排序方式: 共有110条查询结果,搜索用时 31 毫秒
81.
Let Φ be an irreducible crystallographic root system with Weyl group W and coroot lattice
, spanning a Euclidean space V. Let m be a positive integer and
be the arrangement of hyperplanes in V of the form
for
and
. It is known that the number
of bounded dominant regions of
is equal to the number of facets of the positive part
of the generalized cluster complex associated to the pair
by S. Fomin and N. Reading.
We define a statistic on the set of bounded dominant regions of
and conjecture that the corresponding refinement of
coincides with the $h$-vector of
. We compute these refined numbers for the classical root systems as well as for all root systems when m = 1 and verify the conjecture when Φ has type A, B or C and when m = 1. We give several combinatorial interpretations to these numbers in terms of chains of order ideals in the root poset of Φ,
orbits of the action of W on the quotient
and coroot lattice points inside a certain simplex, analogous to the ones given by the first author in the case of the set
of all dominant regions of
. We also provide a dual interpretation in terms of order filters in the root poset of Φ in the special case m = 1.
2000 Mathematics Subject Classification Primary—20F55; Secondary—05E99, 20H15 相似文献
82.
83.
George E. Andrews Christian Krattenthaler Luigi Orsina Paolo Papi 《Transactions of the American Mathematical Society》2002,354(10):3835-3853
We study the combinatorics of -nilpotent ideals of a Borel subalgebra of . We provide an inductive method for calculating the class of nilpotence of these ideals and formulas for the number of ideals having a given class of nilpotence. We study the relationships between these results and the combinatorics of Dyck paths, based upon a remarkable bijection between -nilpotent ideals and Dyck paths. Finally, we propose a -analogue of the Catalan number . These -Catalan numbers count, on the one hand, -nilpotent ideals with respect to dimension and class of nilpotence and, on the other hand, admit interpretations in terms of natural statistics on Dyck paths.
84.
In this paper we provide some relationships between Catalan's constant and the 3F2 and 4F3 hypergeometric functions, deriving them from some parametric integrals. In particular, using the complete elliptic integral of the first kind, we found an alternative proof of a result of Ramanujan for 3F2, a second identity related to 4F3 and using the complete elliptic integral of the second kind we obtain an identity by Adamchik. 相似文献
85.
We introduce a rational function C
n(q, t) and conjecture that it always evaluates to a polynomial in q, t with non-negative integer coefficients summing to the familiar Catalan number
. We give supporting evidence by computing the specializations
and C
n
(q) = C
n(q,1) = C
n(1,q). We show that, in fact, D
n(q) q-counts Dyck words by the major index and C
n(q) q-counts Dyck paths by area. We also show that C
n(q, t) is the coefficient of the elementary symmetric function e
nin a symmetric polynomial DHn(x; q, t) which is the conjectured Frobenius characteristic of the module of diagonal harmonic polynomials. On the validity of certain conjectures this yields that C
n(q, t) is the Hilbert series of the diagonal harmonic alternants. It develops that the specialization DHn(x; q, 1) yields a novel and combinatorial way of expressing the solution of the q-Lagrange inversion problem studied by Andrews [2], Garsia [5] and Gessel [11]. Our proofs involve manipulations with the Macdonald basis {P
(x; q, t)} which are best dealt with in -ring notation. In particular we derive here the -ring version of several symmetric function identities.Work carried out under NSF grant support. 相似文献
86.
Alexander Postnikov 《Journal of Combinatorial Theory, Series A》2007,114(5):970-977
Given a sequence of integers b=(b0,b1,b2,…) one gives a Dyck path P of length 2n the weight
wt(P)=bh1bh2?bhn, 相似文献
87.
《Discrete Mathematics》2023,346(3):113247
A 3-dimensional Catalan word is a word on three letters so that the subword on any two letters is a Dyck path. For a given Dyck path D, a recently defined statistic counts the number of Catalan words with the property that any subword on two letters is exactly D. In this paper, we enumerate Dyck paths with this statistic equal to certain values, including all primes. The formulas obtained are in terms of Motzkin numbers and Motzkin ballot numbers. 相似文献
88.
In this paper, we consider combinatorial numbers , mentioned as Catalan triangle numbers where . These numbers unify the entries of the Catalan triangles and for appropriate values of parameters and , i.e., and . In fact, these numbers are suitable rearrangements of the known ballot numbers and some of these numbers are the well-known Catalan numbers that is .We present identities for sums (and alternating sums) of , squares and cubes of and, consequently, for and . In particular, one of these identities solves an open problem posed in Gutiérrez et al. (2008). We also give some identities between and harmonic numbers . Finally, in the last section, new open problems and identities involving are conjectured. 相似文献
89.
Merlini and Sprugnoli (2017) give both an algebraic and a combinatorial proof for an identity proposed by Louis Shapiro by using Riordan arrays and a particular model of lattice paths. In this paper, we revisit the identity and emphasize the use of colored partial Motzkin paths as appropriate tool. By using colored Motzkin paths with weight defined according to the height of its last point, we can generalize the identity in several ways. These identities allow us to move from Fibonacci polynomials, Lucas polynomials, and Chebyshev polynomials, to the polynomials of the form . 相似文献
90.
《Discrete Mathematics》2022,345(11):113065