Sciweavers

7796 search results - page 5 / 1560
» On Generalized Schur Numbers
Sort
View
COMBINATORICS
1998
103views more  COMBINATORICS 1998»
13 years 9 months ago
Recognizing Circulant Graphs of Prime Order in Polynomial Time
A circulant graph G of order n is a Cayley graph over the cyclic group Zn. Equivalently, G is circulant iff its vertices can be ordered such that the corresponding adjacency matr...
Mikhail E. Muzychuk, Gottfried Tinhofer
AMC
2007
90views more  AMC 2007»
13 years 10 months ago
Computing the square roots of matrices with central symmetry
: For computing square roots of a nonsingular matrix A, which are functions of A, two well known fast and stable algorithms, which are based on the Schur decomposition of A, were p...
Zhongyun Liu, Yulin Zhang, Rui Ralha
CORR
2006
Springer
90views Education» more  CORR 2006»
13 years 9 months ago
Symmetric Subresultants and Applications
Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two pol...
Cyril Brunie, Philippe Saux Picart
JCT
2010
113views more  JCT 2010»
13 years 8 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
JCT
2007
71views more  JCT 2007»
13 years 9 months ago
Divisibility of generalized Catalan numbers
We define a q generalization of weighted Catalan numbers studied by Postnikov and Sagan, and prove a result on the divisibility by p of such numbers when p is a prime and q its p...
Matjaz Konvalinka