English
Related papers

Related papers: Lower bounds on the Noether number

200 papers

In this paper, we study the proportion of vanishing elements of finite groups. We show that the proportion of vanishing elements of every finite non-abelian group is bounded below by $1/2$ and classify all finite groups whose proportions of…

Group Theory · Mathematics 2021-01-18 Lucia Morotti , Hung P. Tong-Viet

Three-dimensional monomial Noether problem can have negative solutions for 8 groups by the suitable choice of the coefficients. We find the necessary and sufficient condition for the coefficients to have a negative solution. The results are…

Number Theory · Mathematics 2010-01-02 Aiichi Yamasaki

Fractional (or non-integer) differentiation is an important concept both from theoretical and applicational points of view. The study of problems of the calculus of variations with fractional derivatives is a rather recent subject, the main…

Optimization and Control · Mathematics 2007-06-22 Gastao S. F. Frederico , Delfim F. M. Torres

We improve the previously best known lower and upper bounds on the number n_g of numerical semigroups of genus g. Starting from a known recursive description of the tree T of numerical semigroups, we analyze some of its properties and use…

Combinatorics · Mathematics 2009-05-06 Sergi Elizalde

We prove that an element from the Chevalley group of type $E_6$ or $E_7$ over a polynomial ring with coefficients in a small-dimensional ring can be reduced to an element of certain proper subsystem subgroup by a bounded number of…

Group Theory · Mathematics 2023-09-26 Pavel Gvozdevsky

A sharp bound is derived for the nilpotency class of a regular p-group in terms of its coexponent, and is used to show that the number of groups of order p^n with a given fixed coexponent, is independent of n, for p and n sufficiently…

Group Theory · Mathematics 2007-05-23 Paul J. Sanders

An optimal bound on the quantiles of a certain kind of distributions is given. Such a bound is used in applications to Berry--Esseen-type bounds for nonlinear statistics.

Probability · Mathematics 2013-01-03 Iosif Pinelis

Let $G$ be a group that is relatively hyperbolic with respect to a collection of subgroups $\{H_{\lambda}\}_{\lambda\in \Lambda}$. Suppose that $G$ is given by a finite relative presentation $\mathcal{P}$ with respect to this collection. We…

Group Theory · Mathematics 2025-01-09 Oleg Bogopolski

The isotropy of multiples of Pfister forms is studied. In particular, an improved lower bound on the value of their first Witt index is obtained. This result and certain of its corollaries are applied to the study of the weak isotropy index…

Number Theory · Mathematics 2012-08-03 James O'Shea

We introduce the depth parameters of a finite semigroup, which measure how hard it is to produce an element in the minimum ideal when we consider generating sets satisfying some minimality conditions. We estimate such parameters for some…

Group Theory · Mathematics 2015-06-05 Nasim Karimi

Let $X$ be a set of items of size $n$ that contains some defective items, denoted by $I$, where $I \subseteq X$. In group testing, a {\it test} refers to a subset of items $Q \subset X$. The outcome of a test is $1$ if $Q$ contains at least…

Data Structures and Algorithms · Computer Science 2023-08-16 Nader H. Bshouty

A simple method is shown to provide optimal variational bounds on $f$-divergences with possible constraints on relative information extremums. Known results are refined or proved to be optimal as particular cases.

Information Theory · Computer Science 2019-02-05 Olivier Binette

One important question in the theory of lattices is to detect a shortest vector: given a norm and a lattice, what is the smallest norm attained by a non-zero vector contained in the lattice? We focus on the infinity norm and work with…

Optimization and Control · Mathematics 2026-03-18 Stefan Kuhlmann , Robert Weismantel

The best known size lower bounds against unrestricted circuits have remained around $3n$ for several decades. Moreover, the only known technique for proving lower bounds in this model, gate elimination, is inherently limited to proving…

Computational Complexity · Computer Science 2020-12-09 Alexander Golovnev , Alexander S. Kulikov , R. Ryan Williams

The upper and lower Nordhaus-Gaddum bounds over all graphs for the power domination number follow from known bounds on the domination number and examples. In this note we improve the upper sum bound for the power domination number…

In 1956, Green provided a bound on the order of the Schur multiplier of $p$-groups. This bound, given as a function of the order of the group, is the best possible. Since then, the bound has been refined numerous times by adding other…

Group Theory · Mathematics 2023-01-24 Pradeep Kumar Rai

In this note, we first try to prove a uniform lower bound of nodal volume in elliptic homogenization setting. This lower bound is far from optimal. But, we can prove a constant lower bound in dimension two. Motivated by the proof, we extend…

Analysis of PDEs · Mathematics 2025-12-23 Jiahuan Li , Zhichen Ying

A general method for calculating or constructing lower central factors of groups is presented. {\it Relative basic commutators} are defined.

Group Theory · Mathematics 2009-10-06 Ted Hurley

We use probabilistic methods to find lower bounds on the maximum number, in a graph with domination number \gamma, of dominating sets of size \gamma. We find that we can randomly generate a graph that, w.h.p., is dominated by almost all…

Combinatorics · Mathematics 2013-08-15 Samuel Connolly , Zachary Gabor , Anant Godbole , Bill Kay

We examine the assumptions behind Noether's theorem connecting symmetries and conservation laws. To compare classical and quantum versions of this theorem, we take an algebraic approach. In both classical and quantum mechanics, observables…

Mathematical Physics · Physics 2025-11-04 John C. Baez