Related papers: The spectra of finite 3-transposition groups

For any finite, undirected, non-bipartite, vertex-transitive graph, we establish an explicit lower bound for the smallest eigenvalue of its normalised adjacency operator, which depends on the graph only through its degree and its…

The graph complexity of a compact 3-manifold is defined as the minimum order among all 4-colored graphs representing it. Exact calculations of graph complexity have been already performed, through tabulations, for closed orientable…

An operator matrix $H$ associated with a lattice system describing three particles in interactions, without conservation of the number of particles, is considered. The structure of the essential spectrum of $H$ is described by the spectra…

In this paper, we investigate the spectrum of the unit-graph of the ring of $3 \times 3$ matrices over a finite field $\mathbb{F}_q$, which is equivalently the Cayley digraph $ \mathrm{Cay}\!\left((\mathrm{Mat}_3(\mathbb{F}_q),+),…

We give a bound on the spectral radius of subgraphs of regular graphs with given order and diameter. We give a lower bound on the smallest eigenvalue of a nonbipartite regular graph of given order and diameter.

We establish new bounds on the minimum number of distinct eigenvalues among real symmetric matrices with nonzero off-diagonal pattern described by the edges of a graph and apply these to determine the minimum number of distinct eigenvalues…

The spectra of a finite group is the set of its element orders. We obtain an arithmetic description of finite symplectic and orthogonal groups. In particular, a description of spectra of all finite simple simplectic and orthogonal groups is…

A Transposition graph $T_n$ is defined as a Cayley graph over the symmetric group $Sym_n$ generated by all transpositions. This paper shows how the spectrum of $T_n$ can be obtained using the spectral properties of the Jucys-Murphy…

A rank 3 graph is an orbital graph of a rank 3 permutation group of even order. Despite the classification of rank 3 graphs being complete, see, e.g., Chapter 11 of the recent monograph 'Strongly regular graphs' by Brouwer and Van…

We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…

In this paper, we present a general construction of 3-transposition groups as automorphism groups of vertex operator algebras. Applying to the moonshine vertex operator algebra, we establish the Conway-Miyamoto correspondences between…

We consider a family of compact manifolds which shrinks with respect to an appropriate parameter to a graph. The main result is that the spectrum of the Laplace-Beltrami operator converges to the spectrum of the (differential) Laplacian on…

The least upper bound on degrees of elements of a minimal system of generators of the algebra of invariants of 3x3 matrices is found, and the nilpotency degree of a relatively free finitely generated algebra with the identity x^3=0 is…

In this paper, we construct some non-normal Cayley graphs and explicitly provide their spectra and eigenspaces using representation theory of finite groups.

It is known that the spin structure on a Riemannian manifold can be extended to noncommutative geometry using the notion of a spectral triple. For finite geometries, the corresponding finite spectral triples are completely described in…

We put into evidence graphs with adjacency operator whose singular subspace is prescribed by the kernel of an auxiliary operator. In particular, for a family of graphs called admissible, the singular continuous spectrum is absent and there…

We give the characteristic polynomial of the distance or adjacency matrix of the strong power graph of a finite group, and compute its distance and adjacency spectrum.

Using Cayley graphs and Clifford algebras, we are able to give, for every finitely generated groups, a uniform construction of spectral triples with a generically non-trivial phase for the Dirac operator. Unfortunatly $D_{+}$ is index $0$,…

In this article, we study eigenvalue functions of varying transition probability matrices on finite, vertex transitive graphs. We prove that the eigenvalue function of an eigenvalue of fixed higher multiplicity has a critical point if and…

The intersection graph of a group $G$ is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper non-trivial subgroups of $G$, and there is an edge between two distinct vertices $H$…