Search results for "Group Theory"
showing 10 items of 703 documents
On nilpotent Moufang loops with central associators
2007
Abstract In this paper, we investigate Moufang p-loops of nilpotency class at least three for p > 3 . The smallest examples have order p 5 and satisfy the following properties: (1) They are of maximal nilpotency class, (2) their associators lie in the center, and (3) they can be constructed using a general form of the semidirect product of a cyclic group and a group of maximal class. We present some results concerning loops with these properties. As an application, we classify proper Moufang loops of order p 5 , p > 3 , and collect information on their multiplication groups.
Logics for context-free languages
1995
We define matchings, and show that they capture the essence of context-freeness. More precisely, we show that the class of context-free languages coincides with the class of those sets of strings which can be defined by sentences of the form ∃ bϕ, where ϕ is first order, b is a binary predicate symbol, and the range of the second order quantifier is restricted to the class of matchings. Several variations and extensions are discussed.
Restriction of odd degree characters and natural correspondences
2016
Let $q$ be an odd prime power, $n > 1$, and let $P$ denote a maximal parabolic subgroup of $GL_n(q)$ with Levi subgroup $GL_{n-1}(q) \times GL_1(q)$. We restrict the odd-degree irreducible characters of $GL_n(q)$ to $P$ to discover a natural correspondence of characters, both for $GL_n(q)$ and $SL_n(q)$. A similar result is established for certain finite groups with self-normalizing Sylow $p$-subgroups. We also construct a canonical bijection between the odd-degree irreducible characters of $S_n$ and those of $M$, where $M$ is any maximal subgroup of $S_n$ of odd index; as well as between the odd-degree irreducible characters of $G = GL_n(q)$ or $GU_n(q)$ with $q$ odd and those of $N_{G}…
Circular sturmian words and Hopcroft’s algorithm
2009
AbstractIn order to analyze some extremal cases of Hopcroft’s algorithm, we investigate the relationships between the combinatorial properties of a circular sturmian word (x) and the run of the algorithm on the cyclic automaton Ax associated to (x). The combinatorial properties of words taken into account make use of sturmian morphisms and give rise to the notion of reduction tree of a circular sturmian word. We prove that the shape of this tree uniquely characterizes the word itself. The properties of the run of Hopcroft’s algorithm are expressed in terms of the derivation tree of the automaton, which is a tree that represents the refinement process that, in the execution of Hopcroft’s alg…
Locality of order-invariant first-order formulas
1998
A query is local if the decision of whether a tuple in a structure satisfies this query only depends on a small neighborhood of the tuple. We prove that all queries expressible by order-invariant first-order formulas are local.
On almost nilpotent varieties of subexponential growth
2015
Abstract Let N 2 be the variety of left-nilpotent algebras of index two, that is the variety of algebras satisfying the identity x ( y z ) ≡ 0 . We introduce two new varieties, denoted by V sym and V alt , contained in the variety N 2 and we prove that V sym and V alt are the only two varieties almost nilpotent of subexponential growth.
Thin Bases of Order Two
2001
AbstractA set A⊆N0 is called a basis of order two if A+A≔{a+a′∣a, a′∈A}=N0. If n∈N then A(n) denotes the number of a∈A with 1⩽a⩽n. In this paper bases A, B, C of order two are given such thatlimA(n)n=253,limB(n)n=72andlimC(n)n=101653.
Finite Soluble Groups with Permutable Subnormal Subgroups
2001
Abstract A finite group G is said to be a PST -group if every subnormal subgroup of G permutes with every Sylow subgroup of G . We shall discuss the normal structure of soluble PST -groups, mainly defining a local version of this concept. A deep study of the local structure turns out to be crucial for obtaining information about the global property. Moreover, a new approach to soluble PT -groups, i.e., soluble groups in which permutability is a transitive relation, follows naturally from our vision of PST -groups. Our techniques and results provide a unified point of view for T -groups, PT -groups, and PST -groups in the soluble universe, showing that the difference between these classes is…
Automorphism groups of some affine and finite type Artin groups
2004
We observe that, for fixed n ≥ 3, each of the Artin groups of finite type An, Bn = Cn, and affine type ˜ An−1 and ˜ Cn−1 is a central extension of a finite index subgroup of the mapping class group of the (n + 2)-punctured sphere. (The centre is trivial in the affine case and infinite cyclic in the finite type cases). Using results of Ivanov and Korkmaz on abstract commensurators of surface mapping class groups we are able to determine the automorphism groups of each member of these four infinite families of Artin groups. A rank n Coxeter matrix is a symmetric n × n matrix M with integer entries mij ∈ N ∪ {∞} where mij ≥ 2 for ij, and mii = 1 for all 1 ≤ i ≤ n. Given any rank n Coxeter matr…
On second maximal subgroups of Sylow subgroups of finite groups
2011
Abstract Finite groups in which the second maximal subgroups of the Sylow p -subgroups, p a fixed prime, cover or avoid the chief factors of some of its chief series are completely classified.