- Research Article
5
- 10.1016/j.disc.2009.03.024
Minimal sumsets in finite solvable groups
- Apr 15, 2009
- Discrete Mathematics
- Shalom Eliahou + 1 more +1
Minimal sumsets in finite solvable groups
Let G be an Abelian group of order n, let k 2 be an integer, and A1, . . ., A k be non-empty subsets of G.and maximal by inclusion if for any i {1, . . ., k} and x G \ Ai, the collection (A1, . . ., Ai-1, Ai {x}, Ai+1, . .In this work, we study the problem of the maximal value of k (G).In particular, the maximal value of k (Z d ) for the cyclic group Z d is determined.Upper and lower bounds for k (G) are obtained for the Abelian group G.The structure of maximal k-sum-free set by capacity (by inclusion) is described for an arbitrary cyclic group.
Minimal sumsets in finite solvable groups
Minimal sumsets in finite solvable groups
Fibonacci Length of Generating Pairs in Groups
Let G be a group and let x, y ∈ G. If every element of G can be written as a word $${x^{{\alpha _1}}}{y^{{\alpha _2}}}{x^{{\alpha _3}}} \ldots {x^{{\alpha _{n - 1}}}}{y^{{\alpha _n}}}$$ (1) where αi ∈ ℤ, 1 ≤ i ≤ n, then we say that x and y generate G and that G is a 2-generator group. Although cyclic groups are 2-generator groups according to this definition we are only interested here in 2-generator groups which cannot be generated by a single element. Even among finite groups G many are not 2-generator groups; for example the abelian group of order 8 in which every element has order 2 cannot be 2-generated since given any pair of distinct non-trivial elements x, y there are only 4 words given by expressions of the form (1). However, many groups are 2-generated, in particular finite simple groups.
Read moreAddition sets in a finite group
Addition sets in a finite group
Maximal sum-free sets in finite Abelian groups, III
Maximal sum-free sets in finite Abelian groups, III
Quantifier Elimination for Lexicographic Products of Ordered Abelian Groups
Let $\Lg = \{+,-,0\}$ be the language of the abelian groups, $L$ an expansion of $\Lg(<)$ by relations and constants, and $\Lmod = \Lg \cup \{\equiv_n\}_{n \geq 2}$ where each $\equiv_n$ is defined as follows: $x \equiv_n y$ if and only if $n|x-y$. Let $H$ be a structure for $L$ such that $H|\Lg(<)$ is a totally ordered abelian group and $K$ a totally ordered abelian group. We consider a product interpretation of $H \times K$ with a new predicate $I$ for $\{0\}\times K$ defined by N.~Suzuki \cite{Sz}. Suppose that $H$ admits quantifier elimination in $L$. 1. If $K$ is a Presburger arithmetic with smallest positive element $1_K$ then the product interpretation $G$ of $H \times K$ with a new predicate $I$ admits quantifier elimination in $L(I, 1) \cup \Lmod$ with $1^G = (0^H, 1_K)$.2. If $K$ is dense regular and $K/nK$ is finite for every integer $n \geq 2$ then the product interpretation $G$ of $H \times K$ with a new predicate $I$ admits quantifier elimination in $L(I, D) \cup \Lmod$ for some set $D$ of constant symbols where $G \models I(d)$ for each $d \in D$.3. If $K$ admits quantifier elimination in $\Lmod(<, D)$ for some set $D$ of constant symbols then the product interpretation $G$ of $H \times K$ with a new predicate $I$ admits quantifier elimination in $L(I, D) \cup \Lmod$ unless $K$ is dense regular with $K/nK$ being infinite for some $n$. Conversely, if the product interpretation $G$ of $H \times K$ with a new predicate $I$ admits quantifier elimination in $L(I, D) \cup \Lmod$ for some set $D$ of constant symbols such that $G \models I(d)$ for each $d \in D$ then $H$ admits quantifier elimination in $L \cup \Lmod$, and $K$ admits quantifier elimination in $\Lmod(<, D)$. We also discuss the axiomatization of the theory of the product interpretation of $H \times K$. %For some set $C$ of constants in $K$.
Read moreA compactness argument in the additive theory and the polynomial method
A compactness argument in the additive theory and the polynomial method
Semisimple Modules, Artinian Modules, and Torsionfree Modules
In this chapter, we discuss several special types of modules that will make frequent appearances later. These include semisimple modules, artinian modules, and torsionfree modules, which have prototypes in vector spaces, finite abelian groups, and torsionfree abelian groups, respectively. That special types of modules have useful roles in the study of arbitrary modules may be seen already in the case of abelian groups (i.e., ℤ-modules). In studying an arbitrary abelian group, an almost reflexive first step is to look at its torsion part (i.e., the torsion subgroup) and its torsionfree part (i.e., the factor group modulo the torsion subgroup), since entirely different techniques are available (and needed) for dealing with torsion groups and torsionfree groups. On the torsionfree side, vector spaces make an appearance due to the facts that the torsionfree divisible abelian groups are exactly the vector spaces over ℚ and that every torsionfree abelian group can be embedded in a divisible one. On the torsion side, many questions can be reduced to the case of finite abelian groups, since every torsion abelian group is a directed union of finite subgroups. In studying torsion abelian groups, one also reduces to the case of p -groups for various primes p . Vector spaces make another appearance here, since in an abelian p -group the set of elements of order p (together with 0) forms a vector space over ℤ/ p ℤ.
Read moreA survey of symmetric generation of sporadic simple groups
Many of the sporadic simple groups possess highly symmetric generating sets which can often be used to construct the groups, and which carry much information about their subgroup structure. We give a survey of results obtained so far.
Read moreQuantum stabilizer codes from Abelian and non-Abelian groups association schemes
A new method for the construction of the binary quantum stabilizer codes is provided, where the construction is based on Abelian and non-Abelian groups association schemes. The association schemes based on non-Abelian groups are constructed by bases for the regular representation from U6n, T4n, V8n and dihedral D2n groups. By using Abelian group association schemes followed by cyclic groups and non-Abelian group association schemes a list of binary stabilizer codes up to 40 qubits is given in tables 4, 5 and 10. Moreover, several binary stabilizer codes of minimum distances 5, 7 and 8 with good quantum parameters is presented. The preference of this method specially for Abelian group association schemes is that one can construct any binary quantum stabilizer code with any distance by using the commutative structure of association schemes.
Read moreOn the lattice of subquandles of a Takasaki quandle
Let A be an abelian group. If for any we define , then is a quandle called the Takasaki quandle and is denoted by T(A). In this article, we focus on the lattice of subquandles of a finite Takasaki quandle T(A), denoted by . Indeed, we characterize the subquandles of T(A) and show that is the lattice of cosets of A if and only if A is an odd abelian group or its 2-Sylow subgroup is a cyclic group. Further, we determine the homotopy type of the lattice of subquandles of T(A) which is the wedge of r spheres of dimension d, where r is the number of prime numbers dividing and d is determined by applying the fundamental theorem of finite abelian groups. Furthermore, we prove that is graded if and only if A is an odd abelian group or its 2-Sylow subgroup is cyclic or its 2-Sylow subgroup is elementary abelian. Moreover, we show that the lattice of subquandles of a finite Takasaki quandle is determined by a unique Takasaki quandle. In other words, we show that the lattices of subquandles of two finite Takasaki quandles T(A) and T(B) are isomorphic if and only if A and B are isomorphic. However, the lattice of subquandles of a quandle which is not a Takasaki quandle can be isomorphic to the lattice of subquandles of a Takasaki quandle. We show this by providing a quandle Q of order 8 which is not a Takasaki quandle, but is isomorphic to
Read moreGeneralizations of some zero sum theorems
Given an abelian group G of order n, and a finite non-empty subset A of integers, the Davenport constant of G with weightA, denoted by DA(G), is defined to be the least positive integer t such that, for every sequence (x1,..., xt) with xi ∈ G, there exists a non-empty subsequence \((x_{j_1},\ldots, x_{j_l})\) and ai ∈ A such that \(\sum_{i=1}^{l}a_ix_{j_i} = 0\). Similarly, for an abelian group G of order n, EA(G) is defined to be the least positive integer t such that every sequence over G of length t contains a subsequence \((x_{j_1} ,\ldots, x_{j_n})\) such that \(\sum_{i=1}^{n}a_ix_{j_i} = 0\), for some ai ∈ A. When G is of order n, one considers A to be a non-empty subset of {1,..., n − 1 }. If G is the cyclic group \({\Bbb Z}/n{\Bbb Z}\), we denote EA(G) and DA(G) by EA(n) and DA(n) respectively.
Read moreOn purifiable torsion-free rank-one subgroups
First, we give a necessary and sufficient condition for a torsion-free rank-one subgroup of an arbitrary abelian group to be purifiable in a given group and show that all pure hulls of a purifiable torsion-free rank-one subgroup are isomorphic. Next, we show that if a $T(G)$-high subgroup A of an abelian group $G$ is purifiable in $G$, then there exists a subgroup $T'$ of $T(G)$ such that $G=H\oplus T'$ for every pure hull $H$ of $A$ in $G$. An abelian group $G$ is said to be a strongly ADE decomposable group if there exists a purifiable $T(G)$-high subgroup of $G$. We present an example $G$ such that not all $T(G)$-high subgroups of a strongly ADE decomposable group G are purifiable in $G$. Moreover, we characterize the strongly ADE decomposable groups of torsion-free rank 1. Finally, we use previous results to give a necessary and sufficient condition for an abelian group of torsion-free rank 1 to be splitting.
Read moreOn the stability of the quadratic equation on groups
In this paper the stability of the quadratic equation is considered on arbitrary groups. Since the quadratic equation is stable on Abelian groups, this paper examines the stability of the quadratic equation on noncommutative groups. It is shown that the quadratic equation is stable on $n$-Abelian groups when $n$ is a positive integer. The stability of the quadratic equation is also established on the noncommutative group $T(2, K)$, where $K$ is an arbitrary commutative field. It is proved that every group can be embedded into a group in which the quadratic equation is stable.
Read moreNew results for the multiplicative symmetric equation and related conjecture
The general solution of the multiplicative symmetric functional equation $$f(f(x)y)=f(xf(y))$$, in abelian groups, was given by Dhombres. But it is still an open problem in non-abelian groups and abelian quasi-groups. In this paper, by using a new approach introduced by the author, we give a vast class of its solutions in arbitrary semigroups. It also works for non-abelian groups, and gives its general solution in abelian groups with a different representation from Dhombres’s solution. Also, we introduce some related equations and closed relationships between decomposer type and multiplicative symmetric equations. It is worth noting that the new approach and methods can be used for studying the equation on magmas (groupoids) as the most general algebraic structures for the topic. At last we pose a conjecture that guesses the general solution in arbitrary groups (and possibly semigroups).
Read moreThe accepting power of finite automata over groups
Some results from [2], [5], [6] are generalized for finite automata over arbitrary groups. The accepting power is smaller when abelian groups are considered, in comparison with the non-abelian groups. We prove that this is due to the commutativity. Each language accepted by a finite automaton over an abelian group is actually a unordered vector language. Finally, deterministic finite automata over groups are investigated.
Read more