Equiangular lines and the Lemmens–Seidel conjecture

YCR Lin, WH Yu - Discrete Mathematics, 2020 - Elsevier
In this paper, claims by Lemmens and Seidel in 1973 about equiangular sets of lines with
angle 1∕ 5 are proved by carefully analyzing pillar decomposition, with the aid of the …

Bounds on Discrete Potentials of Spherical (k, k)-Designs

S Borodachov, P Boyvalenkov, PD Saff… - arXiv preprint arXiv …, 2024 - arxiv.org
We derive universal lower and upper bounds for max-min and min-max problems (also
known as polarization) for the potential of spherical $(k, k) $-designs and provide certain …

Classification of Spherical -distance -designs by Solving Diophantine Equations

E Bannai, E Bannai, Z Xiang, WH Yu… - Taiwanese Journal of …, 2021 - projecteuclid.org
In algebraic combinatorics, the first step of the classification of interesting objects is usually
to find all their feasible parameters. The feasible parameters are often integral solutions of …

Spherical designs and modular forms of the lattice

M Hirao, H Nozaki, K Tasaka - Research in Number Theory, 2023 - Springer
In this paper, we study shells of the D 4 lattice with a slight generalization of spherical t-
designs due to Delsarte–Goethals–Seidel, namely, the spherical design of harmonic index T …

[PDF][PDF] Classification of feasible parameters by solving Diophantine equations

E Bannai, E Bannai, Z Xiang, WH Yu, Y Zhu - Taiwanese Journal of Mathematics - ziqing.org
In algebraic combinatorics, the first step of the classification of interesting objects is usually
to find all their feasible parameters. The feasible parameters are often integral solutions of …

[引用][C] Classification of spherical 2-distance {4, 2, 1}-designs

E Bannai, E Bannai, Z Xiang, WH Yu, Y Zhu