Related papers: Symmetric matrices, Catalan paths, and correlation…
Snake graphs and their perfect matchings play a key role in the description of cluster variables of cluster algebras associated to surfaces. In this paper, we introduce triangular snake graphs and establish a bijection between their routes…
Any symmetric affinity function $w: V\times V \to \mathbb{R}_+$ defined on a discrete set $V$ induces Euclidean space structure on $V$. In particular, an undirected graph specified by an affinity (or adjacency) matrix can be considered as a…
In this work we take a deep dive into the cone of copositive $3 \times 3$ matrices. In doing so we visualize the cone, make geometric observations about it, and prove them. We then use these observations to parametrize the set. In the…
From the matrix point of view, we use the recursion to discuss four combinatorial numbers in terms of the integer lattice paths, this is different from Andr\'a's method (Andra). We give four tables and matrices, and their relations, and…
Lattice paths effectively model phenomena in chemistry, physics and probability theory. Asymptotic enumeration of lattice paths is linked with entropy in the physical systems being modeled. Lattice paths restricted to different regions of…
Symmetric functions provide one of the most efficient tools for combinatorial enumeration, in the context of objects that may be acted upon by permutations. Only assuming a basic knowledge of linear algebra, we introduce and describe the…
We present a combinatorial model of configuration spaces and polytopes associated to the quotients of $\mathbb{C} A_n$, the path algebra of the linearly oriented $A_n$ quiver, i.e. the algebra of upper triangular matrices. These quotient…
Very recently, Qi and Cui extended the Perron-Frobenius theory to dual number matrices with primitive and irreducible nonnegative standard parts and proved that they have Perron eigenpair and Perron-Frobenius eigenpair. The Collatz method…
The concept of a matroid quotient has connections to fundamental questions in the geometry of flag varieties. In previous work, Benedetti and Knauer characterized quotients in the class of lattice path matroids (LPMs) in terms of a simple…
We formulate the issue of minimality of self-adjoint operators on a Hilbert space as a semi-definite problem, linking the work by Overton in [1] to the characterization of minimal hermitian matrices. This motivates us to investigate the…
Following Benjamin et al., a matrix with entries being sums of two neighbouring Catalan numbers is considered. Its LU-decomposition is given, by guessing the results and later prove it by computer algebra, with lots of human help.…
The paper gives a thorough introduction to spectra of digraphs via its Hermitian adjacency matrix. This matrix is indexed by the vertices of the digraph, and the entry corresponding to an arc from $x$ to $y$ is equal to the complex unity…
We propose and investigate a bi-infinite matrix approach to the multiplication and composition of formal Laurent series. We generalize the concept of Riordan matrix to this bi-infinite context, obtaining matrices that are not necessarily…
The E. Cartan's equations defining "simple" spinors (renamed "pure" by C. Chevalley) are interpreted as equations of motions for fermion multiplets in momentum spaces which, in a constructive approach based bilinearly on those spinors,…
Multicriteria Decision Making problems are important both for individuals and groups. Pairwise comparisons have become popular in the theory and practice of preference modelling and quantification. We focus on decision problems where the…
We prove that we can always construct strongly minimal linearizations of an arbitrary rational matrix from its Laurent expansion around the point at infinity, which happens to be the case for polynomial matrices expressed in the monomial…
The graph of zigzag diagrams is a close relative of Young's lattice. The boundary problem for this graph amounts to describing coherent random permutations with descent-set statistic, and is also related to certain positive characters on…
Copositive and completely positive matrices play an increasingly important role in Applied Mathematics, namely as a key concept for approximating NP-hard optimization problems. The cone of copositive matrices of a given order and the cone…
In this paper, we review the problem of matrix completion and expose its intimate relations with algebraic geometry, combinatorics and graph theory. We present the first necessary and sufficient combinatorial conditions for matrices of…
Correlation functions in a dynamic quartic matrix model are obtained from the two-point function through a recurrence relation. This paper gives the explicit solution of the recurrence by mapping it bijectively to a two-fold nested…