200 search results - page 1 / 40 » A combinatorial approach to the power of 2 in the number of ... |
JCT
2010
13 years 3 months ago
2010
COMBINATORICS
2007
13 years 4 months ago
2007
The known bijections on Dyck paths are either involutions or have notoriously intractable cycle structure. Here we present a size-preserving bijection on Dyck paths whose cycle st...
JCT
2010
13 years 3 months ago
2010
In the symmetric group on a set of size 2n, let P2n denote the conjugacy class of involutions with no fixed points (equivalently, we refer to these as “pairings”, since each ...
JCT
2007
13 years 4 months ago
2007
Given a sequence of integers b = (b0,b1,b2,...) one gives a Dyck path P of length 2n the weight wt(P) = bh1 bh2 ···bhn , where hi is the height of the ith ascent of P. The corr...
CEC
2010
IEEE
13 years 2 months ago
2010
IEEE
Extremal optimisation (EO) is a relatively recent nature-inspired heuristic whose search method is especially suitable to solve combinatorial optimisation problems. To date, most o...