Sciweavers

3928 search results - page 67 / 786
» order 2006
Sort
View
IJBC
2006
71views more  IJBC 2006»
15 years 4 months ago
Dynamics of Some Rational Discrete Dynamical Systems via Invariants
We consider several discrete dynamical systems for which some invariants can be found. Our study includes complex M
Anna Cima, Armengol Gasull, Víctor Ma&ntild...
ORDER
2010
177views more  ORDER 2010»
15 years 2 months ago
Sharp and Meager Elements in Orthocomplete Homogeneous Effect Algebras
We prove that every orthocomplete homogeneous effect algebra is sharply dominating. Let us denote the greatest sharp element below x by x↓. For every element x of an orthocomple...
Gejza Jenca
COMBINATORICS
2006
120views more  COMBINATORICS 2006»
15 years 4 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
2002
93views more  COMBINATORICS 2002»
15 years 3 months ago
On a Theorem of Erdos, Rubin, and Taylor on Choosability of Complete Bipartite Graphs
Erdos, Rubin, and Taylor found a nice correspondence between the minimum order of a complete bipartite graph that is not r-choosable and the minimum number of edges in an r-unifor...
Alexandr V. Kostochka
ISCI
2006
167views more  ISCI 2006»
15 years 4 months ago
Efficient unbalanced merge-sort
Sorting algorithms based on successive merging of ordered subsequences are widely used, due to their efficiency and to their intrinsically parallelizable structure. Among them, th...
Enrico Nardelli, Guido Proietti