Related papers: Low upper bounds of ideals

We obtain an improved lower bound for the regularity of the binomial edge ideals of trees. We prove an upper bound for the regularity of the binomial edge ideals of certain subclass of block-graphs. As a consequence we obtain sharp upper…

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

Low-rank matrix completion concerns the problem of estimating unobserved entries in a matrix using a sparse set of observed entries. We consider the non-uniform setting where the observed entries are sampled with highly varying…

In this paper, lower bounds on the probability of a finite union of events are considered, i.e. $P\left(\bigcup_{i=1}^N A_i\right)$, in terms of the individual event probabilities $\{P(A_i), i=1,\ldots,N\}$ and the sums of the pairwise…

The purpose of this paper is twofold. We explore higher property T as an abstract group-theoretic property. In particular, we provide new operator-algebraic characterizations of higher property T. Then we turn to lattices in semisimple Lie…

We study the low-lying zeros of various interesting families of elliptic curve L-functions. One application is an upper bound on the average analytic rank of the family of all elliptic curves. The upper bound obtained is less than two,…

Class ambiguity is typical in image classification problems with a large number of classes. When classes are difficult to discriminate, it makes sense to allow k guesses and evaluate classifiers based on the top-k error instead of the…

The F-thresholds are characteristic p analogs of the jumping coefficients for multiplier ideals in characteristic zero. In this article we give an alternative description of the F-thresholds of an ideal in a regular and F--finite ring $R$.…

The reduction algorithm is used to compute reduced ideals of a number field. However, there are reduced ideals that can never be obtained from this algorithm. In this paper, we will show that these ideals have inverses of larger norms among…

Let R be an integral domain and I a nonzero ideal of R. A sub-ideal J of I is a t-reduction of I if (JI^{n})_{t}=(I^{n+1})_{t} for some positive integer n. An element x in R is t-integral over I if there is an equation x^{n} + a_{1}x^{n-1}…

We give estimates for the zero loci of Bernstein-Sato ideals. An upper bound is proved as a multivariate generalisation of the upper bound by Lichtin for the roots of Bernstein-Sato polynomials. The lower bounds generalise the fact that…

We estimate the distribution of relatively $r$-prime lattice points in number fields $K$ with their components having a norm less than $x$. In the previous paper we obtained uniform upper bounds as $K$ runs through all number fields under…

In this paper we give new upper bounds on the regularity of edge ideals whose resolutions are k-steps linear; surprisingly, the bounds are logarithmic in the number of variables. We also give various bounds for the projective dimension of…

We prove a tight lower bound on the Betti numbers of tree and forest ideals and a tight upper bound on certain graded Betti numbers of squarefree monomial ideals.

Continuing ideas of a recent preprint of Schwede arXiv:0906.4313 we study test ideals by viewing them as minimal objects in a certain class of $F$-pure modules over algebras of p^{-e}-linear operators. This shift in the viewpoint leads to a…

The main result of this paper (Theorem B) asserts that under natural conditions, any weakly-split Tits system in G(k), G a reductive or quasi-reductive group over an arbitrary field k, is the standard one.

In this paper we consider extremal and almost extremal bounds on the normal Hilbert coefficients of ${\mathfrak m}$-primary ideals of an analytically unramified Cohen-Macaulay ring $R$ of dimension $d>0$ and infinite residue field. In these…

An inner model M is MINIMAL if there is a class A such that <M,A> is amenable yet has no transitive proper elementary submodel. We study minimal universes in the context of 0#. For example we prove: If 0# exists then there is an inner model…

Automating algorithm configuration is growing increasingly necessary as algorithms come with more and more tunable parameters. It is common to tune parameters using machine learning, optimizing performance metrics such as runtime and…

A real is called integer-valued random if no integer-valued martingale can win arbitrarily much capital betting against it. A real is low for integer-valued randomness if no integer-valued martingale recursive in A can succeed on an…