Sciweavers

JCT
2006
92views more  JCT 2006»
13 years 4 months ago
Classification of small (0, 2)-graphs
We find the graphs of valency at most 7 with the property that any two nonadjacent vertices have either 0 or 2 common neighbours. In particular, we find all semibiplanes of block ...
Andries E. Brouwer
JCT
2006
46views more  JCT 2006»
13 years 4 months ago
Combinatorial interpretations of the q-Faulhaber and q-Salié coefficients
Victor J. W. Guo, Martin Rubey, Jiang Zeng
JCT
2006
109views more  JCT 2006»
13 years 4 months ago
On the combinatorial invariance of Kazhdan-Lusztig polynomials
We prove that the Kazhdan-Lusztig polynomials are combinatorial invariants for intervals up to length 8 in Coxeter groups of type A and up to length 6 in Coxeter groups of type B a...
Federico Incitti
JCT
2006
87views more  JCT 2006»
13 years 4 months ago
Construction of bent functions via Niho power functions
A Boolean function with an even number n = 2k of variables is called bent if it is maximally nonlinear. We present here a new construction of bent functions. Boolean functions of ...
Hans Dobbertin, Gregor Leander, Anne Canteaut, Cla...
JCT
2006
75views more  JCT 2006»
13 years 4 months ago
New polytopes from products
We construct a new 2-parameter family Emn, m, n 3, of self-dual 2-simple and 2-simplicial 4-polytopes, with flexible geometric realisations. E44 is the 24-cell. For large m, n the...
Andreas Paffenholz
JCT
2006
37views more  JCT 2006»
13 years 4 months ago
An L-system on the small Witt design
Norihide Tokushige
JCT
2006
72views more  JCT 2006»
13 years 4 months ago
Partial flocks of the quadratic cone
: We prove that in PG(3, q), q > 19, a partial flock of a quadratic cone with q - planes, can be extended to a unique flock if < 1 4 q.
Péter Sziklai
JCT
2006
47views more  JCT 2006»
13 years 4 months ago
A map colour theorem for the union of graphs
Michael Stiebitz, Riste Skrekovski
JCT
2006
72views more  JCT 2006»
13 years 4 months ago
Arboricity and tree-packing in locally finite graphs
Nash-Williams' arboricity theorem states that a finite graph is the edge-disjoint union of at most k forests if no set of vertices induces more than k( - 1) edges. We prove a...
Maya Jakobine Stein