相关论文: On relational complexity and base size of finite p…

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…

The integral group ring $\mathbb{Z} G$ of a group $G$ has only trivial central units, if the only central units of $\mathbb{Z} G$ are $\pm z$ for $z$ in the center of $G$. We show that the order of a finite solvable group $G$ with this…

We establish new results on the possible growth rates for the sequence (f_n) counting the number of orbits of a given oligomorphic group on unordered sets of size n. Macpherson showed that for primitive actions, the growth is at least…

We say that a class of finite structures for a finite first-order signature is $r$-compressible if each structure $G$ in the class has a first-order description of size at most $O(r(|G|))$. We show that the class of finite simple groups is…

We prove that if the average of the degrees of the irreducible characters of a finite group $G$ is less than 16/5, then $G$ is solvable. This solves a conjecture of I.M. Isaacs, M. Loukaki, and the first author. We discuss related…

Let $n$ be a positive integer and $\mathcal M$ a set of rational $n \times n$-matrices such that $\mathcal M$ generates a finite multiplicative semigroup. We show that any matrix in the semigroup is a product of matrices in $\mathcal M$…

Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot...\cdot(n_lg)$ where $g\in G$ and $n_1,\cdots,n_l\in[1,{\hbox{\rm ord}}(g)]$, and the index $\ind(S)$ of $S$ is defined to be the…

We continue the investigation, that began in [3] and [4], into finite groups whose set of nontrivial conjugacy class sizes form an arithmetic progression. Let $G$ be a finite group and denote the set of conjugacy class sizes of $G$ by ${\rm…

Solving polynomial systems arising from applications is frequently made easier by the structure of the systems. Weighted homogeneity (or quasi-homogeneity) is one example of such a structure: given a system of weights…

Let $G$ denote a compact monothetic group, and let $$\rho (x) = \alpha_k x^k + \ldots + \alpha_1 x + \alpha_0,$$ where $\alpha_0, \ldots , \alpha_k$ are elements of $G$ one of which is a generator of $G$. Let $(p_n)_{n\geq 1}$ denote the…

For each integer $t>0$ and each complex simple Lie algebra $\mathfrak{g}$, we determine the least dimension of an irreducible highest weight representation of $\mathfrak{g}$ whose highest weight has height $t$. As a corollary, we classify…

The purpose of this work is to generalize part of the theory behind Faugere's "F5" algorithm. This is one of the fastest known algorithms to compute a Groebner basis of a polynomial ideal I generated by polynomials f_{1},...,f_{m}. A major…

We show that the minimum number of vertices of a simplicial complex with fundamental group $\mathbb{Z}^{n}$ is at most $O(n)$ and at least $\Omega(n^{3/4})$. For the upper bound, we use a result on orthogonal 1-factorizations of $K_{2n}$.…

For a finite group $G$, let $\mathrm{diam}(G)$ denote the maximum diameter of a connected Cayley graph of $G$. A well-known conjecture of Babai states that $\mathrm{diam}(G)$ is bounded by ${(\log_{2} |G|)}^{O(1)}$ in case $G$ is a…

Let G be an arithmetic lattice in a semisimple algebraic group over a number field. We show that if G has the congruence subgroup property, then the number of n-dimensional irreducible representations of G grows like n^a, where a is a…

We prove that, if $G$ is a finite almost simple group and $H$ is a maximal subgroup of $G$, then the $10$th term of the derived series of $H$ is perfect. The same is true if $G$ is perfect and $H$ is core-free. The constant $10$ is best…

Whiston proved that the maximum size of an irredundant generating set in the symmetric group $S_n$ is $n-1$, and Cameron and Cara characterized all irredundant generating sets of $S_n$ that achieve this size. Our goal is to extend their…

In this article we investigate the question of the lowest possible dimension that a sympathetic Lie algebra $\mathfrak{g}$ can attain, when its Levi subalgebra $\mathfrak{g}_L$ is simple. We establish the structure of the nilradical of a…

The problem of describing the invariance groups of unordered relations, called briefly \emph{relation groups}, goes back to classical work by H. Wielandt. In general, the problem turned out to be hard, and so far it has been settled only…

We consider factorizations of a finite group $G$ into conjugate subgroups, $G=A^{x_{1}}\cdots A^{x_{k}}$ for $A\leq G$ and $x_{1},\ldots ,x_{k}\in G$, where $A$ is nilpotent or solvable. First we exploit the split $BN$-pair structure of…