Related papers: Quasirandom permutations are characterized by 4-po…

Selecting N random points in a unit square corresponds to selecting a random permutation. By putting 5 types of symmetry restrictions on the points, we obtain subsets of permutations : involutions, signed permutations and signed…

Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations. In the style of the seminal paper by Simion…

Chung, Graham, and Wilson proved that a graph is quasirandom if and only if there is a large gap between its first and second largest eigenvalue. Recently, the authors extended this characterization to k-uniform hypergraphs, but only for…

We study 3-random-like graphs, that is, sequences of graphs in which the densities of triangles and anti-triangles converge to 1/8. Since the random graph ${\mathcal G}_{n,1/2}$ is, in particular, 3-random-like, this can be viewed as a weak…

We give necessary and sufficient conditions to characterize the convergence in distribution of a sequence of arbitrary random variables to a probability distribution which is the invariant measure of a diffusion process. This class of…

A record in a permutation is a maximum or a minimum, from the left or from the right. The entries of a permutation can be partitioned into two types: the ones that are records are called external points, the others are called internal…

We introduce a permutation analogue of the celebrated Szemeredi Regularity Lemma, and derive a number of consequences. This tool allows us to provide a structural description of permutations which avoid a specified pattern, a result that…

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…

For each of the notions of hypergraph quasirandomness that have been studied, we identify a large class of hypergraphs F so that every quasirandom hypergraph H admits a perfect F-packing. An informal statement of a special case of our…

We consolidate what is currently known about packing densities of 4-point permutations and in the process improve the lower bounds for the packing densities of 1324 and 1342. We also provide rigorous upper bounds for the packing densities…

The theorem of Chung, Graham, and Wilson on quasi-random graphs asserts that of all graphs with edge density p, the random graph G(n,p) contains the smallest density of copies of K_{t,t}, the complete bipartite graph of size 2t. Since…

For each $n \geq 1$, let $\{X_{j,n}\}_{1 \leq j \leq n}$ be a sequence of strictly stationary random variables. In this article, we give some asymptotic weak dependence conditions for the convergence in distribution of the point process…

We generalize the notion of quasirandom which concerns a class of equivalent properties that random graphs satisfy. We show that the convergence of a graph sequence under the spectral distance is equivalent to the convergence using the…

The theory of quasirandomness has greatly expanded from its inaugural graph theoretical setting to several different combinatorial objects such as hypergraphs, tournaments, permutations, etc. However, these quasirandomness variants have…

We establish a new mixing theorem for quasirandom groups (finite groups with no low-dimensional unitary representations) $G$ which, informally speaking, asserts that if $g, x$ are drawn uniformly at random from $G$, then the quadruple…

A tournament $H$ is said to force quasirandomness if it has the property that a sequence $(T_n)_{n\in \mathbb{N}}$ of tournaments of increasing orders is quasirandom if and only if the homomorphism density of $H$ in $T_n$ tends to…

We prove a conjecture by Garbe et al. [arXiv:2010.07854] by showing that a Latin square is quasirandom if and only if the density of every 2x3 pattern is 1/720+o(1). This result is the best possible in the sense that 2x3 cannot be replaced…

Let $A^{(n)}_{l;k}\subset S_n$ denote the event that the set of $l$ consecutive numbers $\{k,k+1,\cdots, k+l-1\}$ appear in a set of $l$ consecutive positions. Let $p=\{p_j\}_{j=1}^\infty$ be a distribution on $\mathbb{N}$ with $p_j>0$. Let…

We study the interplay between notions of quasirandomness for additive sets and for hypergraphs. In particular, we show a strong connection between the notions of Gowers uniformity in the additive setting and discrepancy-type measures of…

Let $\Sigma$ be a countable alphabet. For $r\geq 1$, an infinite sequence $s$ with characters from $\Sigma$ is called $r$-quasi-regular, if for each $\sigma\in\Sigma$ the ratio of the longest to shortest interval between consecutive…