Matroid representations by partitions

DOI10.1016/S0012-365X(99)00004-7zbMath0934.05038MaRDI QIDQ1301662

František Matúš

Publication date: 10 April 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

matroid; secret-sharing schemes; geometric lattices; almost affine codes; partition isotopy; partition representations

Mathematics Subject Classification ID

05A18: Partitions of sets

05B15: Orthogonal arrays, Latin squares, Room squares

05B35: Combinatorial aspects of matroids and geometric lattices

39B52: Functional equations for functions with more general domains and/or ranges

20N05: Loops, quasigroups

94A17: Measures of information, entropy

51E14: Finite partial geometries (general), nets, partial spreads

51A20: Configuration theorems in linear incidence geometry

20N15: (n)-ary systems ((nge 3))

Related Items

Matroids Can Be Far from Ideal Secret Sharing, Ideal secret sharing schemes whose minimal qualified subsets have at most three participants, Hypergraph decomposition and secret sharing, On an infinite family of graphs with information ratio \(2 - 1/k\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On algebraic matroids
• Algebraic characteristic sets of matroids
• A class of non-algebraic matroids of rank three
• On the classification of ideal secret sharing schemes
• Latin squares. New developments in the theory and applications
• On secret-sharing matroids
• Generalized ideal secret-sharing schemes and matroids
• Ideal homomorphic secret sharing schemes over cyclic groups
• Geometric secret sharing schemes and their duals
• Moufang loops of even order
• Conditional independence structures examined via minors
• Almost affine codes
• Generalized associativity and bisymmetry on quasigroups
• Characteristic Sets of Matroids
• Intersection Theory for Embeddings of Matroids into Uniform Geometries
• Moufang loops of small order
• Polymatroidal dependence structure of a set of random variables
• A Generalization of a Theorem of Belousov
• Conditional Independences among Four Random Variables III: Final Conclusion
• PROBABILISTIC CONDITIONAL INDEPENDENCE STRUCTURES AND MATROID THEORY: BACKGROUND¹
• A framework for linear information inequalities
• A non-Shannon-type conditional inequality of information quantities
• On characterization of entropy function via information inequalities
• Universally ideal secret-sharing schemes
• Conditional Independences among Four Random Variables I
• Conditional Independences among Four Random Variables II
• Conditions for representability and transversality of matroids
• Theory of Matroids