English
Related papers

Related papers: Optimal Polynomial Recurrence

200 papers

Let $\gamma(t)=(P_1(t),\ldots,P_n(t))$ where $P_i$ is a real polynomial with zero constant term for each $1\leq i\leq n$. We will show the existence of the configuration $\{x,x+\gamma(t)\}$ in sets of positive density $\epsilon$ in…

Classical Analysis and ODEs · Mathematics 2024-10-14 Xuezhi Chen , Changxing Miao

The best uniform polynomial approximation of the checkmark function $f(x)=|x-\alpha |$ is considered, as $\alpha$ varies in $(-1,1)$. For each fixed degree $n$, the minimax error $E_n (\alpha)$ is shown to be piecewise analytic in $\alpha$.…

Classical Analysis and ODEs · Mathematics 2022-01-19 Peter D. Dragnev , Alan R. Legg , Ramon Orive

Let $L^2(X,\Sigma,\mu,\tau)$ be a measure-preserving system, with $\tau$ a $\mathbb{Z}$-action. In this note, we prove that the ergodic averages along integer-valued polynomials, $P(n)$, \[ M_N(f):= \frac{1}{N}\sum_{n \leq N} \tau^{P(n)} f…

Classical Analysis and ODEs · Mathematics 2014-02-11 Ben Krause

We show that computing even very coarse approximations of critical points is intractable for simple classes of nonconvex functions. More concretely, we prove that if there exists a polynomial-time algorithm that takes as input a polynomial…

Optimization and Control · Mathematics 2026-01-30 Amir Ali Ahmadi , Georgina Hall

Fix an integer $h \geq 2$, and let $b_1, \ldots, b_h$ be (not necessarily distinct) positive integers with $\gcd(b_1, \ldots, b_h) = 1$. For any subset $A \subseteq \mathbb{N}$, let $r_A(n)$ denote the number of solutions $(k_1, \ldots,…

Number Theory · Mathematics 2026-05-06 Christian Táfula

We develop a new algorithm for factoring a bivariate polynomial $F\in \mathbb{K}[x,y]$ which takes fully advantage of the geometry of the Newton polygon of $F$. Under a non degeneracy hypothesis, the complexity is…

Commutative Algebra · Mathematics 2025-01-13 Martin Weimann

Let $E$ be a compact set of positive logarithmic capacity in the complex plane and let $\{P_n(z)\}_{1}^{\infty}$ be a sequence of asymptotically extremal monic polynomials for $E$ in the sense that \begin{equation*}%\label{}…

Complex Variables · Mathematics 2014-09-03 Edward B. Saff , Nikos Stylianopoulos

Let $f:\{-1,1\}^n$ be a polynomial with at most $s$ non-zero real coefficients. We give an algorithm for exactly reconstructing f given random examples from the uniform distribution on $\{-1,1\}^n$ that runs in time polynomial in $n$ and…

Machine Learning · Computer Science 2014-11-10 Murat Kocaoglu , Karthikeyan Shanmugam , Alexandros G. Dimakis , Adam Klivans

Let $R$ be a commutative Noetherian ring, $I$ an ideal, $M$ and $N$ finitely generated $R$-modules. Assume $V(I)\cap Supp(M)\cap Supp(N)$ consists of finitely many maximal ideals and let ${\l}(\e^i(N/I^nN,M))$ denote the length of…

Commutative Algebra · Mathematics 2007-05-23 Emanoil Theodorescu

We show that for any polynomial $f: \mathbb{Z}\to \mathbb{Z}$ with positive leading coefficient and irreducible over $\mathbb{Q}$, if $N$ is large enough then there are two strings of consecutive positive integers $I_{1}=\{n_1-m,\ldots,…

Number Theory · Mathematics 2026-02-26 Artyom Radomskii

Let $F$ be an integral linear recurrence, $G$ be an integer-valued polynomial splitting over the rationals, and $h$ be a positive integer. Also, let $\mathcal{A}_{F,G,h}$ be the set of all natural numbers $n$ such that $\gcd(F(n), G(n)) =…

Number Theory · Mathematics 2020-12-15 Daniele Mastrostefano , Carlo Sanna

The classical problem of maximizing the Shannon entropy of a sum of independent random variables supported on a finite alphabet is considered and settled in the ternary case. Namely, the following theorem is established: if…

Information Theory · Computer Science 2026-05-13 Mladen Kovačević

We prove, under different natural hypotheses, that the random multidimensional affine recursion $X_n=A_nX_{n-1}+B_n\in\mathbb{R}^d, n \geq 1,$ is recurrent in the critical case. In particular we cover the cases where the matrices $A_n$ are…

Probability · Mathematics 2024-08-08 Richard Aoun , Sara Brofferio , Marc Peigné

The recurrence for the $k$-Fibonacci polynomials is usually iterated upwards to positive values of $n$ only. When the recurrence is iterated downwards to $n<0$, there are indices where the polynomials vanish identically. This fact does not…

Combinatorics · Mathematics 2026-02-25 S. R. Mane

In the classical theory, a famous by-product of the continued fraction expansion of quadratic irrational numbers $\sqrt{D}$ is the solution to Pell's equation for $D$. It is well-known that, once an integer solution to Pell's equation…

Number Theory · Mathematics 2021-01-29 Nikoleta Kalaydzhieva

Fix a prime $p\geq 11$. We show that there exists a positive integer $m$ such that any subset of $\mathbb{F}_p^n\times\mathbb{F}_p^n$ containing no nontrivial configurations of the form $(x,y),(x,y+z),(x,y+2z),(x+z,y)$ must have density…

Combinatorics · Mathematics 2023-12-14 Sarah Peluse

We derive bulk asymptotics of skew-orthogonal polynomials (sop) $\pi^{\bt}_{m}$, $\beta=1$, 4, defined w.r.t. the weight $\exp(-2NV(x))$, $V (x)=gx^4/4+tx^2/2$, $g>0$ and $t<0$. We assume that as $m,N \to\infty$ there exists an $\epsilon >…

Mathematical Physics · Physics 2015-05-13 Saugata Ghosh

We prove that if $\mu_n$ are probability measures on $Z$ such that $\hat \mu_n$ converges to 0 uniformly on every compact subset of $(0,1)$, then there exists a subsequence $\{n_k\}$ such that the weighted ergodic averages corresponding to…

Classical Analysis and ODEs · Mathematics 2012-10-30 Patrick LaVictoire

Given a sequence $\mathscr{A}=\{a_0<a_1<a_2\ldots\}\subseteq \mathbb{N}$, let $r_{\mathscr{A},h}(n)$ denote the number of ways $n$ can be written as the sum of $h$ elements of $\mathscr{A}$. Fixing $h\geq 2$, we show that if $f$ is a…

Combinatorics · Mathematics 2024-12-18 Christian Táfula

Regular expressions with backreferences (regex, for short), as supported by most modern libraries for regular expression matching, have an NP-complete matching problem. We define a complexity parameter of regex, called active variable…

Formal Languages and Automata Theory · Computer Science 2024-02-09 Markus L. Schmid