{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T00:30:10Z","timestamp":1767141010432,"version":"build-2238731810"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,5,31]],"date-time":"2017-05-31T00:00:00Z","timestamp":1496188800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s00493-017-3534-y","type":"journal-article","created":{"date-parts":[[2018,8,30]],"date-time":"2018-08-30T01:20:15Z","timestamp":1535592015000},"page":"935-954","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Classes of Matroids Closed Under Minors and Principal Extensions"],"prefix":"10.1007","volume":"38","author":[{"given":"Franti\u0161ek","family":"Mat\u00fa\u0161","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,31]]},"reference":[{"key":"3534_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6666-3","volume-title":"Combinatorial Theory","author":"M. Aigner","year":"1979","unstructured":"M. Aigner: Combinatorial Theory. Springer-Verlag, Berlin 1979."},{"key":"3534_CR2","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-642-20901-7_2","volume":"6639","author":"A. Beimel","year":"2011","unstructured":"A. Beimel: Secret-sharing schemes: a survey, Coding and Cryptology, Lecture Notes in Comp. Science 6639, Springer-Verlag, Berlin, 11\u201346, 2011.","journal-title":"Coding and Cryptology, Lecture Notes in Comp. Science"},{"key":"3534_CR3","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/978-3-642-54242-8_17","volume":"8349","author":"A. Beimel","year":"2014","unstructured":"A. Beimel, A.M. Ben-Efraim, C. Padr\u00f3 and I. Tomkin: Multi-linear secret sharing schemes, Theory of Cryptography, Lecture Notes in Comp. Science 8349, Springer-Verlag, Berlin, 394\u2013418, 2014.","journal-title":"Theory of Cryptography, Lecture Notes in Comp. Science"},{"key":"3534_CR4","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1109\/18.335890","volume":"40","author":"A. Beimel","year":"1994","unstructured":"A. Beimel and B. Chor: Universally ideal secret-sharing schemes, IEEE Trans. Inf. Theory 40 (1994), 786\u2013794.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3534_CR5","doi-asserted-by":"publisher","first-page":"2136","DOI":"10.1016\/j.disc.2016.02.012","volume":"339","author":"A. Ben-Efraim","year":"2016","unstructured":"A. Ben-Efraim: Secret-sharing matroids need not be algebraic, Disc. Math. 339 (2016), 2136\u20132145.","journal-title":"Disc. Math."},{"key":"3534_CR6","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF00196772","volume":"4","author":"E. F. Brickell","year":"1991","unstructured":"E. F. Brickell and D. M. Davenport: On the classification of ideal secret sharing schemes, J. Cryptology 4 (1991), 123\u2013134.","journal-title":"J. Cryptology"},{"key":"3534_CR7","volume-title":"Matroids and Combinatorial Geometries","author":"T. Brylawski","year":"1980","unstructured":"T. Brylawski and D. Kelly: Matroids and Combinatorial Geometries, Carolina Lecture Series, Department of Mathematics, Univ. of North Carolina at Chapel Hill, 1980."},{"key":"3534_CR8","doi-asserted-by":"publisher","first-page":"1949","DOI":"10.1109\/TIT.2007.896862","volume":"53","author":"R. Dougherty","year":"2007","unstructured":"R. Dougherty, Ch. Freiling and K. Zeger: Networks, matroids, and non-Shannon information inequalities, IEEE Trans. Inf. Theory 53 (2007), 1949\u20131969.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3534_CR9","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0019-9958(78)91063-X","volume":"39","author":"S. Fujishige","year":"1978","unstructured":"S. Fujishige: Polymatroidal dependence structure of a set of random variables, Information and Control 39 (1978), 55\u201372.","journal-title":"Information and Control"},{"key":"3534_CR10","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1016\/j.aam.2008.05.002","volume":"41","author":"J. Geelen","year":"2008","unstructured":"J. Geelen: Some open problems on excluding a uniform matroid, Adv. Appl. Math. 41 (2008), 628\u2013637.","journal-title":"Adv. Appl. Math."},{"key":"3534_CR11","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1090\/noti1139","volume":"61","author":"J. Geelen","year":"2014","unstructured":"J. Geelen, B. Gerards and G. Whittle: Solving Rota's conjecture, Notices AMS 61 (2014), 736\u2013743.","journal-title":"Notices AMS"},{"key":"3534_CR12","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/0095-8956(88)90096-2","volume":"44","author":"G. Gordon","year":"1988","unstructured":"G. Gordon: Algebraic characteristic sets of matroids, J. Comb. Th. B 44 (1988), 64\u201374.","journal-title":"J. Comb. Th. B"},{"key":"3534_CR13","first-page":"62","volume":"211","author":"A. W. Ingleton","year":"1971","unstructured":"A. W. Ingleton: Conditions for representability and transversality of matroids, Proc. Fr. Br. Conf. 1970, Springer Lecture Notes 211, Springer-Verlag, Berlin, 62\u201367, 1971.","journal-title":"Proc. Fr. Br. Conf. 1970"},{"key":"3534_CR14","first-page":"149","volume-title":"Combinatorial Mathematics and its Applications","author":"A. W. Ingleton","year":"1971","unstructured":"A. W. Ingleton: Representation of matroids, Combinatorial Mathematics and its Applications (D.J.A. Welsh, ed.), Academic Press, London, 149\u2013167, (1971)."},{"key":"3534_CR15","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1112\/blms\/7.2.144","volume":"7","author":"A. W. Ingleton","year":"1975","unstructured":"A. W. Ingleton and R. A. Main: Non-algebraic matroids exist, Bull. London Math. Soc. 7 (1975), 144\u2013146.","journal-title":"Bull. London Math. Soc."},{"key":"3534_CR16","volume-title":"Matroid theory for algebraic geometers","author":"E. Katz","year":"2014","unstructured":"E. Katz: Matroid theory for algebraic geometers, (2014). (arXiv:1409.3503)"},{"key":"3534_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0041-0","volume-title":"Algebra","author":"S. Lang","year":"2002","unstructured":"S. Lang: Algebra, Oxford University Press, Oxford, 2002."},{"key":"3534_CR18","first-page":"21","volume":"33","author":"T. Lazarson","year":"1968","unstructured":"T. Lazarson: The representation problem for independence functions, J. London Math. Soc. 33 (1968), 21\u201325.","journal-title":"J. London Math. Soc."},{"key":"3534_CR19","first-page":"95","volume":"16","author":"B. Lindstr\u00f6m","year":"1983","unstructured":"B. Lindstr\u00f6m: The non-Pappus matroid is algebraic, Ars Combin. 16 (1983), 95\u201396.","journal-title":"Ars Combin."},{"key":"3534_CR20","first-page":"255","volume":"32","author":"B. Lindstr\u00f6m","year":"1987","unstructured":"B. Lindstr\u00f6m: A class of non-algebraic matroids of rank three, Geometriae Dedic. 32 (1987), 255\u2013258.","journal-title":"Geometriae Dedic."},{"key":"3534_CR21","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF02122556","volume":"8","author":"B. Lindstr\u00f6m","year":"1988","unstructured":"B. Lindstr\u00f6m: A generalization of the Ingleton-Main lemma and a class of nonalgebraic matroids, Combinatorica 8 (1988), 87\u201390.","journal-title":"Combinatorica"},{"key":"3534_CR22","volume-title":"Algebraic, Extremal and Metric Combinatorics","author":"B. Lindstr\u00f6m","year":"1988","unstructured":"B. Lindstr\u00f6m: Matroids, algebraic and non-algebraic, in: Algebraic, Extremal and Metric Combinatorics, (M-M. Deza, P. Frankl and I.G. Rosenberg, eds.) Cambridge University Press, Cambridge, New York, (1988)."},{"key":"3534_CR23","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/0012-365X(93)90170-X","volume":"111","author":"B. Lindstr\u00f6m","year":"1993","unstructured":"B. Lindstr\u00f6m: On algebraic matroids, Discrete Math. 111 (1993), 357\u2013359.","journal-title":"Discrete Math."},{"key":"3534_CR24","first-page":"234","volume-title":"Mathematical Programming\u2013The State of the Art","author":"L. Lov\u00e1sz","year":"1982","unstructured":"L. Lov\u00e1sz: Submodular functions and convexity, in: Mathematical Programming\u2013The State of the Art (A. Bachem, M. Gr\u00f6tchel and B. Korte, eds.) Springer-Verlag, Berlin, 234\u2013257, (1982)."},{"key":"3534_CR25","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1515\/jmc.2010.004","volume":"4","author":"J. Mart\u00ed-Farr\u00e9","year":"2010","unstructured":"J. Mart\u00ed-Farr\u00e9 and C. Padr\u00f3: On secret sharing schemes, matroids and polymatroids, J. of Mathematical Cryptology 4 (2010), 95\u2013120.","journal-title":"J. of Mathematical Cryptology"},{"key":"3534_CR26","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1080\/03081079308935205","volume":"22","author":"F. Mat\u00fa\u0161","year":"1994","unstructured":"F. Mat\u00fa\u0161: Probabilistic conditional independence structures and matroid theory: background, Int. J. of General Systems 22 (1994), 185\u2013196.","journal-title":"Int. J. of General Systems"},{"key":"3534_CR27","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/S0012-365X(99)00004-7","volume":"203","author":"F. Mat\u00fa\u0161","year":"1999","unstructured":"F. Mat\u00fa\u0161: Matroid representations by partitions, Discrete Math. 203 (1999), 169\u2013194.","journal-title":"Discrete Math."},{"key":"3534_CR28","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1109\/TIT.2006.887090","volume":"53","author":"F. Mat\u00fa\u0161","year":"2007","unstructured":"F. Mat\u00fa\u0161: Two constructions on limits of entropy functions, IEEE Trans. Inf. Th. 53 (2007), 320\u2013330.","journal-title":"IEEE Trans. Inf. Th."},{"key":"3534_CR29","doi-asserted-by":"publisher","first-page":"2464","DOI":"10.1016\/j.disc.2006.11.013","volume":"307","author":"F. Mat\u00fa\u0161","year":"2007","unstructured":"F. Mat\u00fa\u0161: Adhesivity of polymatroids, Discrete Math. 307 (2007), 2464\u20132477.","journal-title":"Discrete Math."},{"key":"3534_CR30","doi-asserted-by":"publisher","first-page":"6007","DOI":"10.1109\/TIT.2016.2601598","volume":"62","author":"F. Mat\u00fa\u0161","year":"2016","unstructured":"F. Mat\u00fa\u0161 and L. Csirmaz: Entropy region and convolution, IEEE Trans. Inform. Theory 62 (2016), 6007\u20136018.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"3534_CR31","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/j.jctb.2008.12.003","volume":"99","author":"D. Mayhew","year":"2009","unstructured":"D. Mayhew, M. Newman and G. Whittle: On excluded minors for realrepresentativity, J. Comb. Th. B 99 (2009), 685\u2013689.","journal-title":"J. Comb. Th. B"},{"key":"3534_CR32","volume-title":"Submodular Functions and Electrical Networks","author":"H. Narayan","year":"1997","unstructured":"H. Narayan: Submodular Functions and Electrical Networks, Elsevier, Amsterdam, 1997."},{"key":"3534_CR33","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566946.001.0001","volume-title":"Matroid Theory","author":"J. G. Oxley","year":"2011","unstructured":"J. G. Oxley: Matroid Theory (Second Edition), Oxford Graduate Texts in Mathematics 21 Oxford University Press, Oxford, 2011."},{"key":"3534_CR34","first-page":"201","volume":"50","author":"R. A. Pendavingh","year":"2013","unstructured":"R. A. Pendavingh and S. H. M. van Zwam: Skew partial fields, multilinear representations of matroids, and a matrix tree theorem, Advances in Applied Mathematics 50 (2013), 201\u2013227.","journal-title":"multilinear representations of matroids, and a matrix tree theorem, Advances in Applied Mathematics"},{"key":"3534_CR35","first-page":"229","volume-title":"Proc. Internat. Cong. Math.","author":"G.-C. Rota","year":"1971","unstructured":"G.-C. Rota: Combinatorial theory, old and new, in: Proc. Internat. Cong. Math. Gauthier-Villars, Paris, 229\u2013233, 1971."},{"key":"3534_CR36","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0095-8956(92)90007-K","volume":"56","author":"P. D. Seymour","year":"1992","unstructured":"P. D. Seymour: On secret-sharing matroids, J. Comb. Theory B 56 (1992), 69\u201373.","journal-title":"J. Comb. Theory B"},{"key":"3534_CR37","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1023\/A:1008244215660","volume":"14","author":"J. Simonis","year":"1998","unstructured":"J. Simonis and A. Ashikhmin: Almost affine codes, Designs, Codes and Crypt. 14 (1998), 179\u2013197.","journal-title":"Designs, Codes and Crypt."},{"key":"3534_CR38","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s00026-015-0250-4","volume":"19","author":"D. Vertigan","year":"2015","unstructured":"D. Vertigan: Dowling geometries representable over rings, Annals of Comb. 19 (2015), 225\u2013233.","journal-title":"Annals of Comb."},{"key":"3534_CR39","volume-title":"Matroid Theory","author":"D. J. A. Welsh","year":"1976","unstructured":"D. J. A. Welsh: Matroid Theory, Academic Press, London, 1976."},{"key":"3534_CR40","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8608-5","volume-title":"A First Course in Information Theory","author":"R. W. Yeung","year":"2002","unstructured":"R. W. Yeung: A First Course in Information Theory, Kluwer Publishers, New York, 2002."},{"key":"3534_CR41","doi-asserted-by":"publisher","first-page":"1982","DOI":"10.1109\/18.641561","volume":"43","author":"Z. Zhang","year":"1997","unstructured":"Z. Zhang and R. W. Yeung: A non-Shannon-type conditional inequality of information quantities, IEEE Trans. Information Theory 43 (1997), 1982\u20131986.","journal-title":"IEEE Trans. Information Theory"},{"key":"3534_CR42","doi-asserted-by":"publisher","first-page":"1440","DOI":"10.1109\/18.681320","volume":"44","author":"Z. Zhang","year":"1998","unstructured":"Z. Zhang and R. W. Yeung: On characterization of entropy function via information inequalities, IEEE Trans. Information Theory 44 (1998), 1440\u20131452.","journal-title":"IEEE Trans. Information Theory"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-017-3534-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-017-3534-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-017-3534-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,8]],"date-time":"2020-11-08T08:27:46Z","timestamp":1604824066000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-017-3534-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,31]]},"references-count":42,"aliases":["10.1007\/s00493-016-3534-y"],"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["3534"],"URL":"https:\/\/doi.org\/10.1007\/s00493-017-3534-y","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,31]]}}}