Browsing by Subject "combinatorics"
Now showing items 1-5 of 5
-
(2013-09-26)The classic derangement question of counting the number of derangements for n objects from some initial permutation of the objects was first considered by de Montfort in 1708. A particular recasting of a permutation allows ...
-
(2009-05-15)Parking functions have been a focus of mathematical research since the mid-1970s. Various generalizations have been introduced since the mid-1990s and deep relationships between these and other areas of mathematics have ...
-
(2015-05-07)Symmetry of monotone sequences arise in many combinatorial structures, the classical examples being inversions and coinversions in permutations. Another example is crossings and nestings in matchings, partitions and ...
-
(2019-07-12)A parking function can be thought of as a sequence of n drivers, each with a preferred parking space, wanting to park along a one-way street with n parking spaces. Each driver checks her preferred parking space and, if it ...
-
(2020-06-02)The interplay of algebra and combinatorics is fruitful in both fields: combinatorics provides algebraic structures with tractable realizations, while algebra underpins combinatorial objects with a rigorous framework. ...