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
    Electronic Resource
    Electronic Resource
    Springer
    Mathematische Annalen 310 (1998), S. 379-393 
    ISSN: 1432-1807
    Keywords: Mathematics Subject Classification (1991): 14K25, 14K05, 14K10, 14N05
    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 ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Algebra universalis 30 (1993), S. 301-310 
    ISSN: 1420-8911
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper we show that the set of closure relations on a finite posetP forms a supersolvable lattice, as suggested by Rota. Furthermore this lattice is dually isomorphic to the lattice of closed sets in a convex geometry (in the sense of Edelman and Jamison [EJ]). We also characterize the modular elements of this lattice (whenP has a greatest element) and compute its characteristic polynomial.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Archiv der Mathematik 65 (1995), S. 475-480 
    ISSN: 1420-8938
    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 ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Order 16 (1999), S. 165-170 
    ISSN: 1572-9273
    Keywords: lattices ; order complex ; order dimension ; topology of posets
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We prove that if a finite lattice L has order dimension at most d, then the homology of the order complex of its proper part L ○ vanishes in dimensions d − 1 and higher. If L can be embedded as a join-sublattice in N d , then L ○ actually has the homotopy type of a simplicial complex with d vertices.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Journal of algebraic combinatorics 11 (2000), S. 135-154 
    ISSN: 1572-9192
    Keywords: minimal free resolution ; matching complex ; chessboard complex ; determinantal ideal
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We generalize work of Lascoux and Józefiak-Pragacz-Weyman on Betti numbers for minimal free resolutions of ideals generated by 2 × 2 minors of generic matrices and generic symmetric matrices, respectively. Quotients of polynomial rings by these ideals are the classical Segre and quadratic Veronese subalgebras, and we compute the analogous Betti numbers for some natural modules over these Segre and quadratic Veronese subalgebras. Our motivation is two-fold: • We immediately deduce from these results the irreducible decomposition for the symmetric group action on the rational homology of all chessboard complexes and complete graph matching complexes as studied by Björner, Lovasz, Vrećica and Živaljević. This follows from an old observation on Betti numbers of semigroup modules over semigroup rings described in terms of simplicial complexes. • The class of modules over the Segre rings and quadratic Veronese rings which we consider is closed under the operation of taking canonical modules, and hence exposes a pleasant symmetry inherent in these Betti numbers.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Journal of algebraic combinatorics 12 (2000), S. 6-6 
    ISSN: 1572-9192
    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 ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Journal of algebraic combinatorics 4 (1995), S. 331-351 
    ISSN: 1572-9192
    Keywords: reduced words ; Knuth equivalence ; Specht module ; Schubert polynomial
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We study a map called plactification from reduced words to words. This map takes Coxeter-Knuth equivalence to Knuth equivalence, and has applications to the enumeration of reduced words, Schubert polynomials and certain Specht modules.
    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
    Mathematische Zeitschrift 235 (2000), S. 315-334 
    ISSN: 0025-5874
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract. We investigate the vertex-connectivity of the graph of f-monotone paths on a d-polytopeP with respect to a generic functionalf. The third author has conjectured that this graph is always (d $-1$ )-connected. We resolve this conjecture positively for simple polytopes and show that the graph is 2-connected for any d-polytope with $d \geq 3$ . However, we disprove the conjecture in general by exhibiting counterexamples for each $d \geq 4$ in which the graph has a vertex of degree two. We also re-examine the Baues problem for cellular strings on polytopes, solved by Billera, Kapranov and Sturmfels. Our analysis shows that their positive result is a direct consequence of shellability of polytopes and is therefore less related to convexity than is at first apparent.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    Publication Date: 2014-02-26
    Description: \def\KPA{\hbox{\rm KPA}}\def\A{{\rm A}}\def\KPW{\hbox{\rm KPW}}\def\W{{\rm W}}\def\B{{\rm B}} \def\D{{\rm D}} Recently M.~M.~Kapranov [Kap] defined a poset $\KPA_{n-1}$, called the {\it permuto-associahedron}, which is a hybrid between the face poset of the permutahedron and the associahedron. Its faces correspond to the partially parenthesized, ordered, partitions of the set $\{1,2,\ldots,n\}$, with a natural partial order. Kapranov showed that $\KPA_{n-1}$ is the face poset of a CW-ball, and explored its connection with a category-theoretic result of MacLane, Drinfeld's work on the Knizhnik-Zamolodchikov equations, and a certain moduli space of curves. He also asked the question of whether this CW-ball can be realized as a convex polytope. We show that this permuto-associahedron corresponds to the type $\A_{n-1}$ in a family of convex polytopes $\KPW$ associated to each of the classical Coxeter groups, $\W = \A_{n-1}, \B_n, \D_n$. The embedding of these polytopes relies on the secondary polytope construction of the associahedron due to Gel'fand, Kapranov, and Zelevinsky. Our proofs yield integral coordinates, with all vertices on a sphere, and include a complete description of the facet-defining inequalities. Also we show that for each $\W$, the dual polytope $\KPW^*$ is a refinement (as a CW-complex) of the Coxeter complex associated to $\W$, and a coarsening of the barycentric subdivision of the Coxeter complex. In the case $\W=\A_{n-1}$, this gives an elementary proof of Kapranov's original sphericity result.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    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...