Related papers: Digital pattern and transcendence via generalized …

We present some Markovian approaches to prove universality results for some functions on the symmetric group. Some of those statistics are already studied in [Kammoun, 2018, 2020] but not the general case. We prove, in particular, that the…

We construct a computable, computably categorical field of infinite transcendence degree over the rational numbers, using the Fermat polynomials and assorted results from algebraic geometry. We also show that this field has an intrinsically…

In this survey, we present five different proofs for the transcendence of Kempner's number, defined by the infinite series $\sum_{n=0}^{\infty} \frac{1}{2^{2^n}}$. We take the opportunity to mention some interesting ideas and methods that…

Despite the fact that the field of pattern avoiding permutations has been skyrocketing over the last two decades, there are very few exhaustive generating algorithms for such classes of permutations. In this paper we introduce the notions…

Hadwiger's theorem is a Helly-type theorem involving common transversals to families of convex sets instead of common intersections. Subsequently, Pollack and Wenger identified a necessary and sufficient condition, called a consistent…

The dynamical system generated by the iterated calculation of the high order gaps between neighboring terms of a sequence of natural numbers is remarkable and only incidentally characterized at the boundary by the notable Proth-Glibreath…

We show the existence of regular combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, t-designs, and t-wise…

Canon permutations are permutations of the multiset having $k$ copies of each integer between $1$ and $n$, with the property that the subsequences obtained by taking the $j$th copy of each entry, for each fixed $j$, are all the same. For…

In this paper, we prove the number of countable models of a countable supersimple theory is either 1 or infinite. This result is an extension of Lachlan's theorem on a superstable theory.

An example of Cornalba and Shiffman from 1972 disproves in dimension two or higher a classical prediction that the count of zeros of holomorphic self-mappings of the complex linear space should be controlled by the maximum modulus function.…

In this article, we prove a theorem \`a la Mauduit et Rivat (prime number theorem, Moebius randomness principle) for functions that count digital blocks whose length is a growing function tending to infinity. These sequences are not…

Which combinatorial sequences correspond to moments of probability measures on the real line? We present a generating function, in the form of a continued fraction, for a fourteen-parameter family of such sequences and interpret these in…

We consider two related problems arising from a question of R. Graham on quasirandom phenomena in permutation patterns. A ``pattern'' in a permutation $\sigma$ is the order type of the restriction of $\sigma : [n] \to [n]$ to a subset $S…

Let $P(x):=a_d x^d+\cdots+a_0\in\mathbb{Q}[x]$, $a_d>0$, be a polynomial of degree $d\geq 2$. Let $(x_n)$ be a sequence of integers satisfying \begin{equation*} x_{n+1}=P(x_n)\mbox{for all}\quad n=0,1,2\ldots,\quad\mbox{and} \quad…

A surprising 'converse to the polynomial method' of Aaronson et al. (CCC'16) shows that any bounded quadratic polynomial can be computed exactly in expectation by a 1-query algorithm up to a universal multiplicative factor related to the…

In general, some of the well known results of measure theory dealing with the convergence of sequences of functions such as the Dominated Convergence Theorem or the Monotone Convergence Theorem are not true when we consider arbitrary nets…

In this article algorithmic methods are presented that have essentially been introduced into computer algebra systems like Mathematica within the last decade. The main ideas are due to Stanley and Zeilberger. Some of them had already been…

We give an analogy between non-reversible Markov chains and electric networks much in the flavour of the classical reversible results originating from Kakutani, and later Kem\'eny-Snell-Knapp and Kelly. Non-reversibility is made possible by…

In this treatise on the theory of the continuum of the surreal numbers of J.H. Conway, is proved ,that the three different techniques and hierarchies of the continuums of the transfinite real numbers of Glayzal A. (1937) defined through…

For an integer $k\geq 2$, let $(L_{n}^{(k)})_{n}$ be the $k-$generalized Lucas sequence which starts with $0,\ldots,0,2,1$ ($k$ terms) and each term afterwards is the sum of the $k$ preceding terms. In this paper, we find all the integers…