English
Related papers

Related papers: Modularity, Extensions and Connectivity in Infinit…

200 papers

Some aspects of a mathematical theory of rigidity and flexibility are developed for general infinite frameworks and two main results are obtained. In the first sufficient conditions, of a uniform local nature, are obtained for the existence…

Functional Analysis · Mathematics 2008-11-19 J. C. Owen , S. C. Power

We study matroidal networks introduced by Dougherty et al. We prove the converse of the following theorem: If a network is scalar-linearly solvable over some finite field, then the network is a matroidal network associated with a…

Information Theory · Computer Science 2016-11-18 Anthony Kim , Muriel Medard

We discuss several extension properties of matroids and polymatroids and their application as necessary conditions for the existence of different matroid representations, namely linear, folded linear, algebraic, and entropic…

Combinatorics · Mathematics 2025-02-24 Michael Bamiloshin , Oriol Farràs , Carles Padró

The expansion axiom of matroids requires only the existence of some kind of independent sets, not the uniqueness of them. This causes that the base families of some matroids can be reduced while the unions of the base families of these…

Discrete Mathematics · Computer Science 2013-07-11 Hua Yao , William Zhu

Thin sums matroids were introduced to extend the notion of representability to non-finitary matroids. We give a new criterion for testing when the thin sums construction gives a matroid. We show that thin sums matroids over thin families…

Combinatorics · Mathematics 2012-04-30 Hadi Afzali , Nathan Bowler

We introduce a new axiomatization of matroid theory that requires the elimination property only among modular pairs of circuits, and we present a cryptomorphic phrasing thereof in terms of Crapo's axioms for flats. This new point of view…

Combinatorics · Mathematics 2016-08-23 Emanuele Delucchi

Submodular set functions are undoubtedly among the most important building blocks of combinatorial optimization. Somewhat surprisingly, continuous counterparts of such functions have also appeared in an analytic line of research where they…

Combinatorics · Mathematics 2024-06-10 Kristóf Bérczi , Boglárka Gehér , András Imolay , László Lovász , Tamás Schwarcz

Adding elements to matroids can be fraught with difficulty. In the V\'amos matroid $V_8$, there are four independent sets $X_1,X_2, X_3,$ and $X_4$ such that $(X_1 \cup X_2,X_3 \cup X_4)$ is a $3$-separation while exactly three of the local…

Combinatorics · Mathematics 2018-05-15 James Oxley

We introduce the singular cohomology ring of a matroid which extends the Chow ring of a matroid. This is defined as the singular cohomology ring of a certain quasi-projective toric variety associated to the matroid. Using the matroidal…

Combinatorics · Mathematics 2026-03-20 Kyle Binder

In this article, the projectivity of finitely generated flat modules of a commutative ring are studied from a topological point of view. Then various interesting results are obtained. For instance, it is shown that if a ring has either a…

Commutative Algebra · Mathematics 2019-01-23 Abolfazl Tarizadeh

We study problems related to indecomposability of modules over certain local finite dimensional trivial extension algebras. We do this by purely combinatorial methods. We introduce the concepts of graph of cyclic modules, of combinatorial…

Rings and Algebras · Mathematics 2019-10-31 Juan Orendain

We introduce the concept of quotient-convergence for sequences of submodular set functions, providing, among others, a new framework for the study of convergence of matroids through their rank functions. Extending the limit theory of…

Combinatorics · Mathematics 2024-06-17 Kristóf Bérczi , Márton Borbényi , László Lovász , László Márton Tóth

For any minor-closed class of matroids over a fixed finite field, we state an exact structural characterization for the sufficiently connected matroids in the class. We also state a number of conjectures that might be approachable using the…

Combinatorics · Mathematics 2015-01-06 Jim Geelen , Bert Gerards , Geoff Whittle

This paper studies the properties of two kinds of matroids: (a) algebraic matroids and (b) finite and infinite matroids whose ground set have some canonical symmetry, for example row and column symmetry and transposition symmetry. For (a)…

Combinatorics · Mathematics 2013-12-16 Franz J. Király , Zvi Rosen , Louis Theran

Matrices are very popular and widely used in mathematics and other fields of science. Every mathematician has known the properties of finite-sized matrices since the time of study. In this paper, we consider the basic theory of infnite…

General Mathematics · Mathematics 2021-08-19 Lukasz Matysiak , Weronika Przewozniak , Natalia Rulinska

We call a class $\mathcal{M}$ of matroids hereditary if it is closed under flats. We denote by $\mathcal{M}^{ext}$ the class of matroids $M$ that is in $\mathcal{M}$, or has an element $e$ such that $M \backslash e$ is in $\mathcal{M}$. We…

Combinatorics · Mathematics 2024-11-21 Jagdeep Singh , Vaidy Sivaraman

Given an $n$-connected binary matroid, we obtain a necessary and sufficient condition for its single-element coextensions to be $n$-connected.

Combinatorics · Mathematics 2018-12-05 Ganesh Mundhe , Y. M. Borse

Starting from any finite simple graph, one can build a reflexive polytope known as a symmetric edge polytope. The first goal of this paper is to show that symmetric edge polytopes are intrinsically matroidal objects: more precisely, we…

Combinatorics · Mathematics 2023-07-12 Alessio D'Alì , Martina Juhnke-Kubitzke , Melissa Koch

Cyclic flats form a common structural invariant of both matroids and $q$-matroids, determining these objects through their weighted lattices of cyclic flats. In this paper we exploit this perspective to establish a correspondence between…

Combinatorics · Mathematics 2026-03-17 Andrew Fulcher

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