Academia.eduAcademia.edu

Solvable Groups

description74 papers
group311 followers
lightbulbAbout this topic
Solvable groups are a class of groups in abstract algebra characterized by a series of subgroups where each quotient group is abelian. Specifically, a group is solvable if it has a derived series that terminates in the trivial subgroup, indicating a certain level of structural simplicity in its composition.
lightbulbAbout this topic
Solvable groups are a class of groups in abstract algebra characterized by a series of subgroups where each quotient group is abelian. Specifically, a group is solvable if it has a derived series that terminates in the trivial subgroup, indicating a certain level of structural simplicity in its composition.

Key research themes

1. What are the complexity classifications of equation satisfiability problems in finite solvable groups?

This research area investigates the computational complexity of deciding whether polynomial equations over finite solvable groups have solutions within those groups. It is significant because it bridges group theory and computational complexity, aiming to understand which solvable groups permit efficient algorithmic treatment of equations and which do not, potentially impacting cryptography and automated reasoning in algebraic structures.

Key finding: The paper establishes super-polynomial lower bounds on the complexity of the polynomial satisfiability problem PolSat(G) for finite solvable groups whose Fitting length is at least three, unless the Exponential Time... Read more
Key finding: By proving a lifting theorem for odd Frattini covers and linking it to group equations, the authors characterize finite solvable groups via the existence of triples of elements satisfying certain product and order properties.... Read more
Key finding: Though focused on maximal A-invariant subgroups, it indirectly impacts equation solvability by showing solvability results conditioned on subgroup properties influenced by group actions. These structural restrictions help... Read more

2. How do solvable groups and their structural properties manifest through graph-theoretic constructions based on conjugacy and commutativity?

This research theme explores associating finite groups, particularly solvable ones, with graphs defined via conjugacy classes and solvability conditions, such as the solvable conjugacy class graph. Investigations focus on graph invariants (connectivity, clique number, genus) and their relation to group-theoretic properties. This approach offers novel combinatorial tools for understanding subgroup interactions and solvability criteria.

Key finding: Introduces the solvable conjugacy class graph (SCC-graph) where adjacency reflects the solvability of subgroups generated by conjugacy class representatives. The paper establishes finiteness results for groups with bounded... Read more
Key finding: Analyzes the solubilizer set Sol_G(x), the neighborhood of an element x in the solubility graph Γ_S(G), capturing elements that generate solvable subgroups with x. Key findings include characterizations of groups where the... Read more
Key finding: Examines finite non-Dedekind N_AC-groups where all non-normal abelian subgroups are cyclic. The study concludes that such groups have cyclic centers and restrictive configurations of Sylow subgroups, often cyclic or... Read more

3. What algebraic and arithmetic constraints characterize solvable group actions, representations, and related structures?

This theme focuses on the algebraic and number-theoretic properties defining solvable groups via their linear actions, permutation representations, and automorphisms, especially under coprime group actions. It covers classifications of solvable groups arising from conditions on invariant Sylow numbers, character degree graphs, and orbit structures, as well as representation-theoretic identification using element orders and spectra.

Key finding: Demonstrates that if all maximal A-invariant subgroups of a finite group G (with A acting coprimely) satisfy nilpotency, supersolvability, or certain arithmetic index conditions, then G itself is solvable. These results,... Read more
Key finding: Investigates conditions on the set of A-invariant Sylow p-subgroup counts in G, showing that particular arithmetic restrictions (e.g., squareness or primality constraints on Sylow numbers) force solvability of G when A acts... Read more
Key finding: Extends the study of character degree graphs for solvable groups, focusing on 'block square' graphs. It proves that solvable groups with block square character degree graphs have at most two normal nonabelian Sylow subgroups... Read more
Key finding: Surveys classification results on finite simple groups uniquely determined ('recognizable') by their element orders (spectrum). It highlights that for large classes of simple groups, any finite group sharing their spectrum is... Read more
Key finding: Classifies linear groups over finite fields that are p-exceptional, i.e., their order is divisible by p but all orbits on vectors have size coprime to p. The classification yields conditions under which such groups are... Read more

All papers in Solvable Groups

Consider G to be a finite group and p to be a prime divisor of the order |G| in the group G. The main aim of this paper is to prove that the outcome in a recent paper of A. Laradji is true in the case of a p-constrained group. We observe... more
We call a subalgebra U of a Lie algebra L a CAP -subalgebra of L if for any chief factor H/K of L, we have In this paper we investigate some properties of such subalgebras and obtain some characterizations for a finite-dimensional Lie... more
Questo lavoro è rilasciato con licenza Creative Commons Attribution 4.0 International (CC BY 4.0). Viene consentita la riproduzione, distribuzione, comunicazione pubblica e modifica, anche per fini commerciali, a condizione di attribuire... more
Formulato dal matematico tedesco Kurt Mahler negli anni quaranta del ventesimo secolo, questo problema chiede di caratterizzare la "dimensione" o "complessità" dei numeri algebrici attraverso una quantità chiamata misura di Mahler...
A group is said to be cube-free if its order is not divisible by the cube of any prime. Let f cf,sol (n) denote the isomorphism classes of solvable cubefree groups of order n. We find asymptotic bounds for f cf,sol (n) in this paper. Let... more
The symmetric maximum, denoted by , is an extension of the usual maximum ∨ operation so that 0 is the neutral element, and -x is the symmetric (or inverse) of x, i.e., x (-x) = 0. However, such an extension does not preserve the... more
La teoria di Galois rappresenta uno dei vertici più straordinari della matematica pura, un capolavoro di astrazione e di potenza concettuale che ha rivoluzionato la nostra comprensione delle equazioni algebriche e delle simmetrie... more
La presente trattazione è dedicata ai fasci di circonferenze, ovvero un insieme di circonferenze i cui centri giacciono su una retta, o anche un insieme di circonferenze aventi il medesimo centro ed è altresì dedicata alle circonferenze... more
We prove that commutative power-associative nilalgebras of dimension 6 over a field of characteristic / = 2, 3, 5 are solvable.
Let π(G) denote the set of prime divisors of the order of a finite group G. The prime graph of G, denoted Γ G , is the graph with vertex set π(G) with edges {p, q} ∈ E(Γ G ) if and only if there exists an element of order pq in G. In this... more
We give a shorter proof of the following theorem of Kathryn Mann [M]: the identity component of the group of the compactly supported C diffeomorphisms of R cannot admit a nontrivial C-action on S, provided n ≥ 2, r 6= n+ 1 and p ≥ 2. We... more
It is an interesting topic to determine the structure of a finite group which has a given number of elements of maximal order. In this article, the author classified finite groups with 30 elements of maximal order. Keywords A finite group... more
For a group G, we define a graph ∆(G) by letting G # = G\{ 1 } be the set of vertices and by drawing an edge between distinct elements x, y ∈ G # if and only if the subgroup x, y is cyclic. Recall that a Z-group is a group where every... more
For a subgroup L of the symmetric group S ℓ , we determine the minimal base size of GL d (q) ≀ L acting on V d (q) ℓ as an imprimitive linear group. This is achieved by computing the number of orbits of GL d (q) on spanning m-tuples,... more
We study a family of metrics on Euclidean space that generalize the left-invariant metric of the SOL group and the metric of the logarithmic model of Hyperbolic space. Suppose G is a connected, simply-connected, Heintze group of Abelian... more
First, we study pseudo-Euclidean Jordan algebras obtained as double extensions of a quadratic vector space by a one-dimensional algebra. We give an isomorphic characterization of 2-step nilpotent pseudo-Euclidean Jordan algebras. Next, we... more
In the first part of this work we have established an efficient method to obtain a topological classification of locally discrete, finitely generated, virtually free subgroups of real-analytic circle diffeomorphisms. In this second part... more
This paper involves an investigation on the maximal subgroups of the groups of order pqr, a theorem has been stated and prove concerning the nature and behavior of the maximal subgroup of such groups. The group algorithm and programming... more
Let G be a finite group, and write cd(G) for the degree set of the complex irreducible characters of G. The group G is said to satisfy the two-prime hypothesis if, for any distinct degrees a, b ∈ cd(G), the total number of (not... more
In this paper, we consider lifts of π-partial characters with the property that the irreducible constituents of their restrictions to certain normal subgroups are also lifts. We will show that such a lift must be induced from what we call... more
In this paper, we show that if p is a prime and G is a psolvable group, then |G : Op(G)|p ≤ (b(G) p /p) 1/(p−1) where b(G) is the largest character degree of G. If p is an odd prime that is not a Mersenne prime or if the nilpotence class... more
Isaacs has defined a character to be super monomial if every primitive character inducing it is linear. Isaacs has conjectured that if G is an M-group with odd order, then every irreducible character is super monomial. We prove that the... more
Let G be a solvable group. Let p be a prime and let Q be a p-subgroup of a subgroup V. Suppose ϕ ∈ IBr(G). If either |G| is odd or p = 2, we prove that the number of Brauer characters of H inducing ϕ with vertex Q is at most |N G (Q) : N... more
In this paper we examine the behavior of lifts of Brauer characters in solvable groups. In the main result, we show that if ϕ ∈ IBr p (G) is a Brauer character of a solvable group such that ϕ has an abelian vertex subgroup Q, then the... more
We investigate character degree graphs of solvable groups. In particular, we provide general results that can be used to eliminate which degree graphs can occur as solvable groups. Finally, we show a specific family of graphs cannot occur... more
For a Lie algebra L and a subalgebra M of L we say that a subalgebra U of L is a supplement to M in L if L = M + U . We investigate those Lie algebras all of whose maximal subalgebras have abelian supplements, those that have nilpotent... more
A finite-dimensional Lie algebra L over a field F of characteristic zero is called elementary if each of its subalgebras has trivial Frattini ideal; it is an A-algebra if every nilpotent subalgebra is abelian. This paper is a continuation... more
Let M be a maximal subalgebra of the Lie algebra L. A subalgebra C of L is said to be a completion for M if C is not contained in M but every proper subalgebra of C that is an ideal of L is contained in M . The set I(M ) of all... more
We describe under various conditions abelian subgroups of the automorphism group Aut(Tn) of the regular n-ary tree Tn, which are normalized by the n-ary adding machine τ = (e,. .. , e, τ)στ where στ is the n-cycle (0, 1,. .. , n − 1). As... more
Let G be a finite group, Irr(G) be the set of irreducible characters of G, and denote by cd(G), the set of irreducible character degrees of G. The character degree graph of G, which is denoted by Γ(G), is defined as follows: the vertices... more
In this paper, we used wreath products of two permutation groups  in constructing transitive supersolvable permutation groups. We verified these groups using some groups theoretical concepts and also validate our work using a standard... more
For a maximal subgroup M of a finite group G the normal index of M is the order of a chief factor H/K where H is minimal in the set of supplements of M in G. We obtain results about the normal index of M when M has composite index in G.
L'accès aux archives de la revue « Rendiconti del Seminario Matematico della Università di Padova » (http://rendiconti.math.unipd.it/) implique l'accord avec les conditions générales d'utilisation (http://www.numdam.org/conditions). Toute... more
This paper is part of a program to study the conjecture of E.C. Dade on counting characters in blocks for several finite groups. In this paper, we verify Dade's invariant conjecture for the Chevalley groups G 2 (p a) in the defining... more
Let A be a commutative algebra over a field F of characteristic = 2, 3. In [M. Gerstenhaber, On nilalgebras and linear varieties of nilpotent matrices II, Duke Math. J. 27 (1960) 21-31], M. Gerstenhaber proved that if A is a nilalgebra of... more
Let A be a commutative power-associative nilalgebra. In this paper we prove that when A (of characteristic = 2) is of dimension ≤ 10 and the identity x 4 = 0 is valid in A, then ((y 2)x 2)x 2 = 0 for all y, x in A and ((A 2) 2) 2 = 0.... more
Let A be a commutative algebra over a field F of characteristic = 2, 3. In [M. Gerstenhaber, On nilalgebras and linear varieties of nilpotent matrices II, Duke Math. J. 27 (1960) 21-31], M. Gerstenhaber proved that if A is a nilalgebra of... more
Let α be a formation of finite groups which is closed under subgroups and group extensions and which contains the formation of solvable groups. Let G be any finite group. We state and prove equivalences between conditions on chief factors... more
Download research papers for free!