Related papers: Spectra of semi-regular polytopes

Two graphs are co-spectral if their respective adjacency matrices have the same multi-set of eigenvalues. A graph is said to be determined by its spectrum if all graphs that are co-spectral with it are isomorphic to it. We consider these…

The $k$-independence number of a graph is the maximum size of a set of vertices at pairwise distance greater than $k$. A graph is called $k$-partially walk-regular if the number of closed walks of a given length $l\le k$, rooted at a vertex…

We investigate isoperimetric upper bounds for sums of consecutive Steklov eigenvalues of planar domains. The normalization involves the perimeter and scale-invariant geometric factors which measure deviation of the domain from roundness. We…

Results of Koebe (1936), Schramm (1992), and Springborn (2005) yield realizations of $3$-polytopes with edges tangent to the unit sphere. Here we study the algebraic degrees of such realizations. This initiates the research on constrained…

In many machine learning and data related applications, it is required to have the knowledge of approximate ranks of large data matrices at hand. In this paper, we present two computationally inexpensive techniques to estimate the…

We approximate boundaries of convex polytopes by smooth hypersurfaces $Y=Y_\varepsilon$ with {\it positive mean curvatures} and, by using basic geometric relations between the scalar curvatures of Riemannin manifolds and the mean curvatures…

Let A be an n x n symmetric random matrix whose upper-triangular entries are independent and follow possibly non-identical subgaussian distributions. This paper investigates the spectral properties of A, including its eigenvalues and…

A well known upper bound for the spectral radius of a graph, due to Hong, is that $\mu_1^2 \le 2m - n + 1$. It is conjectured that for connected graphs $n - 1 \le s^+ \le 2m - n + 1$, where $s^+$ denotes the sum of the squares of the…

In this paper, we investigate the spectral properties of the adjacency and the Laplacian matrices of random graphs. We prove that: (i) the law of large numbers for the spectral norms and the largest eigenvalues of the adjacency and the…

For a connected graph, the distance spectral radius is the largest eigenvalue of its distance matrix. In this paper, of all trees with both given order and fixed diameter, the trees with the minimal distance spectral radius are completely…

While $(2+1)$-dimensional black holes in the Einstein theory allow for only the anti-de Sitter asymptotic, when the higher curvature correction is tuned on, the asymptotically flat, de Sitter and anti-de Sitter cases are included. Here we…

Using methods from random matrix theory researchers have recently calculated the full spectra of random networks with arbitrary degrees and with community structure. Both reveal interesting spectral features, including deviations from the…

The spectral radius {\rho}(G) of a digraph G is the maximum modulus of the eigenvalues of its adjacency matrix. We present bounds on {\rho}(G) that are often tighter and are applicable to a larger class of digraphs than previously reported…

We calculate numerically the periodic orbits of pseudointegrable systems of low genus numbers $g$ that arise from rectangular systems with one or two salient corners. From the periodic orbits, we calculate the spectral rigidity…

This note introduces a result on the location of eigenvalues, i.e., the spectrum, of the Laplacian for a family of undirected graphs with self-loops. We extend on the known results for the spectrum of undirected graphs without self-loops or…

Via the process of isospectral graph reduction the adjacency matrix of a graph can be reduced to a smaller matrix while its spectrum is preserved up to some known set. It is then possible to estimate the spectrum of the original matrix by…

We study the spectral properties of certain non-self-adjoint matrices associated with large directed graphs. Asymptotically the eigenvalues converge to certain curves, apart from a finite number that have limits not on these curves.

We classify the distance-regular Cayley graphs with least eigenvalue $-2$ and diameter at most three. Besides sporadic examples, these comprise of the lattice graphs, certain triangular graphs, and line graphs of incidence graphs of certain…

In this paper we develop the basic homotopy theory of G-symmetric spectra (that is, symmetric spectra with a G-action) for a finite group G, as a model for equivariant stable homotopy with respect to a G-set universe. This model lies in…

We generalize the recent invariant polytope algorithm for computing the joint spectral radius and extend it to a wider class of matrix sets. This, in particular, makes the algorithm applicable to sets of matrices that have finitely many…