Sciweavers

DM
2006
54views more  DM 2006»
13 years 11 months ago
Self-dual, not self-polar
Andries E. Brouwer, Peter J. Cameron, Willem H. Ha...
DM
2006
84views more  DM 2006»
13 years 11 months ago
Indefinite summation with unspecified summands
We provide a new algorithm for indefinite nested summation which is applicable to summands involving unspecified sequences x(n). More than that, we show how to extend Karr's ...
Manuel Kauers, Carsten Schneider
DM
2006
105views more  DM 2006»
13 years 11 months ago
Large sets of t-designs through partitionable sets: A survey
The method of partitionable sets for constructing large sets of t-designs have now been used for nearly a decade. The method has resulted in some powerful recursive constructions ...
Gholamreza B. Khosrovshahi, Behruz Tayfeh-Rezaie
DM
2006
79views more  DM 2006»
13 years 11 months ago
Conditional colorings of graphs
For an integer r > 0, a conditional (k, r)-coloring of a graph G is a proper k-coloring of the vertices of G such that every vertex of degree at least r in G will be adjacent t...
Hong-Jian Lai, Jianliang Lin, Bruce Montgomery, Ta...
DM
2006
58views more  DM 2006»
13 years 11 months ago
Linear transformations on codes
David G. Glynn, T. Aaron Gulliver, Manish K. Gupta
DM
2006
93views more  DM 2006»
13 years 11 months ago
The number of equivalence classes of symmetric sign patterns
This paper shows that the number of sign patterns of totally non-zero symmetric n-by-n matrices, up to conjugation by monomial matrices and negation, is equal to the number of unl...
Peter J. Cameron, Charles R. Johnson
DM
2006
63views more  DM 2006»
13 years 11 months ago
Extended skew partition problem
A skew partition as defined by Chv
Simone Dantas, Celina M. Herrera de Figueiredo, Sy...
DM
2006
55views more  DM 2006»
13 years 11 months ago
A note on short cycles in a hypercube
Maria Axenovich, Ryan Martin
DM
2006
81views more  DM 2006»
13 years 11 months ago
A combinatorial identity with application to Catalan numbers
By a very simple argument, we prove that if l, m, n {0, 1, 2, . . . } then l k=0 (-1)m-k l k m - k n 2k k - 2l + m = l k=0 l k 2k n n - l m + n - 3k - l . On the basis of this ide...
Hao Pan, Zhi-Wei Sun
DM
2006
72views more  DM 2006»
13 years 11 months ago
Sparse anti-magic squares and vertex-magic labelings of bipartite graphs
A sparse anti-magic square is an n
I. D. Gray, Jim A. MacDougall