Related papers: Generic Generalized Diagonal Matrices
Generalized splines are an algebraic combinatorial framework that generalizes and unifies various established concepts across different fields, most notably the classical notion of splines and the topological notion of GKM theory. The…
In this paper, we prove that the open neighborhood ideal of a TD-unmixed tree is geometrically vertex decomposable. This result implies that the associated Stanley-Reisner complex is vertex decomposable. We further demonstrate that…
The shedding vertices of simplicial complexes are studied from an algebraic point of view. Based on this perspective, we introduce the class of ass-decomposable monomial ideals which is a generalization of the class of Stanley-Reisner…
For any real diagonalizable matrix with complex eigenvalues we provide a real, coordinate free decomposition with a clear geometric interpretation.
In this note, we consider matrices similar to $X$-form matrices, which are the matrices for which only the diagonal and the anti-diagonal elements can be different from zero. First, we give a characterization of these matrices using the…
Marginal polytopes are important geometric objects that arise in statistics as the polytopes underlying hierarchical log-linear models. These polytopes can be used to answer geometric questions about these models, such as determining the…
According to the classification scheme of the generalized random matrix ensembles, we present various kinds of concrete examples of the generalized ensemble, and derive their joint density functions in an unified way by one simple formula…
We generalize Voronoi's theory of perfect quadratic forms to generalized copositive matrices over a closed convex and full-dimensional cone K. We introduce a notion of a K-copositive minimum and of perfect K-copositive matrices. We consider…
With a simple graph $G$ on $[n]$, we associate a binomial ideal $P_G$ generated by diagonal minors of an $n \times n$ matrix $X=(x_{ij})$ of variables. We show that for any graph $G$, $P_G$ is a prime complete intersection ideal and…
We introduce a class of ideals generated by a set of 2-minors of $m\times n$-matrix of indeterminates indexed by a pair of graphs. This class of ideals is a natural common generalization of binomial edge ideals and ideals generated by…
Although a good portion of elementary linear algebra concerns itself with matrices over a field such as $\mathbb{R}$ or $\mathbb{C}$, many combinatorial problems naturally surface when we instead work with matrices over a finite field. As…
We establish a genericity property in the representation theory of a flat family of finite-dimensional algebras in the sense of Cline-Parshal-Scott. More precisely, we show that the decomposition matrices as introduced by Geck and Rouquier…
Diagonalization, or eigenvalue decomposition, is very useful in many areas of applied mathematics, including signal processing and quantum physics. Matrix decomposition is also a useful tool for approximating matrices as the product of a…
We study algebraic and homological properties of the ideal of submaximal minors of a sparse generic symmetric matrix. This ideal is generated by all $(n-1)$-minors of a symmetric $n \times n$ matrix whose entries in the upper triangle are…
In this paper we study algebraic sets of pairs of matrices defined by the vanishing of either the diagonal of their commutator matrix or its anti-diagonal. We find a system of parameters for the coordinate rings of these two sets and their…
In this short note, we show some inequalities on Cartan matrices, centers and socles of blocks of group algebras. Our main theorems are generalizations of the facts on dimension of Reynolds ideals.
From the generating matrix of a linear code one can construct a sequence of generalized star configurations which are strongly connected to the generalized Hamming weights and the underlying matroid of the code. When the code is MDS, the…
We describe a random matrix approach that can provide generic and readily soluble mean-field descriptions of the phase diagram for a variety of systems ranging from QCD to high-T_c materials. Instead of working from specific models, phase…
Given a graph $G$ whose edges are labeled by ideals of a commutative ring $R$ with identity, a generalized spline is a vertex labeling of $G$ by the elements of $R$ so that the difference of labels on adjacent vertices is an element of the…
Classical Hamming graphs are Cartesian products of complete graphs, and two vertices are adjacent if they differ in exactly one coordinate. Motivated by connections to unitary Cayley graphs, we consider a generalization where two vertices…