Matroid representations by partitions

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

František Matúš

Publication date: 10 April 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00004-7

zbMATH Keywords

matroidsecret-sharing schemesgeometric latticesalmost affine codespartition isotopypartition representations

Mathematics Subject Classification ID

Partitions of sets (05A18) Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of matroids and geometric lattices (05B35) Functional equations for functions with more general domains and/or ranges (39B52) Loops, quasigroups (20N05) Measures of information, entropy (94A17) Finite partial geometries (general), nets, partial spreads (51E14) Configuration theorems in linear incidence geometry (51A20) (n)-ary systems ((nge 3)) (20N15)

Related Items

Secret-sharing matroids need not be algebraic, On an infinite family of graphs with information ratio \(2 - 1/k\), Algebraic matroids are almost entropic, On ideal and weakly-ideal access structures, Finding lower bounds on the complexity of secret sharing schemes by linear programming, Ideal multipartite secret sharing schemes, Representability of matroids by \(c\)-arrangements is undecidable, Ideal hierarchical secret sharing and lattice path matroids, Common information, matroid representation, and secret sharing for matroid ports, The free product of M-fuzzifying matroids1, Ideal Secret Sharing Schemes for Useful Multipartite Access Structures, On ideal homomorphic secret sharing schemes and their decomposition, Extending Brickell-Davenport theorem to non-perfect secret sharing schemes, On secret sharing schemes, matroids and polymatroids, Classes of matroids closed under minors and principal extensions, 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, Ideal Hierarchical Secret Sharing Schemes, An impossibility result on graph secret sharing, Secret sharing schemes for ports of matroids of rank 3, A note on representing dowling geometries by partitions

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
• 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
• Irreducible Belousov equations on quasigroups
• 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