English
Related papers

Related papers: Geometric Shifts and Positroid Varieties

200 papers

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…

Rings and Algebras · Mathematics 2018-08-17 Travis Baumbaugh , Felice Manganiello

The aim of the paper is to clarify the nature of combinatorial structures associated with maps on closed compact surfaces. We prove that maps give rise to Lagrangian matroids representable in a setting provided by cohomology of the surface…

Combinatorics · Mathematics 2007-05-23 Richard F. Booth , Alexandre V. Borovik , Israel Gelfand

Quiver Grassmannians are projective varieties parametrizing subrepresentations of given dimension in a quiver representation. We define a class of quiver Grassmannians generalizing those which realize degenerate flag varieties. We show that…

Algebraic Geometry · Mathematics 2015-08-04 Giovanni Cerulli Irelli , Evgeny Feigin , Markus Reineke

We construct oriented matroids of rank 3 on 13 points whose realization spaces are disconnected. They are defined on smaller points than the known examples with this property. Moreover, we construct the one on 13 points whose realization…

Combinatorics · Mathematics 2012-01-13 Yasuyuki Tsukamoto

The nonnegative Grassmannian is a cell complex with rich geometric, algebraic, and combinatorial structures. Its study involves interesting combinatorial objects, such as positroids and plabic graphs. Remarkably, the same combinatorial…

Combinatorics · Mathematics 2018-06-15 Alexander Postnikov

The Topological Representation Theorem for (oriented) matroids states that every (oriented) matroid can be realized as the intersection lattice of an arrangement of codimension one homotopy spheres on a homotopy sphere. In this paper, we…

Combinatorics · Mathematics 2015-03-19 Matthew T. Stamps

The goal of this paper is to extend the quiver Grassmannian description of certain degenerations of Grassmann varieties to the symplectic case. We introduce a symplectic version of quiver Grassmannians studied in our previous papers and…

Representation Theory · Mathematics 2024-10-07 Evgeny Feigin , Martina Lanini , Matteo Micheli , Alexander Pütz

We introduce a new width parameter for matroids called decomposition width and prove that every matroid property expressible in the monadic second order logic can be computed in linear time for matroids with bounded decomposition width if…

Discrete Mathematics · Computer Science 2009-04-21 Daniel Kral

We construct a family of independent sets for finite, atomic, and graded lattices, extending the well-known cryptomorphism between geometric lattices and matroids. This construction leads to an embedding theorem into geometric lattices that…

Combinatorics · Mathematics 2026-01-08 Or Raz

Matroids and semigraphoids are discrete structures abstracting and generalizing linear independence among vectors and conditional independence among random variables, respectively. Despite the different nature of conditional independence…

Combinatorics · Mathematics 2023-03-14 Xiangying Chen

Rough set is mainly concerned with the approximations of objects through an equivalence relation on a universe. Matroid is a combinatorial generalization of linear independence in vector spaces. In this paper, we define a parametric set…

Artificial Intelligence · Computer Science 2012-09-25 Yanfang Liu , William Zhu

A matroid $M$ is an ordered pair $(E,I)$, where $E$ is a finite set called the ground set and a collection $I\subset 2^{E}$ called the independent sets which satisfy the conditions: (i) $\emptyset \in I$, (ii) $I'\subset I \in I$ implies…

Computational Complexity · Computer Science 2024-08-21 Eun Jung Kim , Arnaud de Mesmay , Tillmann Miltzow

Given two finite matroids on the same ground set, a celebrated result of Edmonds says that the ground set can be partitioned into two disjoint subsets in a manner that there is a common independent set in both matroids whose intersection…

Combinatorics · Mathematics 2025-01-27 Irfan Alam

We relate a classic algebro-geometric degeneration technique, dating at least to [Hodge 1941], to the notion of vertex decompositions of simplicial complexes. The good case is when the degeneration is reduced, and we call this a "geometric…

Algebraic Geometry · Mathematics 2010-02-17 Allen Knutson , Ezra Miller , Alexander Yong

By interpreting the product of the Principal Component Analysis, that is the covariance matrix, as a sequence of nested subspaces naturally coming with weights according to the level of approximation they provide, we are able to embed all…

Classical Analysis and ODEs · Mathematics 2026-03-31 Blanche Buet , Xavier Pennec

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,…

Data Structures and Algorithms · Computer Science 2023-06-08 Chien-Chung Huang , François Sellier

Let $p$ be a prime such that $p \equiv 2$ or $3$ mod $5$. Linear block codes over the non-commutative matrix ring of $2 \times 2$ matrices over the prime field $GF(p)$ endowed with the Bachoc weight are derived as isometric images of linear…

Information Theory · Computer Science 2015-02-17 Bryan Hernandez , Virgilio Sison

We extend our generic rigidity theory for periodic frameworks in the plane to frameworks with a broader class of crystallographic symmetry. Along the way we introduce a new class of combinatorial matroids and associated linear…

Geometric Topology · Mathematics 2015-03-19 Justin Malestein , Louis Theran

Several moduli spaces parametrizing linear subspaces of the projective space are cut out by linear and quadratic equations in their natural embedding: Grassmannians, Flag varieties, and Schubert varieties. The goal of this paper is to prove…

Algebraic Geometry · Mathematics 2019-04-24 Laurent Evain , Margherita Roggero

In this thesis, we consider the problem of characterizing and enumerating sets of polyominoes described in terms of some constraints, defined either by convexity or by pattern containment. We are interested in a well known subclass of…

Combinatorics · Mathematics 2014-05-14 Daniela Battaglino
‹ Prev 1 8 9 10 Next ›