Related papers: An improved diameter bound for finite simple group…

One of the most interesting problems on maximum nullity (minimum rank) is to characterize $M(\mathcal{G})$ ($mr(\mathcal{G})$) for a graph $\mathcal{G}$. In this regard, many researchers have been trying to find an upper or lower bound for…

We consider the case in which mixed graphs (with both directed and undirected edges) are Cayley graphs of Abelian groups. In this case, some Moore bounds were derived for the maximum number of vertices that such graphs can attain. We first…

The conditional diameter of a connected graph $\Gamma=(V,E)$ is defined as follows: given a property ${\cal P}$ of a pair $(\Gamma_1, \Gamma_2)$ of subgraphs of $\Gamma$, the so-called \emph{conditional diameter} or ${\cal P}$-{\em…

Given a finite Abelian group $G$ and a generator subset $A\subset G$ of cardinality two, we consider the Cayley digraph $\Gamma=$Cay$(G,A)$. This digraph is called $2$--Cayley digraph. An extension of $\Gamma$ is a $2$--Cayley digraph,…

The nonsoluble length $\lambda(G)$ of a finite group $G$ is defined as the minimum number of nonsoluble factors in a normal series of $G$ each of whose quotients either is soluble or is a direct product of nonabelian simple groups. The…

An unrefinable chain of a finite group $G$ is a chain of subgroups $G = G_0 > G_1 > \cdots > G_t = 1$, where each $G_i$ is a maximal subgroup of $G_{i-1}$. The length (respectively, depth) of $G$ is the maximal (respectively, minimal)…

For an abelian topological group G let G^* denote the dual group of all continuous characters endowed with the compact open topology. Given a closed subset X of an infinite compact abelian group G such that w(X) < w(G) and an open…

The commensurability index between two subgroups $A, B$ of a group $G$ is $[A : A \cap B] [B : A\cap B]$. This gives a notion of distance amongst finite-index subgroups of $G$, which is encoded in the p-local commensurability graphs of $G$.…

The intersection graph $\Delta_G$ of a finite group $G$ is a simple graph with vertices the non-trivial proper subgroups of $G$, and an edge between two vertices if their corresponding subgroups intersect non-trivially. These graphs were…

Constructing ensembles of circuits which efficiently approximate the Haar measure over various groups is a long-standing and fundamental problem in quantum information theory. Recently it was shown that one can obtain approximate designs…

Let G be a finite group acting orthogonally on a pair (S^d,\Gamma) where \Gamma is a finite, connected graph of genus g>1 embedded in the sphere S^d. The 3-dimensional case d=3 has recently been considered in a paper by C. Wang, S. Wang, Y.…

We study complete, connected and simply connected $n$-dim Riemannian manifold $M$ satisfying Ricci curvature lower bound. Further more, suppose that $M$ admits discrete isometric group actions $G$ so that the diameter of the quotient space…

Jiang, Tidor, Yao, Zhang, and Zhao recently showed that connected bounded degree graphs have sublinear second eigenvalue multiplicity (always referring to the adjacency matrix). This result was a key step in the solution to the problem of…

We prove that the number of iterations taken by the Weisfeiler-Leman algorithm for configurations coming from Schreier graphs is closely linked to the diameter of the graphs themselves: an upper bound is found for general Schreier graphs,…

In the degree-diameter problem for Abelian Cayley and circulant graphs of diameter 2 and arbitrary degree d there is a wide gap between the best lower and upper bounds valid for all d, being quadratic functions with leading coefficient 1/4…

Let $g$, $h$ be a random pair of generators of $G=Sym(n)$ or $G=Alt(n)$. We show that, with probability tending to $1$ as $n\to \infty$, (a) the diameter of $G$ with respect to $S = \{g,h,g^{-1},h^{-1}\}$ is at most $O(n^2 (\log n)^c)$, and…

A base B for a finite permutation group G acting on a set X is a subset of X with the property that only the identity of G can fix every point of B. We prove that a primitive diagonal group G has a base of size 2 unless the top group of G…

E. Breuillard showed that finite subsets $F$ of matrices in $GL_d(\overline{\mathbb{Q}})$ generating non-virtually solvable groups have normalized height $\widehat{h}(F) \ge \epsilon_d$, for some positive $\epsilon_d >0$. The normalized…

The diameter of an undirected or a directed graph is defined to be the maximum shortest path distance over all pairs of vertices in the graph. Given an undirected graph $G$, we examine the problem of assigning directions to each edge of $G$…

To any finite group $G$, we may associate a graph whose vertices are the elements of $G$ and where two distinct vertices $x$ and $y$ are adjacent if and only if the order of the subgroup $\langle x, y\rangle$ is divisible by at least 3…