Related papers: Lower bounds on the Noether number

We prove upper and lower bounds on the size of the largest square grid graph that is a subgraph, minor, or shallow minor of a graph in the form of a larger square grid from which a specified number of vertices have been deleted. Our bounds…

We generalize the Cheeger inequality, a lower bound on the first nontrivial eigenvalue of a Laplacian, to the case of geometric sub-Laplacians on rank-varying Carnot-Carath\'eodory spaces and we describe a concrete method to lower bound the…

Let $G$ be a simple undirected graph. The regular number of $G$ is defined to be the minimum number of subsets into which the edge set of $G$ can be partitioned so that the subgraph induced by each subset is regular. In this work, we obtain…

In a finite group, a subset is called a Lagrange subset if its size divides the group order, and a factor if it admits a complementary subset. We provide a new and comparatively direct proof of the classification of groups in which every…

Let $G$ be a finite graph of genus $g$. Let $d$ and $r$ be non-negative integers such that the Brill-Noether number is non-negative. It is known that for some $k$ sufficiently large, the $k$-th homothetic refinement $G^{(k)}$ of $G$ admits…

We develop a new technique for proving distribution testing lower bounds for properties defined by inequalities involving the bin probabilities of the distribution in question. Using this technique we obtain new lower bounds for…

We prove lower bounds on the error of any estimator for the mean of a real probability distribution under the knowledge that the distribution belongs to a given set. We apply these lower bounds both to parametric and nonparametric…

We consider the infinite symmetric group and its infinite index subgroup given as the stabilizer subgroup of one element under the natural action on a countable set. This inclusion of discrete groups induces a hyperfinite subfactor for each…

Consider an operator that takes the Fourier transform of a discrete measure supported in $\mathcal{X}\subset[-\frac 12,\frac 12)^d$ and restricts it to a compact $\Omega\subset\mathbb{R}^d$. We provide lower bounds for its smallest singular…

This paper develops nonasymptotic information inequalities for the estimation of the eigenspaces of a covariance operator. These results generalize previous lower bounds for the spiked covariance model, and they show that recent upper…

An apriori bound for the condition number associated to each of the following problems is given: general linear equation solving, minimum squares, non-symmetric eigenvalue problems, solving univariate polynomials, solving systems of…

We prove a lower bound for the Milnor number of function germ invariant with respect to a finite abelian group action. It is shown that this bound is tight for functions of arbitrarily many variables. We also prove the function germs that…

It is proved that the universal degree bound for separating polynomial invariants of a finite abelian group (in non-modular characteristic) is strictly smaller than the universal degree bound for generators of polynomial invariants, unless…

We establish sharp upper and lower estimates of the Dunkl kernel in the case of dihedral groups.

In this paper we study the algebra of graph invariants, focusing mainly on the invariants of simple graphs. All other invariants, such as sorted eigenvalues, degree sequences and canonical permutations, belong to this algebra. In fact,…

We prove a fractional Noether's theorem for fractional Lagrangian systems invariant under a symmetry group both in the continuous and discrete cases. This provides an explicit conservation law (first integral) given by a closed formula…

Let $G$ be a $p$-group for some prime $p$. Let $n$ be the positive integer so that $|G:Z(G)| = p^n$. Suppose $A$ is a maximal abelian subgroup of $G$. Let $$p^l = {\rm max} \{|Z(C_G (g)):Z(G)| : g \in G \setminus Z(G)\},$$ $$p^b = {\rm max}…

Certain smoothing inequalities were proposed in the recent paper posted on arXiv at arxiv:1301.2828 in order to lessen the very large gap between the best correctly established upper and lower bounds on the constant factor in the nonuniform…

We provide a rather general and very simple to compute lower bound for the asymptotic convergence factor of compact subsets of the set of complex numbers with connected complement and finitely many connected components .

We provide polynomial lower bounds for residual finiteness of residually finite, finitely generated solvable groups that admit infinite order elements in the Fitting subgroup of strict distortion at least exponential. For this class of…