Related papers: Spectrum and combinatorics of two-dimensional Rama…

Graph eigenvalues play a fundamental role in controlling structural properties, such as bisection bandwidth, diameter, and fault tolerance, which are critical considerations in the design of supercomputing interconnection networks. This…

We construct an infinite family of bounded-degree bipartite unique-neighbour expander graphs with arbitrarily unbalanced sides. Although weaker than the lossless expanders constructed by Capalbo et al., our construction is simpler and may…

In this paper we investigate Ramanujan hypergraphs by using hypergraph coverings. We first show that the spectrum of a $k$-fold covering $\bar{H}$ of a connected hypergraph $H$ contains the spectrum of $H$, and that it is the union of the…

In this article we are introducing combinatorial spectra of graphs, this is a generalization of $H$-Hamiltonian spectra. The main motivation was to made from $H$-Hamiltonian spectra an operation and develop some algebra in this field. An…

We consider finite graphs whose vertexes are supersingular elliptic curves, possibly with level structure, and edges are isogenies. They can be applied to the study of modular forms and to isogeny based cryptography. The main result of this…

In this paper, we investigate spectral properties of the adjacency tensor, Laplacian tensor and signless Laplacian tensor of general hypergraphs (including uniform and non-uniform hypergraphs). We obtain some bounds for the spectral radius…

This paper establishes new eigenvalue bounds for combinatorial Laplacians of simplicial complexes, extending previous results for flag complexes by Lew (2024) and general complexes by Shukla and Yogeshwaran (2020). Using elementary…

The expansion of a graph is typically associated with its spectral properties - testing whether a graph is an expander is usually done using Cheeger's inequality. One can also use multiple eigenvalues in a higher-order Cheeger's inequality…

We describe a simple but surprisingly effective technique of obtaining spectral multiplier results for abstract operators which satisfy the finite propagation speed property for the corresponding wave equation propagator. We show that, in…

In this paper, we determine the bound of the valency of the odd circulant graph which guarantees to be a Ramanujan graph for each fixed number of vertices. In almost of the cases, the bound coincides with the trivial bound, which comes from…

In this paper, we shall try to deduce asymptotic behaviour of component spectrum of random $n \times n$ magical squares with line sum $r \in \mathbb{N}$, which can also be identified as $r$-regular bipartite graphs on $2n$ vertices, chosen…

We define and construct Ramanujan complexes. These are simplicial complexes which are higher dimensional analogues of Ramanujan graphs. They are obtained as quotients of the buildings of type $\tilde{A}_{d-1}$ associated with…

Let $G$ be a topological group acting on a simplicial complex $\mathcal{X}$ satisfying some mild assumptions. For example, consider a $k$-regular tree and its automorphism group, or more generally, a regular affine Bruhat-Tits building and…

We study three mixing properties of a graph: large algebraic connectivity, large Cheeger constant (isoperimetric number) and large spectral gap from 1 for the second largest eigenvalue of the transition probability matrix of the random walk…

We establish spectral expansions of homogeneous and isotropic random fields taking values in the $3$-dimensional Euclidean space $E^3$ and in the space $\mathsf{S}^2(E^3)$ of symmetric rank $2$ tensors over $E^3$. The former is a model of…

In this paper we study spectra of Laplacians of infinite weighted graphs. Instead of the assumption of local finiteness we impose the condition of summability of the weight function. Such graphs correspond to reversible Markov chains with…

Let $X=G/H$ be a reductive homogeneous space with $H$ noncompact, endowed with a $G$-invariant pseudo-Riemannian structure. Let $L$ be a reductive subgroup of $G$ acting properly on $X$ and $\Gamma$ a torsion-free discrete subgroup of $L$.…

For a $k$-uniform hypergraph $H$, we obtain some trace formulas for the Laplacian tensor of $H$, which imply that $\sum_{i=1}^nd_i^s$ ($s=1,\ldots,k$) is determined by the Laplacian spectrum of $H$, where $d_1,\ldots,d_n$ is the degree…

We first develop a general framework for Laplace operators defined in terms of the combinatorial structure of a simplicial complex. This includes, among others, the graph Laplacian, the combinatorial Laplacian on simplicial complexes, the…

In this paper algebraic and combinatorial properties and a computation of the number of the spanning trees are developed for certain graphs. To this purpose, an original method, independent of the spectrum of the Laplacian matrix associated…