Sciweavers

2904 search results - page 34 / 581
» Number Forms in the Brain
Sort
View
ITA
2008
150views Communications» more  ITA 2008»
13 years 7 months ago
A note on univoque self-Sturmian numbers
We compare two sets of (infinite) binary sequences whose suffixes satisfy extremal conditions: one occurs when studying iterations of unimodal continuous maps from the unit interva...
Jean-Paul Allouche
JCT
2006
60views more  JCT 2006»
13 years 7 months ago
On the number of rectangulations of a planar point set
We investigate the number of different ways in which a rectangle containing a set of n noncorectilinear points can be partitioned into smaller rectangles by n (non-intersecting) s...
Eyal Ackerman, Gill Barequet, Ron Y. Pinter
DM
2010
107views more  DM 2010»
13 years 7 months ago
Degree-associated reconstruction number of graphs
A card of a graph G is a subgraph formed by deleting one vertex. The Reconstruction Conjecture states that each graph with at least three vertices is determined by its multiset of...
Michael D. Barrus, Douglas B. West
JC
2008
68views more  JC 2008»
13 years 7 months ago
On the number of minima of a random polynomial
We give an upper bound in O(d(n+1)/2 ) for the number of critical points of a normal random polynomial. The number of minima (resp. maxima) is in O(d(n+1)/2 )Pn, where Pn is the (...
Jean-Pierre Dedieu, Gregorio Malajovich
FCT
2009
Springer
14 years 2 months ago
Martingales on Trees and the Empire Chromatic Number of Random Trees
We study the empire colouring problem (as defined by Percy Heawood in 1890) for maps whose dual planar graph is a tree, with empires formed by exactly r countries. We prove that, ...
Colin Cooper, Andrew R. A. McGrae, Michele Zito