English
Related papers

Related papers: Square commutative groups

200 papers

The purpose of this paper is to prove that if $G$ is a transitive permutation group of degree $n\geq 2$, then $G$ can be generated by $\lfloor cn/\sqrt{\log{n}}\rfloor$ elements, where $c:=\sqrt{3}/2$. Owing to the transitive group…

Group Theory · Mathematics 2021-02-22 Gareth Tracey

A finite group is said to be weakly separable if every algebraic isomorphism between two $S$-rings over this group is induced by a combinatorial isomorphism. In the paper we prove that every abelian weakly separable group belongs to one of…

Group Theory · Mathematics 2021-11-04 Grigory Ryabov

The generalized wreath product of permutation groups is introduced. By means of it we study the schurity problem for S-rings over a cyclic group $G$ and the automorphism groups of them. Criteria for the schurity and non-schurity of the…

Combinatorics · Mathematics 2015-05-07 Sergei Evdokimov , Ilya Ponomarenko

In this note we give an alternative proof of a theorem of Linnell and Warhurst that the number of generators d(G) of a polycyclic group G is at most d(\hat G), where d(\hat G) is the number of generators of the profinite completion of G.…

Group Theory · Mathematics 2008-03-27 Martin Kassabov , Nikolay Nikolov

Two finite groups $L_1$ and $L_2$ are compatible if there exists a finite group $G$ with isomorphic normal subgroups $N_1$ and $N_2$ such that $L_1\cong G/N_1$ and $L_2\cong G/N_2$. We prove a new sufficient condition for two groups to be…

Group Theory · Mathematics 2025-09-23 Zhaochen Ding , Gabriel Verret

We classify groups generated by powers of 2 Dehn twists which are 1) free or 2) have no ``unexpected'' reducible elements. We give some sufficient conditions in the case of groups generated by powers of more than two twists.

Geometric Topology · Mathematics 2007-05-23 Hessam Hamidi-Tehrani

We give a simple proof of the well-known fact: any group of n elements is cyclic if and only if n and \phi(n) are coprime. This note is accessible for students familiar with permutations and basic number theory. No knowledge of abstract…

Group Theory · Mathematics 2026-01-08 V. Bragin , Ant. Klyachko , A. Skopenkov

An $S$-ring (a Schur ring) is said to be separable with respect to a class of groups $\mathcal{K}$ if every algebraic isomorphism from the $S$-ring in question to an $S$-ring over a group from $\mathcal{K}$ is induced by a combinatorial…

Combinatorics · Mathematics 2020-12-29 Grigory Ryabov

An abelian square is the concatenation of two words that are anagrams of one another. A word of length $n$ can contain $\Theta(n^2)$ distinct factors that are abelian squares. We study infinite words such that the number of abelian square…

Discrete Mathematics · Computer Science 2015-06-12 Gabriele Fici , Filippo Mignosi

An $S$-ring (a Schur ring) is said to be separable with respect to a class of groups $\mathcal{K}$ if every its algebraic isomorphism to an $S$-ring over a group from $\mathcal{K}$ is induced by a combinatorial isomorphism. We prove that…

Combinatorics · Mathematics 2019-12-17 Grigory Ryabov

A 2-covering for a finite group $G$ is a set of proper subgroups of $G$ such that every pair of elements of $G$ is contained in at least one subgroup in the set. The minimal number of subgroups needed to 2-cover a group $G$ is called the…

Group Theory · Mathematics 2026-02-02 Andrea Lucchini

Two groups $L_1$ and $L_2$ are compatible if there exists a finite group $G$ with isomorphic normal subgroups $N_1$ and $N_2$ such that $L_1\cong G/N_1$ and $L_2\cong G/N_2$. In this paper, we give new necessary conditions for two groups to…

Group Theory · Mathematics 2025-01-16 Zhaochen Ding , Gabriel Verret

Let $(\Gamma,+)$ be an Abelian group of order $n^2$. A $\Gamma$-magic square of order $n$ is an $n\times n$ array whose entries are pairwise distinct elements of $\Gamma$ such that all row sums, column sums, and the two main diagonal sums…

Combinatorics · Mathematics 2026-05-07 Sylwia Cichacz , Dalibor Froncek

A square is a factor $S = (S_1; S_2)$ where $S_1$ and $S_2$ have the same pattern, and a permutation is said to be square-free if it contains no non-trivial squares. The permutation is further said to be bicrucial if every extension to the…

Combinatorics · Mathematics 2022-01-31 Carla Groenland , Tom Johnston

We prove that a finite group is rational if and only if it has a set of permutation characters which separate conjugacy classes. It follows from this that a finite group is rational if and only if it has a representation as a permutation…

Group Theory · Mathematics 2019-05-21 Cecil Andrew Ellard

Let $X$ be a finite set such that $|X|=n$, and let $k< n/2$. A group is $k$-homogeneous if it has only one orbit on the sets of size $k$. The aim of this paper is to prove some general results on permutation groups and then apply them to…

Group Theory · Mathematics 2015-12-18 João Araújo , Peter J. Cameron

Say that a finite group $G$ is mixable if a product of random elements, each chosen independently from two options, can distribute uniformly on $G$. We present conditions and obstructions to mixability. We show that $2$-groups, the…

Group Theory · Mathematics 2025-01-30 Gideon Amir , Guy Blachar , Subhajit Ghosh , Uzi Vishne

We introduce a new random group model called the square model: we quotient a free group on $n$ generators by a random set of relations, each of which is a reduced word of length four. We prove, as in the Gromov density model, that for…

Group Theory · Mathematics 2014-05-14 Tomasz Odrzygóźdź

We describe all groups that can be generated by two twists along spherical sequences in an enhanced triangulated category. It will be shown that with one exception such a group is isomorphic to an abelian group generated by not more than…

Representation Theory · Mathematics 2019-11-28 Yury Volkov

A group G is almost cyclic if there is an element x in G, such that for all g in G, there is an element y in G and an integer n with ygy^{-1} = x^n (that is, every element is conjugate to some power of x). W. Ziller asked whether there are…

Group Theory · Mathematics 2007-05-23 Bruce Ikenaga