Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
DM
2011
228views Education» more  DM 2011»
10 years 8 months ago
The largest missing value in a composition of an integer
Archibald and Knopfmacher recently considered the largest missing value in a composition of an integer and established mean and variance. Our alternative, probabilistic approach p...
Margaret Archibald, Arnold Knopfmacher
JCT
2002
54views more  JCT 2002»
11 years 1 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
COMBINATORICS
2000
96views more  COMBINATORICS 2000»
11 years 1 months ago
Bijections for Hook Pair Identities
Short, bijective proofs of identities for multisets of `hook pairs' (arm-leg pairs) of the cells of certain diagrams are given. These hook pair identities were originally foun...
Christian Krattenthaler
JCT
2007
90views more  JCT 2007»
11 years 1 months ago
Overpartitions, lattice paths, and Rogers-Ramanujan identities
We define the notions of successive ranks and generalized Durfee squares for overpartitions. We show how these combinatorial statistics give extensions to overpartitions of combin...
Sylvie Corteel, Olivier Mallet
JCT
2007
141views more  JCT 2007»
11 years 1 months ago
Partition identities and Ramanujan's modular equations
We show that certain modular equations and theta function identities of Ramanujan imply elegant partition identities. Several of the identities are for t-cores. Key Words: partitio...
Nayandeep Deka Baruah, Bruce C. Berndt
JCT
2008
59views more  JCT 2008»
11 years 1 months ago
Partition identities and the coin exchange problem
The number of partitions of n into parts divisible by a or b equals the number of partitions of n in which each part and each difference of two parts is expressible as a non-negati...
Alexander E. Holroyd
JCT
2008
78views more  JCT 2008»
11 years 1 months ago
A partition bijection related to the Rogers-Selberg identities and Gordon's theorem
We provide a bijective map from the partitions enumerated by the series side of the Rogers-Selberg mod 7 identities onto partitions associated with a special case of Basil Gordon&...
Andrew V. Sills
ARSCOM
2007
191views more  ARSCOM 2007»
11 years 1 months ago
Binomial Identities Generated by Counting Spanning Trees
We partition the set of spanning trees contained in the complete graph Kn into spanning trees contained in the complete bipartite graph Ks,t. This relation will show that any prop...
Thomas Dale Porter
ATAL
2010
Springer
11 years 2 months ago
False-name-proofness with bid withdrawal
We study a more powerful variant of false-name manipulation in Internet auctions: an agent can submit multiple false-name bids, but then, once the allocation and payments have bee...
Mingyu Guo, Vincent Conitzer
NORDSEC
2009
Springer
11 years 6 months ago
Security Usability of Petname Systems
Abstract. To have certainty about identities is crucial for secure communication in digital environments. The number of digital identities that people and organizations need to man...
Md. Sadek Ferdous, Audun Jøsang, Kuldeep Si...
books