English
Related papers

Related papers: Solvability of Generalized Monomial Groups

200 papers

We develop a unified representation theory for the categories of finite subsets and relation-preserving maps of highly homogeneous relational structures classified by Cameron. For any commutative coefficient ring $k$, we extend the…

Representation Theory · Mathematics 2026-04-28 Liping Li

For any right-angled Artin group, we show that its outer automorphism group contains either a finite-index nilpotent subgroup or a nonabelian free subgroup. This is a weak Tits alternative theorem. We find a criterion on the defining graph…

Group Theory · Mathematics 2009-10-27 Matthew B. Day

I. M. Isaacs has conjectured (see \cite{isa00}) that if the product of two faithful irreducible characters of a solvable group is irreducible, then the group is cyclic. In this paper we prove a special case of the following conjecture,…

Group Theory · Mathematics 2023-05-23 Edith Adan-Bante , Maria Loukaki , Alexander Moretó

We prove that the monodromy group of a reduced irreducible square system of general polynomial equations equals the symmetric group. This is a natural first step towards the Galois theory of general systems of polynomial equations, because…

Algebraic Geometry · Mathematics 2020-07-08 Alexander Esterov

We conjecture that the word problem of Artin-Tits groups can be solved without introducing trivial factors ss^{-1} or s^{-1}s. Here we make this statement precise and explain how it can be seen as a weak form of hyperbolicity. We prove the…

Group Theory · Mathematics 2011-10-18 Patrick Dehornoy , Eddy Godelle

We show that if G is a finite group then no chain of modular elements in its subgroup lattice L(G) is longer than a chief series. Also, we show that if G is a nonsolvable finite group then every maximal chain in L(G) has length at least two…

Group Theory · Mathematics 2011-12-30 John Shareshian , Russ Woodroofe

In this paper we begin the systematic study of group equations with abelian predicates in the main classes of groups where solving equations is possible. We extend the line of work on word equations with length constraints, and more…

Group Theory · Mathematics 2022-05-02 Laura Ciobanu , Albert Garreta

We prove that there exists an integer-valued function f on positive integers such that if a finite group G has at most k real-valued irreducible characters, then |G/Sol(G)| is at most f(k), where Sol(G) denotes the largest solvable normal…

Group Theory · Mathematics 2019-05-28 Nguyen Ngoc Hung , A. A. Schaeffer Fry , Hung P. Tong-Viet , C. Ryan Vinroot

Using a general result of Lusztig, we find the decomposition into irreducibles of certain induced characters of the projective general linear group over a finite field of odd characteristic.

Representation Theory · Mathematics 2007-05-23 Anthony Henderson

Glider representations can be defined for a finite algebra filtration FKG determined by a chain of subgroups 1 < G_1 < ... < G_d = G. In this paper we develop the generalized character theory for such glider representations. We give the…

Group Theory · Mathematics 2018-12-03 Frederik Caenepeel , Fred Van Oystaeyen

The solubilizer of an element $x$ of a profinite group $G$ is the set of the elements $y$ of $G$ such that the subgroup of $G$ generated by $x$ and $y$ is prosoluble. We propose the following conjecture: the solubilizer of $x$ in $G$ has…

Group Theory · Mathematics 2024-10-18 Andrea Lucchini

Suppose that $G$ is a finite group and $H$ is a nilpotent subgroup of $G$. If a character of $H$ induces an irreducible character of $G$, then the generalized Fitting subgroup of $G$ is nilpotent.

Representation Theory · Mathematics 2019-02-27 Zoltan Halasi , Attila Maroti , Gabriel Navarro , Pham Huu Tiep

We show that a finite permutation group containing a regular abelian self-normalizing subgroup is soluble.

Group Theory · Mathematics 2013-05-29 Enrico Jabara , Pablo Spiga

The incompressibility method is a counting argument in the framework of algorithmic complexity that permits discovering properties that are satisfied by most objects of a class. This paper gives a preliminary insight into Kolmogorov's…

Information Theory · Computer Science 2024-07-25 Carles Cardó

A covering of a group is a finite set of proper subgroups whose union is the whole group. A covering is minimal if there is no covering of smaller cardinality, and it is nilpotent if all its members are nilpotent subgroups. We complete a…

Group Theory · Mathematics 2014-09-29 Russell D. Blyth , Francesco Fumagalli , Marta Morigi

We prove that even Artin groups of FC type are poly-free and residually finite.

Group Theory · Mathematics 2017-05-17 Ruben Blasco-Garcia , Conchita Martinez-Perez , Luis Paris

We study finite groups $G$ with the property that for any subgroup $M$ maximal in $G$ whose order is divisible by all the prime divisors of $|G|$, $M$ is supersolvable. We show that any nonabelian simple group can occur as a composition…

Group Theory · Mathematics 2020-11-24 Alexander Moretó

Recent results on the linearity of braid groups are extended in two ways. We generalize the Lawrence Krammer representation as well as Krammer's faithfulness proof for this linear representation to Artin groups of finite type.

Group Theory · Mathematics 2007-05-23 Arjeh M. Cohen , David B. Wales

Let $A$ and $A'$ be two Artin groups of spherical type, and let $A_1,\dots,A_p$ (resp. $A'_1,\dots,A'_q$) be the irreducible components of $A$ (resp. $A'$). We show that $A$ and $A'$ are commensurable if and only if $p=q$ and, up to…

Group Theory · Mathematics 2020-11-11 María Cumplido , Luis Paris

We find a polynomial (n^6) isoperimetric function for Artin groups, the defining graph of which contains no edges labelled by 3. This in particular shows that even Artin groups have solvable word problem. We use small cancellation theory of…

Group Theory · Mathematics 2025-07-23 Arye Juhasz