Ngày tải lên :
08/08/2014, 01:20
... follows for (π, f ) ∈ S
n,A
: If R
(π,f)
= ∅, let φ((π, f)) = (π, f).
Otherwise, let (i, j) ∈ R
(π,f)
be minimal under the lexicographic ordering of R
(π,f)
. Let
˜π = (i, j) ◦ π, the product of the ... by
˜
f(K
˜π
(p)) = f(K
π
(p)) for all 1 p n. Let φ((π, f)) = (˜π,
˜
f).
Note that R
(π,f)
= R
φ((π,f ))
for all (π, f) ∈ S
n,A
, and that therefore φ is involutive.
Note further that, if (π, f) = ... Cambridge
Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 1997.
With a foreword by Gian-Carlo Rota, Corrected reprint of the 1986 original.
the electronic journal of combinatorics...