scientific article; zbMATH DE number 5047784
From MaRDI portal
Publication:5484515
zbMATH Open1115.05001MaRDI QIDQ5484515FDOQ5484515
Authors: James Oxley 
Publication date: 21 August 2006
Title of this publication is not available (Why is that?)
Recommendations
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of matroids and geometric lattices (05B35)
Cited In (only showing first 100 items - show all)
- Slack matrices, \(k\)-products, and 2-level polytopes
- On the reliability roots of simplicial complexes and matroids
- On the Complexity of Stackelberg Matroid Pricing Problems
- Title not available (Why is that?)
- Proto-exact categories of modules over semirings and hyperrings
- A combinatorial mapping for the higher-dimensional matrix-tree theorem
- Fully dynamic clustering and diversity maximization in doubling metrics
- The matroid intersection cover problem
- Structure on the top homology and related algorithms
- Tight revenue gaps among multiunit mechanisms
- Transition operations over plane trees
- The complexity of degree anonymization by graph contractions
- Combinatorics of essential sets for positroids
- On the parameterized complexity of \textsc{Girth} and \textsc{Connectivity} problems on linear matroids
- Title not available (Why is that?)
- On decomposable correlation matrices
- Matroid theory
- Two cryptomorphic formalizations of projective incidence geometry
- Proto-exact categories of matroids, Hall algebras, and \(K\)-theory
- Representing matroids over the reals is \(\exists \mathbb{R}\)-complete
- Rational roots of all‐terminal reliability
- Approximation in mechanism design with interdependent values
- Parameterized complexity of conflict-free set cover
- Tangle bases: Revisited
- An overview of complex fractal dimensions: from fractal strings to fractal drums, and back
- Formal barriers to simple algorithms for the matroid secretary problem
- Simultaneous feedback edge set: a parameterized perspective
- Tutte polynomials for regular oriented matroids
- P-flag spaces and incidence stratifications
- Subdeterminant maximization via nonconvex relaxations and anti-concentration
- Parameterized complexity of geometric covering problems having conflicts
- Auctions with interdependence and SOS: improved approximation
- Hopf algebras for matroids over hyperfields
- Triangle-roundedness in matroids
- Single commodity-flow algorithms for lifts of graphic and cographic matroids
- On ideal and weakly-ideal access structures
- On the number of circuits in regular matroids (with connections to lattices and codes)
- The Tutte polynomial of matroids constructed by a family of splitting operations
- Isolating a vertex via lattices: polytopes with totally unimodular faces
- Polynomial Kernel for Interval Vertex Deletion
- A family of matrix-tree multijections
- Regular matroids have polynomial extension complexity
- Theory and applications of linearized multivariate skew polynomials
- Quotients of uniform positroids
- Information theoretically secure hypothesis test for temporally unstructured quantum computation (extended abstract)
- Signed-graphic matroids with all-graphic cocircuits
- Two new ways to formally prove Dandelin-Gallucci's theorem
- Tropical moduli spaces of rational graphically stable curves
- Rotor-Routing Induces the Only Consistent Sandpile Torsor Structure on Plane Graphs
- Title not available (Why is that?)
- Hyperplane arrangements and Milnor fibrations
- Topics in Matroid Theory
- Spanning trees with specified differences in Cayley graphs
- Diversity, dependence and independence
- Matroidizing set systems: A new approach to matroid theory
- Computing the largest bond and the maximum connected cut of a graph
- Generalized permutohedra, \(h\)-vectors of cotransversal matroids and pure \(O\)-sequences
- Evaluation and interpolation over multivariate skew polynomial rings
- Classification of external zonotopal algebras
- Topology of augmented Bergman complexes
- Grassmann homomorphism and Hajós-type theorems
- Higher dimensional electrical circuits
- Hispanic Heritage Month
- Recognizing Cartesian products of matrices and polytopes
- Stiefel tropical linear spaces
- Fast exact algorithms for survivable network design with uniform requirements
- A matroid-friendly basis for the quasisymmetric functions
- Broken circuit complexes and hyperplane arrangements
- Quantitative combinatorial geometry for concave functions
- Sublinear circuits for polyhedral sets
- On graphs uniquely defined by their \(K\)-circular matroids
- Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits
- Greedy-type resistance of combinatorial problems
- Geometry of cuts and metrics
- The algebraic matroid of the finite unit norm tight frame (funtf) variety
- Matroid bases with cardinality constraints on the intersection
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the basis pair graphs of signed-graphic matroids
- Matroids arising from electrical networks
- A splitter theorem on 3-connected matroids
- Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees
- Detecting binomiality
- Deterministic parameterized algorithms for the graph motif problem
- The matroid stratification of the Hilbert scheme of points on \(\mathbb{P}^1\)
- Information hiding using matroid theory
- Locally defined independence systems on graphs
- The relationships between posets and independent sets of a matroid of arbitrary cardinality
- On posets and independence spaces
- How many circuits determine an oriented matroid?
- Multigraded shifts of matroidal ideals
- Generalized weights of codes over rings and invariants of monomial ideals
- The joints problem for matroids
- Finding even subgraphs even faster
- On minors avoiding elements in matroids
- Ghost symmetry and an analogue of Steinitz's theorem
- On Fair Division under Heterogeneous Matroid Constraints
- Title not available (Why is that?)
- Formalizing Some “Small” Finite Models of Projective Geometry in Coq
- On Vertices and Facets of Combinatorial 2-Level Polytopes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5484515)
