English
Related papers

Related papers: Ramanujan Graphs on Cosets of $PGL_2(\mathbb{F}_q)…

200 papers

In this work we consider the class of Cayley graphs known as generalized Paley graphs (GP-graphs for short) given by $\Gamma(k,q) = Cay(\mathbb{F}_q, \{x^k : x\in \mathbb{F}_q^* \})$, where $\mathbb{F}_q$ is a finite field with $q$…

Combinatorics · Mathematics 2025-04-03 Ricardo A. Podestá , Denis E. Videla

In this paper we construct a methodology for separating the divergencies due to different topological manifolds dual to Feynman graphs in colored group field theory. After having introduced the amplitude bounds using propagator cuts, we…

General Relativity and Quantum Cosmology · Physics 2013-11-27 Francesco Caravelli

In this paper, we present a method to obtain regular (or equitable) partitions of Cayley (di)graphs (that is, graphs, digraphs, or mixed graphs) of permutation groups on $n$ letters. We prove that every partition of the number $n$ gives…

Combinatorics · Mathematics 2019-06-14 C. Dalfó , M. A. Fiol

For a graph $G$, let $L(G)$ and $Q(G)$ be the Laplacian and signless Laplacian matrices of $G$, respectively, and $\tau(G)$ be the number of spanning trees of $G$. We prove that if $G$ has an odd number of vertices and $\tau(G)$ is not…

Combinatorics · Mathematics 2014-01-30 Ebrahim Ghorbani

All Cayley representations of the distant graph $\Gamma _Z$ over integers are characterized as Neumann subgroups of the extended modular group. Possible structures of Neumann subgroups are revealed and it is shown that every such a…

Group Theory · Mathematics 2020-10-20 Andrzej Matraś , Artur Siemaszko

The study of Feynman rules is much facilitated by the two Symanzik polynomials, homogeneous polynomials based on edge variables for a given Feynman graph. We review here the role of a recently discovered third graph polynomial based on…

High Energy Physics - Theory · Physics 2018-07-09 Dirk Kreimer

The divisor theory of the complete graph $K_n$ is in many ways similar to that of a plane curve of degree $n$. We compute the splitting types of all divisors on the complete graph $K_n$. We see that the possible splitting types of divisors…

Combinatorics · Mathematics 2025-01-13 Haruku Aono , Eric Burkholder , Owen Craig , Ketsile Dikobe , David Jensen , Ella Norris

We study Cayley graphs of abelian groups from the perspective of quantum symmetries. We develop a general strategy for determining the quantum automorphism groups of such graphs. Applying this procedure, we find the quantum symmetries of…

Quantum Algebra · Mathematics 2024-02-07 Daniel Gromada

We give the first examples of Fano manifolds with multiple optimal tori, i.e.~we construct monotone Lagrangian tori $L$, such that the weighted number of holomorphic Maslov index two discs with boundary on $L$ equals the upper bound given…

Algebraic Geometry · Mathematics 2022-06-24 Pieter Belmans , Sergey Galkin , Swarnava Mukhopadhyay

We prove that $q+1$-regular Morgenstern Ramanujan graphs $X^{q,g}$ (depending on $g\in\mathbb{F}_q[t]$) have diameter at most $\left(\frac{4}{3}+\varepsilon\right)\log_{q}|X^{q,g}|+O_{\varepsilon}(1)$ (at least for odd $q$ and irreducible…

Number Theory · Mathematics 2020-04-28 Naser T. Sardari , Masoud Zargar

We apply spectral analysis of quotients of the Bruhat-Tits buildings of type $\tilde{A}_{d-1}$ to construct isospectral non-isomorphic Cayley graphs of the finite simple groups $\operatorname{PSL}_d({\mathbb F}_q)$ for every $d \geq 5$ ($d…

Combinatorics · Mathematics 2007-05-23 Alexander Lubotzky , Beth Samuels , Uzi Vishne

Efficiency of routing on a regular digraph often involves finding opitmal properties of the graph. For example, the diameter of a digraph is the maximum distance between any two vertices. We show how we can study these problems…

Combinatorics · Mathematics 2025-10-03 Nyumbu Chishwashwa , Vance Faber , Noah Streib

In this paper, we investigate the Tur\'an exponent for $1$-subdivisions of graphs that are neither bipartite nor complete. Specifically, we establish an upper bound on the Tur\'an number of the 1-subdivision of $K_{s,t}^+$, where…

Combinatorics · Mathematics 2025-06-11 Xiao-Chuan Liu , Danni Peng , Xu Yang

We establish metric graph counterparts of Pleijel's theorem on the asymptotics of the number of nodal domains $\nu_n$ of the $n$-th eigenfunction(s) of a broad class of operators on compact metric graphs, including Schr\"odinger operators…

Spectral Theory · Mathematics 2021-11-03 Matthias Hofmann , James B. Kennedy , Delio Mugnolo , Marvin Plümer

Let $n >3$ and $ 0< k < \frac{n}{2} $ be integers. In this paper, we investigate some algebraic properties of the line graph of the graph $ {Q_n}(k,k+1) $ where $ {Q_n}(k,k+1) $ is the subgraph of the hypercube $Q_n$ which is induced by the…

Group Theory · Mathematics 2019-04-26 S. Morteza Mirafzal

Non-unique factorizations theory, which started in algebraic number theory, over the years has expanded into several areas of mathematics. Here, we propose yet another branching. We show that some concepts of factorizations theory, such as…

Combinatorics · Mathematics 2010-02-19 Jan Sliwa

We consider quasirandom properties for Cayley graphs of finite abelian groups. We show that having uniform edge-distribution (i.e., small discrepancy) and having large eigenvalue gap are equivalent properties for such Cayley graphs, even if…

Combinatorics · Mathematics 2016-10-21 Yoshiharu Kohayakawa , Vojtěch Rödl , Mathias Schacht

Let $G$ be a finite group. For each $m>1$ we define the symmetric canonical subset $S=S(m)$ of the Cartesian power $G^m$ and we consider the family of Cayley graphs $\mathscr{G}_m(G)=Cay(G^m,S)$. We describe properties of these graphs and…

Combinatorics · Mathematics 2019-11-14 Czesław Bagiński , Piotr Grzeszczuk

In this paper, we show that the eigenvalues of certain classes of Cayley graphs are integers. The (n,k,r)-arrangement graph A(n,k,r) is a graph with all the k-permutations of an n-element set as vertices where two k-permutations are…

Combinatorics · Mathematics 2013-12-17 Bai Fan Chen , Ebrahim Ghorbani , Kok Bin Wong

We study Artin kernels, i.e. kernels of discrete characters of right-angled Artin groups, and we show that they decompose as graphs of groups in a way that can be explicitly computed from the underlying graph. When the underlying graph is…

Group Theory · Mathematics 2024-05-03 Danielle Barquinero , Lorenzo Ruffoni , Kaidi Ye
‹ Prev 1 3 4 5 6 7 10 Next ›