Related papers: Idempotent ultrafilters and polynomial recurrence

Hindman's Theorem says that every finite coloring of the positive natural numbers has a monochromatic set of finite sums. Ramsey algebras, recently introduced, are structures that satisfy an analogue of Hindman's Theorem. It is an open…

Using an ergodic inverse theorem obtained in our previous paper, we obtain limit formulae for multiple ergodic averages associated with the action of $\mathbb{F}_{p}^{\omega}$. From this we deduce multiple Khintchine-type recurrence results…

The $(q,r)$-Eulerian polynomials are the $(\maj-$$\exc,\fix,\exc)$ enumerative polynomials of permutations. Using Shareshian and Wachs' exponential generating function of these Eulerian polynomials, Chung and Graham proved two symmetrical…

Arthur Cohn's irreducibility criterion for polynomials with integer coefficients and its generalization connect primes to irreducibles, and integral bases to the variable $x$. As we follow this link, we find that these polynomials are ready…

We establish some new Tur\'an's type inequalities for orthogonal polynomials defined by a three-term recurrence with monotonic coefficients. As a corollary we deduce asymptotic bounds on the extreme zeros of orthogonal polynomials with…

We prove that the half plane version of the uniform infinite planar triangulation (UIPT) is recurrent. The key ingredients of the proof are a construction of a new full plane extension of the half plane UIPT, based on a natural…

We use nonstandard methods, based on iterated hyperextensions, to develop applications to Ramsey theory of the theory of monads of ultrafilters. This is performed by studying in detail arbitrary tensor products of ultrafilters, as well as…

We previously showed that the inverse limit of standard-graded polynomial rings with perfect coefficient field is a polynomial ring, in an uncountable number of variables. In this paper, we show that the same result holds with arbitrary…

Ultrafilters are useful mathematical objects having applications in nonstandard analysis, Ramsey theory, Boolean algebra, topology, and other areas of mathematics. In this note, we provide a categorical construction of ultrafilters in terms…

In [1] the authors showed some basic properties of a pre-order that arose in combinatorial number theory, namely the finite embeddability between sets of natural numbers, and they presented its generalization to ultrafilters, which is…

We prove a recent conjecture by Ulas on reducible polynomial substitutions.

We study ultrafilters from the perspective of the algebra in the \v{C}ech-Stone compactification of the natural numbers, and idempotent elements therein. The first two results that we prove establish that, if $p$ is a Q-point (resp. a…

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…

In this paper we present a use of nonstandard methods in the theory of ultrafilters and in related applications to combinatorics of numbers.

In this paper, we give some new and interesting identities which are derived from the basis of Frobenius-Euler. Recently, Simsek et als(see [13]) have given some identities of q-analogue of Frobenius-Euler polynomials related to q-Bernstein…

We establish new operational formulae of Burchnall type for the complex disk polynomials (generalized Zernike polynomials). We then use them to derive some interesting identities involving these polynomials. In particular, we establish…

We extend the authors' previous work on Wiener-Wintner double recurrence theorem to the case of polynomials.

The two linearly independent solutions of the three-term recurrence relation of the associated Askey-Wilson polynomials, found by Ismail and Rahman in [22], are slightly modified so as to make it transparent that these functions satisfy a…

We prove a new upper bound for the number of smooth values of a polynomial with integer coefficients. This improves Timofeev's previous result unless the polynomial is a product of linear polynomials with integer coefficients. As an…

Heckman and Opdam introduced a non-symmetric analogue of Jack polynomials using Cherednik operators. In this paper, we derive a simple recursion formula for these polynomials and formulas relating the symmetric Jack polynomials with the…