Related papers: Poisson genericity in numeration systems with expo…
Using techniques from Poisson approximation, we prove explicit error bounds on the number of permutations that avoid any pattern. Most generally, we bound the total variation distance between the joint distribution of pattern occurrences…
Probabilistic circuits compute multilinear polynomials that represent multivariate probability distributions. They are tractable models that support efficient marginal inference. However, various polynomial semantics have been considered in…
Frequent pattern mining is widely used to find ``important'' or ``interesting'' patterns in data. While it is not easy to mathematically define such patterns, maximal frequent patterns are promising candidates, as frequency is a natural…
We introduce a generalization of Pascal triangle based on binomial coefficients of finite words. These coefficients count the number of times a word appears as a subsequence of another finite word. Similarly to the Sierpi\'nski gasket that…
A causal set is a partially ordered set on a countably infinite ground-set such that each element is above finitely many others. A natural extension of a causal set is an enumeration of its elements which respects the order. We bring…
We present a first-order theory of sequences with integer elements, Presburger arithmetic, and regular constraints, which can model significant properties of data structures such as arrays and lists. We give a decision procedure for the…
We establish necessary and sufficient conditions implying that the product of $m\geq 2$ Poisson functionals, living in a finite sum of Wiener chaoses, is square-integrable. Our conditions are expressed in terms of iterated add-one cost…
We investigate the regularity of shot noise series and of Poisson integrals. We give conditions for the absolute continuity of their law with respect to Lebesgue measure and for their continuity in total variation norm. In particular, the…
We give metric theorems for the property of Borel normality for real numbers under the assumption of digit dependencies in their expansion in a given integer base. We quantify precisely how much digit dependence can be allowed such that,…
We prove a generalization of the author's work to show that any subset of the primes which is `well-distributed' in arithmetic progressions contains many primes which are close together. Moreover, our bounds hold with some uniformity in the…
A group element is called a generalized torsion if a finite product of its conjugates is equal to the identity. We prove that in a nilpotent or FC-group, the generalized torsion elements are all torsion elements. Moreover, we compute the…
Nourdin et al. [9] established the following universality result: if a sequence of off-diagonal homogeneous polynomial forms in i.i.d. standard normal random variables converges in distribution to a normal, then the convergence also holds…
An Engel series is a sum of reciprocals of a non-decreasing sequence $(x_n)$ of positive integers, which is such that each term is divisible by the previous one, and a Pierce series is an alternating sum of the reciprocals of a sequence…
Erd\"os conjectured the existence of an infinite Sidon sequence of positive integers which is also an asymptotic basis of order 3. We make progress towards this conjecture in several directions. First we prove the conjecture for all cyclic…
For a given permutation or set partition there is a natural way to assign a genus. Counting all permutations or partitions of a fixed genus according to cycle lengths or block sizes, respectively, is the main content of this article. After…
We utilize Gaussian measure preserving systems to prove the existence and genericity of Lebesgue measure preserving transformations $T:[0,1]\rightarrow [0,1]$ which exhibit both mixing and rigidity behavior along families of asymptotically…
Contrary to prevailing notion we find that the spectrum associated with the extended states in a complex system may belong to the Poisson universality class if the system is subjected to a specific set of constraints. Our results are based…
We show that, for any (symmetric) finite generating set of the Torelli group of a closed surface, the probability that a random word is not pseudo-Anosov decays exponentially in terms of the length of the word.
Simple methods permit to generalize the concepts of iteration and of recursive processes. We shall see briefly on several examples what these methods generate. In additive sequences, we shall encounter not only the golden or the silver…
This paper develops an analogy between the cycle structure of, on the one hand, random permutations with cycle lengths restricted to lie in an infinite set $S$ with asymptotic density $\sigma$ and, on the other hand, permutations selected…