Related papers: A construction of a $\lambda$- Poisson generic seq…
Let $(X_k)_{k\geq 1}$ and $(Y_k)_{k\geq 1}$ be two independent sequences of i.i.d. random variables, with values in a finite and totally ordered alphabet $\mathcal{A}_m:=\{1,\dots,m\}$, and having respective probability mass function…
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…
Nowadays, the notion of semi-regular sequences, originally proposed by Fr\"oberg, becomes very important not only in Mathematics, but also in Information Science, in particular Cryptology. For example, it is highly expected that randomly…
Suppose $\Lambda$ is a discrete infinite set of nonnegative real numbers. We say that $ {\Lambda}$ is of type 1 if the series $s(x)=\sum_{\lambda\in\Lambda}f(x+\lambda)$ satisfies a zero-one law. This means that for any non-negative…
This survey article is devoted to general results in combinatorial enumeration. The first part surveys results on growth of hereditary properties of combinatorial structures. These include permutations, ordered and unordered graphs and…
We study point processes that consist of certain centers of point tuples of an underlying Poisson process. Such processes arise in stochastic geometry in the study of exceedances of various functionals describing geometric properties of the…
Let $\lambda$ be an uncountable cardinal such that $2^{< \lambda } = \lambda$. Working in the setup of generalized descriptive set theory, we study the structure of $\lambda^+$-Borel measurable functions with respect to various kinds of…
Given a countable transitive model of set theory and a partial order contained in it, there is a natural countable Borel equivalence relation on generic filters over the model; two are equivalent if they yield the same generic extension. We…
In the first part of this paper the notion of natural metric on the set of natural numbers is defined. It is such metric that the completion of N is a compact metric space that a probability borel measure exists in order that the sequence…
In the present paper we define the notion of generalized cumulants which gives a universal framework for commutative, free, Boolean, and especially, monotone probability theories. The uniqueness of generalized cumulants holds for each…
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…
Solomonoff's uncomputable universal prediction scheme $\xi$ allows to predict the next symbol $x_k$ of a sequence $x_1...x_{k-1}$ for any Turing computable, but otherwise unknown, probabilistic environment $\mu$. This scheme will be…
A program is a finite piece of data that produces a (possibly infinite) sequence of primitive instructions. From scratch we develop a linear notation for sequential, imperative programs, using a familiar class of primitive instructions and…
We consider Drinfeld-Sokolov bihamiltonian structure associated to a distinguished nilpotent elements of semisimple type and the space of common equilibrium points defined by its leading term. On this space, we construct a local…
Maps are polygonal cellular networks on Riemann surfaces. This paper analyzes the construction of closed form general representations for the enumerative generating functions associated to maps of fixed but arbitrary genus. The method of…
Let $\lambda_{1},\ldots,\lambda_{n}$ be real numbers in $(0,1)$ and $p_{1},\ldots,p_{n}$ be points in $\mathbb{R}^{d}$. Consider the collection of maps $f_{j}:\mathbb{R}^{d}\to\mathbb{R}^{d} $ given by $$f_{j}(x)=\lambda_{j} x…
Generalized Pascal matrix whose elements are generalized binomial coefficients is included in the group of generalized Riordan arrays. There is a special set of generalized Riordan arrays defined by parameter $q$. If $q=0$, they are…
Let $(P_n(x;z;\lambda))_{n\geq 0}$ be the sequence of monic orthogonal polynomials with respect to the symmetric linear functional $\mathbf{s}$ defined by $$\langle\mathbf{s},p\rangle=\int_{-1}^1 p(x)(1-x^2)^{(\lambda-1/2)}…
Given a periodic point $\omega$ in a $\psi$-mixing shift with countable alphabet, the sequence $\{S_{n}\}$ of random variables counting the number of multiple returns to shrinking cylindrical neighborhoods of $\omega$ is considered.…
We consider the complexities of substitutive sequences over a binary alphabet. By studying various types of special words, we show that, knowing some initial values, its complexity can be completely formulated via a recurrence formula…