Sciweavers

1248 search results - page 16 / 250
» On the Number of Birch Partitions
Sort
View
COMBINATORICS
2000
92views more  COMBINATORICS 2000»
13 years 8 months ago
Asymptotics for the Probability of Connectedness and the Distribution of Number of Components
Let n be the fraction of structures of size" n which are connected"; e.g., a the fraction of labeled or unlabeled n-vertex graphshavingone component, b the fraction of p...
Jason P. Bell, Edward A. Bender, Peter J. Cameron,...
DM
2000
73views more  DM 2000»
13 years 8 months ago
Some formulae for partitions into squares
We consider the new problem of determining the number of partitions of a number into a fixed number k of squares, and find explicit formulae in the cases k = 2, 3, 4. Classificati...
Michael D. Hirschhorn
COMBINATORICS
2004
94views more  COMBINATORICS 2004»
13 years 8 months ago
Bijections and Congruences for Generalizations of Partition Identities of Euler and Guy
In 1958, Richard Guy proved that the number of partitions of n into odd parts greater than one equals the number of partitions of n into distinct parts with no powers of 2 allowed...
James A. Sellers, Andrew V. Sills, Gary L. Mullen
FMICS
2009
Springer
14 years 3 months ago
Dynamic State Space Partitioning for External Memory Model Checking
We describe a dynamic partitioning scheme usable by model checking techniques that divide the state space into partitions, such as most external memory and distributed model checki...
Sami Evangelista, Lars Michael Kristensen
SWAT
2010
Springer
250views Algorithms» more  SWAT 2010»
14 years 1 months ago
Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing
Given a permutation π of {1, . . . , n} and a positive integer k, we give an algorithm with running time 2O(k2 log k) nO(1) that decides whether π can be partitioned into at mos...
Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov...