Related papers: Polynomial central set theorem near zero

For each fixed value of $\beta$ in the range $-2<\beta<-1$ and $0<c<1$, we investigate interlacing properties of the zeros of polynomials of consecutive degree for $M_{n}(x;\beta,c)$ and $M_k(x,\beta+t,c)$, $k\in\{n-1,n,n+1\}$ and…

For a field $\mathbb{F}$ and integers $d, k$ and $\ell$, a set $A \subseteq \mathbb{F}^d$ is called $(k,\ell)$-nearly orthogonal if all vectors in $A$ are non-self-orthogonal and every $k+1$ vectors in $A$ contain $\ell + 1$ pairwise…

We study the problem of minimizing the supremum norm, on a segment of the real line or on a compact set in the plane, by polynomials with integer coefficients. The extremal polynomials are naturally called integer Chebyshev polynomials.…

For any pair of real numbers $(i,j)$ with $0<i,j<1$ and $i+j=1$, we prove that the set of $p$-adic mixed $(i,j)$-badly approximable numbers $\bad_p(i, j)$ is 1/2-winning in the sense of Schmidt's game. This improves a recent result of…

The Lloyd Theorem of (Sol\'e, 1989) is combined with the Schwartz-Zippel Lemma of theoretical computer science to derive non-existence results for perfect codes in the Lee metric, NRT metric, mixed Hamming metric, and for the sum-rank…

We generalize a version of Lavrent\'ev's theorem which says that a function that is continuous on a compact set K with connected complement and without interior points can be uniformly approximated as closely as desired by a polynomial…

Let $z_1, \dots, z_m$ be $m$ distinct complex numbers, normalized to $|z_k| = 1$, and consider the polynomial $$ p_{m}(z) = \prod_{k=1}^{m}{(z-z_k)}.$$ We define a sequence of polynomials in a greedy fashion, $$ p_{N+1}(z) = p_{N}(z)…

This article takes up the challenge of extending the classical Real Nullstellensatz of Dubois and Risler to left ideals in a *-algebra A. After introducing the notions of non-commutative zero sets and real ideals, we develop three themes…

Let m be a probability measure supported on some infinite and compact set K in the complex plane and let p_n(z) be the corresponding degree n orthonormal polynomial with positive leading coefficient. Let v_n be the normalized zero counting…

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

Consider a semi-algebraic set A in R^d constructed from the sets which are determined by inequalities p_i(x)>0, p_i(x)\ge 0, or p_i(x)=0 for a given list of polynomials p_1,...,p_m. We prove several statements that fit into the following…

This paper considers polynomial optimization with unbounded sets. We give a homogenization formulation and propose a hierarchy of Moment-SOS relaxations to solve it. Under the assumptions that the feasible set is closed at infinity and the…

Let $p_n(x)$ be orthogonal polynomials associated to a measure $d\mu$ of compact support in $R$. If $E\not\in supp(d\mu)$, we show there is a $\delta>0$ so that for all $n$, either $p_n$ or $p_{n+1}$ has no zeros in $(E-\delta, E+\delta)$.…

Let $n$ be a nonnegative integer and $I$ be a finite set of positive integers. In 1915, MacMahon proved that the number of permutations in the symmetric group $\mathfrak{S}_n$ with descent set $I$ is a polynomial in $n$. We call this the…

We introduce the notion of a coherent $P$-ultrafilter on a complete ccc Boolean algebra, strenghtening the notion of a $P$-point on $\omega$, and show that these ultrafilters exist generically under ${\mathfrak c} = {\mathfrak d}$. This…

In 2015, Phulara established a generalization of the famous central set theorem by an original idea. Roughly speaking, this idea extends a combinatorial result from one large subset of the given semigroup to countably many. In this paper,…

In this paper, we study the superconvergence phenomenon in the free central limit theorem for identically distributed, unbounded summands. We prove not only the uniform convergence of the densities to the semicircular density but also their…

We prove the following theorem: For a partially ordered set Q such that every countable subset has a strict upper bound, there is a forcing notion satisfying ccc such that, in the forcing model, there is a basis of the null ideal of the…

We show how to obtain linear combinations of polynomials in an orthogonal sequence $\{P_n\}_{n\geq 0}$, such as $Q_{n,k}(x)=\sum\limits_{i=0}^k a_{n,i}P_{n-i}(x)$, $a_{n,0}a_{n,k}\neq0$, that characterize quasi-orthogonal polynomials of…

We show that a determinantal ideal generated by $t$-minors does not contain any nonzero polynomials with $t!/2$ or fewer terms. Geometrically this means that any nonzero polynomial vanishing on all matrices of rank at most $t-1$ has more…