English
Related papers

Related papers: Distinguishing Primitive Permutation Groups

200 papers

Let $G$ be a finite group and let $\pi$ be a set of primes. Write $\mathrm{Irr}_{\pi'}(G)$ for the set of irreducible characters of degree not divisible by any prime in $\pi$. We show that if $\pi$ contains at most two prime numbers and the…

Representation Theory · Mathematics 2019-03-25 Eugenio Giannelli , Mandi Schaeffer Fry , Carolina Vallejo

The distinguishing number of a graph $G$ is the smallest positive integer $r$ such that $G$ has a labeling of its vertices with $r$ labels for which there is no non-trivial automorphism of $G$ preserving these labels. Albertson and Collins…

Logic · Mathematics 2008-04-28 C. Laflamme , L. Nguyen Van Thé , N. W. Sauer

Let $G$ be a finite group, let $\pi(G)$ be the set of prime divisors of $|G|$ and let $\Gamma(G)$ be the prime graph of $G$. This graph has vertex set $\pi(G)$, and two vertices $r$ and $s$ are adjacent if and only if $G$ contains an…

Group Theory · Mathematics 2019-02-20 Timothy C. Burness , Elisa Covato

A coloring of the vertices of a graph G is said to be distinguishing} provided no nontrivial automorphism of G preserves all of the vertex colors. The distinguishing number of G, D(G), is the minimum number of colors in a distinguishing…

Combinatorics · Mathematics 2011-11-22 Michael Ferrara , Ellen Gethner , Stephen G. Hartke , Derrick Stolee , Paul S. Wenger

Let $G$ be a transitive normal subgroup of a permutation group $A$ of finite degree $n$. The factor group $A/G$ can be considered as a certain Galois group and one would like to bound its size. One of the results of the paper is that $|A/G|…

Group Theory · Mathematics 2017-01-31 Robert M. Guralnick , Attila Maróti , László Pyber

In this article we look into characterizing primitive groups in the following way. Given a primitive group we single out a subset of its generators such that these generators alone (the so-called primitive generators) imply the group is…

Combinatorics · Mathematics 2009-08-10 Pedro Lopes

The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. In this paper we characterize all trees with radius at most three…

Combinatorics · Mathematics 2016-11-29 Saeid Alikhani , Samaneh Soltani

A minimal permutation representation of a finite group G is a faithful G-set with the smallest possible size. We study the structure of such representations and show that for certain groups they may be obtained by a greedy construction. In…

Group Theory · Mathematics 2013-07-25 Ben Elias , Lior Silberman , Ramin Takloo-Bighash

Let $G$ be a permutation group, and denote with $\mu(G)$ and $b(G)$ its minimal degree and base size respectively. We show that for every $\varepsilon>0$, there exists a transitive permutation group $G$ of degree $n$ with \[ \mu(G)b(G) \geq…

Group Theory · Mathematics 2025-06-24 Lorenzo Guerra , Attila Maróti , Fabio Mastrogiacomo , Pablo Spiga

A \textit{distinguishing coloring} of a graph $G$ is a coloring of the vertices so that every nontrivial automorphism of $G$ maps some vertex to a vertex with a different color. The \textit{distinguishing number} of $G$ is the minimum $k$…

Combinatorics · Mathematics 2015-09-16 Poppy Immel , Paul S. Wenger

Let $G$ be a finite group of odd order. We show that if $\chi$ is an irreducible primitive character of $G$ then for all primes $p$ dividing the order of $G$ there is a conjugacy class such that the $p-$part of $\chi(1)$ divides the size of…

Group Theory · Mathematics 2019-06-27 Claudio Marchi

Let $G$ be a group. A subset $D$ of $G$ is a determining set of $G$, if every automorphism of $G$ is uniquely determined by its action on $D$. The determining number of $G$, denoted by $\alpha(G)$, is the cardinality of a smallest…

Group Theory · Mathematics 2018-01-26 Dengyin Wang , Shikun Ou , Haipeng Qu

If $G$ is a group of permutations of a set $\Omega$ and $\alpha \in \Omega$, then the {\em $\alpha$-suborbits} of $G$ are the orbits of the stabilizer $G_\alpha$ on $\Omega$. The cardinality of an $\alpha$-suborbit is called a {\em…

Group Theory · Mathematics 2012-01-05 Simon M. Smith

A subset $B$ of a group $G$ is called a difference basis of $G$ if each element $g\in G$ can be written as the difference $g=ab^{-1}$ of some elements $a,b\in B$. The smallest cardinality $|B|$ of a difference basis $B\subset G$ is called…

Combinatorics · Mathematics 2021-11-01 Taras Banakh , Volodymyr Gavrylkiv

A permutation group is {\it binary} if its orbits on $k$-tuples, for any integer $k\geq 2$, can be deduced from its orbits on $2$-tuples. Cherlin conjectured that a finite primitive binary permutation group $G$ must lie in one of three…

Group Theory · Mathematics 2021-07-13 Nick Gill , Martin W. Liebeck , Pablo Spiga

A subset $B$ of a group $G$ is called a difference basis of $G$ if each element $g\in G$ can be written as the difference $g=ab^{-1}$ of some elements $a,b\in B$. The smallest cardinality $|B|$ of a difference basis $B\subset G$ is called…

Combinatorics · Mathematics 2021-11-01 Taras Banakh , Volodymyr Gavrylkiv

Let $G$ be a finite primitive permutation group on a set $\Omega$ with nontrivial point stabilizer $G_{\alpha}$. We say that $G$ is extremely primitive if $G_{\alpha}$ acts primitively on each of its orbits in $\Omega \setminus \{\alpha\}$.…

Group Theory · Mathematics 2020-11-26 Timothy C. Burness , Adam R. Thomas

In this paper we show that a finite nonabelian characteristically simple group G satisfying n = |\pi(G)|+2 if and only if G is isomorphic to A5, where n is the number of isomorphism classes of derived subgroups of G and \pi(G) is the set of…

Group Theory · Mathematics 2017-02-14 Leyli Jafari Taghvasani , Soran Marzang

We fix a field $\kk$ of characteristic $p$. For a finite group $G$ denote by $\delta(G)$ and $\sigma(G)$ respectively the minimal number $d$, such that for any finite dimensional representation $V$ of $G$ over $\kk$ and any $v\in…

Commutative Algebra · Mathematics 2014-06-25 Jonathan Elmer , Martin Kohls

Let $G$ be a finite permutation group on $\Omega$. An ordered sequence of elements of $\Omega$, $(\omega_1,\dots, \omega_t)$, is an irredundant base for $G$ if the pointwise stabilizer $G_{(\omega_1,\dots, \omega_t)}$ is trivial and no…

Group Theory · Mathematics 2021-02-26 Andrea Lucchini , Marta Morigi , Mariapia Moscatiello