Related papers: The Run Transform
An edge switch is an operation which makes a local change in a graph while maintaining the degree of every vertex. We introduce a switch move, called a triangle switch, which creates or deletes at least one triangle. Specifically, a make…
The Fourier transform is naturally defined for integrable functrions. Otherwise, it should be stipulated in which sense the Fourier transform is understood. We consider some class of radial and, generally saying, nonintegrable functions.…
We prove that a rank one transformation satisfying a condition called restricted growth is a mixing transformation if and only if the spacer sequence for the transformation is uniformly ergodic. Uniform ergodicity is a generalization of the…
Let $\xi$ be a random integer vector, having uniform distribution \[\mathbf{P} \{\xi = (i_1,i_2,...,i_n) = 1/n^n \} \ \hbox{for} \ 1 \leq i_1,i_2,...,i_n\leq n.\] A realization $(i_1,i_2,...,i_n)$ of $\xi$ is called \textit{good}, if its…
We define a mapping from transition-based parsing algorithms that read sentences from left to right to sequence labeling encodings of syntactic trees. This not only establishes a theoretical relation between transition-based parsing and…
We define a transformation that associates certain exponential moment sequences with ordinary moment sequences in a natural way. The ingredients of this transformation are series reversion, the Sumudu transform (a variant of the Laplace…
This paper presents a bijection between ascent sequences and upper triangular matrices whose non-negative entries are such that all rows and columns contain at least one non-zero entry. We show the equivalence of several natural statistics…
We determine the distributions of lengths of runs in random sequences of elements from a totally ordered set (total order) or partially ordered set (partial order). In particular, we produce novel formulae for the expected value, variance,…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
The score of a vertex $x$ in an oriented graph is defined to be its outdegree, \emph{i.e.}, the number of arcs with initial vertex $x$. The score sequence of an oriented graph is the sequence of all scores arranged in nondecreasing order.…
A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…
In this paper, we revisit the classic problem of run generation. Run generation is the first phase of external-memory sorting, where the objective is to scan through the data, reorder elements using a small buffer of size M , and output…
A shift-periodic map is a one-dimensional map from the real line to itself which is periodic up to a linear translation and allowed to have singularities. It is shown that iterative sequences $x_{n+1}=F(x_n)$ generated by such maps display…
We consider reversible random walks in random environment obtained from symmetric long--range jump rates on a random point process. We prove almost sure transience and recurrence results under suitable assumptions on the point process and…
From the simplest point of view, transseries are a new kind of expansion for real-valued functions. But transseries constitute much more than that--they have a very rich (algebraic, combinatorial, analytic) structure. The set of transseries…
We introduce a nonlinear aggregation type classifier for functional data defined on a separable and complete metric space. The new rule is built up from a collection of $M$ arbitrary training classifiers. If the classifiers are consistent,…
We consider planar lattice walks that start from a prescribed position, take their steps in a given finite subset of Z^2, and always stay in the quadrant x >= 0, y >= 0. We first give a criterion which guarantees that the length generating…
Gaussian fields $(g_x)$ on $\mathbb{Z}_q^d$ are constructed from a class of reversible long range random walks $(X_t)_{t\in \mathbb{N}}$ on $\mathbb{Z}_q^d$ in arXiv:2510.22554. The construction is from taking the covariance function of…
In this paper, we define and study the concept of traceable regressions. These are sequences of regressions in joint or single responses for which a corresponding regression graph captures not only an independence structure but represents,…
In the first part of this paper, we enumerate exactly walks on the square lattice that start from the origin, but otherwise avoid the non positive horizontal half-axis. We call them "walks on the slit plane". We count them by their length,…