首页/论文/2011.14426

arXiv 2011.144262020-11math.GRmath.CO

On the maximal number of elements pairwise generating the symmetric group of even degree

Francesco Fumagalli, Martino Garonzi, Attila Maróti

英文摘要：

Let $G$ be the symmetric group of degree $n$. Let $ω(G)$ be the maximal size of a subset $S$ of $G$ such that $\langle x,y \rangle = G$ whenever $x,y \in S$ and $x \neq y$ and let $σ(G)$ be the minimal size of a family of proper subgroups of $G$ whose union is $G$. We prove that both functions $σ(G)$ and $ω(G)$ are asymptotically equal to $\frac{1}{2} \binom{n}{n/2}$ when $n$ is even. This, together with a result of S. Blackburn, implies that $σ(G)/ω(G)$ tends to $1$ as $n \to \infty$. Moreover, we give a lower bound of $(1-o(1))n$ on $ω(G)$ which is independent of the classification of finite simple groups. We also calculate, for large enough $n$, the clique number of the graph defined as follows: the vertices are the elements of $G$ and two vertices $x,y$ are connected by an edge if $\langle x,y \rangle \geq A_n$.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

On the maximal number of elements pairwise generating the finite alternating group

Let $G$ be the alternating group of degree $n$. Let $ω(G)$ be the maximal size of a subset $S$ of $G$ such that $\langle x,y \rangle = G$ whenever $x,y \in S$ and $x \neq y$ and let $σ(G)$ be the minimal size of a family of proper subgroups of $G$ whose union is $G$. We prove that, when $n$ varies in the family of composite numbers, $σ(G)/ω(G)$ tends to $1$ as $n \to \infty$. Moreover, we explicitly calculate $σ(A_n)$ for $n \geq 21$ congruent to $3$ modulo $18$.

2022-06-22math.COmath.GR

Maximal subset of pairwise non-commuting elements of finite minimal non-Abelian groups

Let G be a group. A subset X of G is a set of pairwise non-commuting elements if xy is not equal to yx for any two distinct elements x and y in X. If |X|>=|Y| for any other set of pairwise non-commuting elements Y in G, then X is said to be a maximal subset of pairwise non-commuting elements. In this paper we determine the cardinality of a maximal subset of pairwise non-commuting elements for finite minimal non-abelian groups.

2014-05-19math.GR

$2^{\aleph_0}$ pairwise non-isomorphic maximal-closed subgroups of Sym$(\mathbb{N})$ via the classification of the reducts of the Henson digraphs

Given two structures $\mathcal{M}$ and $\mathcal{N}$ on the same domain, we say that $\mathcal{N}$ is a reduct of $\mathcal{M}$ if all $\emptyset$-definable relations of $\mathcal{N}$ are $\emptyset$-definable in $\mathcal{M}$. In this article the reducts of the Henson digraphs are classified. Henson digraphs are homogeneous countable digraphs that omit some set of finite tournaments. As the Henson digraphs are $\aleph_0$-categorical, determining their reducts is equivalent to determining all closed supergroups $G<$ Sym$(\mathbb{N})$ of their automorphism groups. A consequence of the classific…

2015-09-25math.COmath.GRmath.LO

Bounding the maximal size of independent generating sets of finite groups

Denote by $m(G)$ the largest size of a minimal generating set of a finite group $G$. We estimate $m(G)$ in terms of $\sum_{p\in π(G)}d_p(G),$ where we are denoting by $d_p(G)$ the minimal number of generators of a Sylow $p$-subgroup of $G$ and by $π(G)$ the set of prime numbers dividing the order of $G$.

2019-08-03math.COmath.GR

Monochromatic generating sets in groups and other algebraic structures

The \emph{generating chromatic number} of a group $G$, $\chigen(G)$, is the maximum number of colors $k$ such that there is a monochromatic generating set for each coloring of the elements of $G$ in $k$ colors. If no such maximal $k$ exists, we set $\chigen(G)=\infty$. Equivalently, $\chigen(G)$ is the maximal number $k$ such that there is no cover of $G$ by proper subgroups ($\infty$ if there is no such maximal $k$). We provide characterizations, for arbitrary gruops, in the cases $\chigen(G)=\infty$ and $\chigen(G)=2$. For nilpotent groups (in particular, for abelian ones), all possible chro…

2012-12-01math.COmath.GR

On the maximal number of coprime subdegrees in finite primitive permutation groups

The subdegrees of a transitive permutation group are the orbit lengths of a point stabilizer. For a finite primitive permutation group which is not cyclic of prime order, the largest subdegree shares a non-trivial common factor with each non-trivial subdegree. On the other hand it is possible for non-trivial subdegrees of primitive groups to be coprime, a famous example being the rank 5 action of the small Janko group on 266 points which has subdegrees of lengths 11 and 12. We prove that, for every finite primitive group, the maximal size of a set of pairwise coprime non-trivial subdegrees is …

2012-03-13math.COmath.GR

更多相关论文收起更多论文

Maximal Cocliques in the Generating Graphs of the Alternating and Symmetric Groups

The generating graph $Γ(G)$ of a finite group $G$ has vertex set the non-identity elements of $G$, with two elements connected exactly when they generate $G$. A coclique in a graph is an empty induced subgraph, so a coclique in $Γ(G)$ is a subset of $G$ such that no pair of elements generate $G$. A coclique is maximal if it is contained in no larger coclique. It is easy to see that the non-identity elements of a maximal subgroup of $G$ form a coclique in $Γ(G)$, but this coclique need not be maximal. In this paper we determine when the intransitive maximal subgroups of $\textrm{S}_n$ and $\tex…

2020-07-23math.GR

Generating maximal subgroups of finite almost simple groups

For a finite group $G$, let $d(G)$ denote the minimal number of elements required to generate $G$. In this paper, given a finite almost simple group $G$ and any maximal subgroup $H$ of $G$, we determine a precise upper bound for $d(H)$. In particular, we show that $d(H)\leq 5$, and that $d(H)\geq 4$ if and only if $H$ occurs in a known list. This improves a result of Burness, Liebeck and Shalev. The method involves the theory of crowns in finite groups.

2018-07-14math.GR

Finite groups with a certain number of elements pairwise generating a non-nilpotent subgroup

Let $n>0$ be an integer and $\mathcal{X}$ be a class of groups. We say that a group $G$ satisfies the condition $(\mathcal{X},n)$ whenever in every subset with $n+1$ elements of $G$ there exist distinct elements $x,y$ such that $<x,y>$ is in $\mathcal{X}$. Let $\mathcal{N}$ and $ \mathcal{A}$ be the classes of nilpotent groups and abelian groups, respectively. Here we prove that: (1) If $G$ is a finite semi-simple group satisfying the condition $(\mathcal{N},n)$, then $|G|<c^{2[\log_{21}n]n^2} [\log_{21}n]!$, for some constant $c$. (2) A finite insoluble group $G$ satisfies the condition $(\ma…

2005-11-28math.GR

关于李群和代数群中冗余生成集最大尺寸的探讨

On the Maximal Size of Irredundant Generating Sets in Lie Groups and Algebraic Groups

研究显示，连通紧致李群的生成集若大小超过群秩的固定多项式，则必冗余。类似结果适用于可解李群和具有 Zariski 群的半单代数群。方法产生的量化界限受有限简单李型群界限的控制，并部分回答了 Gelander 的猜想。

2026-07-02math.GR

On non-commuting sets and centralizers in infinite group

A subset X of a group G is a set of pairwise non-commuting ele- ments if ab 6= ba for any two distinct elements a and b in X. If jXj ? jY j for any other set of pairwise non-commuting elements Y in G, then X is said to be a maximal subset of pairwise non-commuting elements and the cardinality of such a subset is denoted by !(G). In this paper, among other thing, we prove that, for each positive integer n, there are only finitely many groups G, up to isoclinic, with !(G) = n (with exactly n centralizers).

2014-12-14math.GR

Generating solutions of a linear equation and structure of elements of the Zelisko group

Solutions of a linear equation b=ax in a homomorphic image of a commutative Bezout domain of stable range 1.5 is developed. It is proved that the set of solutions of a solvable linear equation contains at least one solution that divides the rest, which is called a generating solution. Generating solutions are pairwise associates. Using this result, the structure of elements of the Zelisko group is investigated.

2021-04-23math.GRmath.RA

$\mathbb{Z}^{n+1}\rtimes_{ρ_n}GL_2(\mathbb{Z})$中的极大Haagerup子群

Maximal Haagerup subgroups in $\mathbb{Z}^{n+1}\rtimes_{ρ_n}GL_2(\mathbb{Z})$

本研究针对$\mathbb{Z}^{n+1}\rtimes_{ρ_n}GL_2(\mathbb{Z})$对应的半直积群，通过分析非顺从子群作用下的结构，刻画其极大Haagerup子群，拓展了Jiang-Skalski的分类结果，证明奇偶次数下均存在无穷多非共轭的极大Haagerup子群并明确其群同构类型。

2023-10-09math.GRmath.RT

Maximal Cocliques in $\operatorname{PSL}_2(q)$

The generating graph of a finite group is a structure which can be used to encode certain information about the group. It was introduced by Liebeck and Shalev and has been further investigated by Lucchini, Maróti, Roney-Dougal and others. We investigate maximal cocliques (totally disconnected induced subgraphs of the generating graph) in $\operatorname{PSL}_2(q)$ for $q$ a prime power and provide a classification of the `large' cocliques when $q$ is prime. We then provide an interesting geometric example which contradicts this result when $q$ is not prime and illustrate why the methods used fo…

2019-01-14math.GR

Finding a cycle base of a permutation group

A cycle base of a permutation group is defined to be a maximal set of its pairwise non-conjugate regular cyclic subgroups. It is proved that a cycle base of a permutation group of degree $n$ can be constructed in polynomial time in~$n$.

2017-02-17math.GR