English
Related papers

Related papers: Parallel Translates of Represented Matroids

200 papers

For any rank $r$ oriented matroid $M$, a construction is given of a "topological representation" of $M$ by an arrangement of homotopy spheres in a simplicial complex which is homotopy equivalent to $S^{r-1}$. The construction is completely…

Combinatorics · Mathematics 2009-03-17 Laura Anderson

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…

Combinatorics · Mathematics 2025-04-11 Carolina Benedetti , Anton Dochtermann , Kolja Knauer , Yupeng Li

We study Stanley-Reisner ideals of broken circuits complexes and characterize those ones admitting a linear resolution or being complete intersections. These results will then be used to characterize arrangements whose Orlik-Terao ideal has…

Commutative Algebra · Mathematics 2021-05-18 Le Van Dinh , Tim Roemer

The supercharacter theory of algebra groups gave us a representation theoretic realization of the Hopf algebra of symmetric functions in noncommuting variables. The underlying representation theoretic framework comes equipped with two…

Combinatorics · Mathematics 2018-10-04 Farid Aliniaeifard , Nathaniel Thiem

The Tutte polynomial is a fundamental invariant associated to a graph, matroid, vector arrangement, or hyperplane arrangement. This short survey focuses on some of the most important results on Tutte polynomials of hyperplane arrangements.…

Combinatorics · Mathematics 2017-10-05 Federico Ardila

We introduce combinatorial objects named matricubes that provide a generalization of the theory of matroids. As matroids provide a combinatorial axiomatization of hyperplane arrangements, matricubes provide a combinatorial axiomatization of…

Combinatorics · Mathematics 2024-04-03 Omid Amini , Lucas Gierczak

The Grassmannian, which is the manifold of all $k$-dimensional subspaces in the Euclidean space $\mathbb{R}^n$, was decomposed through three equivalent methods connecting combinatorial geometries, Schubert cells and convex polyhedra by…

Combinatorics · Mathematics 2025-06-11 Houshan Fu , Weikang Liang , Suijie Wang

We present representative sets-style statements for linear delta-matroids, which are set systems that generalize matroids, with important connections to matching theory and graph embeddings. Furthermore, our proof uses a new approach of…

Data Structures and Algorithms · Computer Science 2025-11-21 Magnus Wahlström

Let $\mathcal{A}$ denote a central hyperplane arrangement of rank $n$ in affine space $\mathbb{K}^n$ over an infinite field $\mathbb{K}$ and let $l_1,\ldots, l_m\in R:= \mathbb K[x_1,\ldots,x_n]$ denote the linear forms defining the…

Commutative Algebra · Mathematics 2021-01-11 Ricardo Burity , Aron Simis , Stefan Tohaneanu

Zonotopal algebra is the study of a family of pairs of dual vector spaces of multivariate polynomials that can be associated with a list of vectors X. It connects objects from combinatorics, geometry, and approximation theory. The origin of…

Combinatorics · Mathematics 2016-04-01 Matthias Lenz

Let $M_{1,2}(F)$ be the algebra of $3 \times 3$ matrices with orthosymplectic superinvolution $*$ over a field $F$ of characteristic zero. We study the $*$-identities of this algebra through the representation theory of the group…

Rings and Algebras · Mathematics 2024-09-17 Sara Accomando

We provide a combinatorial study of split matroids, a class that was motivated by the study of matroid polytopes from a tropical geometry point of view. A nice feature of split matroids is that they generalize paving matroids, while being…

Combinatorics · Mathematics 2022-02-10 Kristóf Bérczi , Tamás Király , Tamás Schwarcz , Yutaro Yamaguchi , Yu Yokoi

Consider a finite field $\mathbb F_q$, $q=p^d$, where $p$ is an odd number. Let $M=(E,r)$ be a regular matroid; denote by ${\mathcal B}$ the family of its bases, $\bar s(M;\alpha)=\sum_{B\in {\mathcal B}}\prod_{e\not\in B} \alpha_e$, where…

Combinatorics · Mathematics 2025-03-25 Eduard Lerner

We consider arrangements of tropical hyperplanes where the apices of the hyperplanes are taken to infinity in certain directions. Such an arrangement defines a decomposition of Euclidean space where a cell is determined by its `type' data,…

Commutative Algebra · Mathematics 2025-02-21 Ayah Almousa , Anton Dochtermann , Ben Smith

A hemiimplicative semilattice is a bounded semilattice $(A, \wedge, 1)$ endowed with a binary operation $\to$, satisfying that for every $a, b, c \in A$, $a \leq b \to c$ implies $a \wedge b \leq c$ (that is to say, one of the conditionals…

Logic · Mathematics 2016-11-30 José Luis Castiglioni , Hernán Javier San Martín

We introduce the notion of a matroid M over a commutative ring R, assigning to every subset of the ground set an R-module according to some axioms. When R is a field, we recover matroids. When R=$\mathbb{Z}$, and when R is a DVR, we get…

Combinatorics · Mathematics 2019-11-19 Alex Fink , Luca Moci

To a finite dimensional representation of a complex Lie group $G$, an associative algebra of adjoint covariant polynomial maps from the direct sum of $m$ copies of the Lie algebra $\mathfrak{g}$ of $G$ into an algebra of complex matrices is…

Representation Theory · Mathematics 2021-12-14 M. Domokos

An integral coefficient matrix determines an integral arrangement of hyperplanes in R^m. After modulo q reduction, the same matrix determines an arrangement A_q of "hyperplanes" in Z^m. In the special case of central arrangements, Kamiya,…

Combinatorics · Mathematics 2011-09-27 Hidehiko Kamiya , Akimichi Takemura , Hiroaki Terao

A classical result of R.\,P. Dilworth states that every finite distributive lattice $D$ can be represented as the congruence lattice of a finite lattice~$L$. A~sharper form was published in G.~Gr\"atzer and E.\,T. Schmidt in 1962, adding…

Rings and Algebras · Mathematics 2021-04-29 G. Grätzer , H. Lakser

We show algorithms for computing representative families for matroid intersections and use them in fixed-parameter algorithms for set packing, set covering, and facility location problems with multiple matroid constraints. We complement our…

Data Structures and Algorithms · Computer Science 2021-09-14 René van Bevern , Oxana Yu. Tsidulko , Philipp Zschoche