Related papers: Short note on additive sequences and on recursive …
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…
Renyi's "thinning" operation on a discrete random variable is a natural discrete analog of the scaling operation for continuous random variables. The properties of thinning are investigated in an information-theoretic context, especially in…
The information in an individual finite object (like a binary string) is commonly measured by its Kolmogorov complexity. One can divide that information into two parts: the information accounting for the useful regularity present in the…
The diffraction of various random subsets of the integer lattice $\mathbb{Z}^{d}$, such as the coin tossing and related systems, are well understood. Here, we go one important step beyond and consider random point sets in $\mathbb{R}^{d}$.…
We give an explicit coinduction principle for recursively-defined stochastic processes. The principle applies to any closed property, not just equality, and works even when solutions are not unique. The rule encapsulates low-level analytic…
We consider a family of integer sequences generated by nonlinear recurrences of the second order, which have the curious property that the terms of the sequence, and integer multiples of the ratios of successive terms (which are also…
Set partitions and permutations with restrictions on the size of the blocks and cycles are important combinatorial sequences. Counting these objects lead to the sequences generalizing the classical Stirling and Bell numbers. The main focus…
This paper explores the Fibonacci sequence and the Golden Ratio as organizing principles for visual composition and abstraction in painting. The author shows how recursive proportional systems, long associated with natural growth and…
Many algorithms are specified with respect to a fixed but unspecified parameter. Examples of this are especially common in cryptography, where protocols often feature a security parameter such as the bit length of a secret key. Our aim is…
Chaotic attractors, chaotic saddles and periodic orbits are examples of chain-recurrent sets. Using arbitrary small controls, a trajectory starting from any point in a chain-recurrent set can be steered to any other in that set. The…
Interacting particle systems can often be constructed from a graphical representation, by applying local maps at the times of associated Poisson processes. This leads to a natural coupling of systems started in different initial states. We…
Two formalisms, both based on context-free grammars, have recently been proposed as a basis for a non-uniform random generation of combinatorial objects. The former, introduced by Denise et al, associates weights with letters, while the…
Three extensions and reinterpretations of nonclassical probabilities are reviewed. (i) We propose to generalize the probability axiom of quantum mechanics to self-adjoint positive operators of trace one. Furthermore, we discuss the…
We use the classical umbral calculus to describe Riordan arrays. Here, a Riordan array is generated by a pair of umbrae, and this provides efficient proofs of several basic results of the theory such as the multiplication rule, the…
We consider random walks associated with conductances on Delaunay triangulations, Gabriel graphs and skeletons of Voronoi tilings which are generated by point processes in $\mathbb{R}^d$. Under suitable assumptions on point processes and…
We describe new, simple, recursive methods of construction for orientable sequences over an arbitrary finite alphabet, i.e. periodic sequences in which any sub-sequence of n consecutive elements occurs at most once in a period in either…
Our central observation is that unbounded additive recurrence establishes a homomorphism between $\mathbb{N}$ and Modus Ponens in a constructive sense. By finding sums of nonconsecutive Fibonacci indices, each inference step corresponds to…
The ruler function or the Gros sequence is a classical infinite integer sequence that is underlying some interesting mathematical problems. In this paper, we provide four new problems containing this type of sequence: (i) a demographic…
We survey and prove properties a family of recurrences bears in relation to integer representations, compositions, the Pascal triangle, sums of digits, Nim games and Beatty sequences.
Our goal is to develop a limit approach for a class of problems in additive combinatorics that is analogous to the limit theory of dense graph sequences. We introduce metric, convergence and limit objects for functions on groups and for…