Sciweavers

Share
SIAMDM
2010
102views more  SIAMDM 2010»
7 years 10 months ago
Hamilton Cycles in Random Graphs with a Fixed Degree Sequence
Let d = d1 d2
Colin Cooper, Alan M. Frieze, Michael Krivelevich
JCT
2011
91views more  JCT 2011»
7 years 10 months ago
On a generalisation of the Dipper-James-Murphy conjecture
Let r, n be positive integers. Let e be 0 or an integer bigger than
Jun Hu
JCT
2010
113views more  JCT 2010»
8 years 1 months ago
Equations resolving a conjecture of Rado on partition regularity
A linear equation L is called k-regular if every k-coloring of the positive integers contains a monochromatic solution to L. Richard Rado conjectured that for every positive intege...
Boris Alexeev, Jacob Tsimerman
MOC
1998
80views more  MOC 1998»
8 years 3 months ago
Fast evaluation of multiple zeta sums
We show that the multiple zeta sum: ζ(s1, s2, ..., sd) = n1>n2>...>nd 1 ns1 1 ns2 2 ...n sd d , for positive integers si with s1 > 1, can always be written as a finit...
Richard E. Crandall
MOC
1998
147views more  MOC 1998»
8 years 3 months ago
On the Diophantine equation |axn - byn | = 1
If a, b and n are positive integers with b ≥ a and n ≥ 3, then the equation of the title possesses at most one solution in positive integers x and y, with the possible exceptio...
Michael A. Bennett, Benjamin M. M. de Weger
COMBINATORICS
1999
83views more  COMBINATORICS 1999»
8 years 3 months ago
Discrepancy of Matrices of Zeros and Ones
Let m and n be positive integers, and let R = (r1, . . . , rm) and S = (s1, . . . , sn) be non-negative integral vectors. Let A(R, S) be the set of all m
Richard A. Brualdi, Jian Shen
COMBINATORICS
1998
100views more  COMBINATORICS 1998»
8 years 3 months ago
Lattice Paths Between Diagonal Boundaries
A bivariate symmetric backwards recursion is of the form d[m, n] = w0(d[m− 1, n]+d[m, n−1])+ω1(d[m−r1, n−s1]+d[m−s1, n−r1])+· · ·+ωk(d[m−rk, n−sk] +d[m−sk, ...
Heinrich Niederhausen
EATCS
2002
100views more  EATCS 2002»
8 years 3 months ago
Bead-Sort: A Natural Sorting Algorithm
Nature is not only a source of minerals and precious stones but is also a mine of algorithms. By observing and studying natural phenomena, computer algorithms can be extracted. In...
Joshua J. Arulanandham, Cristian Calude, Michael J...
DM
2002
83views more  DM 2002»
8 years 3 months ago
Sums of minima and maxima
Let h1,
Zhi-Wei Sun
COMBINATORICS
2000
100views more  COMBINATORICS 2000»
8 years 3 months ago
Separability Number and Schurity Number of Coherent Configurations
To each coherent configuration (scheme) C and positive integer m we associate a natural scheme C(m) on the m-fold Cartesian product of the point set of C having the same automorph...
Sergei Evdokimov, Ilia N. Ponomarenko
books