
This important paper generalizes techniques from association schemes and spherical designs to study finite subsets of polynomials spaces. A polynomial space is a set \(\Omega\) with a function \(\rho: \Omega\times\Omega\to {\mathbf R}\) with \(\rho(x,x)=r>0\), \(\rho(x,y)=\rho(y,x)
\(t\)-designs, polynomial space, Association schemes, strongly regular graphs, Discrete Mathematics and Combinatorics, \(t\)-transitive permutation groups, Theoretical Computer Science
\(t\)-designs, polynomial space, Association schemes, strongly regular graphs, Discrete Mathematics and Combinatorics, \(t\)-transitive permutation groups, Theoretical Computer Science
| citations 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). | 20 | |
| 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. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
