相关论文: Simple Permutations Mix Even Better

Graph reconstruction can efficiently detect the underlying topology of massive networks such as the Internet. Given a query oracle and a set of nodes, the goal is to obtain the edge set by performing as few queries as possible. An algorithm…

A complete mapping of a group $G$ is a permutation $\phi:G\rightarrow G$ such that $g\mapsto g\phi(g)$ is also a permutation. Complete mappings of $G$ are equivalent to tranversals of the Cayley table of $G$, considered as a latin square.…

We prove that if L is a finite simple group of Lie type and A a symmetric set of generators of L, then A grows i.e |AAA| > |A|^(1+epsilon) where epsilon depends only on the Lie rank of L, or AAA=L. This implies that for a family of simple…

The method of Murty and Cioab\u{a} shows how one can use results about gaps between primes to construct families of almost-Ramanujan graphs. In this paper we give a simpler construction which avoids the search for perfect matchings and thus…

We study the largest component of a random (multi)graph on n vertices with a given degree sequence. We let n tend to infinity. Then, under some regularity conditions on the degree sequences, we give conditions on the asymptotic shape of the…

We bound the number of permutations with a fixed number $r$ of $321 \ominus p_0$ patterns by a constant times the number of permutations which avoid $321 \ominus p_0$. We use this new upper bound to show that the ordinary generating…

We give a simple construction of $n\times n$ Boolean matrices with $\Omega(n^{4/3})$ zero entries that are free of $2 \times 2$ all-zero submatrices and have covering number $O(\log^4(n))$. This construction provides an explicit…

This paper discusses the permutations that are generated by rotating $k \times k$ blocks of squares in a union of overlapping $k \times (k+1)$ rectangles. It is found that the single-rotation parity constraints effectively determine the…

Let $M_n$ be a class of symmetric sparse random matrices, with independent entries $M_{ij} = \delta_{ij} \xi_{ij}$ for $i \leq j$. $\delta_{ij}$ are i.i.d. Bernoulli random variables taking the value $1$ with probability $p \geq…

Let each point of a homogeneous Poisson process in R^d independently be equipped with a random number of stubs (half-edges) according to a given probability distribution mu on the positive integers. We consider translation-invariant schemes…

A permutation of n letters is k-prolific if each (n-k)-subset of the letters in its one-line notation forms a unique pattern. We present a complete characterization of k-prolific permutations for each k, proving that k-prolific permutations…

For any order of growth $f(n)=o(\log n)$ we construct a finitely-generated group $G$ and a set of generators $S$ such that the Cayley graph of $G$ with respect to $S$ supports a harmonic function with growth $f$ but does not support any…

We prove Boyd's "unexpected coincidence" of the Mahler measures for two families of two-variate polynomials defining curves of genus 2. We further equate the same measures to the Mahler measures of polynomials $y^3-y+x^3-x+kxy$ whose zero…

In [1], a new quasi-Hermitian variety $\mathcal{H}_\varepsilon^r$ in $\mathrm{PG}(r, q^2)$, with $q = 2^e$ and $e \geq 3$ an odd integer, was constructed. The variety depends on a primitive element $\varepsilon$ of the underlying field…

Flip graphs are graphs on combinatorial objects in which the adjacency relation reflects a local change in the underlying objects. In this thesis we introduce Yoke graphs, a family of flip graphs that generalizes previously studied families…

Initiated by Davis, Nelson, Petersen and Tenner (2018), the enumerative study of pinnacle sets of permutations has attracted a fair amount of attention recently. In this article, we provide a recurrence that can be used to compute…

We develop a novel sampling theorem for functions defined on the three-dimensional rotation group SO(3) by connecting the rotation group to the three-torus through a periodic extension. Our sampling theorem requires $4L^3$ samples to…

We detail an explicit construction of ordinary irreducible representations for the family of finite groups $SL_2({\mathbb Z} /p^n {\mathbb Z})$ for odd primes $p$ and $n\geq 2$. For $n=2$, the construction is a complete set of irreducible…

We derive three families of orthogonally-equivariant matrix submanifold models for the Grassmann, flag, and Stiefel manifolds respectively. These families are exhaustive -- every orthogonally-equivariant submanifold model of the lowest…

Let $i(n,k)$ be the proportion of permutations $\pi\in\mathcal{S}_n$ having an invariant set of size $k$. In this note we adapt arguments of the second author to prove that $i(n,k) \asymp k^{-\delta} (1+\log k)^{-3/2}$ uniformly for $1\leq…