English
Related papers

Related papers: Extending matroid classes closed under flats

200 papers

In this paper we present an explicit combinatorial description of a special class of facets of the secondary polytopes of hypersimplices. These facets correspond to polytopal subdivisions called multi-splits. We show a relation between the…

Combinatorics · Mathematics 2019-10-10 Benjamin Schröter

We explore a combinatorial theory of linear dependency in complex space, "complex matroids", with foundations analogous to those for oriented matroids. We give multiple equivalent axiomatizations of complex matroids, showing that this…

Combinatorics · Mathematics 2013-03-27 Laura Anderson , Emanuele Delucchi

We prove that a minor-closed class of graphs has bounded layered pathwidth if and only if some apex-forest is not in the class. This generalises a theorem of Robertson and Seymour, which says that a minor-closed class of graphs has bounded…

Combinatorics · Mathematics 2020-08-03 Vida Dujmović , David Eppstein , Gwenaël Joret , Pat Morin , David R. Wood

We characterize the class of threshold matroids by the structure of their defining bases. We also give an example of a shifted matroid which is not threshold, answering a question of Deza and Onn. We conclude by exploring consequences of…

Combinatorics · Mathematics 2025-09-01 Ethan Partida

A laminar family is a collection $\mathscr{A}$ of subsets of a set $E$ such that, for any two intersecting sets, one is contained in the other. For a capacity function $c$ on $\mathscr{A}$, let $\mathscr{I}$ be $\{I:|I\cap A| \leq…

Combinatorics · Mathematics 2016-06-28 Tara Fife , James Oxley

The pattern of a matrix M is a (0,1)-matrix which replaces all non-zero entries of M with a 1. There are several contexts in which studying the patterns of orthogonal matrices can be useful. One necessary condition for a matrix to be…

Combinatorics · Mathematics 2007-05-23 J. Richard Lundgren , Simone Severini , Dustin J. Stewart

Clique-width is a well-studied graph parameter owing to its use in understanding algorithmic tractability: if the clique-width of a graph class ${\cal G}$ is bounded by a constant, a wide range of problems that are NP-complete in general…

Combinatorics · Mathematics 2021-12-23 Konrad K. Dabrowski , Matthew Johnson , Daniël Paulusma

If A is a graded connected algebra then we define a new invariant, polydepth A, which is finite if $Ext_A^*(M,A) \neq 0$ for some A-module M of at most polynomial growth. Theorem 1: If f : X \to Y is a continuous map of finite category, and…

Algebraic Topology · Mathematics 2007-05-23 Y. Felix , S. Halperin , J. -C. Thomas

In this sequel to "Foundations of matroids - Part 1", we establish several presentations of the foundation of a matroid in terms of small building blocks. For example, we show that the foundation of a matroid M is the colimit of the…

Combinatorics · Mathematics 2024-07-31 Matthew Baker , Oliver Lorscheid , Tianyi Zhang

We say that a graph $H$ dominates another graph $H'$ if the number of homomorphisms from $H'$ to any graph $G$ is dominated, in an appropriate sense, by the number of homomorphisms from $H$ to $G$. We study the family of dominating graphs,…

Combinatorics · Mathematics 2024-11-27 David Conlon , Joonkyung Lee

Polymatroids are combinatorial abstractions of subspace arrangements in the same way that matroids are combinatorial abstractions of hyperplane arrangements. By introducing augmented Chow rings of polymatroids, modeled after augmented…

Algebraic Geometry · Mathematics 2023-09-01 Christopher Eur , Matt Larson

The classes of bicircular matroids and lattice path matroids are closed under minors. The complete list of excluded minors for the class of lattice path matroids is known, and it has been recently shown that the analogous list for the class…

Combinatorics · Mathematics 2024-02-20 Emma Hogan , Charles Semple

A well-known conjecture of Richard Stanley posits that the $h$-vector of the independence complex of a matroid is a pure ${\mathcal O}$-sequence. The conjecture has been established for various classes but is open for graphic matroids. A…

Combinatorics · Mathematics 2023-08-11 Preston Cranford , Anton Dochtermann , Evan Haithcock , Joshua Marsh , Suho Oh , Anna Truman

In a recent paper by a superset of the authors it was proved that for every primitive 3-constrained space $\Gamma$ of finite diameter $\delta$ from Cherlin's catalogue of metrically homogeneous graphs, there exists a finite family $\mathcal…

Combinatorics · Mathematics 2025-11-03 Jan Hubička , Michael Kompatscher , Matěj Konečný

Let $H$ be an extension of a finite group $Q$ by a finite group $G$. Inspired by the results of duality theorems for \'etale gerbes on orbifolds, we describe the number of conjugacy classes of $H$ that maps to the same conjugacy class of…

Group Theory · Mathematics 2014-08-19 Xiang Tang , Hsian-hua Tseng

A matroid M is cyclically orderable if there is a cyclic permutation of the elements of M such that any r consecutive elements form a basis in M. An old conjecture of Kajitani, Miyano, and Ueno states that a matroid M is cyclically…

Combinatorics · Mathematics 2024-08-06 Sean McGuinness

We prove that a hereditary class of graphs is $(\mathsf{tw}, \omega)$-bounded if and only if the induced minors of the graphs from the class form a $(\mathsf{tw}, \omega)$-bounded class.

Combinatorics · Mathematics 2024-10-24 Claire Hilaire , Martin Milanič , Nicolas Trotignon , Djordje Vasić

We study some closely interrelated notions of Homological Algebra: (1) We define a topology on modules over a not-necessarily commutative ring $R$ that coincides with the $R$-topology defined by Matlis when $R$ is commutative. (2) We…

Rings and Algebras · Mathematics 2018-08-08 Alberto Facchini , Zahra Nazemian

We show that, for any prime $p$ and integer $k \geq 2$, a simple GF($p$)-representable matroid with sufficiently high rank has a rank-$k$ flat which is either independent in $M$, or is a projective or affine geometry. As a corollary we…

Combinatorics · Mathematics 2023-09-28 Jim Geelen , Matthew E. Kroeker

It is shown that the lattices of flats of boolean representable simplicial complexes are always atomistic, but semimodular if and only if the complex is a matroid. A canonical construction is introduced for arbitrary finite atomistic…

Combinatorics · Mathematics 2015-10-20 Stuart Margolis , John Rhodes , Pedro V. Silva
‹ Prev 1 8 9 10 Next ›