Related papers: A construction of a $\lambda$- Poisson generic seq…
Lambda calculus is the basis of functional programming and higher order proof assistants. However, little is known about combinatorial properties of lambda terms, in particular, about their asymptotic distribution and random generation.…
We give a natural definition of a Poisson Differential Algebra. Consistence conditions are formulated in geometrical terms. It is found that one can often locally put the Poisson structure on differential calculus in a simple canonical form…
By Zeckendorf's theorem, an equivalent definition of the Fibonacci sequence (appropriately normalized) is that it is the unique sequence of increasing integers such that every positive number can be written uniquely as a sum of non-adjacent…
Defined by Borel, a real number is normal to an integer base $b$, greater than or equal to $2$, if in its base-$b$ expansion every block of digits occurs with the same limiting frequency as every other block of the same length. We consider…
Given a Poisson process on a bounded interval, its random geometric graph is the graph whose vertices are the points of the Poisson process and edges exist between two points if and only if their distance is less than a fixed given…
A generalized Davenport-Schinzel sequence is one over a finite alphabet that contains no subsequences isomorphic to a fixed forbidden subsequence. One of the fundamental problems in this area is bounding (asymptotically) the maximum length…
A concept of "guessability" is defined for sets of sequences of naturals. Eventually, these sets are thoroughly characterized. To do this, a nonstandard logic is developed, a logic containing symbols for the ellipsis as well as for…
Let L be an infinite regular language on a totally ordered alphabet (A,<). Feeding a finite deterministic automaton (with output) with the words of L enumerated lexicographically with respect to < leads to an infinite sequence over the…
Generalized abelian equivalence compares words by their factors up to a certain bounded length. The associated complexity function counts the equivalence classes for factors of a given size of an infinite sequence. How practical is this…
Various specifiable combinatorial structures, with d extensive parameters, can be exactly sampled both by the recursive method, with linear arithmetic complexity if a heavy preprocessing is performed, or by the Boltzmann method, with…
For $p \in (0,1)$, sample a binary sequence from the infinite product measure of Bernoulli$(p)$ distributions. It is known that for $p=1/2$, almost every binary sequence is Poisson generic in the sense of Peres and Weiss, a property that…
Jacobi brackets (a generalization of standard Poisson brackets in which Leibniz's rule is replaced by a weaker condition) are extended to brackets involving an arbitrary (even) number of functions. This new structure includes, as a…
We present a general framework for constructing polynomial integrable systems on linearizations of Poisson varieties that admit log-canonical systems. Our construction is in particular applicable to Poisson varieties with compatible cluster…
We examine properties of generic automorphisms of the random poset, with the goal of explicitly characterizing them. We associate to each automorphism an auxiliary first-order structure, consisting of the random poset equipped with an…
We show that normality for continued fractions expansions and normality for base-$b$ expansions are maximally logically separate. In particular, the set of numbers that are normal with respect to the continued fraction expansion but not…
We define the arithmetic self-similarity (AS) of a one-sided infinite sequence sigma to be the set of arithmetic progressions through sigma which are a vertical shift of sigma. We study the AS of several famlies of sequences, viz.…
Recently, Babson and Steingrimsson have introduced generalised permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We consider pattern avoidance for such patterns, and…
The Poisson structure arising in the Hamiltonian approach to the rational Gaudin model looks very similar to the so-called modified Reflection Equation Algebra. Motivated by this analogy, we realize a braiding of the mentioned Poisson…
We extend our investigation of $2$-determinants, which we defined in a previous paper. For a linear homogenous recurrence of the second order, we consider relations between different sequences satisfying the same linear homogeneous…
Given an alphabet $S$, we consider the size of the subsets of the full sequence space $S^{\rm {\bf Z}}$ determined by the additional restriction that $x_i\not=x_{i+f(n)},\ i\in {\rm {\bf Z}},\ n\in {\rm {\bf N}}.$ Here $f$ is a positive,…