Related papers: Recurrence for pretentious systems along generaliz…
The abc conjecture, one of the most famous open problems in number theory, claims that three positive integers satisfying a+b=c cannot simultaneously have significant repetition among their prime factors; in particular, the product of the…
This paper is a sequel of arXiv:2109.06394. In this paper, we consider a kind of inverse problem of multipliers. The problem is to count number of isospectral correspondences, correspondences which has the same combination of multipliers.…
The aim of our paper is to formulate and solve problems concerning multitime multiple recurrence equations. We discuss in detail the generic properties and the existence and uniqueness of solutions. Among the general things, we discuss in…
Using a structure theorem from [FG2010] we prove a version of multiple recurrence for sets of positive measure in a general stationary dynamical system.
Multidimensional continued fractions generalize classical continued fractions with the aim of providing periodic representations of algebraic irrationalities by means of integer sequences. However, there does not exist any algorithm that…
Two well-studied Diophantine equations are those of Pythagorean triples and elliptic curves, for the first we have a parametrization through rational points on the unit circle, and for the second we have a structure theorem for the group of…
This paper is concerned with the concept of linear repetitivity in the theory of tilings. We prove a general uniform subadditive ergodic theorem for linearly repetitive tilings. This theorem unifies and extends various known (sub)additive…
Motivated by recent work of George Andrews and Mircea Merca on the expansion of the quotient of the truncation of Euler's pentagonal number series by the complete series, we provide similar expansion results for averages involving…
We establish two versions of Vizing's theorem for Borel multi-graphs whose vertex degrees and edge multiplicities are uniformly bounded by respectively $\Delta$ and $\pi$. The ``approximate'' version states that, for any Borel probability…
A colouring of a graph is "nonrepetitive" if for every path of even order, the sequence of colours on the first half of the path is different from the sequence of colours on the second half. We show that planar graphs have nonrepetitive…
The polynomial multiplication problem has attracted considerable attention since the early days of computer algebra, and several algorithms have been designed to achieve the best possible time complexity. More recently, efforts have been…
Consider the property $(\aleph_{\omega + 1},\aleph_{\omega + 2},\ldots) \twoheadrightarrow (\aleph_1,\aleph_2,\ldots)$. Here we will show that this property with the addition of the General Continuum Hypothesis implies projective…
Our original results refer to multivariate recurrences: discrete multitime diagonal recurrence, bivariate recurrence, trivariate recurrence, solutions tailored to particular situations, second order multivariate recurrences, characteristic…
Through the following, we establish the conditions which allow us to express recursive sequences of real numbers, enumerated through the recurrence relation a_{n+1} = Aa_n + Ba_{n-1}, by means of algebraic equations in two variables of…
We identify a recursive structure among factorizations of polynomial values into two integer factors. Polynomials for which this recursive structure characterizes all non-trivial representations of integer factorizations of the polynomial…
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…
We show that, whenever Gamma is a countable abelian group and Delta is a finitely-generated subgroup of Gamma, a generic measure-preserving action of Delta on a standard atomless probability space (X,mu) extends to a free measure-preserving…
For graph classes $P_1,...,P_k$, Generalized Graph Coloring is the problem of deciding whether the vertex set of a given graph $G$ can be partitioned into subsets $V_1,...,V_k$ so that $V_j$ induces a graph in the class $P_j$…
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 excedance number for S_n is known to have an Eulerian distribution. Nevertheless, the classical proof uses descents rather than excedances. We present a direct recursive proof which seems to be folklore and extend it to the colored…