English
Related papers

Related papers: On solid density of Cayley digraphs on finite Abel…

200 papers

Consider a plane graph G, drawn with straight lines. For every pair a,b of vertices of G, we compare the shortest-path distance between a and b in G (with Euclidean edge lengths) to their actual distance in the plane. The worst-case ratio…

Computational Geometry · Computer Science 2007-05-23 Rolf Klein , Martin Kutz

The genus graphs have been studied by many authors, but just a few results concerning in special cases: Planar, Toroidal, Complete, Bipartite and Cartesian Product of Bipartite. We present here a derive general lower bound for the genus of…

General Topology · Mathematics 2016-01-05 J. E. Strapasson , S. I. R. Costa , M. M. S. Alves

We focus on the probability distribution function (pdf) $P(\Delta \gamma; \gamma)$ where $\Delta \gamma$ are the {\em measured} strain intervals between plastic events in an athermal strained amorphous solids, and $\gamma$ measures the…

Soft Condensed Matter · Physics 2016-01-20 H. G. E. Hentschel , Prabhat K. Jaiswal , Itamar Procaccia , Srikanth Sastry

We provide an explicit construction of finite 4-regular graphs $(\Gamma_k)_{k\in \mathbb N}$ with ${girth \Gamma_k\to\infty}$ as $k\to\infty$ and $\frac{diam \Gamma_k}{girth \Gamma_k}\leqslant D$ for some $D>0$ and all $k\in\mathbb{N}$. For…

Group Theory · Mathematics 2022-08-25 Goulnara Arzhantseva , Arindam Biswas

It is known, that the existence of dead ends (of arbitrary depth) in the Cayley graph of a group depends on the chosen set of generators. Nevertheless there exist many groups, which do not have dead ends of arbitrary depth with respect to…

Group Theory · Mathematics 2007-05-23 Jörg Lehnert

Let $T$ be a complete, model-complete, geometric dp-minimal $\mathcal{L}$-theory of topological fields of characteristic $0$ and let $T(\partial)$ be the theory of expansions of models of $T$ by a derivation $\partial$. We assume that…

Logic · Mathematics 2025-05-13 Françoise Point

If $\Gamma$ is a graph for which every edge is in exactly one clique of order $\omega$, then one can form a new graph with vertex set equal to these cliques. This is a generalization of the line graph of $\Gamma$. We discover many general…

Combinatorics · Mathematics 2025-02-26 Robert R. Petro , Connor M. Phillips

We study the geometry and dynamics of discrete subgroups $\Gamma$ of $\PSL(3,\mathbb{C})$ with an open invariant set $\Omega \subset \PC^2$ where the action is properly discontinuous and the quotient $\Omega/\Gamma$ contains a connected…

Dynamical Systems · Mathematics 2012-09-07 Angel Cano , José Seade

A finite simple graph $\Gamma$ determines a quotient $P_\Gamma$ of the pure braid group, called a graphic arrangement group. We analyze homomorphisms of these groups defined by deletion of sets of vertices, using methods developed in prior…

Geometric Topology · Mathematics 2021-09-10 Daniel C Cohen , Michael J Falk

Suppose $\Gamma$ is a finite group acting freely on $S^{n}$ ($n\geqslant 3$ being odd) and $M$ is any closed oriented $n$-manifold. We show that, given an integer $k$, the set $\deg^{-1}(k)$ of based homotopy classes of mappings with degree…

Algebraic Topology · Mathematics 2024-02-27 Haimiao Chen

We define a new family of graph invariants, studying the topology of the moduli space of their geometric realizations in Euclidean spaces, using a limiting procedure reminiscent of Floer homology. Given a labeled graph $G$ on $n$ vertices…

Algebraic Topology · Mathematics 2024-07-24 Mara Belotti , Antonio Lerario , Andrew Newman

Given a countable abelian group $A$, we construct a row finite directed graph $\Gamma(A)$ such that the $K_{0}$-group of the graph $\textrm{C}^{\ast}$-algebra $\textrm{C}^{\ast}(\Gamma(A))$ is canonically isomorphic to $A$. Moreover, each…

Operator Algebras · Mathematics 2025-12-23 Swarnendu Datta , Debashish Goswami , Soumalya Joardar

We address the degree-diameter problem for Cayley graphs of Abelian groups (Abelian graphs), both directed and undirected. The problem turns out to be closely related to the problem of finding efficient lattice coverings of Euclidean space…

Combinatorics · Mathematics 2021-02-09 Randall Dougherty , Vance Faber

In this paper we introduce a new way of measuring the robustness of Erd\H{o}s--Ko--Rado (EKR) Theorems on permutation groups. EKR-type results can be viewed as results about the independence numbers of certain corresponding graphs, namely…

Combinatorics · Mathematics 2025-02-21 Karen Gunderson , Karen Meagher , Joy Morris , Venkata Raghu Tej Pantangi , Mahsa N Shirazi

For a finite group $G,$ we investigate the direct graph $\Gamma(G),$ whose vertices are the non-hypercentral elements of $G$ and where there is an edge $x\mapsto y$ if and only if $[x,_ny]=1$ for some $n \in \mathbb N.$ We prove that…

Group Theory · Mathematics 2022-03-01 Eloisa Detomi , Andrea Lucchini , Daniele Nemmi

We classify all the $2$-arc-transitive strongly regular graphs, and use this classification to study the family of finite $(G,3)$-geodesic-transitive graphs of girth $4$ or $5$ for some group $G$ of automorphisms. For this application we…

Combinatorics · Mathematics 2019-04-03 Wei Jin , Cheryl E. Praeger

We characterize the equivalence and the weak equivalence of Cayley graphs for a finite group $\C{A}$. Using these characterizations, we find enumeration formulae of the equivalence classes and weak equivalence classes of Cayley graphs. As…

Combinatorics · Mathematics 2007-05-23 Dongseok Kim , Jin Hwan Kim , Jaeun Lee , Dianjun Wang

In this paper, we characterize some certain directed strongly regular Cayley graphs on Dihedral groups $D_{n}$, where $n\geqslant 3$ is a positive integer.

Combinatorics · Mathematics 2018-07-25 Yiqin He , Bicheng Zhangb , Rongquan Feng

Condensed mathematics, developed by Clausen and Scholze over the last few years, is a new way of studying the interplay between algebra and geometry. It replaces the concept of a topological space by a more sophisticated but better-behaved…

Logic · Mathematics 2024-10-24 Dagur Asgeirsson

A digraph is called an $n$-Cayley digraph if its automorphism group has an $n$-orbit semiregular subgroup. We determine the splitting fields of $n$-Cayley digraphs over abelian groups and compute a bound on their algebraic degrees, before…

Combinatorics · Mathematics 2024-01-17 Hao Li , Xiaogang Liu