A matrix equation for association schemes
Copyright policy )A matrix equation for association schemes
{Let ${\Cal X}$ be a self-dual P-polynomial association scheme. Then there are at most 12 diagonal matrices $T$ such that $(PT)^3=I$. Moreover, all of the solutions for the classical infinite families of such schemes (including the Hamming scheme) are classified.
- University of Minnesota System United States
- University of Minnesota Morris United States
- University of Minnesota United States
- University of Minesota United States
- University of Minnesota United States
\(P\)-polynomial, Hamming scheme, Matrix equations and identities, matrix equation, Mathematics - Classical Analysis and ODEs, association schemes, Classical Analysis and ODEs (math.CA), FOS: Mathematics, Association schemes, strongly regular graphs, Mathematics - Combinatorics, Combinatorics (math.CO)
\(P\)-polynomial, Hamming scheme, Matrix equations and identities, matrix equation, Mathematics - Classical Analysis and ODEs, association schemes, Classical Analysis and ODEs (math.CA), FOS: Mathematics, Association schemes, strongly regular graphs, Mathematics - Combinatorics, Combinatorics (math.CO)
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).2 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!