C. Krattenthaler

activity

19972005

most citedOn the number of fully packed loop configurations with a fixed associated matching

1 citations · 1 across the 13 of their papers we have counts for

collaborators

Showing 2000Show all

4 papers · 1 filter

math.RA2000

Enumeration of ad-nilpotent $b$ -ideals for simple Lie algebras

Christian Krattenthaler, Luigi Orsina, Paolo Papi

We provide explicit formulas for the number of ad-nilpotent ideals of a Borel subalgebra of a complex simple Lie algebra having fixed class of nilpotence.

math.CO2000

A non-automatic (!) application of Gosper's algorithm evaluates a determinant from tiling enumeration

Mihai Ciucu, Christian Krattenthaler

We evaluate the determinant $det_{1 \leq i, j \leq n} ((x - i + 2 j x + y + j) - (x + i + 2 j x + y + j))$ , which gives the number of lozenge tilings of a hexagon with cut off corners. A pa…

math.RA2000

Rectangular Scott-type Permanents

Guo-Niu Han, Christian Krattenthaler

Let $x_{1}, x_{2}, ..., x_{n}$ be the zeroes of a polynomial P(x) of degree n and $y_{1}, y_{2}, ..., y_{m}$ be the zeroes of another polynomial Q(y) of degree m. Our object of study is the permanen…

math.CO2000

Permutations with restricted patterns and Dyck paths

Christian Krattenthaler

We exhibit a bijection between 132-avoiding permutations and Dyck paths. Using this bijection, it is shown that all the recently discovered results on generating functions for 132-…

Enumeration of ad-nilpotent b-ideals for simple Lie algebras

A non-automatic (!) application of Gosper's algorithm evaluates a determinant from tiling enumeration

Rectangular Scott-type Permanents

Permutations with restricted patterns and Dyck paths

Enumeration of ad-nilpotent $b$ -ideals for simple Lie algebras