Sciweavers

492 search results - page 48 / 99
» combinatorics 2006
Sort
View
COMBINATORICS
2006
105views more  COMBINATORICS 2006»
14 years 9 months ago
Sets of Points Determining Only Acute Angles and Some Related Colouring Problems
We present both probabilistic and constructive lower bounds on the maximum size of a set of points S Rd such that every angle determined by three points in S is acute, considerin...
David Bevan
COMBINATORICS
2006
120views more  COMBINATORICS 2006»
14 years 9 months ago
Cycle Lengths in a Permutation are Typically Poisson
The set of cycle lengths of almost all permutations in Sn are "Poisson distributed": we show that this remains true even when we restrict the number of cycles in the per...
Andrew Granville
COMBINATORICS
2006
135views more  COMBINATORICS 2006»
14 years 9 months ago
Drawing a Graph in a Hypercube
A d-dimensional hypercube drawing of a graph represents the vertices by distinct points in {0, 1}d, such that the line-segments representing the edges do not cross. We study lower...
David R. Wood
COMBINATORICS
2006
98views more  COMBINATORICS 2006»
14 years 9 months ago
A Few More Cyclic Steiner 2-Designs
In this paper, we prove the existence of a cyclic (v, 4, 1)-BIBD for v = 12t + 4, 3 t 50 using computer programs, which are useful in recursive constructions for cyclic designs....
Kejun Chen, Ruizhong Wei
COMBINATORICS
2006
107views more  COMBINATORICS 2006»
14 years 9 months ago
The Linear Complexity of a Graph
The linear complexity of a matrix is a measure of the number of additions, subtractions, and scalar multiplications required to multiply that matrix and an arbitrary vector. In th...
David L. Neel, Michael E. Orrison