Related papers: Lower bounds on the Noether number

We derive a lower bound on the size of finite non-cyclic quotients of the braid group that is superexponential in the number of strands. We also derive a similar lower bound for nontrivial finite quotients of the commutator subgroup of the…

The rank of a finite semigroup is the smallest number of elements required to generate the semigroup. A formula is given for the rank of an arbitrary (non necessarily regular) Rees matrix semigroup over a group. The formula is expressed in…

We study the number of elements $x$ and $y$ of a finite group $G$ such that $x \otimes y= 1_{_{G \otimes G}}$ in the nonabelian tensor square $G \otimes G$ of $G$. This number, divided by $|G|^2$, is called the tensor degree of $G$ and has…

Let $G$ be a finite group. In this short note, we give a criterion of nilpotency of $G$ based on the existence of elements of certain order in each section of $G$.

We determine when a generalized down-up algebra is a Noetherian unique factorisation domain or a Noetherian unique factorisation ring.

We obtain optimal lower bounds for moments of theta functions. On the other hand, we also get new upper bounds on individual theta values and moments of theta functions on average over primes. The upper bounds are based on bounds of…

We study irreducible restrictions from modules over alternating groups to subgroups. We get reduction results which substantially restrict the classes of subgroups and modules for which this is possible. This is known when the…

We study the rings of invariants for the indecomposable modular representations of the Klein four group. For each such representation we compute the Noether number and give minimal generating sets for the Hilbert ideal and the field of…

We study the problem of finding a subgroup of a given order in a finite group, where the group is represented by its Cayley table. We analyze the complexity of the problem in the special case of abelian groups and present an optimal…

We determine the groups of minimal order in which all groups of order n can embedded for 1 < n < 16. We further determine the order of a minimal group in which all groups or order n or less can be embedded, also for 1 < n < 16.

We give lower bounds on the case of worst inhomogeneous approximation.

We analyze Kumar's recent quadratic algebraic branching program size lower bound proof method (CCC 2017) for the power sum polynomial. We present a refinement of this method that gives better bounds in some cases. The lower bound relies on…

Lie symmetry group method is applied to study the Born-Infeld equation. The symmetry group and its optimal system are given, and group invariant solutions associated to the symmetries are obtained. Finally the structure of the Lie algebra…

This article derives lower bounds on the supremal (strict) p-negative type of finite metric spaces using purely elementary techniques. The bounds depend only on the cardinality and the (scaled) diameter of the underlying finite metric…

We obtain a new lower bound for the eternal vertex cover number of an arbitrary graph $G$, in terms of the cardinality of a vertex cover of minimum size in $G$ containing all its cut vertices. The consequences of the lower bound includes a…

We give lower bounds on the number of effective divisors of degree $\leq g-1$ with respect to the number of places of certain degrees of an algebraic function field of genus $g$ defined over a finite field. We deduce lower bounds and…

Previously the second author has constructed by cobordism methods, an invariant associated to a finite group $G$. This invariant approximates the number of subgroups of a group, giving in some cases the number of abelian and cyclic…

In this paper we find the formula that gives the n-th smallest term in a given finite sequence of real numbers.

Lower bounds for the number of local nearrings on groups of order $p^3$ are obtained. On each non-metacyclic non-abelian or metacyclic abelian groups of order $p^3$ there exist at least $p+1$ non-isomorphic local nearrings

A common problem in analytic number theory is to bound the sum of an arithmetic function over a set of integers. Nair and Tenenbaum found a very general bound that applies to short sums of a multivariable arithmetic function over polynomial…