Related papers: Reconstruction and Higher Dimensional Geometry
Graph is an abstract representation commonly used to model networked systems and structure. In problems across various fields, including computer vision and pattern recognition, and neuroscience, graphs are often brought into comparison (a…
Many important enumerative invariants of a matroid can be obtained from its Tutte polynomial, and many more are determined by two stronger invariants, the $\mathcal{G}$-invariant and the configuration of the matroid. We show that the same…
The goal of this expository note is to give a short, self-contained proof of nearly optimal lower bounds for the second largest eigenvalue of the adjacency matrix of regular graphs.
The block-cut tree decomposes a connected graph along its cutvertices, displaying its 2-connected components. The Tutte-decomposition extends this idea to 2-separators in 2-connected graphs, yielding a canonical tree-decomposition that…
We associate two modules, the $G$-parking critical module and the toppling critical module, to an undirected connected graph $G$. The $G$-parking critical module and the toppling critical module are canonical modules (with suitable twists)…
In a recent paper, we studied the interaction between the automorphism group of a graph and its Tutte polynomial. More precisely, we proved that certain symmetries of graphs are clearly reflected by their Tutte polynomials. The purpose of…
We prove a central limit theorem for the components of the largest eigenvectors of the adjacency matrix of a finite-dimensional random dot product graph whose true latent positions are unknown. In particular, we follow the methodology…
In this study, we explore the substructures of a hypergraph that lead us to linearly dependent rows (or columns) in the incidence matrix of the hypergraph. These substructures are closely related to the spectra of various hypergraph…
Unlike an irreducible $Z$-matrices, a weakly irreducible $Z$-tensor $\mathcal{A}$ can have more than one eigenvector associated with the least H-eigenvalue. We show that there are finitely many eigenvectors of $\mathcal{A}$ associated with…
We consider a bipartite distance-regular graph $G$ with diameter $D$ at least 4 and valency $k$ at least 3. We obtain upper and lower bounds for the local eigenvalues of $G$ in terms of the intersection numbers of $G$ and the eigenvalues of…
We present a spectral theory of hypergraphs that closely parallels Spectral Graph Theory. A number of recent developments building upon classical work has led to a rich understanding of "hyperdeterminants" of hypermatrices, a.k.a.…
In this paper, we study the Reconstruction Conjecture for finite simple graphs. Let $\Gamma$ and $\Gamma'$ be finite simple graphs with at least three vertices such that there exists a bijective map $f:V(\Gamma) \rightarrow V(\Gamma')$ and…
An alternating dimap is an orientably embedded Eulerian directed graph where the edges incident with each vertex are directed inwards and outwards alternately. Three reduction operations for alternating dimaps were investigated by Farr. A…
In this paper we prove that for a general tree $T$, if $A$ is T-TP, all the submatrices of $A$ associated with the deletion of pendant vertices are $P$-matrices, and $\det A>0$, then the smallest eigenvalue has an eigenvector signed…
After defining generalizations of the notions of covariant derivatives and geodesics from Riemannian geometry for reductive Cartan geometries in general, various results for reductive Cartan geometries analogous to important elementary…
The distance matrix of a connected graph is the symmetric matrix with columns and rows indexed by the vertices and entries that are the pairwise distances between the corresponding vertices. We give a construction for graphs which differ in…
We give a short, mostly elementary and self-contained proof of the classical result that the groups of diffeomorphisms, homeomorphisms, and homotopy equivalences of a surface have the same group of connected components.
We investigate, in some details, symplectic equivalence between several conformal classes of Lorentz metrics on the hyperboloid of one sheet $H^{1,1} \cong T \times T - \Delta$ and affine coadjoint orbits of the group $Diff_+(\Delta)$ of…
We show that any depth 2 subfactor with a simple first relative commutant has a unitary orthonormal basis. As a pleasant consequence, we produce new elements in the set of Popa's relative dimension of projections for such subfactors. We…
We give inequalities relating the eigenvalues of the adjacency matrix and the Laplacian of a graph, and its minimum and maximum degrees. The results are applied to derive new conditions for quasi-randomness of graphs.