5 search results - page 1 / 1 » On the combinatorial invariance of Kazhdan-Lusztig polynomia... |
JCT
2006
13 years 11 months ago
2006
We prove that the Kazhdan-Lusztig polynomials are combinatorial invariants for intervals up to length 8 in Coxeter groups of type A and up to length 6 in Coxeter groups of type B a...
JCT
2011
13 years 6 months ago
2011
We consider integrals of type On ua1 11 . . . uan 1nub1 21 . . . ubn 2n du, with respect to the Haar measure on the orthogonal group. We establish several remarkable invariance pro...
DCG
1998
13 years 10 months ago
1998
It is proved that in R3 the volume of any polyhedron is a root of some polynomial with coefficients depending only on the combinatorial structure and the metric of the polyhedron....
TCS
2008
13 years 11 months ago
2008
We define a new cost model for the call-by-value lambda-calculus satisfying the invariance thesis. That is, under the proposed cost model, Turing machines and the call-by-value la...
JCT
2011
13 years 6 months ago
2011
We give combinatorial proofs of the formulas for the number of multichains in the k-divisible noncrossing partitions of classical types with certain conditions on the rank and the ...