Results 91 to 100 of about 14,016 (208)
Modifications of Tutte–Grothendieck invariants and Tutte polynomials
AKCE International Journal of Graphs and Combinatorics, 2020 Generalized Tutte–Grothendieck invariants are mappings from the class of matroids to a commutative ring that are characterized recursively by contraction–deletion rules. Well known examples are Tutte, chromatic, tension and flow polynomials.
Martin Kochol
doaj +1 more source
Naval Research Logistics (NRL), Volume 72, Issue 1, Page 133-147, February 2025.Abstract A classic result of Korte and Hausmann [1978] and Jenkyns [1976] bounds the quality of the greedy solution to the problem of finding a maximum value basis of an independence system (E,ℐ)$$ \left(E,\mathcal{I}\right) $$ in terms of the rank‐quotient. We extend this result in two ways.
Sven de Vries +2 more
wiley +1 more source
On triangular matroids induced by n3-configurations
Open Mathematics, 2020 A triangular matroid is a rank-3 matroid whose ground set consists of the points of an n3{n}_{3}-configuration and whose bases are the point triples corresponding to non-triangles within the configuration.
Alazemi Abdullah, Raney Michael
doaj +1 more source
Hopf algebras for matroids over hyperfields [PDF]
, 2018 Recently, M.~Baker and N.~Bowler introduced the notion of matroids over hyperfields as a unifying theory of various generalizations of matroids. In this paper we generalize the notion of minors and direct sums from ordinary matroids to matroids over ...
Eppolito, Chris +2 more
core
Matroids on the Bases of Simple Matroids
European Journal of Combinatorics, 1981 Let M be a simple matroid (= combinatorial geometry). On the bases of M we consider two matroids S(M, F) and H(M, F), which depend on a field F. S(M, F) is the simplicial matroid with coefficients in F on the bases of M considered as simplices. H(M, F) has been studied by Björner in [1].
openaire +1 more source
Generate $\Delta$-matroids from matroids
, 2021 Comment: 8 pages, 2 ...
Avohou, Rémi Cocou +2 more
openaire +1 more source
Some characteristics of matroids through rough sets [PDF]
, 2012 At present, practical application and theoretical discussion of rough sets are two hot problems in computer science. The core concepts of rough set theory are upper and lower approximation operators based on equivalence relations. Matroid, as a branch of
Su, Lirun, Zhu, William
core
MathematicsWe study point-line configurations through the lens of projective geometry and matroid theory. Our focus is on their realization spaces, where we introduce the concepts of liftable and quasi-liftable configurations, exploring cases in which an n-tuple of
Oliver Clarke +2 more
doaj +1 more source
Lagrangian Pairs and Lagrangian Orthogonal Matroids
, 2002 Represented Coxeter matroids of types $C_n$ and $D_n$, that is, symplectic and orthogonal matroids arising from totally isotropic subspaces of symplectic or (even-dimensional) orthogonal spaces, may also be represented in buildings of type $C_n$ and $D_n$
Booth, Richard F. +2 more
core +1 more source
Semi-streaming algorithms for submodular matroid intersection. [PDF]
Math Program, 2023 Garg P, Jordan L, Svensson O.
europepmc +1 more source