SIAMDM
2010
13 years 5 months ago
2010
Let d = d1 d2
JCT
2011
13 years 5 months ago
2011
Let r, n be positive integers. Let e be 0 or an integer bigger than
JCT
2010
13 years 9 months ago
2010
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...
MOC
1998
13 years 10 months ago
1998
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...
MOC
1998
13 years 10 months ago
1998
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...
COMBINATORICS
1999
13 years 10 months ago
1999
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
COMBINATORICS
1998
13 years 10 months ago
1998
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, ...
EATCS
2002
13 years 10 months ago
2002
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...
DM
2002
13 years 10 months ago
2002
Let h1,
COMBINATORICS
2000
13 years 10 months ago
2000
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...