Related papers: Pseudodeterminants and perfect square spanning tre…
This paper studies symmetric tensor decompositions. For symmetric tensors, there exist linear relations of recursive patterns among their entries. Such a relation can be represented by a polynomial, which is called a generating polynomial.…
The underlying graph $G$ of a symmetric matrix $M=(m_{ij})\in \mathbb{R}^{n\times n}$ is the graph with vertex set $\{v_1,\ldots,v_n\}$ such that a pair $\{v_i,v_j\}$ with $i\neq j$ is an edge if and only if $m_{ij}\neq 0$. Given a graph…
The determinant is a main organizing tool in commutative linear algebra. In this review we present a theory of the quasideterminants defined for matrices over a division algebra. We believe that the notion of quasideterminants should be one…
Dual quaternion/complex matrices have important applications in brain science and multi-agent formation control. In this paper, we first study some basic properties of determinants of dual complex matrices, including Sturm theorem and…
A skew polynomial ring $R=K[x;\sigma,\delta]$ is a ring of polynomials with non-commutative multiplication. This creates a difference between left and right divisibility, and thus a concept of left and right evaluations and roots. A…
The mesh matrix $Mesh(G,T_0)$ of a connected finite graph $G=(V(G),E(G))=(vertices, edges) \ of \ G$ of with respect to a choice of a spanning tree $T_0 \subset G$ is defined and studied. It was introduced by Trent \cite{Trent1,Trent2}. Its…
We investigate the tractability of a simple fusion of two fundamental structures on graphs, a spanning tree and a perfect matching. Specifically, we consider the following problem: given an edge-weighted graph, find a minimum-weight…
Pseudo-hermitian matrices are matrices hermitian with respect to an indefinite metric. They can be thought of as the truncation of pseudo-hermitian operators, defined over some Krein space, together with the associated metric, to a finite…
Let $X$ be a projective variety (possibly singular) over an algebraically closed field of any characteristic and $\mathcal{F}$ be a coherent sheaf. In this article, we define the determinant of $\mathcal{F}$ such that it agrees with the…
We revisit a graph width parameter that we dub bipartite treewidth (btw). Bipartite treewidth can be seen as a common generalization of treewidth and the odd cycle transversal number, and is closely related to odd-minors. Intuitively, a…
A continuum description of unstructured meshes in two dimensions, both for planar and curved surface domains, is proposed. The meshes described are those which, in the limit of an increasingly finer mesh (smaller cells), and away from…
The purpose of this paper is to study the commutative pseudomeadows, the structure which is defined in the same way as commutative meadows, except that the existence of a multiplicative identity is not required. We extend the…
We describe all the trees with the property that the corresponding edge ideal of the square of the tree has a linear resolution. As a consequence, we give a complete characterization of those trees $T$ for which the square is co-chordal,…
In the objective of studying concentration and oscillation properties of eigenfunctions of the discrete Laplacian on regular graphs, we construct a pseudo-differential calculus on homogeneous trees, their universal covers. We define symbol…
In this paper, we initiate the study of backward doubly stochastic differential equations (BDSDEs, for short) with quadratic growth. The existence, comparison, and stability results for one-dimensional BDSDEs are proved when the generator…
We introduce a definition of a quasiconvex function on an infinite directed regular tree that depends on what we understood by a segment on the tree. Our definition is based on thinking on segments as sub-trees with the root as the midpoint…
4x4x3 absolutely nonsingular tensors are characterized by their determinant polynomial. Non-quivalence among absolutely nonsingular tensors with respect to a class of linear transformations, which do not chage the tensor rank,is studied. It…
One considers certain degenerations of the generic symmetric matrix over a field $k$ of characteristic zero and the main structures related to the determinant $f$ of the matrix, such as the ideal generated by its partial derivatives, the…
Given a solution to a recursive distributional equation, a natural (and non-trivial) question is whether the corresponding recursive tree process is endogenous. That is, whether the random environment almost surely defines the tree process.…
Complete non-ambiguous trees (CNATs) are combinatorial objects which appear in various contexts.Recently, Chen and Ohlig studied the notion of permutations associated to these objects, and proposed a series of nice conjectures.Most of them…