English
Related papers

Related papers: Optimal Polynomial Recurrence

200 papers

We show that a generic tensor $T\in \mathbb{F}^{n\times n\times \dots\times n}$ of order $k$ and CP rank $d$ can be uniquely recovered from $n\log n+dn\log \log n +o(n\log \log n) $ uniformly random entries with high probability if $d$ and…

Combinatorics · Mathematics 2024-08-08 Hiroki Hamaguchi , Shin-ichi Tanigawa

A conjecture of Khang Tran [6] claims that for an arbitrary pair of polynomials $A(z)$ and $B(z)$, every zero of every polynomial in the sequence $\{P_n(z)\}_{n=1}^\infty$ satisfying the three-term recurrence relation of length $k$…

Classical Analysis and ODEs · Mathematics 2020-03-18 Rikard Bögvad , Innocent Ndikubwayo , Boris Shapiro

Following an approach presented by N. Frantzikinakis, B. Host and B. Kra, we show that the parameters in the multidimensional Szemer\'edi theorem for closest integer polynomials have non-empty intersection with the set of shifted primes…

Dynamical Systems · Mathematics 2016-09-28 Andreas Koutsogiannis

Let $G_{n,p}$ be the standard Erd\H{o}s-R\'enyi-Gilbert random graph and let $G_{n,n,p}$ be the random bipartite graph on $n+n$ vertices, where each $e\in [n]^2$ appears as an edge independently with probability $p$. For a graph $G=(V,E)$,…

Combinatorics · Mathematics 2015-11-19 Alan Frieze , Tony Johansson

A subset $R$ of integers is a set of Bohr recurrence if every rotation on $\mathbb{T}^d$ returns arbitrarily close to zero under some non-zero multiple of $R$. We show that the set $\{k!\, 2^m3^n\colon k,m,n\in \mathbb{N}\}$ is a set of…

Dynamical Systems · Mathematics 2024-11-05 Nikos Frantzikinakis , Bernard Host , Bryna Kra

In this note we connect Sobolev estimates in the context of polynomial averages e.g. \[ \| \int_0^1 \prod_{k=1}^m f_k(x-t^k) \|_{1} \leq \text{Const} \cdot 2^{-\text{const} \cdot l} \prod_{i=1}^m \| f_k \|_m \] whenever some $f_i$ vanishes…

Classical Analysis and ODEs · Mathematics 2025-08-11 Ben Krause

We consider incomplete exponential sums in several variables of the form S(f,n,m) = \frac{1}{2^n} \sum_{x_1 \in \{-1,1\}} ... \sum_{x_n \in \{-1,1\}} x_1 ... x_n e^{2\pi i f(x)/p}, where m>1 is odd and f is a polynomial of degree d with…

Number Theory · Mathematics 2010-11-16 Eduardo Duenez , Steven J. Miller , Howard Straubing , Amitabha Roy

Let $A = a_0T^m + \sum_{j=1}^{m-1} a_j (T^{m-j}+T^{m+j}) + T^{2m}+1 \in \mathbf{Z}[T]$ be a monic reciprocal polynomial of degree $2m$ sampled randomly by selecting its coefficients $a_0,a_1,\dots,a_{m-1}$ independently according to a given…

Number Theory · Mathematics 2025-10-22 David Hokken , Dimitris Koukoulopoulos

Assume that $rB_{2}^{n} \subset P$ for some polytope $P \subset \mathbb{R}^n$, where $r \in (\frac{1}{2},1]$. Denote by $\mathcal{F}$ the set of facets of $P$, and by $N=N(P,B_2^n)$ the covering number of $P$ by the Euclidean unit ball…

Metric Geometry · Mathematics 2024-10-24 Dan I. Florentin , Tomer Milo

We study the recursions $A(n) = A(n-a-A^k(n-b)) + A(A^k(n-b))$ where $a \geq 0$, $b \geq 1$ are integers and the superscript $k$ denotes a $k$-fold composition, and also the recursion $C(n) = C(n-s-C(n-1)) + C(n-s-2-C(n-3))$ where $s \geq…

Combinatorics · Mathematics 2014-07-03 Abraham Isgur , Mustazee Rahman

For $0 < \alpha \leq 1$, let $E$ be a compact subset of the $d$-dimensional moment curve in $\mathbb{R}^d$ such that $N(E,\varepsilon) \lesssim \varepsilon^{-\alpha}$ for $0 <\varepsilon <1$ where $N(E,\varepsilon)$ is the smallest number…

Classical Analysis and ODEs · Mathematics 2025-09-08 Shengze Duan , Minh-Quy Pham , Donggeun Ryou

Among other things, we prove that, for a doubling weight $w$, $0< p\leq\infty$, $r\in{\mathbb N}_0$, and $0<\alpha <r+1 - 1/\lambda_p$, we have \[ E_n(f)_{p, w_n} = O(n^{-\alpha}) \iff \omega_\varphi^{r+1}(f, n^{-1})_{p, w_n} =…

Classical Analysis and ODEs · Mathematics 2015-07-20 Kirill A. Kopotun

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…

Classical Analysis and ODEs · Mathematics 2015-02-03 Alex Rice

Let $S_n^{(2)}$ denote the iterated partial sums. That is, $S_n^{(2)}=S_1+S_2+ ... +S_n$, where $S_i=X_1+X_2+ ... s+X_i$. Assuming $X_1, X_2,....,X_n$ are integrable, zero-mean, i.i.d. random variables, we show that the persistence…

Probability · Mathematics 2015-06-05 Amir Dembo , Jian Ding , Fuchang Gao

In this paper we give a conditional improvement to the Elekes-Szab\'{o} problem over the rationals, assuming the Uniformity Conjecture. Our main result states that for $F\in \mathbb{Q}[x,y,z]$ belonging to a particular family of…

Combinatorics · Mathematics 2020-10-20 Mehdi Makhul , Oliver Roche-Newton , Sophie Stevens , Audie Warren

We study the asymptotics of recurrence coefficients for monic orthogonal polynomials p_n(z) with the quartic exponential weight exp [-N (1/2 z^2 + t/4 z^4)], where t is complex. Our goals are: A) to describe the regions of different…

Exactly Solvable and Integrable Systems · Physics 2015-03-19 Marco Bertola , Alexander Tovbis

Let f be a sum of exponentials of the form exp(2 pi i N x), where the N are distinct integers. We call f an idempotent trigonometric polynomial (because the convolution of f with itself is f) or, simply, an idempotent. We show that for…

Classical Analysis and ODEs · Mathematics 2007-05-23 Bruce Anderson , J. Marshall Ash , Roger Jones , Daniel G. Rider , Bahman Saffari

A sequence $S=s_{1}s_{2}..._{n}$ is \emph{nonrepetitive} if no two adjacent blocks of $S$ are identical. In 1906 Thue proved that there exist arbitrarily long nonrepetitive sequences over 3-element set of symbols. We study a generalization…

Combinatorics · Mathematics 2011-04-15 Jarosław Grytczuk , Jakub Kozik , Marcin Witkowski

Statistics of Poincar\'e recurrences is studied for the base-pair breathing dynamics of an all-atom DNA molecule in realistic aqueous environment with thousands of degrees of freedom. It is found that at least over five decades in time the…

Biomolecules · Quantitative Biology 2015-11-04 Alexey K. Mazur , D. L. Shepelyansky

We prove that any extended formulation that approximates the matching polytope on $n$-vertex graphs up to a factor of $(1+\varepsilon)$ for any $\frac2n \le \varepsilon \le 1$ must have at least $\binom{n}{{\alpha}/{\varepsilon}}$ defining…

Computational Complexity · Computer Science 2017-11-29 Makrand Sinha
‹ Prev 1 3 4 5 6 7 10 Next ›