Related papers: Symmetric Groups and Expander Graphs

Given a finite group $G$, the invariably generating graph of $G$ is defined as the undirected graph in which the vertices are the nontrivial conjugacy classes of $G$, and two classes are adjacent if and only if they invariably generate $G$.…

In this paper we complete the classification of topological symmetry groups for complete graphs $K_n$ by characterizing which $K_n$ can have a cyclic group, a dihedral group, or a subgroup of $D_m \times D_m$ where $m$ is odd, as its…

In this paper we investigate properties of the Artin monoid Cayley graph. This is the Cayley graph of an Artin group $A_\Gamma$ with respect to the (infinite) generating set given by the associated Artin monoid $A^+_\Gamma$. In a previous…

It was proved in [Y.-Q. Feng, C. H. Li and J.-X. Zhou, Symmetric cubic graphs with solvable automorphism groups, {\em European J. Combin.} {\bf 45} (2015), 1-11] that a cubic symmetric graph with a solvable automorphism group is either a…

A common model for social networks are Geometric Inhomogeneous Random Graphs (GIRGs), in which vertices draw a random position in some latent geometric space, and the probability of two vertices forming an edge depends on their geometric…

Families of symmetric simple random walks on Cayley graphs of Abelian groups with a bound on the number of generators are shown to never have sharp cut off in the sense of [1], [3], or [5]. Here convergence to the stationary distribution is…

Ara\'ujo, Kinyon and Konieczny (2011) pose several problems concerning the construction of arbitrary commuting graphs of semigroups. We observe that every star-free graph is the commuting graph of some semigroup. Consequently, we suggest…

We show that there are well separated families of quantum expanders with asymptotically the maximal cardinality allowed by a known upper bound. This has applications to the "growth" of certain operator spaces: It implies asymptotically…

In this paper we are concerned with the conjecture that, for any set of generators S of the symmetric group of degree n, the word length in terms of S of every permutation is bounded above by a polynomial of n. We prove this conjecture for…

An $n$-vertex graph $G$ is a $C$-expander if $|N(X)|\geq C|X|$ for every $X\subseteq V(G)$ with $|X|< n/2C$ and there is an edge between every two disjoint sets of at least $n/2C$ vertices. We show that there is some constant $C>0$ for…

We prove that uniform Roe C*-algebras associated to some expander graphs coming from discrete groups with property (\tau) are not K-exact. In particular, we show that this is the case for the expander obtained as Cayley graphs of a sequence…

In this paper we consider asymptotic expansions for a class of sequences of symmetric functions of many variables. Applications to classical and free probability theory are discussed.

A graph $\Ga=(V,E)$ is called a Cayley graph of some group $T$ if the automorphism group $\Aut(\Ga)$ contains a subgroup $T$ which acts on regularly on $V$. If the subgroup $T$ is normal in $\Aut(\Ga)$ then $\Ga$ is called a normal Cayley…

We use binary trees to study the Bratteli diagram of Sylow 2-subgroups of symmetric groups. We show that it is simple, has a recursive structure, and self-similarities at all scales. We contrast its subgraph of one-dimensional…

Given a graph and a representation of its fundamental group, there is a naturally associated twisted adjacency operator. The main result of this article is the fact that these operators behave in a controlled way under graph covering maps.…

Let $S$ be a set of transpositions generating the symmetric group $S_n$. The transposition graph of $S$ is defined to be the graph with vertex set $\{1,\ldots,n\}$, and with vertices $i$ and $j$ being adjacent in $T(S)$ whenever $(i,j) \in…

Let $S$ be a set of transpositions such that the girth of the transposition graph of $S$ is at least 5. It is shown that the automorphism group of the Cayley graph of the permutation group $H$ generated by $S$ is the semidirect product…

Let us say that a Cayley graph $\Gamma$ of a group $G$ of order $n$ is a Cerny Cayley graph if every synchronizing automaton containing $\Gamma$ as a subgraph with the same vertex set admits a synchronizing word of length at most $(n-1)^2$.…

For n at least 2, the concept of n-way expanders was defined by various researchers. Bigger n gives a weaker notion in general, and 2-way expanders coincide with expanders in usual sense. Koji Fujiwara asked whether these concepts are…

We present an elementary way to transform an expander graph into a simplicial complex where all high order random walks have a constant spectral gap, i.e., they converge rapidly to the stationary distribution. As an upshot, we obtain new…