메뉴 건너뛰기




Volumn 118, Issue 1, 2011, Pages 152-161

New inequalities for subspace arrangements

Author keywords

Matroids; Polymatroids; Rank functions; Realizable; Subspace arrangements

Indexed keywords


EID: 78149410461     PISSN: 00973165     EISSN: 10960899     Source Type: Journal    
DOI: 10.1016/j.jcta.2009.10.014     Document Type: Article
Times cited : (34)

References (11)
  • 1
    • 0141542021 scopus 로고    scopus 로고
    • A Course in Convexity
    • Amer. Math. Soc., Providence, RI
    • Barvinok Alexander A Course in Convexity. Grad. Stud. Math. 2002, vol. 54. Amer. Math. Soc., Providence, RI.
    • (2002) Grad. Stud. Math. , vol.54
    • Barvinok, A.1
  • 2
    • 0001360427 scopus 로고
    • Constructions
    • Cambridge Univ. Press, Cambridge, Theory of Matroids
    • Brylawski Thomas Constructions. Encyclopedia Math. Appl. 1986, vol. 26:127-223. Cambridge Univ. Press, Cambridge.
    • (1986) Encyclopedia Math. Appl. , vol.26 , pp. 127-223
    • Brylawski, T.1
  • 3
    • 33846049315 scopus 로고    scopus 로고
    • Randall Dougherty, Chris Freiling, Kenneth Zeger, Six new non-shannon information inequalities, in: IEEE International Symposium on Information Theory, Seattle, Washington
    • Randall Dougherty, Chris Freiling, Kenneth Zeger, Six new non-shannon information inequalities, in: IEEE International Symposium on Information Theory, Seattle, Washington, 2006, pp. 233-236.
    • (2006) , pp. 233-236
  • 5
    • 0033872924 scopus 로고    scopus 로고
    • Inequalities for Shannon entropy and Kolmogorov complexity
    • (part 2), Twelfth Annual IEEE Conference on Computational Complexity
    • Hammer Daniel, Romashchenko Andrei, Shen Alexander, Vereshchagin Nikolai Inequalities for Shannon entropy and Kolmogorov complexity. J. Comput. System Sci. 2000, 60(2):442-464. (part 2).
    • (2000) J. Comput. System Sci. , vol.60 , Issue.2 , pp. 442-464
    • Hammer, D.1    Romashchenko, A.2    Shen, A.3    Vereshchagin, N.4
  • 7
    • 51649097192 scopus 로고    scopus 로고
    • František Matúš, Infinitely many information inequalities, in: IEEE International Symposium on Information Theory, Nice, France, June
    • František Matúš, Infinitely many information inequalities, in: IEEE International Symposium on Information Theory, Nice, France, June 2007, pp. 41-44.
    • (2007) , pp. 41-44
  • 9
    • 0004236843 scopus 로고
    • Axiom systems
    • Cambridge Univ. Press, Cambridge, Theory of Matroids
    • Nicoletti Giorgio, White Neil Axiom systems. Encyclopedia Math. Appl. 1986, vol. 26:29-44. Cambridge Univ. Press, Cambridge.
    • (1986) Encyclopedia Math. Appl. , vol.26 , pp. 29-44
    • Nicoletti, G.1    White, N.2
  • 10
    • 0003306141 scopus 로고    scopus 로고
    • Enumerative Combinatorics, vol. 1
    • Cambridge Univ. Press, Cambridge, with a foreword by Gian-Carlo Rota, corrected reprint of the 1986 original
    • Stanley Richard P. Enumerative Combinatorics, vol. 1. Cambridge Stud. Adv. Math. 1997, vol. 49. Cambridge Univ. Press, Cambridge, with a foreword by Gian-Carlo Rota, corrected reprint of the 1986 original.
    • (1997) Cambridge Stud. Adv. Math. , vol.49
    • Stanley, R.P.1
  • 11
    • 0032124111 scopus 로고    scopus 로고
    • On characterization of entropy function via information inequalities
    • Zhang Zhen, Yeung Raymond On characterization of entropy function via information inequalities. IEEE Trans. Inform. Theory July 1998, 44(4):1440-1452.
    • (1998) IEEE Trans. Inform. Theory , vol.44 , Issue.4 , pp. 1440-1452
    • Zhang, Z.1    Yeung, R.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.