English
Related papers

Related papers: Spectral properties of generalized Paley graphs an…

200 papers

Two method for computation of the spectra of certain infinite graphs are suggested. The first one can be viewed as a reversed Gram--Schmidt orthogonalization procedure. It relies heavily on the spectral theory of Jacobi matrices. The second…

Combinatorics · Mathematics 2020-01-24 Leonid Golinskii

Let $G$ be a finite group, $S\subseteq G\setminus\{1\}$ be a set such that if $a\in S$, then $a^{-1}\in S$, where $1$ denotes the identity element of $G$. The undirected Cayley graph $Cay(G,S)$ of $G$ over the set $S$ is the graph whose…

Combinatorics · Mathematics 2014-02-12 Alireza Abdollahi , Mojtaba Jazaeri

A graph $\G$ is {\em symmetric} or {\em arc-transitive} if its automorphism group $\Aut(\G)$ is transitive on the arc set of the graph, and $\G$ is {\em basic} if $\Aut(\G)$ has no non-trivial normal subgroup $N$ such that the quotient…

Combinatorics · Mathematics 2017-07-18 Da-Wei Yang , Yan-Quan Feng , Jin Ho Kwak , Jaeun Lee

We study a representation-theoretic refinement of the ordinary Laplacian spectrum of a graph. Given a graph $G$ on $n$ vertices, one may associate to it the element \[ X_G=\sum_{ij\in E(G)} (ij)\in \C[S_n]. \] The action of $X_G$ in…

Combinatorics · Mathematics 2026-05-19 Boris Shapiro

We study the spectra of non-regular semisimple elements in irreducible representations of simple algebraic groups. More precisely, we prove that if G is a simply connected simple linear algebraic group and f is a non-trivial irreducible…

Representation Theory · Mathematics 2021-06-11 Donna M Testerman , Alexandre Zalesski

Let $GP(q,d)$ be the $d$-Paley graph defined on the finite field $\mathbb{F}_q$. It is notoriously difficult to improve the trivial upper bound $\sqrt{q}$ on the clique number of $GP(q,d)$. In this paper, we investigate the connection…

Number Theory · Mathematics 2022-03-25 Chi Hoi Yip

A perfect code in a graph $\Gamma = (V, E)$ is a subset $C$ of $V$ that is an independent set such that every vertex in $V \setminus C$ is adjacent to exactly one vertex in $C$. A total perfect code in $\Gamma$ is a subset $C$ of $V$ such…

Combinatorics · Mathematics 2017-03-28 Rongquan Feng , He Huang , Sanming Zhou

The permutation groups of cyclic codes are widely applicable in determining the weight distribution of codes, decoding theory and various other areas. In this paper, by employing two distinct matrix representations, we can relate cyclic…

Information Theory · Computer Science 2026-05-26 Junjie Huang , Jicheng Ma , Chang-An Zhao

The prime graph of a finite group $G$ is denoted by $\ga(G)$ whose vertex set is $\pi(G)$ and two distinct primes $p$ and $q$ are adjacent in $\ga(G)$, whenever $G$ contains an element with order $pq$. We say that $G$ is unrecognizable by…

Group Theory · Mathematics 2016-01-05 Ali Mahmoudifar

We study the geometry of compact geodesic spaces with trivial first Betti number admitting large finite groups of isometries. We show that if a finite group $G$ acts by isometries on a compact geodesic space $X$ whose first Betti number…

Metric Geometry · Mathematics 2024-06-11 Sergio Zamora

Quasi-strongly regular graphs form a significant generalization of strongly regular graphs. We study the eigenvalues of a family of such graphs, $\Gamma_H(G)$, constructed from a finite group $G$ and a subgroup $H$. Our main results include…

Combinatorics · Mathematics 2025-11-19 Sauvik Poddar , Sucharita Biswas , Angsuman Das

Consider the power pseudorandom-number generator in a finite field ${\mathbb F}_q$. That is, for some integer $e\ge2$, one considers the sequence $u,u^e,u^{e^2},\dots$ in ${\mathbb F}_q$ for a given seed $u\in {\mathbb F}_q^\times$. This…

Number Theory · Mathematics 2017-06-08 Carl Pomerance , Igor E. Shparlinski

We study the class of graphs known as k-trees through the lens of Joyal's theory of combinatorial species (and an equivariant extension known as '$\Gamma$-species' which incorporates data about 'structural' group actions). This culminates…

Combinatorics · Mathematics 2015-09-14 Andrew Gainer-Dewar

In a recent paper Gunnells, Scott and Walden have determined the complete spectrum of the Schreier graph on the symmetric group corresponding to the Young subgroup $S_{n-2}\times S_2$ and generated by initial reversals. In particular they…

Combinatorics · Mathematics 2009-11-11 Filippo Cesi

In this paper, we study the behaviour of the generalized power domination number of a graph by small changes on the graph, namely edge and vertex deletion and edge contraction. We prove optimal bounds for $\gamma\_{p,k}(G-e)$,…

Discrete Mathematics · Computer Science 2016-03-24 Paul Dorbec , Seethu Varghese , Ambat Vijayakumar

The generalized cyclotomic binary sequences $S=S(a, b, c)$ with period $n=pq$ have good autocorrelation property where $(a, b, c)\in \{0, 1\}^3$ and $p, q$ are distinct odd primes. For some cases, the sequences $S$ have ideal or optimal…

Information Theory · Computer Science 2021-05-25 Xiaoyan Jing , Shiyuan Qiang , Minghui Yang , Keqin Feng

Let $n$ be a positive integer, $q$ be a prime power, and $V$ be a vector space of dimension $n$ over $\mathbb{F}_q$. Let $G := V \rtimes G_0$, where $G_0$ is an irreducible subgroup of ${\rm GL}(V)$ which is maximal by inclusion with…

Combinatorics · Mathematics 2016-01-29 Carmen Amarra , Michael Giudici , Cheryl E. Praeger

Let $k$ and $p$ be positive integers and let $Q$ be a finite point set in general position in the plane. We say that $Q$ is $(k,p)$-Ramsey if there is a finite point set $P$ such that for every $k$-coloring $c$ of $\binom{P}{p}$ there is a…

Combinatorics · Mathematics 2017-10-23 Martin Balko , Jan Kynčl , Stefan Langerman , Alexander Pilz

We demonstrate that a large class of one-dimensional quantum and classical exchange models can be described by the same type of graphs, namely Cayley graphs of the permutation group. Their well-studied spectral properties allow us to derive…

Statistical Mechanics · Physics 2020-09-02 Jean Decamp , Jiangbin Gong , Huanqian Loh , Christian Miniatura

Let $G = \mathrm{SCl}_n(q)$ be a quasisimple classical group with $n$ large, and let $x_1, \dots, x_k \in G$ random, where $k \geq q^C$. We show that the diameter of the resulting Cayley graph is bounded by $q^2 n^{O(1)}$ with probability…

Group Theory · Mathematics 2021-11-18 Sean Eberhard , Urban Jezernik