相关论文: Pseudodeterminants and perfect square spanning tre…
We present a version of the weighted cellular matrix-tree theorem that is suitable for calculating explicit generating functions for spanning trees of highly structured families of simplicial and cell complexes. We apply the result to give…
A covariant causal set (c-causet) is a causal set that is invariant under labeling. Such causets are well-behaved and have a rigid geometry that is determined by a sequence of positive integers called the shell sequence. We first consider…
The quasi-potential is a key concept of the Large Deviation Theory for Stochastic Differential Equations (SDEs). Once the quasi-potential with respect to an attractor of the corresponding deterministic system is found, one can readily…
The problem of expressing a specific polynomial as the determinant of a square matrix of affine-linear forms arises from algebraic geometry, optimisation, complexity theory, and scientific computing. Motivated by recent developments in this…
One of the most important classes of even $\Delta$-matroids arises from orientable ribbon graphs, which play a role analogous to that of graphic matroids in matroid theory. Motivated by a natural correspondence between strong…
The complexity of a finite connected graph is its number of spanning trees; for a non-connected graph it is the product of complexities of its connected components. If $G$ is an infinite graph with cofinite free ${\mathbb Z}^d$-symmetry,…
Any finite dimensional semisimple algebra A over a field K is isomorphic to a direct sum of finite dimensional full matrix rings over suitable division rings. In this paper we will consider the special case where all division rings are…
Denote $\Sigma_n$ and $Q_n$ the set of all $n \times n$ symmetric and skew-symmetric matrices over a field $\mathbb{F}$, respectively, where $char(\mathbb{F})\neq 2$ and $\lvert \mathbb{F} \rvert \geq n^2+1$. A characterization of…
Given a Hilbert space operator $T$, the level sets of function $\Psi_T(z)=\|(T-z)^{-1}\|^{-1}$ determine the so-called pseudospectra of $T$. We set $\Psi_T$ to be zero on the spectrum of $T$. After giving some elementary properties of…
A theta curve is a spatial embedding of the $\theta$-graph in the three-sphere, taken up to ambient isotopy. We define the determinant of a theta curve as an integer-valued invariant arising from the first homology of its Klein cover. When…
Each self-similar dendrite K with a finite self-similar boundary defines a finite acyclic edge-labeled bipartite graph G, called the sprout of K. The paper shows that the sprout G determines the combinatorial properties of the dendrite K…
A general method to generate a centrosymmetric matrix associated with the solving of partial differential equation (PDE) on an irreducible domain by means of a linear equation system is proposed. The method applies to any PDE for which both…
Given a real cubic form f(x,y,z), there is a pseudo-Riemannian metric given by its Hessian matrix, defined on the open subset of R^3 where the Hessian determinant h is non-zero. We determine the full curvature tensor of this metric in terms…
A basis of $N^2$ projectors, each an ${N^2}\times{N^2}$ matrix with constant elements, is implemented to construct a class of braid matrices $\hat{R}(\theta)$, $\theta$ being the spectral parameter. Only odd values of $N$ are considered…
We present an efficient algorithm to compute permanents, mixed discriminants and hyperdeterminants of structured matrices and multidimensional arrays (tensors). We describe the sparsity structure of an array in terms of a graph, and we…
Kirchhoff showed that the number of spanning trees of a graph is the spectral determinant of the combinatorial Laplacian divided by the number of vertices; we reframe this result in the quantum graph setting. We prove that the spectral…
A metric tree ($M$, $d$), also known as $\mathbb{R}$-trees or $T$-theory, is a metric space such that between any two points there is an unique arc and that arc is isometric to an interval in $\mathbb{R}$. In this paper after presenting…
The singularity degree of a semidefinite programming problem is the smallest number of facial reduction steps to make the problem strictly feasible. We introduce two new graph parameters, called the singularity degree and the nondegenerate…
We prove that every real nonnegative ternary quartic whose complex zero set is smooth can be represented as the determinant of a symmetric matrix with quadratic entries which is everywhere positive semidefinite. We show that the…
We give two combinatorial proofs of an elegant product formula for the number of spanning trees of the $n$-dimensional hypercube. The first proof is based on the assertion that if one chooses a uniformly random rooted spanning tree of the…