Higher Order Independence in Matroids

DOI10.1112/JLMS/S2-19.2.193MaRDI QIDQ4175298zbMATH OpenOpenAlexFDO

Authors Kenneth Baclawski, Neil White

Publication date 1979

Published in Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/jlms/s2-19.2.193

zbMATH Keywords

Dehn TwistElectrical NetworksLinear DependenPolynomial Ring

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Cited in

(4)

• Geometry of the Gass-Saaty parametric cost LP algorithm
• Permanent formulae from the Veronesean
• Binary Supersolvable Matroids and Modular Constructions
• Complete monotonicity for inverse powers of some combinatorially defined polynomials

This page was built for publication: Higher Order Independence in Matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4175298)