English
Related papers

Related papers: Multiple recurrence and popular differences for po…

200 papers

Given a family of subspaces we investigate existence, quantity and quality of common complements in Hilbert spaces and Banach spaces. In particular we are interested in complements for countable families of closed subspaces of finite…

Functional Analysis · Mathematics 2022-04-04 Florian Noethen

Let $K$ be a field of characteristic $0$, and let $k \geq 2$ be an integer. We prove that every $K$-linear bijection $f \colon K[X] \to K[X]$ strongly preserving the set of $k$-free polynomials (or the set of polynomials with a $k$-fold…

Commutative Algebra · Mathematics 2025-07-31 Béranger Seguin

In this paper we study the asymptotic behavior of the maximum magnitude of a complex random polynomial with i.i.d. uniformly distributed random roots on the unit circle. More specifically, let $\{n_k\}_{k=1}^{\infty}$ be an infinite…

Probability · Mathematics 2012-11-19 Gabriel H. Tucci , Philip A. Whiting

We consider random lines in $\mathbb{R}^3$ (random with respect to the kinematic measure) and how they intersect $\mathbb{S}^2$. It is known that the entry point and the exit point behave like \textit{independent} uniformly distributed…

Probability · Mathematics 2023-08-07 Dmitriy Bilyk , Alan Chang , Otte Heinävaara , Ryan W. Matzke , Stefan Steinerberger

Let $d\in\mathbb{Z}$ and $p_i$ be an integral polynomial with $p_i(0)=0,1\leq i\leq d$. It is shown that if $S$ is thickly syndetic in $\mathbb{Z}$, then $\{(m,n)\in\mathbb{Z}^2:m+p_i(n),m+p_2(n),\ldots,m+p_d(n)\in S\}$ is thickly syndetic…

Dynamical Systems · Mathematics 2023-04-07 Qinqi Wu

A conjecture of Odoni stated over Hilbertian fields $K$ of characteristic zero asserts that for every positive integer $d$, there exists a polynomial $f\in K[x]$ of degree $d$ such that for every positive integer $n$, each iterate $f^{\circ…

Number Theory · Mathematics 2023-05-11 Sushma Palimar

Let $ k, m, n $ be positive integers with $ k \geq 2 $. A $ k $-multiset of $ [n]_m $ is a collection of $ k $ integers from the set $ \{1, 2, \ldots, n\} $ in which the integers can appear more than once but at most $ m $ times. A family…

Combinatorics · Mathematics 2023-03-14 Jiaqi Liao , Zequn Lv , Mengyu Cao , Mei Lu

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

For any set $A$ of natural numbers with positive upper Banach density and any $k\geq 1$, we show the existence of an infinite set $B\subset{\mathbb N}$ and a shift $t\geq0$ such that $A-t$ contains all sums of $m$ distinct elements from $B$…

Dynamical Systems · Mathematics 2025-09-16 Bryna Kra , Joel Moreira , Florian K. Richter , Donald Robertson

We examine sequences of dense packings of n congruent non-overlapping disks inside a square which follow specific patterns as n increases along certain values, n = n(1), n(2),... n(k),.... Extending and improving previous work of Nurmela…

Metric Geometry · Mathematics 2007-05-23 Ronald L. Graham , Boris D. Lubachevsky

Let $p_1,...,p_L\in Z[x_1,...,x_d]$ be non-constant polynomials with zero constant term. The ergodic theoretical proofs of the polynomial and the IP-polynomial Szemeredi theorems as well as some of the ergodic-theoretical and combinatorial…

Dynamical Systems · Mathematics 2026-05-25 Vitaly Bergelson , Rigoberto Zelada

We consider the well-studied pattern counting problem: given a permutation $\pi \in \mathbb{S}_n$ and an integer $k > 1$, count the number of order-isomorphic occurrences of every pattern $\tau \in \mathbb{S}_k$ in $\pi$. Our first result…

Data Structures and Algorithms · Computer Science 2024-07-09 Gal Beniamini , Nir Lavee

We study sets of the form $A = \big\{ n \in \mathbb N \big| \lVert p(n) \rVert_{\mathbb R / \mathbb Z} \leq \varepsilon(n) \big\}$ for various real valued polynomials $p$ and decay rates $\varepsilon$. In particular, we ask when such sets…

Number Theory · Mathematics 2018-07-20 Jakub Konieczny

The classic string indexing problem is to preprocess a string S into a compact data structure that supports efficient pattern matching queries. Typical queries include existential queries (decide if the pattern occurs in S), reporting…

Data Structures and Algorithms · Computer Science 2021-02-05 Philip Bille , Inge Li Gørtz , Max Rishøj Pedersen , Teresa Anna Steiner

We investigate three types of averaging principles and the normal deviation for multi-scale stochastic differential equations (in short, SDEs) with polynomial nonlinearity. More specifically, we first demonstrate the strong convergence of…

Dynamical Systems · Mathematics 2023-08-22 Mengyu Cheng , Zhenxin Liu , Michael Röckner

Let $k$ and $m$ be positive integers. A collection of $k$-multisets from $\{1,..., m \}$ is intersecting if every pair of multisets from the collection is intersecting. We prove that for $m \geq k+1$, the size of the largest such collection…

Combinatorics · Mathematics 2011-11-23 Karen Meagher , Alison Purdy

Fix an odd prime $p$. If $r$ is a positive integer and $f$ a polynomial with coefficients in $\mathbb{F}_{p^r}$, let $P_{p,r}(f)$ be the proportion of $\mathbb{P}^1(\mathbb{F}_{p^r})$ that is periodic with respect to $f$. We show that as…

Number Theory · Mathematics 2022-08-26 Derek Garton

Let $\pi_n$ be a uniformly chosen random permutation on $[n]$. Using an analysis of the probability that two overlapping consecutive $k$-permutations are order isomorphic, the authors of a recent paper showed that the expected number of…

Combinatorics · Mathematics 2024-08-07 Anant Godbole , Hannah Swickheimer

Let $ k, n \in \mathbb{N}^+ $ and $ m \in \mathbb{N}^+ \cup \{\infty \} $. A $ k $-multiset in $ [n]_m $ is a $ k $-set whose elements are integers from $ \{1, 2, \ldots, n\} $, and each element is allowed to have at most $ m $ repetitions.…

Combinatorics · Mathematics 2024-07-09 Jiaqi Liao , Zequn Lv , Mengyu Cao , Mei Lu

Set systems with strongly restricted intersections, called $\alpha$-intersecting families for a vector $\alpha$, were introduced recently as a generalization of several well-studied intersecting families including the classical oddtown and…

Combinatorics · Mathematics 2024-04-15 Xin Wei , Xiande Zhang , Gennian Ge
‹ Prev 1 4 5 6 7 8 10 Next ›