Sciweavers

365 search results - page 23 / 73
» On the combinatorics of Galois numbers
Sort
View
COCOON
2005
Springer
15 years 5 months ago
An Upper Bound on the Number of Rectangulations of a Point Set
Abstract. We consider the number of different ways to divide a rectangle containing n noncorectilinear points into smaller rectangles by n non-intersecting axis-parallel segments,...
Eyal Ackerman, Gill Barequet, Ron Y. Pinter
CORR
2004
Springer
106views Education» more  CORR 2004»
14 years 11 months ago
Why Delannoy numbers?
This article is not a research paper, but a little note on the history of combinatorics: we present here a tentative short biography of Henri Delannoy, and a survey of his most no...
Cyril Banderier, Sylviane R. Schwer
COMBINATORICS
2006
107views more  COMBINATORICS 2006»
14 years 12 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
COMBINATORICS
2006
102views more  COMBINATORICS 2006»
14 years 12 months ago
Identifying X-Trees with Few Characters
Previous work has shown the perhaps surprising result that, for any binary phylogenetic tree T , there is a set of four characters that define T . Here we deal with the general ca...
Magnus Bordewich, Charles Semple, Mike A. Steel
COMBINATORICS
2006
135views more  COMBINATORICS 2006»
14 years 12 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