Related papers: The Necklace Process: A Generating Function Approa…
We use a probabilistic method to produce some combinatorial inequalities by considering pattern containment in permutations and words.
This paper introduces a new systematic algorithm for constructing periodic Euclidean weaving diagrams with combinatorial arguments. It is shown that such a weaving diagram can be considered as a specific type of four-regular periodic planar…
We consider the process of uncovering the vertices of a random labeled tree according to their labels. First, a labeled tree with $n$ vertices is generated uniformly at random. Thereafter, the vertices are uncovered one by one, in order of…
In this article, we study directed graphs (digraphs) with a coloring constraint due to Von Neumann and related to Nim-type games. This is equivalent to the notion of kernels of digraphs, which appears in numerous fields of research such as…
De novo crystal generation, a central task in materials discovery, aims to generate crystals that are simultaneously valid, stable, unique, and novel. Existing methods mainly rely on black-box stochastic sampling, providing limited control…
An \"{u}bercrossing diagram is a knot diagram with only one crossing that may involve more than two strands of the knot. Such a diagram without any nested loops is called a petal projection. Every knot has a petal projection from which the…
Recently, light-assisted nanofabrication have been introduced, such as the synthesis of quantum dots using photo-induced desorption that yields reduced size fluctuations, or metal sputtering under light illumination resulting in…
In this experiment, the authors reviewed the principles and methods for the synthesis and characterization of gold-silver nanocrystals and proposed two possible synthesis mechanisms for Gold and Silver Composite Nanocrystals. Gold…
We continue to consider the ordered lexicographic sequence, which is constructed according to the formal characteristics of a series of natural numbers. For analysis, we selected balanced parentheses with zeros, Motzkin words. As you know,…
We present a graph model for a background independent, relational approach to spacetime emergence. The general idea and the graph main features, detailed in [1], are discussed. This is a combinatorial (dynamical) metric graph, colored on…
We define a random walk problem which admits analytic results, on a class of infinite periodic lattices which are directed and colored. Our approach is motivated from the fact that such lattices arise in string theoretic constructs of…
We present modeling approaches to explain mechanisms of control of uniformity (narrow distribution) of sizes and shapes in synthesis of nanosize crystals and micron-size colloids. We consider those situations when the nanocrystals are…
The Decoration Conjecture describes the structure of the set of braid types of Smale's horseshoe map ordered by forcing, providing information about the order in which periodic orbits can appear when a horseshoe is created. A proof of this…
Coalescent theory is the study of random processes where particles may join each other to form clusters as time evolves. These notes provide an introduction to some aspects of the mathematics of coalescent processes and their applications…
Sequences are often conveniently encoded in the form of a generating function depending on a formal variable. This note presents two observations that allow one to draw conclusions about the generated sequence from the generating function.…
Nucleation is generally viewed as a structural fluctuation that passes a critical size to eventually become a stable emerging new phase. However, this concept leaves out many details, such as changes in cluster composition and competing…
We obtain an index of the complexity of a random sequence by allowing the role of the measure in classical probability theory to be played by a function we call the generating mechanism. Typically, this generating mechanism will be a finite…
We present an algorithm for effectively generating binary sequences which would be rated by people as highly likely to have been generated by a random process, such as flipping a fair coin.
The seemingly disjoint problems of count and mixture modeling are united under the negative binomial (NB) process. A gamma process is employed to model the rate measure of a Poisson process, whose normalization provides a random probability…
Bootstrap percolation on a graph iteratively enlarges a set of occupied sites by adjoining points with at least $\theta$ occupied neighbors. The initially occupied set is random, given by a uniform product measure, and we say that spanning…