Related papers: Permute, Graph, Map, Derange
Consider a uniformly chosen random reduced decomposition of the longest element in the symmetric group. It is known that the location of the first transposition in this decomposition converges to the semicircle distribution. In this note we…
We introduce the notion of combinatorial encoding of continuous dynamical systems and suggest the first examples, which are the most interesting and important, namely, the combinatorial encoding of a Bernoulli process with continuous state…
We study the mixing properties of permutations obtained as a product of two uniformly random permutations of fixed cycle types. For instance, we give an exact formula for the probability that elements $1,2,...,k$ are in distinct cycles of…
In combinatorics, a derangement is a permutation that has no fixed points. The number of derangements of an n-element set is called the n-th derangement number. In this paper, as natural companions to derangement numbers and degenerate…
Recently, Marcus et al. (Bioinformatics 2014) proposed to use a compressed de Bruijn graph to describe the relationship between the genomes of many individuals/strains of the same or closely related species. They devised an $O(n \log g)$…
In entangled polymer systems, there are several characteristic time scales, such as the entanglement time and the disengagement time. In molecular simulations, the longest relaxation time (the disengagement time) can be determined by the…
In this article we consider a problem related to two famous combinatorial topics. One of them concerns the chromatic number of the space. The other deals with graphs having big girth (the length of the shortest cycle) and large chromatic…
Transactional data may be represented as a bipartite graph $G:=(L \cup R, E)$, where $L$ denotes agents, $R$ denotes objects visible to many agents, and an edge in $E$ denotes an interaction between an agent and an object. Unsupervised…
We obtain large deviation results for non-uniformly expanding maps with non-flat singularities or criticalities and for partially hyperbolic non-uniformly expanding attracting sets. That is, given a continuous function we consider its space…
Many materials contain extended defects of nanosize scale, such as dislocations, cracks, pores, polymorphic inclusions, and other embryos of competing phases. When one is interested not in the precise internal structure of a sample with…
We continue the study of Adin, Alon and Roichman [arXiv:2502.14398, 2025] on the number of steps required to sort $n$ labelled points on a circle by transpositions. Imagine that the vertices of a cycle of length $n$ are labelled by the…
Let $G_{k,n}$ be a group of permutations of $kn$ objects which permutes things independently in disjoint blocks of size $k$ and then permutes the blocks. We investigate the probabilistic and/or enumerative aspects of random elements of…
Let $p$ be a given modulus, let $u$ be prime to $p$, and consider the linear permutation $u\cdot n\pmod p$ of the residue system modulo $p$. Writing $\langle x\rangle_p$ to denote the least nonnegative residue of $x$ modulo $p$, we say that…
Consider the random walk on the permutation group obtained when the step distribution is uniform on a given conjugacy class. It is shown that there is a critical time at which two phase transitions occur simultaneously. On the one hand, the…
The cycle set of a graph $G$ is the set consisting of all sizes of cycles in $G$. Answering a conjecture of Erd\H{o}s and Faudree, Verstra\"{e}te showed that there are at most $2^{n - n^{1/10}}$ different cycle sets of graphs with $n$…
We consider the distributions of the lengths of the longest monotone and alternating subsequences in classes of permutations of size $n$ that avoid a specific pattern or set of patterns, with respect to the uniform distribution on each such…
For the size of the largest component in a supercritical random geometric graph, this paper estimates its expectation which tends to a polynomial on a rate of exponential decay, and sharpens its asymptotic result with a central limit…
It is shown that the maximum number of patterns that can occur in a permutation of length $n$ is asymptotically $2^n$. This significantly improves a previous result of Coleman.
The exponential family of random graphs has been a topic of continued research interest. Despite the relative simplicity, these models capture a variety of interesting features displayed by large-scale networks and allow us to better…
We define and study two structures associated to permutation groups: Dirichlet characters on permutation groups, and the "cycle form," a bilinear form on the group algebras of permutation groups. We use Dirichlet characters and the cycle…