Sciweavers

371 search results - page 1 / 75
» Partition Theorems and Computability Theory
Sort
View
ALGORITHMICA
2006
63views more  ALGORITHMICA 2006»
13 years 6 months ago
A Local Limit Theorem in the Theory of Overpartitions
Abstract. An overpartition of an integer n is a partition where the last occurrence of a part can be overlined. We study the weight of the overlined parts of an overpartition count...
Sylvie Corteel, William M. Y. Goh, Pawel Hitczenko
BIRTHDAY
2009
Springer
14 years 22 days ago
On Path Partitions and Colourings in Digraphs
We provide a new proof of a theorem of Saks which is an extension of Greene’s Theorem to acyclic digraphs, by reducing it to a similar, known extension of Greene and Kleitman’s...
Irith Ben-Arroyo Hartman

Lecture Notes
841views
15 years 4 months ago
General Equilibrium Theory
These lecture notes cover several topics such as Topological Space, Metric Space, Convex Sets, Correspondences, Maximum Theorem, KKM Theorem, Existence of Maximal Element, Selectio...
Nicholas C. Yannelis
JCT
2002
54views more  JCT 2002»
13 years 5 months ago
Partition Identities and a Theorem of Zagier
In partition theory and q-series, one often seeks identities between series and infinite products. Using a recent result of Zagier, we obtain such identities for every positive int...
Jayce Getz, Karl Mahlburg