English
Related papers

Related papers: A Note on the Sticky Matroid Conjecture

200 papers

The sticky polymatroid conjecture states that any two extensions of the polymatroid have an amalgam if and only if the polymatroid has no non-modular pairs of flats. We show that the conjecture holds for polymatroids on five or less…

Information Theory · Computer Science 2020-02-04 Laszlo Csirmaz

Motivated by the characterization of the lattice of cyclic flats of a matroid, the convolution of a ranked lattice and a discrete measure is defined, generalizing polymatroid convolution. Using the convolution technique we prove that if a…

Combinatorics · Mathematics 2019-10-03 Laszlo Csirmaz

We show Kantor's conjecture (1974) holds in rank 4. This proves both the sticky matroid conjecture of Poljak and Turzik (1982) and the whole Kantor's conjecture, due to an argument of Bachem, Kern, and Bonin, and an equivalence argument of…

Combinatorics · Mathematics 2021-08-11 Jaeho Shin

We give a criterion for modular extension of rank-4 hypermodular matroids, and prove a weakening of Kantor's conjecture for rank-4 realizable matroids. This proves the sticky matroid conjecture and Kantor's conjecture for realizable…

Combinatorics · Mathematics 2021-01-20 Jaeho Shin

We prove the equivalence of Kantor's Conjecture and the Sticky Matroid Conjecture due to Poljak und Turz\'ik.

Combinatorics · Mathematics 2018-12-12 Winfried Hochstättler , Michael Wilhelmi

Adhesive polymatroids were defined by F. Mat\'u\v{s} motivated by entropy functions. Two polymatroids are adhesive if they can be glued together along their joint part in a modular way; and are one-adhesive, if one of them has a single…

Information Theory · Computer Science 2019-08-28 Laszlo Csirmaz

We show that an adjoint of a loopless matroid is connected if and only if it itself is connected. Our first goal is to study the adjoint of modular matroids. We prove that a modular matroid has only one adjoint (up to isomorphism) which can…

Combinatorics · Mathematics 2023-04-18 Houshan Fu , Chunming Tang , Suijie Wang

B\'ar\'any, Kalai, and Meshulam recently obtained a topological Tverberg-type theorem for matroids, which guarantees multiple coincidences for continuous maps from a matroid complex to d-dimensional Euclidean space, if the matroid has…

Combinatorics · Mathematics 2017-05-11 Pavle V. M. Blagojević , Albert Haase , Günter M. Ziegler

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

Following the work of Gao and Xie in [2], we state some properties of the inverse Kazhdan-Lusztig polynomial of a matroid. We also give partial answers to a conjecture that states that regular connected matroids are non-degenerate. We link…

Combinatorics · Mathematics 2021-04-21 Lorenzo Vecchi

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

In this paper we highlight some enumerative results concerning matroids of low rank and prove the tail-ends of various sequences involving the number of matroids on a finite set to be log-convex. We give a recursion for a new, slightly…

Combinatorics · Mathematics 2007-05-23 W. M. B. Dukes

There is a long list of open questions rooted in the same underlying problem: understanding the structure of bases or common bases of matroids. These conjectures suggest that matroids may possess much stronger structural properties than are…

Combinatorics · Mathematics 2024-11-05 Kristóf Bérczi , Áron Jánosik , Bence Mátravölgyi

Using a new technique, we prove a rich family of special cases of the matroid intersection conjecture. Roughly, we prove the conjecture for pairs of tame matroids which have a common decomposition by 2-separations into finite parts.

Combinatorics · Mathematics 2014-04-25 Nathan Bowler , Johannes Carmesin

Rota's basis conjecture (RBC) states that given a collection B of n bases in a matroid M of rank n, one can always find n disjoint rainbow bases with respect to B. We show that if M is a matroid having n + k elements, then one can construct…

Combinatorics · Mathematics 2022-07-01 Sean McGuinness

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

White's conjecture asserts that any two tuples of matroid bases that have the same multi-set union can be transformed from one to another by symmetric exchanges; it also implies that the toric ideals of matroids are generated by the…

Combinatorics · Mathematics 2025-10-07 Yu-Chuan Yu , Chi Ho Yuen

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

Combinatorics · Mathematics 2018-08-01 Peter Nelson , Kazuhiro Nomoto

The "Modularity Conjecture" is the assertion that the join of two nonmodular varieties is nonmodular. We establish the veracity of this conjecture for the case of linear idempotent varieties. We also establish analogous results concerning…

Rings and Algebras · Mathematics 2012-12-24 Wolfram Bentz , Luis Sequeira

Generalizing a well known theorem for finite matroids, we prove that for every (infinite) connected matroid M there is a unique tree T such that the nodes of T correspond to minors of M that are either 3-connected or circuits or cocircuits,…

Combinatorics · Mathematics 2015-06-08 Elad Aigner-Horev , Reinhard Diestel , Luke Postle
‹ Prev 1 2 3 10 Next ›