Sciweavers

3928 search results - page 166 / 786
» order 2006
Sort
View
JAPLL
2006
109views more  JAPLL 2006»
15 years 4 months ago
Deduction chains for common knowledge
Deduction chains represent a syntactic and in a certain sense constructive method for proving completeness of a formal system. Given a formula , the deduction chains of are built...
Mathis Kretz, Thomas Studer
JCM
2006
76views more  JCM 2006»
15 years 4 months ago
Hierarchical Aggregation of Multicast Trees in Large Domains
Multicast tree aggregation is a technique that reduces the control overhead and the number of states induced by multicast. The main idea of this protocol is to route several groups...
Joanna Moulierac, Alexandre Guitton, Miklós...
JCT
2006
73views more  JCT 2006»
15 years 4 months ago
Colouring lines in projective space
Let V be a vector space of dimension v over a field of order q. The q-Kneser graph has the kdimensional subspaces of V as its vertices, where two subspaces and are adjacent if and...
Ameera Chowdhury, Chris D. Godsil, Gordon F. Royle
144
Voted
JCT
2006
54views more  JCT 2006»
15 years 4 months ago
Spectral estimates for Abelian Cayley graphs
We give two short proofs that for fixed d, a d-regular Cayley graph on an Abelian group of order n has second eigenvalue bounded below by d - O(dn-4/d), where the implied constant...
Joel Friedman, Ram Murty, Jean-Pierre Tillich
JCT
2006
67views more  JCT 2006»
15 years 4 months ago
On the coexistence of conference matrices and near resolvable 2-(2k+1, k, k-1) designs
We show that a near resolvable 2-(2k + 1, k, k - 1) design exists if and only if a conference matrix of order 2k + 2 does. A known result on conference matrices then allows us to ...
Malcolm Greig, Harri Haanpää, Petteri Ka...