Results 1 to 10 of about 759 (82)

Minor-closed classes of binary functions [PDF]

Discrete Mathematics & Theoretical Computer Science
Binary functions are a generalisation of the cocircuit spaces of binary matroids to arbitrary functions. Every rank function is assigned a binary function, and the deletion and contraction operations of binary functions generalise matroid deletion and ...
Benjamin R. Jones
doaj   +1 more source

GEOMETRIC BIJECTIONS FOR REGULAR MATROIDS, ZONOTOPES, AND EHRHART THEORY

Forum of Mathematics, Sigma, 2019
Let $M$ be a regular matroid. The Jacobian group $\text{Jac}(M)$ of $M$ is a finite abelian group whose cardinality is equal to the number of bases of $M$.
SPENCER BACKMAN, MATTHEW BAKER, CHI HO YUEN   +2 more
doaj   +1 more source

Tropical Carathéodory with Matroids. [PDF]

Discrete Comput Geom, 2023
Loho G, Sanyal R.
europepmc   +1 more source

Idealness of k-wise intersecting families. [PDF]

Math Program, 2022
Abdi A, Cornuéjols G, Huynh T, Lee D.
europepmc   +1 more source

Gray matter asymmetry atypical patterns in subgrouping minors with autism based on core symptoms. [PDF]

Front Neurosci, 2022
Li C, Chen W, Li X, Li T, Chen Y, Zhang C, Ning M, Wang X.   +7 more
europepmc   +1 more source

Matroid connectivity and singularities of configuration hypersurfaces. [PDF]

Lett Math Phys, 2021
Denham G, Schulze M, Walther U.
europepmc   +1 more source

Projective hypersurfaces in tropical scheme theory I: the Macaulay ideal. [PDF]

Res Math Sci
Fink A, Giansiracusa J, Giansiracusa N, Mundinger J.   +3 more
europepmc   +1 more source

Cocircuit Graphs and Efficient Orientation Reconstruction in Oriented Matroids

European Journal of Combinatorics, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Komei Fukuda
exaly   +3 more sources

Polynomial Time Recognition of Uniform Cocircuit Graphs

Electronic Notes in Discrete Mathematics, 2009
Abstract We present an algorithm which takes a graph as input and decides in polynomial time if the graph is the cocircuit graph of a uniform oriented matroid. In the affirmative case the algorithm returns the set of signed cocircuits of the oriented matroid.
Ricardo Strausz, Kolja Knauer
exaly   +2 more sources

A characterization of cocircuit graphs of uniform oriented matroids

Journal of Combinatorial Theory Series B, 2006
Given an oriented matroid \({\mathcal M}\), the authors define the cocircuit graph as the 1-skeleton of the cellular decomposition of the sphere induced by the pseudospheres that realizes \({\mathcal M}\) via the well-known topological representation theorem of Folkman and Lawrence.
Juan, Ricardo Strausz
exaly   +3 more sources