English
Related papers

Related papers: Edge-isoperimetric problem for Cayley graphs and g…

200 papers

For a finite group $G$, the prime graph $\Gamma(G)$ (also known as Gruenberg-Kegel graph) is defined to be the graph where the vertices are the primes that divide $|G|$ such that two vertices $p$ and $q$ share an edge if and only if there…

Group Theory · Mathematics 2025-10-28 Thomas Michael Keller , Zachary Martin , Alexa Renner , Gabriel Roca , Eric Yu

We introduce a new infinite family of regular graphs admitting nested solutions in the edge-isoperimetric problem for all their Cartesian powers. The obtained results include as special cases most of previously known results in this area.

Combinatorics · Mathematics 2023-07-12 Sergei L. Bezrukov , Pavle Bulatovic , Nikola Kuzmanovski

Let $\mathcal{C}$ be a class of finite groups closed for subgroups, quotients groups and extensions. Let $\Gamma$ be a finite simplicial graph and $G = G_{\Gamma}$ be the corresponding pro-$\mathcal C$ RAAG. We show that if $N$ is a…

Group Theory · Mathematics 2023-05-08 Dessislava Kochloukova , Pavel Zalesskii

Let $G$ be a finite group and let $S$ be an inverse-closed subset of $G$ not containing the identity. The Cayley graph $\mathrm{Cay}(G,S)$ has vertex set $G$, where two vertices $x$ and $y$ are adjacent if and only if $x^{-1}y \in S$.…

Combinatorics · Mathematics 2026-01-06 Amitayu Banerjee

Let $G$ be a hyperbolic group that splits as a graph of free groups with cyclic edge groups. We prove that, unless $G$ is isomorphic to a free product of free and surface groups, every finite abelian group $M$ appears as a direct summand in…

Group Theory · Mathematics 2025-05-28 Dario Ascari , Jonathan Fruchter

Let $\Gamma$ be a Cayley graph, or a Cayley sum graph, or a twisted Cayley graph, or a twisted Cayley sum graph, or a vertex-transitive graph. Denote the degree of $\Gamma$ by $d$, its edge Cheeger constant by $\mathfrak{h}_\Gamma$, and its…

Combinatorics · Mathematics 2023-06-23 Jyoti Prakash Saha

We associate with every etale groupoid G two normal subgroups S(G) and A(G) of the topological full group of G, which are analogs of the symmetric and alternating groups. We prove that if G is a minimal groupoid of germs (e.g., of a group…

Group Theory · Mathematics 2017-02-08 Volodymyr Nekrashevych

Isomorphic factorizations of complete graphs originate from the seminal work of Frank Harary and collaborators, who initiated the systematic study of decompositions of complete graphs into pairwise isomorphic spanning subgraphs. In this…

Combinatorics · Mathematics 2026-03-09 Huye Chen , Jingjian Li , Hao Yu , Zitong Yu

Let $\Omega$ be a finite symmetric subset of GL$_n(\mathbb{Z}[1/q_0])$, and $\Gamma:=\langle \Omega \rangle$. Then the family of Cayley graphs $\{{\rm Cay}(\pi_m(\Gamma),\pi_m(\Omega))\}_m$ is a family of expanders as $m$ ranges over fixed…

Group Theory · Mathematics 2018-02-13 Alireza Salehi Golsefidy

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…

Group Theory · Mathematics 2011-04-11 László Pyber , Endre Szabó

Let $r>2$ and $\sigma\in(0,r-1)$ be integers. We require $t<2s$, where $t=2^{\sigma+1}-1$ and $s=2^{r-\sigma-1}$. Generalizing a known $\{K_4,T_{6,3}\}$-ultrahomogenous graph $G_3^1$, we find that a finite, connected, undirected,…

Combinatorics · Mathematics 2021-07-06 Italo J. Dejter

Let $G$ be a finite group and $P$ a Sylow $2$-subgroup of $G$. We obtain both asymptotic and explicit bounds for the number of odd-degree irreducible complex representations of $G$ in terms of the size of the abelianization of $P$. To do…

Group Theory · Mathematics 2020-08-28 Nguyen Ngoc Hung , Thomas Michael Keller , Yong Yang

We prove that a map onto a nilpotent group $Q$ has finitely generated kernel if and only if the preimage of the positive cone is coarsely connected as a subset of the Cayley graph for every full archimedean partial order on $Q$. In case $Q$…

Group Theory · Mathematics 2023-11-02 Kevin Klinge

Let $M$ be a complete Riemannian manifold and $G$ a Lie subgroup of the isometry group of $M$ acting freely and properly on $M.$ We study the Dirichlet Problem \begin{align*} \operatorname{div}\left( \frac{a\left( \left\Vert \nabla…

Differential Geometry · Mathematics 2021-09-21 Jaime Ripoll , Friedrich Tomi

We study pairs of subsets $A, B$ of a compact abelian group $G$ where the sumset $A+B:=\{a+b: a\in A, b\in B\}$ is small. Let $m$ and $m_{*}$ be Haar measure and inner Haar measure on $G$, respectively. Given $\varepsilon>0$, we classify…

Combinatorics · Mathematics 2019-11-28 John T. Griesmer

Let $\Gamma$ be a Cayley graph, or a Cayley sum graph, or a twisted Cayley graph, or a twisted Cayley sum graph, or a vertex-transitive graph. Suppose $\Gamma$ is undirected and non-bipartite. Let $\mu$ (resp. $\mu_2$) denote the smallest…

Combinatorics · Mathematics 2023-12-12 Jyoti Prakash Saha

When one studies geometric properties of graphs, local finiteness is a common implicit assumption, and that of transitivity a frequent explicit one. By compactness arguments, local finiteness guarantees several regularity properties. It is…

Combinatorics · Mathematics 2017-01-06 Sébastien Martineau

For a positive integer $k$ and a graph $H$, the $k$-color induced size-Ramsey number $\hat{R}_{\mathrm{ind}}(H, k)$ is the minimum integer $m$ for which there exists a graph $G$ with $m$ edges such that for every $k$-edge coloring of $G$,…

Combinatorics · Mathematics 2026-03-24 Ramin Javadi , Yoshiharu Kohayakawa , Meysam Miralaei

Each infinitesimally faithful representation of a reductive complex connected algebraic group $G$ induces a dominant morphism $\Phi$ from the group to its Lie algebra $\g$ by orthogonal projection in the endomorphism ring of the…

Representation Theory · Mathematics 2007-05-23 Bertram Kostant , Peter W. Michor

In this paper, we revisit the problem of sampling edges in an unknown graph $G = (V, E)$ from a distribution that is (pointwise) almost uniform over $E$. We consider the case where there is some a priori upper bound on the arboriciy of $G$.…

Computational Complexity · Computer Science 2019-02-22 Talya Eden , Dana Ron , Will Rosenbaum
‹ Prev 1 8 9 10 Next ›