Sciweavers

692 search results - page 5 / 139
» Combinatorics of Partial Derivatives
Sort
View
COMBINATORICS
2007
81views more  COMBINATORICS 2007»
13 years 10 months ago
The m-Colored Composition Poset
We define a partial order on colored compositions with many properties analogous to Young’s lattice. We show that saturated chains correspond to colored permutations, and that ...
Brian Drake, T. Kyle Petersen
CORR
2008
Springer
158views Education» more  CORR 2008»
13 years 10 months ago
Declarative Combinatorics: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell
This paper is an exploration in a functional programming framework of isomorphisms between elementary data types (natural numbers, sets, finite functions, permutations binary deci...
Paul Tarau
COMBINATORICS
2002
93views more  COMBINATORICS 2002»
13 years 10 months ago
On a Theorem of Erdos, Rubin, and Taylor on Choosability of Complete Bipartite Graphs
Erdos, Rubin, and Taylor found a nice correspondence between the minimum order of a complete bipartite graph that is not r-choosable and the minimum number of edges in an r-unifor...
Alexandr V. Kostochka
COMBINATORICS
2004
99views more  COMBINATORICS 2004»
13 years 10 months ago
A Fast Algorithm for MacMahon's Partition Analysis
This paper deals with evaluating constant terms of a special class of rational functions, the Elliott-rational functions. The constant term of such a function can be read off immed...
Guoce Xin
COMBINATORICS
2006
113views more  COMBINATORICS 2006»
13 years 10 months ago
Tilings of the Sphere with Right Triangles II: The (1, 3, 2), (0, 2, n) Subfamily
Sommerville [8] and Davies [2] classified the spherical triangles that can tile the sphere in an edge-to-edge fashion. Relaxing this condition yields other triangles, which tile t...
Robert J. MacG. Dawson, Blair Doyle