English
Related papers

Related papers: A refined saturation theorem for polynomials and a…

200 papers

An abstract, Hales-Jewett type extension of the polynomial van der Waerden Theorem [J. Amer. Math. Soc. 9 (1996),725-753] is established: Theorem. Let r,d,q \in \N. There exists N \in \N such that for any r-coloring of the set of subsets of…

Combinatorics · Mathematics 2016-09-07 Vitaly Bergelson , Alexander Leibman

By a [$K$-]approximate subring of a ring we mean an additively symmetric subset $X$ such that $X \cdot X \cup (X + X)$ is covered by finitely many [resp.\ $K$] additive translates of $X$. We prove a structure theorem for finite approximate…

Rings and Algebras · Mathematics 2026-04-07 Krzysztof Krupiński , Simon Machado

Let $p$ be a prime, let $1 \le t < d < p$ be integers, and let $S$ be a non-empty subset of $\mathbb{F}_p$. We establish that if a polynomial $P:\mathbb{F}_p^n \to \mathbb{F}_p$ with degree $d$ is such that the image $P(S^n)$ does not…

Combinatorics · Mathematics 2026-02-25 Thomas Karam

The probability that a zero of a random real polynomial of increasing degree is real tends to zero. However, passing from polynomials to Laurent polynomials yields a surprising result: the probability that a root is real tends not to zero,…

Algebraic Geometry · Mathematics 2025-09-03 Boris Kazarnovskii

We investigate random complex dynamics of rational or polynomial maps on the Riemann sphere. We show that regarding random complex dynamics of polynomials, generically, the chaos of the averaged system disappears at any point in the Riemann…

Dynamical Systems · Mathematics 2013-07-15 Hiroki Sumi

A recent letter titled "Explicit Analytical Solution for Random Close Packing in d=2 and d=3" published in Physical Review Letters proposes a first-principle computation of the random close packing (RCP) density in spatial dimensions d=2…

Statistical Mechanics · Physics 2025-09-01 Patrick Charbonneau , Peter K. Morse

Let $\mathrm{R}$ be a real closed field, and $\mathrm{D} \subset \mathrm{R}$ an ordered domain. We describe an algorithm that given as input a polynomial $P \in \mathrm{D} [ X_{1},\ldots,X_{k} ]$, and a finite set, $\mathcal{A}= \{ p_{1},…

Algebraic Geometry · Mathematics 2016-10-11 Saugata Basu , Marie-Francoise Roy

We study continuous approximate solutions to polynomial equations over the ring $C(X)$ of continuous complex-valued functions over a compact Hausdorff space $X$. We show that when $X$ is one-dimensional, the existence of such approximate…

General Topology · Mathematics 2025-10-03 Joshua Lau , Vicente Marin-Marquez

Let $\MP_d$ denote the space of polynomials $f: \C \to \C$ of degree $d\geq 2$, modulo conjugation by $\Aut(\C)$. Using properties of polynomial trees (as introduced in [DM, math.DS/0608759]), we show that if $f_n$ is a divergent sequence…

Dynamical Systems · Mathematics 2007-05-23 Laura DeMarco

For a given topological dynamical system $(X,T)$ over a compact set $X$ with a metric $d$, the "variational principle" states that \begin{equation*} \sup_{\mu}h_\mu(T) = h(T) = h_d(T), \end{equation*} where $h_\mu(T)$ is the…

Dynamical Systems · Mathematics 2016-04-12 André Caldas , Mauro Patrão

We provide some conditions for the graph of a Hoelder-continuous function on \bar{D}, where \bar{D} is a closed disc in the complex plane, to be polynomially convex. Almost all sufficient conditions known to date --- provided the function…

Complex Variables · Mathematics 2015-08-28 Gautam Bharali

This work is based on the idea that extension of physical and mathematical theories to include the amount of space, time, momentum, and energy resources required to determine properties of systems may influence what is true in physics and…

Quantum Physics · Physics 2007-05-23 Paul Benioff

We prove a quantitative version of Hilbert's irreducibility theorem for function fields: If $f(T_1,\ldots, T_n,X)$ is an irreducible polynomial over the field of rational functions over a finite field $\mathbb{F}_q$ of characteristic $p$,…

Number Theory · Mathematics 2019-12-12 Lior Bary-Soroker , Alexei Entin

Let $(X,G)$ be a minimal equicontinuous dynamical system, where $X$ is a compact metric space and $G$ some topological group acting on $X$. Under very mild assumptions, we show that the class of regular almost automorphic extensions of…

Dynamical Systems · Mathematics 2019-11-13 Gabriel Fuhrmann , Dominik Kwietniak

In this paper, it is shown that a topological space $X$ is compact iff every maximal ideal of the power set ring $\mathcal{P}(X)$ converges to exactly one point of $X$. Then as an application, simple and ring-theoretic proofs are provided…

Commutative Algebra · Mathematics 2020-11-05 Abolfazl Tarizadeh

Let $p(x)=a_0 + a_1 x + \ldots + a_n x^n$ be a polynomial with all roots real and satisfying $x \leq -\delta$ for some $0<\delta <1$. We show that for any $0 < \epsilon <1$, the value of $p(1)$ is determined within relative error $\epsilon$…

Combinatorics · Mathematics 2018-06-21 Alexander Barvinok

In this paper we study online Reinforcement Learning (RL) in partially observable dynamical systems. We focus on the Predictive State Representations (PSRs) model, which is an expressive model that captures other well-known models such as…

Machine Learning · Computer Science 2022-08-16 Wenhao Zhan , Masatoshi Uehara , Wen Sun , Jason D. Lee

We investigate the plane dynamical system given by the secant map applied to a polynomial $p$ having at least one multiple root of multiplicity $d>1$. We prove that the local dynamics around the fixed points associated to the roots of $p$…

Dynamical Systems · Mathematics 2019-07-23 Antonio Garijo , Xavier Jarque

Given finite sets $X_1,\dotsc,X_m$ in $\mathbb{R}^d$ (with $d$ fixed), we prove that there are respective subsets $Y_1,\dotsc,Y_m$ with $|Y_i|\ge \frac{1}{\operatorname{poly}(m)}|X_i|$ such that, for $y_1\in Y_1,\dotsc,y_m\in Y_m$, the…

Combinatorics · Mathematics 2023-09-20 Boris Bukh , Alexey Vasileuski

The proof of Toda's celebrated theorem that the polynomial hierarchy is contained in $\P^{# P}$ relies on the fact that, under mild technical conditions on the complexity class $C$, we have $\exists C \subset BP \cdot \oplus C$. More…

Computational Complexity · Computer Science 2008-10-07 Cristopher Moore , Alexander Russell