Matroid representations by partitions

Discrete Mathematics

Volumn 203, Issue 1-3, 1999, Pages 169-194

  Matúš, František ^a,b  

^a BIELEFELD UNIVERSITY   (Germany)

^b INSTITUTE OF INFORMATION THEORY AND AUTOMATION   (Czech Republic)

Author keywords

Cardinality; Matroid; P Representation

Indexed keywords

EID: 0345884729     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(99)00004-7     Document Type: Article

References (48)

1. J. Aczél, Lectures on Functional Equations and their Applications, Academic Press, New York, 1966.
2. J. Aczél, Functional Equations: History, Applications and Theory, D. Reidel Publ. Company, Dordrecht, Boston, Lancaster, 1984.
3. J. Aczél, V.D. Belousov, M. Hosszú, Generalized associativity and bisymmetry on quasigroups, Acta Math. Acad. Sci. Hungaricae 11 (1960) 127-136.
4. M. Aigner, Combinatorial Theory, Springer, Berlin, 1979.
5. A. Beimel, B. Chor, Universally ideal secret-sharing schemes, IEEE Trans. Inform. Theory 40 (1994) 786-794.
6. V.D. Belousov, Systems of quasigroups with generalized identities, Russian Math. Surveys 20 (1965) 73-143.
7. G.R. Blakley, G.A. Kabatianski, Generalized ideal secret-sharing schemes and matroids, Problems Inform. Transmission 33 (1997) 277-284.
8. E.F. Brickell, D.M. Davenport, On the classification of ideal secret-sharing schemes, J. Cryptol. 4 (1991) 123-134.
9. T. Brylawski, Intersection theory for embeddings of matroids into uniform geometries, Stud. Appl. Math. 61 (1979) 211-244.
10. T. Brylawski, D. Kelly, Matroids and Combinatorial Geometries, Carolina Lecture Series, Department of Mathematics, Univ. of North Carolina at Chapel Hill, 1980.
11. R.H. Bruck, A Survey of Binary Systems, Springer, Berlin, 1966.
12. O. Chein, Moufang loops of small order, Mem. Amer. Math. Soc. 13 (1) (1978) 197.
13. L. Csirmaz, The dealer's random bits in perfect secret-sharing schemes, Studia Scient. Math. Hungarica 32 (1996) 429-437.
14. J. Dénes, A.D. Keedwell, Latin Squares and their Applications, Akadémiai Kiadó, Budapest; Academic Press, New York: English Universities Press, London, 1974.
15. J. Dénes, A.D. Keedwell, Latin Squares: New Developments in the Theory and Applications, North-Holland, Amsterdam, 1991.
16. L. Fook, T.P. Eng, Moufang loops of even order, J. Algeb. 164 (1994) 409-414.
17. S. Fujishige, Polymatroidal dependence structure of a set of random variables, Inform. Control 39 (1978) 55-72.
18. G. Gordon, Algebraic characteristic sets of matroids, J. Combin. Theory B 44 (1988) 64-74.
19. A.W. Ingleton, Conditions for representability and transversality of matroids, Proc. Fr. Br. Conf. 1970, Springer Lecture Notes, vol. 211, 1971, pp. 62-67.
20. A.W. Ingleton, Representation of matroids, in: D.J.A. Welsh (Eds.), Combinatorial Mathematics and its Applications. Academic Press, London, 1971, pp. 149-169.
21. W.-A. Jackson, K.M. Martin, Geometric secret sharing schemes and their duals, Des. Codes Cryptogr. 4 (1994) 83-95.
22. W.-A. Jackson, K.M. Martin, Combinatorial models for perfect secret sharing schemes, J. Combin. Math. Combin. Comput. (1998), in press.
23. J. Kahn, Characteristic sets of matroids, J. London Math. Soc. (2) 26 (1982) 207-217.
24. A. Krapež, M.A. Taylor, Irreducible Belousov equations on quasigroups, Czechoslovak Math. J. 43 (118) (1993) 157-175.
25. J.P.S. Kung, A Source Book in Matroid Theory, Birkhäuser, Boston, Basel, Stuttgart, 1986.
26. B. Lindström, A class of non-algebraic matroids of rank three, Geometriae Dedicata 32 (1987) 255-258.
27. B. Lindström, Matroids, algebraic and non-algebraic, in: M-M. Deza, P. Frankl, I.G. Rosenberg (Eds.), Algebraic, Extremal and Metric Combinatorics, Cambridge University Press, Cambridge, 1988.
28. B. Lindström, On algebraic matroids, Discrete Math. 111 (1993) 357-359.
29. S. MacLane, Some interpretations of abstract linear dependence in term of projective geometry, Amer. J. Math. 58 (1936) 236-240.
30. M. Liu, Z. Zhan, Ideal homomorphic secret sharing schemes over cyclic groups, Science in China, Ser. E, Vol. 41, No. 6; Beijing: Science in China Press, pp. 650-660, December 1998.
31. F.J. MacWilliams, N.J.A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1983.
32. F. Matúš, Ascending and descending conditional independence relations, Transactions of the 11th Prague Conf. on Information Theory, Statistical Decision Functions and Random Processes, Vol. B, Academia, Prague, also Kluwer, Dordrecht, 1992, pp. 189-200.
33. F. Matúš, Probabilistic conditional independence structures and matroid theory: background, Int. J. General Systems 22 (1994) 185-196.
34. F. Matúš, Conditional independences among four random variables II, Combin. Probab. Comput. 4 (1995) 407-417.
35. F. Matúš, Conditional independence structures examined via minors, The Ann. Math. AI 21 (1997) 99-128.
36. F. Matúš, Conditional independences among four random variables III, Combin. Probab. Comput. 8 (1999) 1-8.
37. F. Matúš, M. Studený, Conditional independences among four random variables I, Combin. Probab. Comput. 4 (1995) 269-278.
38. J.G. Oxley, Matroid Theory, Oxford University Press, Oxford, New York, Tokyo, 1992.
39. P.O. Seymour, On secret-sharing matroids, J. Combin. Theory B 56 (1992) 69-73.
40. J. Simonis, A. Ashikhmin, Almost affine codes, Designs, Codes Cryptography 14 (1998) 179-197.
41. M.A. Taylor, A generalization of a theorem of Belousov, Bull. London Math. Soc. 10 (1978) 285-286.
42. D.J.A. Welsh, Matroid Theory, Academic Press, London, 1976.
43. N. White (Ed.), Theory of Matroids, Cambridge University Press, Cambridge, 1986.
44. N. White (Ed.), Combinatorial Geometries, Cambridge University Press, Cambridge, 1987.
45. R.W. Yeung, A framework for information-theoretic inequalities, IEEE Trans. Inform. Theory 43 (1996) 1924-1934.
46. Z. Zhang, R.W. Yeung, A non-Shannon-type conditional inequality of information quantities, IEEE Trans. Inform. Theory 43 (1997) 1982-1986.
47. Z. Zhang, R.W. Yeung, On characterization of entropy function via information inequalities, IEEE Trans. Inform. Theory 44 (1998) 1440-1452.
48. G.M. Ziegler, Matroid representations and free arrangements, Trans. Amer. Math. Soc. 320 (1990) 325-341.