Consider a sequence of positive integers of the form ca n − d, n ≥ 1, where a, c and d are positive integers, a > 1. For each n ≥ 1, let S n be the submonoid of N generated by s j = ca n+j − d, with j ∈ N. We obtain a numerical semigroup (1/e)S n by dividing every element of S n by e = gcd(S n ).We characterize the embedding dimension of S n and describe a method to find the minimal generating set of S n . We also show how to find the maximum element of the Apéry set Ap(S n , s 0 ), characterize the elements of Ap(S n , s 0 ), and use these results to compute the Frobenius number of the numerical semigroup (1/e)S n , where e = gcd(S n ).
The evasiveness conjecture has been proved for properties of graphs on a prime‐power number of vertices and the six‐vertex case. The 10‐vertex case is still unsolved. In this paper we study the size of the automorphism group of a graph on
2
p vertices to estimate the Euler characteristic of monotone nonevasive graph properties. We get some conditions on graphs that such graph properties must contain. We also do this by means of Oliver groups and give a new lower bound for the dimension of the simplicial complex associated with a nontrivial monotone nonevasive graph property. We apply our results to graphs on 10 vertices to get conditions on potential counterexamples to the evasiveness conjecture in the 10‐vertex case.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.