Related papers: The Necklace Process: A Generating Function Approa…
Unlabelled Necklaces are an equivalence class of cyclic words under both the rotation (cyclic shift) and the relabelling operations. The relabelling of a word is a bijective mapping from the alphabet to itself. The main result of the paper…
We give subquadratic algorithms that, given two necklaces each with n beads at arbitrary positions, compute the optimal rotation of the necklaces to best align the beads. Here alignment is measured according to the p norm of the vector of…
Let $C_n^k$ be the $k$-th power of a cycle on $n$ vertices (i.e. the vertices of $C_n^k$ are those of the $n$-cycle, and two vertices are connected by an edge if their distance along the cycle is at most $k$). For each vertex draw uniformly…
We develop a Bayesian nonparametric approach to a general family of latent class problems in which individuals can belong simultaneously to multiple classes and where each class can be exhibited multiple times by an individual. We introduce…
The diffractive production of open charm in deep-inelastic scattering is studied in the semiclassical approach which has been proposed recently. In this approach, the leading order process contains a charm quark pair and an additional gluon…
The connection between matrix integrals and links is used to define matrix models which count alternating tangles in which each closed loop is weighted with a factor n, i.e. may be regarded as decorated with n possible colors. For n=2, the…
An $(a,b)$-difference necklace of length $n$ is a circular arrangement of the integers $0, 1, 2, \ldots , n-1$ such that any two neighbours have absolute difference $a$ or $b$. We prove that, subject to certain conditions on $a$ and $b$,…
We give an explicit construction of the generating set of a colored operad that implements theta theory in the mathematical model of Minimalism in generative linguistics, in the form of a coloring algorithm for syntactic objects. We show…
In this paper we investigate enumeration of some classes of $n$-character strings and binary necklaces. Recall that binary necklaces are necklaces in two colors with length $n$. We prove three results (Theorems 1, 1' and 2) concerning the…
In this work, we present a method to generate probability distributions and classes of probability distributions, which broadens a process of probability distribution construction. In this method, distribution classes are built from…
Given an arbitrary long but finite sequence of observations from a finite set, we construct a simple process that approximates the sequence, in the sense that with high probability the empirical frequency, as well as the empirical one-step…
As countless examples show, it can be fruitful to study a sequence of complicated objects all at once via the formalism of generating functions. We apply this point of view to the homology and combinatorics of orbit configuration spaces:…
Nucleation is an activated process in which the system has to overcome a free energy barrier in order for a first-order phase transition between the metastable and the stable phases to take place. In the liquid-to-solid transition the…
We consider braids with repeating patterns inside arbitrary knots which provides a multi-parametric family of knots, depending on the "evolution" parameter, which controls the number of repetitions. The dependence of knot (super)polynomials…
This paper introduces and studies a new class of nonparametric prior distributions. Random probability distribution functions are constructed via normalization of random measures driven by increasing additive processes. In particular, we…
It is well known that the behaviour of a branching process is completely described by the generating function of the offspring law and its fixed points. Branching random walks are a natural generalization of branching processes: a branching…
It is known that any open necklace with beads of $t$ types in which the number of beads of each type is divisible by $k$, can be partitioned by at most $(k-1)t$ cuts into intervals that can be distributed into $k$ collections, each…
Adding a column of numbers produces "carries" along the way. We show that random digits produce a pattern of carries with a neat probabilistic description: the carries form a one-dependent determinantal point process. This makes it easy to…
Considering a random binary tree with $n$ labelled leaves, we use a pruning procedure on this tree in order to construct a $\beta(3/2,1/2)$-coalescent process. We also use the continuous analogue of this construction, i.e. a pruning…
A monolithic process is a single recursive equation with data parameters, which only uses non-determinism, action prefixing, and recursion. We present a technique that decomposes such a monolithic process into multiple processes where each…