Sciweavers

COMBINATORICS
1999
60views more  COMBINATORICS 1999»
13 years 11 months ago
Reconstructing Subsets of Reals
A. J. Radcliffe, Alex D. Scott
COMBINATORICS
1999
61views more  COMBINATORICS 1999»
13 years 11 months ago
A Fibonacci-like Sequence of Composite Numbers
In 1964, Ronald Graham proved that there exist relatively prime natural numbers a and b such that the sequence {An} defined by An = An-1 + An-2 (n 2; A0 = a, A1 = b) contains no ...
John W. Nicol
COMBINATORICS
1999
102views more  COMBINATORICS 1999»
13 years 11 months ago
Critical Subgraphs of a Random Graph
We prove that the threshold for a random graph to have a k-core is equal to the threshold for having a subgraph which meets a necessary condition of Gallai for being k-critical. 1...
Michael Molloy, Bruce A. Reed
COMBINATORICS
1999
83views more  COMBINATORICS 1999»
13 years 11 months ago
The Asymptotic Number of Set Partitions with Unequal Block Sizes
Arnold Knopfmacher, Andrew M. Odlyzko, Boris Pitte...
COMBINATORICS
1999
59views more  COMBINATORICS 1999»
13 years 11 months ago
List Edge-Colorings of Series-Parallel Graphs
Martin Juvan, Bojan Mohar, Robin Thomas
COMBINATORICS
1999
62views more  COMBINATORICS 1999»
13 years 11 months ago
An infinite Family of Non-embeddable Hadamard Designs
The parameters 2 - (2 + 2, + 1, ) are those of a residual Hadamard 2 (4 + 3, 2 + 1, ) design. All 2 - (2 + 2, + 1, ) designs with 4 are embeddable. The existence of non-embedd...
Kirsten Mackenzie-Fleming
COMBINATORICS
1999
57views more  COMBINATORICS 1999»
13 years 11 months ago
Zero Capacity Region of Multidimensional Run Length Constraints
Hisashi Ito, Akiko Kato, Zsigmond Nagy, Kenneth Ze...
COMBINATORICS
1999
70views more  COMBINATORICS 1999»
13 years 11 months ago
Derivative Polynomials, Euler Polynomials, and Associated Integer Sequences
Let Pn and Qn be the polynomials obtained by repeated differentiation of the tangent and secant functions respectively. From the exponential generating functions of these polynomia...
Michael E. Hoffman
COMBINATORICS
1999
99views more  COMBINATORICS 1999»
13 years 11 months ago
Deformation of Chains via a Local Symmetric Group Action
A symmetric group action on the maximal chains in a finite, ranked poset is local if the adjacent transpositions act in such a way that (i, i + 1) sends each maximal chain either ...
Patricia Hersh
COMBINATORICS
1999
70views more  COMBINATORICS 1999»
13 years 11 months ago
Tilings of Diamonds and Hexagons with Defects
We show how to count tilings of Aztec diamonds and hexagons with defects using determinants. In several cases these determinants can be evaluated in closed form. In particular, we...
Harald Helfgott, Ira M. Gessel