相关论文: The Expected Codimension of a Matroid Variety

A greedoid is a generalization of a matroid allowing for more flexible analyses and modeling of combinatorial optimization problems. However, these structures decimate many matroid properties contributing to their pervasive nature. A…

We present an algebraic study of line correspondences for pinhole cameras, in contrast to the thoroughly studied point correspondences. We define the line multiview variety as the Zariski closure of the image of the map projecting lines in…

In this paper, a description of the set-theoretical defining equations of symplectic (type C) Grassmannian/flag/Schubert varieties in corresponding (type A) algebraic varieties is given as linear polynomials in Pl$\ddot{u}$cker coordinates,…

Franco, Galloni, Penante, and Wen have proposed a boundary measurement map for a graph on any closed orientable surface with boundary. We consider this boundary measurement map which takes as input an edge weighted directed graph embedded…

An arithmetic matroid is weakly multiplicative if the multiplicity of at least one of its bases is equal to the product of the multiplicities of its elements. We show that if such an arithmetic matroid can be represented by an integer…

Let $A$ be an associative algebra graded by a finite group $G$ over a field ${F}$ of characteristic zero. One associates to $A$ the sequence of $G$-graded codimensions $c_n^G(A)$, $n=1,2,\ldots$, which measures the growth of the polynomial…

A permutation is called Grassmannian if it has at most one descent. In this paper, we investigate pattern avoidance and parity restrictions for such permutations. As our main result, we derive formulas for the enumeration of Grassmannian…

We introduce G{\aa}rding polynomials, a class of real multivariate polynomials characterized by positivity regions that are invariant under translation by positive vectors and closed under strictly positive affine transformations. We prove…

This paper provides a general solution for the Kronecker product decomposition (KPD) of vectors, matrices, and hypermatrices. First, an algorithm, namely, monic decomposition algorithm (MDA), is reviewed. It consists of a set of projections…

The Chow class of the closure of the torus orbit of a point in a Grassmannian only depends on the matroid associated to the point. The Chow class can be extended to a matroid invariant of arbitrary matroids. We call the coefficients…

Inspired by a recent result of Brakensiek et al. that symmetric tensor matroids and rigidity matroids are linked by matroid duality, we define abstract symmetric tensor matroids as a dual concept to abstract rigidity matroids and establish…

We relate the notion of matroid pathwidth to the minimum trellis state-complexity (which we term trellis-width) of a linear code, and to the pathwidth of a graph. By reducing from the problem of computing the pathwidth of a graph, we show…

We introduce the notion of a quasi-matroidal class of ordered simplicial complexes: an approximation to the idea of a matroid cryptomorphism in the landscape of ordered simplicial complexes. A quasi-matroidal class contains pure shifted…

Multilinear varieties, defined as the sets of rational points of varieties cut out by multilinear functions, were first introduced and studied by Gowers and Mili\'{c}evi\'{c}[Proc. Edinb. Math. Soc., 2021] for finite $\mathbb{K}$. In this…

This paper compares skew-linear and multilinear matroid representations. These are matroids that are representable over division rings and (roughly speaking) invertible matrices, respectively. The main tool is the von Staudt construction,…

We study a matrix-based notion of matroid representation over local commutative rings obtained by replacing linear independence with modular independence. This construction always defines an independence system, though not necessarily a…

A well-known conjecture states that the Whitney numbers of the second kind of a geometric lattice (simple matroid) are logarithmically concave. We show this conjecture to be equivalent to proving an upper bound on the number of new copoints…

We characterize the double Veronese embedding of P^n as the only variety that, under certain general conditions, can be isomorphically projected from the Grassmannian of lines in P^{2n+1} to the Grassmannian of lines in P^{n+1}.

In this paper, we introduce the problem of Matroid-Constrained Vertex Cover: given a graph with weights on the edges and a matroid imposed on the vertices, our problem is to choose a subset of vertices that is independent in the matroid,…

We considered the possibility that the oriented matroid theory is connected with supersymmetry via the Grassmann-Plucker relations. The main reason for this, is that such relations arise in both in the chirotopes definition of an oriented…