相关论文: Polynomial central set theorem near zero

The concept of Central sets, introduced by Furstenberg through the framework of topological dynamics, has played a pivotal role in combinatorial number theory. Furstenberg's Central Sets Theorem highlighted their rich combinatorial…

Given a zero-dimensional ideal I in a polynomial ring, many computations start by finding univariate polynomials in I. Searching for a univariate polynomial in I is a particular case of considering the minimal polynomial of an element in…

We prove quasipolynomial bounds on the inverse theorem for the Gowers $U^{s+1}[N]$-norm. The proof is modeled after work of Green, Tao, and Ziegler and uses as a crucial input recent work of the first author regarding the equidistribution…

This paper gives the first algorithm for finding a set of natural $\epsilon$-clusters of complex zeros of a triangular system of polynomials within a given polybox in $\mathbb{C}^n$, for any given $\epsilon>0$. Our algorithm is based on a…

We study a family of high order Ehrlich-type methods for approximating all zeros of a polynomial simultaneously. Let us denote by $T^{(1)}$ the famous Ehrlich method (1967). Starting from $T^{(1)}$, Kjurkchiev and Andreev (1987) have…

In this paper we prove a Nullstellensatz for supersymmetric polynomials. This gives a bijection between radical ideals and superalgebraic sets. These are algebraic sets which are invariant under the Weyl groupoid of Sergeev and Veselov,…

Motivated by situations in which the removal of a zero (a.k.a., an absorbing element) from a semigroup yields a subsemigroup with another zero, sets of quasi-zeros (a.k.a., quasi-absorbing elements) are introduced as well as primitive…

We study algorithms for approximating the permanent of a random matrix when the entries are slightly biased away from zero. This question is motivated by the goal of understanding the classical complexity of linear optics and \emph{boson…

We extend the methods and results of [arXiv 1603.04896] to the setting of multinomial distributions satisfying certain properties. These include all the multinomial distributions arising from the direct proof of the Central Limit Theorem…

We show that any nonzero polynomial in the ideal generated by the $r \times r$ minors of an $n \times n$ matrix $X$ can be used to efficiently approximate the determinant. For any nonzero polynomial $f$ in this ideal, we construct a small…

Hindman proved that, whenever the set $\mathbb{N}$ of naturals is finitely colored, there must exist non-constant monochromatic solution of the equation $a+b=cd$. In this paper we extend this result for dense subsemigroups of $((0, \infty),…

The present paper investigates properties of quasi-stable ideals and of Borel-fixed ideals in a polynomial ring $k[x_0,\dots,x_n]$, in order to design two algorithms: the first one takes as input $n$ and an admissible Hilbert polynomial…

Let $E$ be an arbitrary subset of the unit circle $T$ and let $f$ be a function defined on $E$. When there exist polynomials $P_n$ which are uniformly bounded by a number $M > 0$ on $T$ and converge (pointwise) to $f$ at each point of $E$?…

A central limit theorem is proved for the free energy of the random field Ising model with all plus or all minus boundary condition, at any temperature (including zero temperature) and any dimension. This solves a problem posed by Wehr and…

We discuss and compare upper and lower bounds obtained by two different methods for the positive zero of the ultraspherical polynomial $C_{n}^{(\lambda)}$ that is greater than $1$ when $-3/2 < \lambda < -1/2.$ Our first approach uses mixed…

We state the Central Limit Theorem, as the degree goes to infinity, for the normalized volume of the zero set of a rectangular Kostlan-Shub-Smale random polynomial system. This paper is a continuation of {\it Central Limit Theorem for the…

An improved characteristic set algorithm for solving Boolean polynomial systems is proposed. This algorithm is based on the idea of converting all the polynomials into monic ones by zero decomposition, and using additions to obtain…

An "entropy increasing to the maximum" result analogous to the entropic central limit theorem (Barron 1986; Artstein et al. 2004) is obtained in the discrete setting. This involves the thinning operation and a Poisson limit. Monotonic…

In this paper, we give the central limit theorem and almost sure central limit theorem for products of some partial sums of independent identically distributed random variables.

We are interested in a fragmentation process. We observe fragments frozen when their sizes are less than $\epsilon$ ($\epsilon$ > 0). Is is known ([BM05]) that the empirical measure of these fragments converges in law, under some…