Related papers: On the problem of Kakeya

We study a variety of problems about homothets of sets related to the Kakeya conjecture. In particular, we show many of these problems are equivalent to the arithmetic Kakeya conjecture of Katz and Tao. We also provide a proof that the…

Given a sequence $\{Z_d\}_{d\in \mathbb{N}}$ of smooth and compact hypersurfaces in $\mathbb{R}^{n-1}$, we prove that (up to extracting subsequences) there exists a regular definable hypersurface $\Gamma\subset \mathbb{R}\mathrm{P}^n$ such…

A partition polynomial is a refinement of the partition number p(n) whose coefficients count some special partition statistic. Just as partition numbers have useful asymptotics so do partition polynomials. In fact, their asymptotics…

We estimate the number of possible types degree patterns of $k$-lacunary polynomials of degree $t < p$ which split completely modulo $p$. The result is based on a combination of a bound on the number of zeros of lacunary polynomials with…

For a given real polynomial $p$ we study the possible number of real roots of a differential polynomial $H_{\varkappa}[p](x) = \varkappa\left(p'(x)\right)^2-p(x)p''(x), \varkappa \in \mathbb{R}.$ In the special case when all real zeros of…

In this paper we relate the location of the complex zeros of the reliability polynomial to parameters at which a certain family of rational functions derived from the reliability polynomial exhibits chaotic behaviour. We use this connection…

The main aim of this paper is twofold. First we generalize, in a novel way, most of the known non-vanishing results for the derivatives of the Riemann zeta function by establishing the existence of an infinite sequence of regions in the…

We prove that if $P(X) \in \mathbb{Z}[X]$ is an integer polynomial of degree $n$ and having $P(0) = 1$, then either $P(X)$ is a product of cyclotomic polynomials, or else at least one of the complex roots of $P$ belongs to the disk $|z|…

We define a necessary and sufficient condition on a polynomial $h\in \mathbb{Z}[x]$ to guarantee that every set of natural numbers of positive upper density contains a nonzero difference of the form $h(p)$ for some prime $p$. Moreover, we…

A time-dependent monic polynomial in the z variable with N distinct roots such that exactly one root has multiplicity m>=2 is considered. For k=1,2, the k-th derivatives of the N roots are expressed in terms of the derivatives of order j<=…

The classical Enestrom-Kakeya theorem establishes upper and lower bounds on the zeros of a polynomial with positive coefficients that are explicit functions of those coefficients. We establish a unifying framework that incorporates this…

Let $p(z)=a_0+a_1z+a_2z^2+a_3z^3+\cdots+a_nz^n$ be a polynomial of degree $n$ having no zeros in the unit disk. ~Then it is well known that for $R\geq 1,$ $\displaystyle{\max_{|z|=R}|p(z)|}\leq…

In this note we study packing or covering integer programs with at most k constraints, which are also known as k-dimensional knapsack problems. For any integer k > 0 and real epsilon > 0, we observe there is a polynomial-sized LP for the…

Given a complex polynomial $p(z)$ of degree $n$ and an ellipse, we find an algorithm of determining the number of zeros of $p$ in the interior and exterior of the ellipse. Our results generalize the previous results of Pt\'ak and Young…

D. Khavinson and G. Swiatek proved that harmonic polynomials p(z)+q(z), where p is holomorphic, q is antiholomorphic, and deg p = n > 1 = deg q, can have at most 3n-2 complex zeros. We show that this bound is sharp for all n by proving a…

Roughly speaking, the Kakeya Conjecture asks to what extent lines which point in different directions can be packed together in a small space. In $\R^2$, the problem is relatively straightforward and was settled in the 1970s. In $\R^3$ it…

Our goal in this paper is to study the zero distribution of a sequence of polynomials whose coefficients satisfy a three-term recurrence. Equivalently, these polynomials are Taylor polynomials of a rational function with a polynomial…

For a tree $T$, the subtree polynomial of $T$ is the generating polynomial for the number of subtrees of $T$. We show that the complex roots of the subtree polynomial are contained in the disk $\left\{z\in\mathbb{C}\colon\ |z|\leq…

Given a real polynomial $p$ with only real zeroes, we find upper and lower bounds for the number of non-real zeroes of the differential polynomial $$ F_{\varkappa}[p](z):= p(z)p''(z)-\varkappa[p'(z)]^2,$$ where $\varkappa$ is a real number.…

Let $ P(z) $ be a polynomial of degree $ n $ having all zeros in $|z|\leq k$ where $k\leq 1,$ then it was proved by Dewan \textit{et al} that for every real or complex number $\alpha$ with $|\alpha|\geq k$ and each $r\geq 0$ $$…