Related papers: Geometric multiplicity of unitary non-backtracking…
Graph homomorphism has been studied intensively. Given an m x m symmetric matrix A, the graph homomorphism function is defined as \[Z_A (G) = \sum_{f:V->[m]} \prod_{(u,v)\in E} A_{f(u),f(v)}, \] where G = (V,E) is any undirected graph. The…
We consider square matrices over $\mathbb{C}$ satisfying an identity relating their eigenvalues and the corresponding eigenvectors re-proved and discussed by Denton, Parker, Tao and Zhang, called the eigenvector-eigenvalue identity. We…
A novel scenario for the emergence of geometry in random multitrace matrix models of a single hermitian matrix $M$ with unitary $U(N) $ invariance, i.e. without a kinetic term, is presented. In particular, the dimension of the emergent…
A block graph is a graph in which every block is a complete graph. Let $G$ be a block graph and let $A(G)$ be its (0,1)-adjacency matrix. Graph $G$ is called nonsingular (singular) if $A(G)$ is nonsingular (singular). Characterizing…
We present a new model of quantum gravity as a theory of random geometries given explicitly in terms of a multitrace matrix model. This is a generalization of the usual discretized random surfaces of 2D quantum gravity which works away from…
The inverse eigenvalue problem of a given graph $G$ is to determine all possible spectra of real symmetric matrices whose off-diagonal entries are governed by the adjacencies in $G$. Barrett et al. introduced the Strong Spectral Property…
Finding a diagonal matrix congruent to $A - cI$ for constants $c$, where $A$ is the adjacency matrix of a graph $G$ allows us to quickly tell the number of eigenvalues in a given interval. If $G$ has clique-width $k$ and a corresponding…
Let $G$ be a graph with an adjacent matrix $A(G)$. The multiplicity of an arbitrary eigenvalue $\lambda$ of $A(G)$ is denoted by $m_\lambda(G)$. In \cite{Wong}, the author apply the Pater-Wiener Theorem to prove that if the diameter of $T$…
A threshold graph G on n vertices is defined by binary sequence of length n. In this paper we present an explicit formula for computing the characteristic polynomial of a threshold graph from its binary sequence. Applications include…
A matching $M$ in a graph $G$ is said to be uniquely restricted if there is no other matching in $G$ that matches the same set of vertices as $M$. We describe a polynomial-time algorithm to compute a maximum cardinality uniquely restricted…
We prove a universal limit theorem for the halting time, or iteration count, of the power/inverse power methods and the QR eigenvalue algorithm. Specifically, we analyze the required number of iterations to compute extreme eigenvalues of…
Let G be a graph of given order and mu(G) be the largest eigenvalue of its adjacency matrix. We give conditions on mu(G) that imply Hamiltonicity of G and of its complement.
A collection of vectors in a real vector space is called a unimodular system if any of its maximal linearly independent subsets generates the same free abelian group. This notion is closely connected with totally unimodular matrices: rows…
A class of differential calculi is explored which is determined by a set of automorphisms of the underlying associative algebra. Several examples are presented. In particular, differential calculi on the quantum plane, the $h$-deformed…
We undertake a detailed study of the sets of multiplicity in a second countable locally compact group $G$ and their operator versions. We establish a symbolic calculus for normal completely bounded maps from the space $\mathcal{B}(L^2(G))$…
The mixed volume counts the roots of generic sparse polynomial systems. Mixed cells are used to provide starting systems for homotopy algorithms that can find all those roots, and track no unnecessary path. Up to now, algorithms for that…
Structured matrices with symbolic sizes appear frequently in the literature, especially in the description of algorithms for linear algebra. Recent work has treated these symbolic structured matrices themselves as computational objects,…
We introduce a new class of countably infinite random geometric graphs, whose vertices are points in a metric space, and vertices are adjacent independently with probability p if the metric distance between the vertices is below a given…
I present an algorithm that, given a number $n \geq 1$, computes a compact representation of the set of all noncrossing acyclic digraphs with $n$ nodes. This compact representation can be used as the basis for a wide range of dynamic…
Let $K$ be an imaginary quadratic field. In this article, we study the local geometry of the Bianchi eigenvariety around non-cuspidal classical points, in particular, ordinary non-cuspidal base change points. To perform this study we…