Related papers: Lower bounds on the Noether number

A recurring theme in finite group theory is understanding how the structure of a finite group is determined by the arithmetic properties of group invariants. There are results in the literature determining the structure of finite groups…

Let $G$ be a finite group and $P$ a Sylow $2$-subgroup of $G$. We obtain both asymptotic and explicit bounds for the number of odd-degree irreducible complex representations of $G$ in terms of the size of the abelianization of $P$. To do…

Let $G\cong \mathbb Z/m_1\mathbb Z\times\ldots\times \mathbb Z/m_r\mathbb Z$ be a finite abelian group with $m_1\mid\ldots\mid m_r=\exp(G)$. The $n$-term subsums version of Kneser's Theorem, obtained either via the DeVos-Goddyn-Mohar…

Let $G$ be a finite group and $k$ be a field. Let $G$ act on the rational function field $k(x_g:g\in G)$ by $k$-automorphisms defined by $g\cdot x_h=x_{gh}$ for any $g,h\in G$. Noether's problem asks whether the fixed field $k(G)=k(x_g:g\in…

An old problem in group theory is that of describing how the order of an element behaves under multiplication. To generalize some classical bounds concerning the order $\mathrm o(ab)$ of two elements $a, b$ in a finite abelian group to the…

In this short note we introduce a new metric on certain finite groups. It leads to a class of groups for which the element orders satisfy an interesting inequality. This extends the class CP_2 studied in our previous paper [16].

Let $\gamma_n=[x_1,\dots,x_n]$ be the $n$th lower central word. Denote by $X_n$ the set of $\gamma_n$-values in a group $G$ and suppose that there is a number $m$ such that $|g^{X_n}|\leq m$ for each $g\in G$. We prove that…

Noether, Fleischmann and Fogarty proved that if the characteristic of the underlying field does not divide the order $|G|$ of a finite group $G$, then the polynomial invariants of $G$ are generated by polynomials of degrees at most $|G|$.…

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…

We show that every finite group $G$ of size at least $3$ has a nilpotent subgroup of class at most $2$ and size at least $|G|^{1/32\log\log|G|}$. This answers a question of Pyber, and is essentially best possible.

We give upper and lower bounds on the Chevalley-Bass number of a field of characteristic zero, whenever this quantity is well-defined. We also describe an algorithm which computes the Chevalley-Bass number of a field, provided its maximal…

We use entropy numbers in combination with the polynomial method to derive a new general lower bound for the n-th minimal error in the quantum setting of information-based complexity. As an application, we improve some lower bounds on…

Let $G$ be a finite group. A proper subgroup $H$ of $G$ is said to be large if the order of $H$ satisfies the bound $|H|^3 \ge |G|$. In this note we determine all the large maximal subgroups of finite simple groups, and we establish an…

We establish a majorization-based theory for bounding observables of waves with varied coherence. For any measurement, exact bounds are attained by the maximal and minimal elements in the set of input coherence spectra. The set's supremum…

A numerical procedure providing guaranteed two-sided bounds on the effective coefficients of elliptic partial differential operators is presented. The upper bounds are obtained in a standard manner through the variational formulation of the…

Lower bounds of betti numbers for homology groups of racks and quandles will be given using the quotient homomorphism to the orbit quandles. Exact sequences relating various types of homology groups are analyzed. Geometric methods of…

We define the graph minor category and prove that the category of contravariant representations of the graph minor category over a Noetherian ring is locally Noetherian. This can be regarded as a categorification of the Robertson--Seymour…

In order to provide a guaranteed precision and a more accurate judgement about the true value of the Cram\'{e}r-Rao bound and its scaling behavior, an upper bound (equivalently a lower bound on the quantum Fisher information) for precision…

We use an old elementary arithmetic argument to find new upper and lower bounds for Sylvester's denumerant function. These bounds are tight enough to get the asymptotic behavior of the denumerant.

We study modular forms for the minimal index noncongruence subgroups of the modular group. Our main theorem is a proof of the unbounded denominator conjecture for these groups, and we also provide a study of the Fourier coefficients of…