English
Related papers

Related papers: Fractal classes of matroids

200 papers

It is well known that the class of transversal matroids is not closed under contraction or duality. In particular, after contracting a set of elements from a transversal matroid, the resulting matroid may or may not be transversal, and the…

Combinatorics · Mathematics 2024-09-24 Samuel Bastida

We introduce the notion of k-hyperclique complexes, i.e., the largest simplicial complexes on the set [n] with a fixed k-skeleton. These simplicial complexes are a higher-dimensional analogue of clique (or flag) complexes (case k=2) and…

Combinatorics · Mathematics 2007-10-14 Raul Cordovil , Manoel Lemos , Claudia Linhares Sales

We say that a set system $\mathcal{F}$ is $k$-completely hyperseparating if for any vertex $v$, there are at most $k$ sets in $\mathcal{F}$ with intersection $\{v\}$. We determine the minimum size of such set systems on an $n$-element…

Combinatorics · Mathematics 2026-03-10 Dániel Gerbner

In this thesis, we study nearly finitary matroids by introducing new definitions and prove various properties of nearly finitary matroids. In 2010, an axiom system for infinite matroids was proposed by Bruhn et al. We use this axiom system…

Combinatorics · Mathematics 2019-06-13 Patrick Tam

An $m \times n$ matrix $\mathsf{A}$ with column supports $\{S_i\}$ is $k$-separable if the disjunctions $\bigcup_{i \in \mathcal{K}} S_i$ are all distinct over all sets $\mathcal{K}$ of cardinality $k$. While a simple counting bound shows…

Combinatorics · Mathematics 2017-11-27 Matthew Aldridge , Leonardo Baldassini , Karen Gunderson

We introduce a class of plane graphs called weak near-triangulations, and prove that this class is closed under certain graph operations. Then we use the properties of weak near-triangulations to prove that every plane triangulation on…

Combinatorics · Mathematics 2018-06-20 Simon Spacapan

We establish a closing property for thin trapped homoclinic classes. Taking advantage of this property, we proved that if the homoclinic class $H(p)$ admits a dominated splitting $T_{H(p)}M=E\oplus_{<}F$, where $E$ is thin trapped (see…

Dynamical Systems · Mathematics 2017-10-25 Wanlou Wu , Bo Li

Let $M$ be a matroid and let $Q$, $R$, $S$ and $T$ be subsets of the ground set such that the smallest separation that separates $Q$ from $R$ has order $k$ and the smallest separation that separates $S$ from $T$ has order $l$. We prove that…

Combinatorics · Mathematics 2014-03-06 Rong Chen , Geoff Whittle

We show that if a simplicial complex is a near-cone of sufficiently high depth, then the only maximum families of small pairwise intersecting faces are those with a common intersection. Thus, near-cones of sufficiently high depth satisfy…

Combinatorics · Mathematics 2025-07-02 Denys Bulavka , Russ Woodroofe

A matrix is $k$-nonnegative if all its minors of size $k$ or less are nonnegative. We give a parametrized set of generators and relations for the semigroup of $k$-nonnegative $n\times n$ invertible matrices in two special cases: when $k =…

Combinatorics · Mathematics 2017-10-31 Sunita Chepuri , Neeraja Kulkarni , Joe Suk , Ewin Tang

For each positive integer $t$ and each sufficiently large integer $r$, we show that the maximum number of elements of a simple, rank-$r$, $\mathbb C$-representable matroid with no $U_{2,t+3}$-minor is $t{r\choose 2}+r$. We derive this as a…

Combinatorics · Mathematics 2025-02-13 Jim Geelen , Peter Nelson , Zach Walsh

A torsion class $\mathcal{T}$ of the module category $\operatorname{\mathsf{mod}} A$ of a finite dimensional algebra $A$ over a field $K$ is said to be compact if there exists a module $M \in \operatorname{\mathsf{mod}} A$ such that…

Representation Theory · Mathematics 2026-04-07 Sota Asai

We classify completely prime primitive ideals whose associated varieties are the closure of the minimal nilpotent orbit of $\mathfrak{g}=\mathfrak{sl}(n,\mathbb{C})$, and classify irreducible $(\mathfrak{g},\mathfrak{k})$-modules which have…

Representation Theory · Mathematics 2021-12-02 Hiroyoshi Tamori

In this paper we prove that any strongly embedded subgroup of a K*-group G of finite Morley rank and odd type that does not interpret any bad field is solvable if its Pruefer 2-rank is at least 2. If the normal 2-rank of G is at least 3…

Group Theory · Mathematics 2007-05-23 Christine Altseimer

For any positive integer $l$ we prove that if $M$ is a simple matroid with no $(l+2)$-point line as a minor and with sufficiently large rank, then $|E(M)|\le \frac{q^{r(M)}-1}{q-1}$, where $q$ is the largest prime power less than or equal…

Combinatorics · Mathematics 2011-05-23 Jim Geelen , Peter Nelson

A simple binary matroid is called $I_4$-free if none of its rank-4 flats are independent sets. These objects can be equivalently defined as the sets $E$ of points in $PG(n-1,2)$ for which $|E \cap F|$ is not a basis of $F$ for any…

Combinatorics · Mathematics 2020-05-04 Peter Nelson , Kazuhiro Nomoto

A frame template over a field $\mathbb F$ describes the precise way in which a given $\mathbb F$-representable matroid is close to being a frame matroid. Our main result determines the maximum-rank projective or affine geometry that is…

Combinatorics · Mathematics 2021-11-10 Peter Nelson , Zach Walsh

Given a field $K$ and $n > 1$, we say that a polynomial $f \in K[x]$ has newly reducible $n$th iterate over $K$ if $f^{n-1}$ is irreducible over $K$, but $f^n$ is not (here $f^i$ denotes the $i$th iterate of $f$). We pose the problem of…

Number Theory · Mathematics 2021-11-24 Peter Illig , Rafe Jones , Eli Orvis , Yukihiko Segawa , Nick Spinale

An intertwine of a pair of matroids is a matroid such that it, but none of its proper minors, has minors that are isomorphic to each matroid in the pair. For pairs for which neither matroid can be obtained, up to isomorphism, from the other…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin

Let M and N be internally 4-connected binary matroids such that M has a proper N-minor, and |E(N)| is at least seven. As part of our project to develop a splitter theorem for internally 4-connected binary matroids, we prove the following…

Combinatorics · Mathematics 2012-06-22 Carolyn Chun , Dillon Mayhew , James Oxley