Sciweavers

Share
JCT
2010
112views more  JCT 2010»
8 years 1 months ago
More on block intersection polynomials and new applications to graphs and block designs
The concept of intersection numbers of order r for t-designs is generalized to graphs and to block designs which are not necessarily t-designs. These intersection numbers satisfy ...
Leonard H. Soicher
EJC
2008
8 years 3 months ago
3-bounded property in a triangle-free distance-regular graph
Let denote a distance-regular graph with classical parameters (D, b, , ) and D 3. Assume the intersection numbers a1 = 0 and a2 = 0. We show is 3-bounded in the sense of the ar...
Yeh-jong Pan, Chih-wen Weng
DM
2008
86views more  DM 2008»
8 years 3 months ago
"Catalan traffic" and integrals on the Grassmannian of lines
One proves that certain numbers occurring in a problem of paths enumeration, studied by Niederhausen in [7] (see also [10]), are top intersection numbers in the cohomology ring of...
Taíse Santiago Costa Oliveira
DCC
2008
IEEE
8 years 3 months ago
A characterization of quadrics by intersection numbers
This work is inspired by a paper of Hertel and Pott on maximum non-linear functions [8]. Geometrically, these functions correspond with quasi-quadrics; objects introduced in [5]. ...
Jeroen Schillewaert
books