English
Related papers

Related papers: Quasi-matroidal classes of ordered simplicial comp…

200 papers

q-Matroids form the q-analogue of classical matroids. In this paper we introduce various types of maps between q-matroids. These maps are not necessarily linear, but they map subspaces to subspaces and respect the q-matroid structure in…

Combinatorics · Mathematics 2023-03-14 Heide Gluesing-Luerssen , Benjamin Jany

A minor of a matrix is quasi-principal if it is a principal or an almost-principal minor. The quasi principal rank characteristic sequence (qpr-sequence) of an $n\times n$ symmetric matrix is introduced, which is defined as $q_1 q_2 \cdots…

Combinatorics · Mathematics 2018-04-19 Shaun M. Fallat , Xavier Martínez-Rivera

We give a new characterization of partial groups as a subcategory of symmetric (simplicial) sets. This subcategory has an explicit reflection, which permits one to compute colimits in the category of partial groups. We also introduce the…

Group Theory · Mathematics 2025-03-10 Philip Hackney , Justin Lynd

We introduce the notion of power lattices that unifies and extends the equicardinal geometric lattices, Cartesian products of subspace lattices, and multiset subset lattices, among several others. The notions of shellability for simplicial…

Combinatorics · Mathematics 2024-07-12 Rakhi Pratihar , Tovohery H. Randrianarisoa , Klara Stokes

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…

Combinatorics · Mathematics 2025-03-20 Bill Jackson , Shin-ichi Tanigawa

The discrete polymatroid is a multiset analogue of the matroid. Based on the polyhedral theory on integral polymatroids developed in late 1960's and in early 1970's, in the present paper the combinatorics and algebra on discrete…

Commutative Algebra · Mathematics 2007-05-23 Juergen Herzog , Takayuki Hibi

This paper is devoted to the study of independent spaces of q-polymatroids. With the aid of an auxiliary q-matroid it is shown that the collection of independent spaces satisfies the same properties as for q-matroids. However, in contrast…

Combinatorics · Mathematics 2021-05-06 Heide Gluesing-Luerssen , Benjamin Jany

Let $M$ be a matroid defined on a finite set $E$ and $L\subset E$. $L$ is locked in $M$ if $M|L$ and $M^*|(E\backslash L)$ are 2-connected, and $min\{r(L), r^*(E\backslash L)\} \geq 2$. Locked subsets characterize nontrivial facets of the…

Computational Complexity · Computer Science 2019-06-20 Brahim Chaourar

It is well known that in q-matroids, axioms for independent spaces, bases, and spanning spaces differ from the classical case of matroids, since the straightforward q-analogue of the classical axioms does not give a q-matroid. For this…

Combinatorics · Mathematics 2024-04-24 Michela Ceria , Relinde Jurrius

The matching and linear matroid intersection problems are solvable in quasi-NC, meaning that there exist deterministic algorithms that run in polylogarithmic time and use quasi-polynomially many parallel processors. However, such a parallel…

Computational Complexity · Computer Science 2024-02-29 Rohit Gurjar , Taihei Oki , Roshan Raj

Simplicial arrangements are classical objects in discrete geometry. Their classification remains an open problem but there is a list conjectured to be complete at least for rank three. A further important class in the theory of hyperplane…

Combinatorics · Mathematics 2020-03-05 Michael Cuntz , Paul Mücksch

A transduction provides us with a way of using the monadic second-order language of a structure to make statements about a derived structure. Any transduction induces a relation on the set of these structures. This article presents a…

Combinatorics · Mathematics 2024-01-24 Susan Jowett , Dillon Mayhew , Songbao Mo , Christopher Tuffley

Cyclic monotone independence is an algebraic notion of noncommutative independence, introduced in the study of multi-matrix random matrix models with small rank. Its algebraic form turns out to be surprisingly close to monotone…

Operator Algebras · Mathematics 2024-11-12 Benoît Collins , Felix Leid , Noriyoshi Sakuma

This study aims to shed light on new (sub)classes of matroids originating from cluster algebras and investigate their properties. We focus on what we call cluster matroids and build some results on them. Then, we point out a relationship…

Combinatorics · Mathematics 2025-06-23 Fayadh Kadhem

Matroid bundles, introduced by MacPherson, are combinatorial analogues of real vector bundles. This paper sets up the foundations of matroid bundles, and defines a natural transformation from isomorphism classes of real vector bundles to…

Geometric Topology · Mathematics 2015-12-01 Laura Anderson , James F. Davis

It is well known that the underlying simplicial set of any simplicial group is a Kan complex. Roughly speaking, Kan complex is an infinite-dimensional analogue of groupoid, and the relation between groupoids and categories resembles that…

Category Theory · Mathematics 2020-06-23 Ryo Horiuchi

We investigate quotients by radical monomial ideals for which $T^2$, the second cotangent cohomology module, vanishes. The dimension of the graded components of $T^2$, and thus their vanishing, depends only on the combinatorics of the…

Symmetric strongly shifted ideals are a class of monomial ideals which come equipped with an action of the symmetric group and are analogous to the well-studied class of strongly stable monomial ideals. In this paper we focus on algebraic…

Commutative Algebra · Mathematics 2022-08-23 Alessandra Costantini , Alexandra Seceleanu

This paper investigates infinite matroids from a categorical perspective. We prove that the category of infinite matroids is a proto-exact category in the sense of Dyckerhoff and Kapranov, thereby generalizing our previous result on the…

Combinatorics · Mathematics 2021-09-01 Chris Eppolito , Jaiung Jun

The class of quasiseparable matrices is defined by the property that any submatrix entirely below or above the main diagonal has small rank, namely below a bound called the order of quasiseparability. These matrices arise naturally in…

Symbolic Computation · Computer Science 2019-10-22 Clement Pernet , Arne Storjohann