Related papers: Two conjectures in spectral hypergraph theory

Let $(M,\omega)$ be a symplectic manifold compact or convex at infinity. Consider a closed Lagrangian submanifold $L$ such that $\omega |_{\pi_2(M,L)}=0$ and $\mu|_{\pi_2(M,L)}=0$, where $\mu$ is the Maslov index. Given any Lagrangian…

Let $G$ be an $n$-vertex graph with Laplacian eigenvalues $0=\lambda_1(G)\le \lambda_2(G)\le\cdots\le \lambda_n(G)$. Motivated by the Alon-Boppana bound and the Ramanujan phenomenon for regular graphs, Spielman conjectured that, for every…

Random graphs defined by an occurrence probability that is invariant under node aggregation have been identified recently in the context of network renormalization. The invariance property requires that edges are drawn with a specific…

Let $ \Phi=(G, \varphi) $ be a connected complex unit gain graph ($ \mathbb{T} $-gain graph) on a simple graph $ G $ with $ n $ vertices and maximum vertex degree $ \Delta $. The associated adjacency matrix and degree matrix are denoted by…

Eigenvalues and eigenvectors of non-Hermitian tridiagonal periodic random matrices are studied by means of the Hatano-Nelson deformation. The deformed spectrum is annular-shaped, with inner radius measured by the complex Thouless formula.…

Given a regular (connected) graph $\Gamma=(X,E)$ with adjacency matrix $A$, $d+1$ distinct eigenvalues, and diameter $D$, we give a characterization of when its distance matrix $A_D$ is a polynomial in $A$, in terms of the adjacency…

We show P\'eter Csorba's conjecture that the graph homomorphism complex Hom(C_5,K_{n+2}) is homeomorphic to a Stiefel manifold, the space of unit tangent vectors to the n-dimensional sphere. For this a general tool is developed that allows…

In 2003, van Dam and Haemers posed a fundamental question in spectral graph theory: does there exist a ``sensible'' matrix whose spectrum determines a random graph up to isomorphism? This paper introduces the class of {\em natural graph…

A hypergraph generalizes the concept of an ordinary graph. In an ordinary graph, edges connect pairs of vertices, whereas in a hypergraph, hyperedges can connect multiple vertices at a time. In this paper, we obtain a relationship between…

Let $H$ and $G$ be graphs such that $H$ has at least 3 vertices and is connected. The $H$-line graph of $G$, denoted by $HL(G)$, is that graph whose vertices are the edges of $G$ and where two vertices of $HL(G)$ are adjacent if they are…

Let $V=\mathbb R^d$ be the Euclidean $d$-dimensional space, $\mu$ (resp $\lambda$) a probability measure on the linear (resp affine) group $G=G L (V)$ (resp $H= \Aff (V))$ and assume that $\mu$ is the projection of $\lambda$ on $G$. We…

Let $(\mathfrak{g}, \mathfrak{k})$ be a complex quaternionic symmetric pair with $\mathfrak{k}$ having an ideal $\mathfrak{sl}(2, \mathbb{C})$, $\mathfrak{k}=\mathfrak{sl}(2, \mathbb{C})+\mathfrak{m}_c$. Consider the representation…

Given a family of hypergraphs $\mathcal{H}$, we say that a hypergraph $\Gamma$ is $\mathcal{H}$-universal if it contains every $H \in \mathcal{H}$ as a subgraph. For $D, r \in \mathbb{N}$, we construct an $r$-uniform hypergraph with…

We discuss the problem of perturbation of spectral subspaces for linear self-adjoint operators on a separable Hilbert space. Let $A$ and $V$ be bounded self-adjoint operators. Assume that the spectrum of $A$ consists of two disjoint parts…

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 introduce the concept of minimum-weight edge-discriminators in hypergraphs, and study its various properties. For a hypergraph $\mathcal H=(\mathcal V, \mathcal E)$, a function $\lambda: \mathcal V\rightarrow \mathbb…

For a real number $\alpha\in[0,1]$ and a $k$-uniform hypergraph $\mathcal{H}$, $\mathcal{A}_{\alpha}(\mathcal{H})=\alpha\mathcal{D}(\mathcal{H})+(1-\alpha)\mathcal{A}(\mathcal{H})$ is called the $\mathcal{A}_{\alpha}$-tensor of…

We prove that for an arbitrary field $k,$ a complete, associative $k^r$-algebra $\hat H$ augmented over $k^r$ has exactly $r$ maximal two-sided ideals and deserves the name $r$-pointed. If $A$ is any $k$-algebra, $M=\{M_i\}_{i=1}^r$ is a…

Let $G$ be a $k$-uniform hypergraph with vertex set $V(G)$ and edge set $E(G)$. A connected and acyclic hypergraph is called a supertree. For $0\leq\alpha<1$, the $\alpha$-spectral radius of $G$ is the largest $H$-eigenvalue of $\alpha…

As a discrete analogue of Kac's celebrated question on "hearing the shape of a drum", and towards a practical graph isomorphism test, it is of interest to understand which graphs are determined up to isomorphism by their spectrum (of their…