Related papers: A construction of a $\lambda$- Poisson generic seq…
A prefix normal word is a binary word with the property that no substring has more 1s than the prefix of the same length. This class of words is important in the context of binary jumbled pattern matching. In this paper we present an…
We prove that a Poisson-Newton formula, in a broad sense, is associated to each Dirichlet series with a meromorphic extension to the whole complex plane of finite order. These formulas simultaneously generalize the classical Poisson formula…
Generalised polynomials are maps constructed by applying the floor function, addition, and multiplication to polynomials. Despite superficial similarity, generalised polynomials exhibit many phenomena which are impossible for polynomials.…
We generalize the notion of linear chord diagrams to the case of matched sets of size $k$, which we call $k$-chord diagrams. We provide formal generating functions and recurrence relations enumerating these $k$-chord diagrams by the number…
Regular sequences generalize the extensively studied automatic sequences. Let $S$ be an abstract numeration system. When the numeration language $L$ is prefix-closed and regular, a sequence is said to be $S$-regular if the module generated…
We consider uniform random permutations drawn from a family enumerated through generating trees. We develop a new general technique to establish a central limit theorem for the number of consecutive occurrences of a fixed pattern in such…
We prove that a Poisson-Newton formula, in a broad sense, is associated to each Dirichlet series with a meromorphic extension to the whole complex plane. These formulas simultaneously generalize the classical Poisson formula and Newton…
In this paper we define generalizations of boson normal ordering. These are based on the number of contractions whose vertices are next to each other in the linear representation of the boson operator function. Our main motivation is to…
Divisibility sequences are defined by the property that their elements divide each other whenever their indices do. The divisibility sequences that also satisfy a linear recurrence, like the Fibonacci numbers, are generated by polynomials…
We construct the Poisson boundary for a random walk supported by the general linear group on the rational numbers as the product of flag manifolds over the $p$-adic fields. To this purpose, we prove a law of large numbers using the…
A new class of Poisson algebras, the class of {\em generalized Weyl Poisson algebras}, is introduced. It can be seen as Poisson algebra analogue of generalized Weyl algebras or as giving a Poisson structure to (certain) generalized Weyl…
Labeled infinite trees provide combinatorial interpretations for many integer sequences generated by nested recurrence relations. Typically, such sequences are monotone increasing. Several of these sequences also have straightforward…
A Sidon set is a set of the positive integers such that the sums of two pairs is not repeated. I. Ruzsa gave a probabilistic construction of an infinite Sidon set. In this work we present the details of a simplified proof of this…
A sequence of graphs is FO-convergent if the probability of satisfaction of every first-order formula converges. A graph modeling is a graph, whose domain is a standard probability space, with the property that every definable set is Borel.…
The two main approaches to the study of irreducible representations of orders (via traces and Poisson orders) have so far been applied in a completely independent fashion. We define and study a natural compatibility relation between the two…
Gessel's famous Bessel determinant formula gives the generating function of the number of permutations without increasing subsequences of a given length. Ekhad and Zeilberger proposed the challenge of finding a suitable generalization for…
Let $\gamma_{n}= O (\log^{-c}n)$ and let $\nu$ be the infinite product measure whose $n$-th marginal is Bernoulli$(1/2+\gamma_{n})$. We show that $c=1/2$ is the threshold, above which $\nu$-almost every point is simply Poisson generic in…
An occurrence of a classical pattern p in a permutation \pi is a subsequence of \pi whose letters are in the same relative order (of size) as those in p. In an occurrence of a generalized pattern, some letters of that subsequence may be…
In recent years, the asymptotic normality of some famous combinatorial sequences has been the subject of extensive study. However, the methods used to prove the asymptotic normality of various combinatorial sequences differ significantly.…
After a short review of the historical milestones on normal numbers, we introduce the Borel numbers as the reals admitting a probability function on their different bases representations. In this setting, we provide two probabilistic…