Related papers: Lower bounds on the Noether number

We present a sharp upper bound for the number of generators of a finite group in terms of the ratio between the order and the exponent.

In [1] the problem of finding a sharp lower bound on lower against number of a general graph is mentioned as an open question. We solve the problem by establishing a tight lower bound on lower against number of a general graph in terms of…

In this note we generalize several well known results concerning invariants of finite groups from characteristic zero to positive characteristic not dividing the group order. The first is Schmid's relative version of Noether's theorem. That…

We prove several Littlewood-Offord type inequalities for arbitrary groups. In groups having elements of finite order the worst case scenario is provided by the simple random walk on a certain cyclic subgroup. The inequalities we obtain are…

We prove a new lower bound for the Mahler measure of a polynomial in one and in several variables that depends on the complex coefficients, and the number of monomials. In one variable our result generalizes a classical inequality of…

We obtain a lower bound on each entry of the principal eigenvector of a non-regular connected graph.

Assume G is a nilpotent group of class > 3 in which every proper subgroup has class at most 3. In this note, we give the exact upper bound of class of G.

In this short note, we provide an inequality that holds in any finite group, only involving the orders of the elements; we prove that equality holds if and only if the group is nilpotent.

A subfactor is an inclusion $N \subset M$ of von Neumann algebras with trivial centers. The simplest example comes from the fixed points of a group action $M^G \subset M$, and subfactors can be thought of as fixed points of more general…

The main goal of this paper is to apply the arithmetic method developed in our previous paper \cite{13} to determine the number of some types of subgroups of finite abelian groups.

The number of subgroups and the number of cyclic subgroups are natural combinatorial invariants of a finite group. We investigate how restrictions on these quantities, together with the number of distinct prime divisors of $|G|$, enforce…

An instance of a group testing problem is a set of objects $\cO$ and an unknown subset $P$ of $\cO$. The task is to determine $P$ by using queries of the type ``does $P$ intersect $Q$'', where $Q$ is a subset of $\cO$. This problem occurs…

Given an infinite linear group with a finite set of generators, we show that the shortest word length of an element of infinite order has an upper bound that depends only on the number of generators and the degree. This provides a…

We study Noether's problem from the perspective of torsors under linear algebraic groups and descent.

We prove a Noether's theorem for fractional variational problems with Riesz-Caputo derivatives. Both Lagrangian and Hamiltonian formulations are obtained. Illustrative examples in the fractional context of the calculus of variations and…

Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all…

We prove sharp lower bounds for the smallest singular value of a partial Fourier matrix with arbitrary "off the grid" nodes (equivalently, a rectangular Vandermonde matrix with the nodes on the unit circle), in the case when some of the…

We begin by reporting on some recent results of the authors (Frederico and Torres, 2006), concerning the use of the fractional Euler-Lagrange notion to prove a Noether-like theorem for the problems of the calculus of variations with…

Combinatorics on multisets is used to deduce new upper and lower bounds on the number of numerical semigroups of each given genus, significantly improving existing ones. In particular, it is proved that the number $n_g$ of numerical…

We establish a quantitative lower bound on the reach of flat norm minimizers for boundaries in $\mathbb{R}^2$.