EuDML | Browse

Page 1

Displaying 1 – 10 of 10

The difference matrices of the classes of a Sharma-Kaushik partition

Bhu Dev Sharma, Norris Sookoo (2004)

Archivum Mathematicum

Sharma-Kaushik partitions have been used to define distances between vectors with $n$ -coordinates. In this paper, “difference matrices” for the partitioning classes have been introduced and investigated. It has been shown that the difference matrices are circulant and that the entries of a product of matrices is an extended intersection number of a distance scheme. The sum of the entries of each row or columns of the product matrix has been obtained. The algebra of matrices generated by the difference...

Displaying 1 – 10 of 10

The difference matrices of the classes of a Sharma-Kaushik partition

The matching polynomial of a distance-regular graph.

The maximum size of a partial spread in $H (4 n + 1, q^{2})$ is $q^{2 n + 1} + 1$ .

The multiplicities of a dual-thin $Q$ -polynomial association scheme.

The nonexistence of regular near octagons with parameters $(s, t, t_{2}, t_{3}) = (2, 24, 0, 8)$ .

The number of indecomposable Schur rings over a cyclic 2-group.

The spectral excess theorem for distance-regular graphs: a global (over)view.

The strongly regular (40, 12, 2, 4) graphs.

The strongly regular (45, 12, 3, 3) graphs.

Towards a classification of homogeneous integral table algebras of degree five.

Currently displaying 1 – 10 of 10