相关论文: Composition Direction of Seymour's Theorem for Reg…
We study rank-three matroids, known as point-line configurations, and their associated matroid varieties, defined as the Zariski closures of their realization spaces. Our focus is on determining finite generating sets of defining equations…
We generalize Baker-Bowler's theory of matroids over tracts to orthogonal matroids, define orthogonal matroids with coefficients in tracts in terms of Wick functions, orthogonal signatures, circuit sets, and orthogonal vector sets, and…
The Dedekind-Birkhoff theorem for finite-height modular lattices has previously been generalized to complete modular lattices using the theory of regular coverings. In this paper, we investigate regular coverings in lattices of filters and…
The idea of decomposing a matrix into a product of structured matrices such as triangular, orthogonal, diagonal matrices is a milestone of numerical computations. In this paper, we describe six new classes of matrix decompositions,…
Let $\mathfrak{M}_n$ be the multiplicative monoid of $n \times n$ matrices over a finite field. The monoid algebra $\mathbf{C}[\mathfrak{M}_n]$ has been studied for several decades. One of the important early results is Kov\'acs' theorem…
A general theorem on factorization of matrices with polynomial entries is proven and it is used to reduce polynomial Darboux matrices to linear ones. Some new examples of linear Darboux matrices are discussed.
Matroid varieties are the closures in the Grassmannian of sets of points defined by specifying which Pl\"ucker coordinates vanish and which don't --- the set of nonvanishing Pl\"ucker coordinates forms a well-studied object called a…
Given a matroid or flag of matroids we introduce several broad classes of polynomials satisfying Deletion-Contraction identities, and study their singularities. There are three main families of polynomials captured by our approach:…
Rough sets are efficient for data pre-processing in data mining. Matroids are based on linear algebra and graph theory, and have a variety of applications in many fields. Both rough sets and matroids are closely related to lattices. For a…
Following Britz, Johnsen, Mayhew and Shiromoto, we consider demi\-ma\-troids as a(nother) natural generalization of matroids. As they have shown, demi\-ma\-troids are the appropriate combinatorial objects for studying Wei's duality. Our…
This paper develops the fundamentals of modular representation theory for finite monoids, introducing the decomposition matrix and exploring its connection to Brauer characters. We define modular characteristic and explain how the…
A positroid is the matroid of a real matrix with nonnegative maximal minors, a positroid variety is the closure of the locus of points in a complex Grassmannian whose matroid is a fixed positroid, and a positroid class is the cohomology…
We settle the fusion product decomposition theorem for higher-level affine Demazure modules for the cases $E^{(1)}_{6, 7, 8}, F^{(1)}_4$ and $E^{(2)}_{6}$, thus completing the main theorems of Chari et al. (J. Algebra, 2016) and Kus et al.…
A bimatroid is a matroid-like generalization of the collection of regular minors of a matrix. In this article, we use the theory of Lorentzian polynomials to study the logarithmic concavity of natural sequences associated to bimatroids.…
For the second fundamental representation of the general linear group over a commutative ring $R$ we construct straightforward and uniform polynomial expressions of elementary generators as products of elementary conjugates of an arbitrary…
In this paper we generalise the even directed cycle problem, which asks whether a given digraph contains a directed cycle of even length, to orientations of regular matroids. We define non-even oriented matroids generalising non-even…
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.…
This note contributes to the structure theory of abstract rigidity matroids in general dimension. In the spirit of classical matroid theory, we prove several cryptomorphic characterizations of abstract rigidity matroids (in terms of…
A uniqueness theorem for an LU decomposition of a totally nonnegative matrix is obtained.
A binary frame template is a device for creating binary matroids from graphic or cographic matroids. Such matroids are said to conform or coconform to the template. We introduce a preorder on these templates and determine the nontrivial…