Related papers: The Krzy\.z Conjecture and an Entropy Conjecture

We prove Hunter's conjecture on complete homogeneous symmetric polynomials. For even $n$ and every integer $k\geq 1$, we show that under the constraint $\sum_{i=1}^n a_i^2=1$ the global minimum of the even-degree polynomial…

If a macroscopic (random) classical system is put into a random state in phase space, it will of course the most likely have an almost maximal entropy according to second law of thermodynamics. We will show, however, the following theorem:…

Let \(F(z) = \prod_{k=1}^{n}(z - z_k)\) be a monic complex polynomial of degree \(n\) whose zeros satisfy \(\max\limits_{1 \le k \le n} |z_k| \le 1\). Paw{\l}owski [Trans. Amer. Math. Soc. 350(11) (1998)] considered the radius \(\gamma_n\)…

Cromwell proved that the minimum $v$-degree of the HOMFLY polynomial of homogeneous link $L$ is bounded above by $1-\chi(L)$, where $\chi(L)$ is the maximum Euler characteristic of Seifert surfaces of $L$. We prove its slice version,…

We give a simple proof of a classical theorem by A.M\'at\'e, P.Nevai, and V.Totik on asymptotic behavior of orthogonal polynomials on the unit circle. It is based on a new real-variable approach involving an entropy estimate for the…

We use weighted polynomial approximation to prove the existence of a compact set K with non-empty interior and a function f is dense in the space A(K) of all continuous functions on K that are holomorphic in the interior of K, endowed with…

Expansive polynomials (whose roots are greater than 1 in modulus) often arise in dynamical systems and other computational problems. This paper examines the expansivity gap (the gap between 1 and the smallest modulus of the roots) of these…

The famous Posa conjecture states that every graph of minimum degree at least 2n/3 contains the square of a Hamilton cycle. This has been proved for large n by Koml\'os, Sark\"ozy and Szemer\'edi. Here we prove that if p > n^{-1/2+\eps},…

We obtain an estimate for uniform approximation rate of bounded analytic in the unit disk functions by logarithmic derivatives of $C$-polynomials, i.e., polynomials, all of whose zeros lie on the unit circle $C:|z|=1$.

Measure-theoretic slow entropy is a more refined invariant than the classical measure-theoretic entropy to characterize the complexity of dynamical systems with subexponential growth rates of distinguishable orbit types. In this paper we…

For each $t>0,$ up to the number $n=N(t),$ the exact estimations of all initial taylor coefficients in the class $B_t$ were found, where $B_t$ is a set of holomorphic in unit disk functions $f,$ $0<|f|<1,$ $f(0)=e^{-t}.$

We prove in this paper that, under suitable coinditions on an initial data set, we can obtain Area and Curvature Estimates for simple marginally outer trapped surfaces (or MOTS). Using this estimates, we derive a Compactness Theorem for…

Let X be an infinite, compact, metrizable space of finite covering dimension and h a minimal homeomorphism of X. We prove that the crossed product of C(X) by h absorbs the Jiang-Su algebra tensorially and has finite nuclear dimension. As a…

Using the Bers isomorphism theorem for Teichmuller spaces of punctured Riemann surfaces and some of their other complex geometric features, we prove a general theorem on maximization of homogeneous polynomial (in fact, more general…

We partially generalize Peters' formula on modules over the group ring ${\mathbb F} \Gamma$ for a given finite field ${\mathbb F}$ and a sofic group $\Gamma$. It is also discussed that how the values of entropy are related to the zero…

Sendov conjecture tells that if $P$ denotes a complex polynomial having all his zeros in the closed unit disk and $a$ denote a zero of $P$, the closed disk of center $a$ and radius 1 contains a zero of the derivative $P'$. The main result…

The Schinzel hypothesis essentially claims that finitely many irreducible polynomials in one variable over Z simultaneously assume infinitely many prime values unless there is an obvious reason why this is impossible. We prove that under a…

Brown and Colbourn (1992) showed that the complex roots of the reliability polynomial of connected multigraphs are dense in the unit disk and that the closure of the real roots is $[-1,0] \cup \{1\}$. We prove the simple graph analogues of…

A way to pose the entropic uncertainty principle for trace-preserving super-operators is presented. It is based on the notion of extremal unraveling of a super-operator. For given input state, different effects of each unraveling result in…

We establish a result linking the Bouniakowsky conjecture and the density of polynomial roots to prime moduli.