English
Related papers

Related papers: Multiple recurrence for non-commuting transformati…

200 papers

We prove that multiple-recurrence and polynomial-recurrence of invertible infinite measure preserving transformations are both properties which pass to extensions.

Dynamical Systems · Mathematics 2009-03-11 Tom Meyerovitch

Motivated by partition regularity problems of homogeneous quadratic equations, we prove multiple recurrence and convergence results for multiplicative measure preserving actions with iterates given by rational sequences involving…

Dynamical Systems · Mathematics 2025-07-17 Nikos Frantzikinakis

We establish multiple recurrence and convergence results for pairs of zero entropy measure preserving transformations that do not satisfy any commutativity assumptions. Our results cover the case where the iterates of the two…

Dynamical Systems · Mathematics 2023-01-12 Nikos Frantzikinakis , Bernard Host

In this article, we give two different sufficient conditions for the irreducibility of a polynomial of more than one variable, over the field of complex numbers, that can be written as a sum of two polynomials which depend on mutually…

Commutative Algebra · Mathematics 2021-07-08 Vikramjeet Singh Chandel , Uma Dayal

We show that if $p_1,p_2$ are injective, integer polynomials that vanish at the origin, such that either both are of degree $1$ or both are of degree $2$ or higher, then double recurrence fails for non-commuting, mixing, zero entropy…

Dynamical Systems · Mathematics 2025-07-22 Zemer Kosloff , Shrey Sanadhya

We study multiple recurrence without commutativity in this paper. We show that for any two homeomorphisms $T,S: X\rightarrow X$ with $(X,T)$ and $(X,S)$ being minimal, there is a residual subset $X_0$ of $X$ such that for any $x\in X_0$ and…

Dynamical Systems · Mathematics 2024-09-13 Wen Huang , Song Shao , Xiangdong Ye

We study the structure of multiple correlation sequences defined by measure preserving actions of commuting transformations. When the iterates of the transformations are integer polynomials we prove that any such correlation sequence is the…

Dynamical Systems · Mathematics 2023-07-19 Nikos Frantzikinakis

We develop a theory of formal multivariate polynomials over commutative rings by treating them as ring terms. Our main result is that two ring terms are s-equivalent (when expanded they yield the same standard polynomial) iff they are…

Combinatorics · Mathematics 2024-01-30 M. Klazar

In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials of a given degree and exhibit explicit decompositions into…

Symbolic Computation · Computer Science 2008-10-29 Laurent Busé , Bernard Mourrain

Raimi's theorem guarantees the existence of a partition of $\mathbb{N}$ into two parts with an unavoidable intersection property: for any finite coloring of $\mathbb{N}$, some color class intersects both parts infinitely many times, after…

Combinatorics · Mathematics 2026-01-01 Norbert Hegyvari , Janos Pach , Thang Pham

We give a short proof of polynomial recurrence with large intersection for additive actions of finite-dimensional vector spaces over countable fields on probability spaces, improving upon the known size and structure of the set of strong…

Dynamical Systems · Mathematics 2014-09-25 Vitaly Bergelson , Donald Robertson

We establish new recurrence and multiple recurrence results for a rather large family $\mathcal{F}$ of non-polynomial functions which includes tempered functions defined in [11], as well as functions from a Hardy field with the property…

Dynamical Systems · Mathematics 2020-04-16 Vitaly Bergelson , Joel Moreira , Florian K. Richter

We extend our result on the convergence of double recurrence Wiener-Wintner averages to the case where we have a polynomial exponent. We will show that there exists a single set of full measure for which the averages \[ \frac{1}{N}…

Dynamical Systems · Mathematics 2015-09-04 Idris Assani , Ryo Moore

We consider a renewal-like recursion and prove that the solution is polynomially decaying asymptotically under suitable conditions. We prove similar results for the corresponding integral equation. In both cases coefficients and functions…

Classical Analysis and ODEs · Mathematics 2012-05-22 Ágnes Backhausz , Tamás F. Móri

Conditions for positive and polynomial recurrence have been proposed for a class of reliability models of two elements with transitions from working state to failure and back. As a consequence, uniqueness of stationary distribution of the…

Probability · Mathematics 2020-05-29 Alexander Veretennikov

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

Commutative Algebra · Mathematics 2014-07-14 Joachim von zur Gathen , Konstantin Ziegler

The multivariate resultant is a fundamental tool of computational algebraic geometry. It can in particular be used to decide whether a system of n homogeneous equations in n variables is satisfiable (the resultant is a polynomial in the…

Computational Complexity · Computer Science 2012-10-05 Bruno Grenet , Pascal Koiran , Natacha Portier

We introduce poly-Bernoulli polynomials in two variables by using a generalization of Stirling numbers of the second kind that we studied in a previous work. We prove the bi-variate poly-Bernoulli polynomial version of some known results on…

Number Theory · Mathematics 2023-06-22 Claudio Pita-Ruiz

Let $E\subset \mathbb Z$ be a set of positive upper density. Suppose that $P_1,P_2,..., P_k\in \mathbb Z[X]$ are polynomials having zero constant terms. We show that the set $E\cap (E-P_1(p-1))\cap ... \cap (E-P_k(p-1))$ is non-empty for…

Dynamical Systems · Mathematics 2015-06-08 Trevor D. Wooley , Tamar D. Ziegler

We present an information theoretic proof of the nonsignalling multiprover parallel repetition theorem, a recent extension of its two-prover variant that underlies many hardness of approximation results. The original proofs used de Finetti…

Information Theory · Computer Science 2019-02-01 Himanshu Tyagi , Shun Watanabe
‹ Prev 1 2 3 10 Next ›