Related papers: Pseudodeterminants and perfect square spanning tre…
The saddle point matrices arising from many scientific computing fields have block structure $ W= \left(\begin{array}{cc} A & B\\ B^T & C \end{array} \right) $, where the sub-block $A$ is symmetric and positive definite, and $C$ is…
A quasivariety K of algebras has the joint embedding property (JEP) iff it is generated by a single algebra A. It is structurally complete iff the free countably generated algebra in K can serve as A. A consequence of this demand, called…
A Littlewood polynomial is a single-variable polynomial all of whose coefficients lie in $\{ \pm 1\}$. We establish the leading term asymptotics of the number of reciprocal or skew-reciprocal Littlewood polynomials with square discriminant.…
A celebrated result of Otter says the number of distinct unlabelled spanning trees in $K_n$ is $\alpha^n$ up to subexponential factors for an absolute constant $\alpha>0$. In this note, we prove that for every $0<\varepsilon<\alpha$, there…
Positive semidefinite Hermitian matrices that are not fully specified can be completed provided their underlying graph is chordal. If the matrix is positive definite the completion can be uniquely characterized as the matrix that maximizes…
Sylvester's criterion characterizes positive definite (PD) and positive semidefinite (PSD) matrices without the need of eigendecomposition. It states that a symmetric matrix is PD if and only if all of its leading principal minors are…
Building on prior work that established Matrix Quasi-tree Theorems for special embedded graphs, in this paper, we develop a comprehensive theory applicable to all embedded graphs. We introduce symbolic skew-adjacency matrices and reduction…
A matrix-weighted graph is an undirected graph with a $k\times k$ positive semidefinite matrix assigned to each edge. There are natural generalizations of the Laplacian and adjacency matrices for such graphs. These matrices can be used to…
We construct near optimal linear decision trees for a variety of decision problems in combinatorics and discrete geometry. For example, for any constant $k$, we construct linear decision trees that solve the $k$-SUM problem on $n$ elements…
The QE constant of a finite connected graph $G$, denoted by $\mathrm{QEC}(G)$, is by definition the maximum of the quadratic function associated to the distance matrix on a certain sphere of codimension two. We prove that the QE constants…
We generalize the definition and enumeration of spanning trees from the setting of graphs to that of arbitrary-dimensional simplicial complexes $\Delta$, extending an idea due to G. Kalai. We prove a simplicial version of the Matrix-Tree…
The main result of this paper states that in a rooted product of a path with rooted graphs which are disposed in a somewhat mirror-symmetric fashion, there are distinct eigenvalues supported in the end vertices of the path which are too…
The solutions to a large class of semi-linear parabolic PDEs are given in terms of expectations of suitable functionals of a tree of branching particles. A sufficient, and in some cases necessary, condition is given for the integrability of…
In nice cases, a zero-dimensional complete intersection ideal over a field of characteristic zero has a Shape Lemma. There are also cases where the ideal is generated by the resultant and first subresultant polynomials of the generators.…
We observe that the Dieudonn\'{e} determinant induces a non-negative degree function on the ring of matrices over a skew polynomial ring. We then apply this degree function to two examples. In the first one, we find an expression for the…
The asymptotic stability of the null equilibrium of a linear population model with two physiological structures formulated as a first-order hyperbolic PDE is determined by the spectrum of its infinitesimal generator. We propose an…
We consider two seemingly unrelated questions: the relationship between nonnegative polynomials and sums of squares on real varieties, and sparse semidefinite programming. This connection is natural when a real variety $X$ is defined by a…
Let $P$ be a finitely generated commutative semiring. It was shown recently that if $P$ is a parasemifield (i.e. the multiplicative reduct of $P$ is a group) then $P$ cannot contain the positive rationals $\mathbb{Q}^+$ as its subsemiring.…
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on the other, is extended to the setting of general planar directed…
If a graph has a non-singular adjacency matrix, then one may use the inverse matrix to define a (labeled) graph that may be considered to be the inverse graph to the original one. It has been known that an adjacency matrix of a tree is…