Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Book
    Book
    Inc., Belmont, CA :Wadsworth,
    Title: Enumerative combinatorics
    Author: Stanley, Richard P.
    Publisher: Inc., Belmont, CA :Wadsworth,
    Year of publication: 1986
    Pages: 306 S.
    Series Statement: ¬The¬ Wadsworth & Brooks/Cole Mathematics Series
    Type of Medium: Book
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Book
    Book
    Basel u.a. :Birkhäuser,
    Title: Combinatorics and commutative algebra; 41
    Author: Stanley, Richard P.
    Publisher: Basel u.a. :Birkhäuser,
    Year of publication: 1996
    Pages: 164 S.
    Series Statement: Progress in mathematics 41
    Type of Medium: Book
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Discrete & computational geometry 1 (1986), S. 9-23 
    ISSN: 1432-0444
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Two convex polytopes, called theorder polytope ϑ(P) andchain polytope ℒ(P), are associated with a finite posetP. There is a close interplay between the combinatorial structure ofP and the geometric structure of ϑ(P). For instance, the order polynomial Ω(P, m) ofP and Ehrhart polynomiali(ϑ(P),m) of ϑ(P) are related by Ω(P, m+1)=i(ϑ(P),m). A “transfer map” then allows us to transfer properties of ϑ(P) to ℒ(P). In particular, we transfer known inequalities involving linear extensions ofP to some new inequalities.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Annals of combinatorics 2 (1998), S. 351-363 
    ISSN: 0219-3094
    Keywords: 05E99 ; spanning tree ; Matrix-Tree Theorem ; orthogonal geometry
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Kontsevich conjectured that the number of zeros over the fieldF q of a certain polynomialQ G associated with the spanning trees of a graphG is a polynomial function ofq. We show the connection between this conjecture, the Matrix-Tree Theorem, and orthogonal geometry. We verify the conjecture in certain cases, such as the complete graph, and discuss some modifications and extensions.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Oxford, UK : Blackwell Publishing Ltd
    Annals of the New York Academy of Sciences 576 (1989), S. 0 
    ISSN: 1749-6632
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Natural Sciences in General
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Oxford, UK : Blackwell Publishing Ltd
    Annals of the New York Academy of Sciences 555 (1989), S. 0 
    ISSN: 1749-6632
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Natural Sciences in General
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Oxford, UK : Blackwell Publishing Ltd
    Annals of the New York Academy of Sciences 440 (1985), S. 0 
    ISSN: 1749-6632
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Natural Sciences in General
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Inventiones mathematicae 68 (1982), S. 175-193 
    ISSN: 1432-1297
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Graphs and combinatorics 3 (1987), S. 55-66 
    ISSN: 1435-5914
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract I. Bárány and L. Lovász [Acta Math. Acad. Sci. Hung.40, 323–329 (1982)] showed that ad-dimensional centrally-symmetric simplicial polytopeP has at least 2 d facets, and conjectured a lower bound for the numberf i ofi-dimensional faces ofP in terms ofd and the numberf 0 =2n of vertices. Define integers $$h_0 ,...,h_d {\mathbf{ }}by{\mathbf{ }}\sum\limits_{i = 0}^d {f_{i - 1} } (x - 1)^{d - i} = \sum\limits_{i = 0}^d {h_i x^{d - i} } $$ A. Björner conjectured (unpublished) that $$h_i \geqslant \left( {\begin{array}{*{20}c} d \\ i \\ \end{array} } \right)$$ (which generalizes the result of Bárány-Lovász sincef d−1 =∑ h i ), and more strongly that $$h_i - h_{i - 1} \geqslant \left( {\begin{array}{*{20}c} d \\ i \\ \end{array} } \right) - \left( {\begin{array}{*{20}c} d \\ {i - 1} \\ \end{array} } \right),1 \leqslant i \leqslant \left\lfloor {{d \mathord{\left/ {\vphantom {d 2}} \right. \kern-\nulldelimiterspace} 2}} \right\rfloor $$ , which is easily seen to imply the conjecture of Bárány-Lovász. In this paper the conjectures of Björner are proved.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Order 1 (1984), S. 29-34 
    ISSN: 1572-9273
    Keywords: Primary 06A10 ; secondary 05C60 ; 20B25 ; Poset ; Peck poset ; Sperner property ; automorphism group ; quotient poset ; edge-reconstruction
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract An elementary, self-contained proof of a result of Pouzet and Rosenberg and of Harper is given. This result states that the quotient of certain posets (called unitary Peck) by a finite group of automorphisms retains some nice properties, including the Sperner property. Examples of unitary Peck posets are given, and the techniques developed here are used to prove a result of Lovász on the edge-reconstruction conjecture.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...