Sho Suda
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Interests
Sho Suda has a total of 43 co-authors. Here are the top co-authors by number of shared publications:
- Hadi Kharaghani
Department of Mathematics and Computer Science, University of Lethbridge, Lethbridge, Canada
41 shared publications - Hiroshi Nozaki
Toyota Central Research and Development Laboratories (Japan)
7 shared publications - Koji Momihara
Division of Natural Science, Kumamoto University, Kumamoto, Japan
7 shared publications - Thomas Pender
Department of Mathematics and Computer Science University of Lethbridge T1K 3M4 Lethbridge Alberta Canada
5 shared publications - Gary R. W. Greaves
Division of Mathematical Sciences School of Physical and Mathematical Sciences Nanyang Technological Uni- versity 21 Nanyang Link 637371 Singapore
4 shared publications - Masaaki Harada
Research Center for Pure and Applied Mathematics, Graduate School of Information Sciences, Tohoku University, Sendai, Japan
4 shared publications
Latest Publications
- 16 September 2026
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 64 (3) , 37
Non-commutative association schemes having divisible design graphs as relations from pseudo-cyclic association schemes
- 16 September 2026
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 64 (3) , 37
Non-commutative association schemes having divisible design graphs as relations from pseudo-cyclic association schemes
- 24 January 2026
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 63 (1) , 12
On skew-regular Hadamard matrices
- 24 January 2026
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 63 (1) , 12
On skew-regular Hadamard matrices
- Open Access
Extremal orthogonal arrays
It is known that a Delsarte $t$-design in a $Q$-polynomial association scheme has degree at least $\left \lceil{\frac{t}{2}}\right \rceil $. Following Ionin and Shrikhande who studied combinatorial $(2s-1)$-designs (i.e., Delsarte designs in Johnson association schemes) having exactly $s$ block intersection numbers, we call a Delsarte $(2s-1)$-design with degree $s$ extremal and study extremal orthogonal arrays, which are Delsarte designs in Hamming association schemes. It was shown by Delsarte that a $t$-design with degree $s$ and $t\geq 2s-2$ in a Hamming association scheme induces an $s$-class association scheme. We prove that an extremal orthogonal array gives rise to a fission scheme of the latter one, which has $2s-1$ or $2s$ classes. As a corollary, a new necessary condition for the existence of tight orthogonal arrays of strength $3$ is obtained. Furthermore, as a counterpart to a result of Ionin and Shrikhande, we prove an inequality for Hamming distances in extremal orthogonal arrays. The inequality is tight as shown by examples related to the Golay codes.Open AccessExtremal orthogonal arrays
It is known that a Delsarte $t$-design in a $Q$-polynomial association scheme has degree at least $\left \lceil{\frac{t}{2}}\right \rceil $. Following Ionin and Shrikhande who studied combinatorial $(2s-1)$-designs (i.e., Delsarte designs in Johnson association schemes) having exactly $s$ block intersection numbers, we call a Delsarte $(2s-1)$-design with degree $s$ extremal and study extremal orthogonal arrays, which are Delsarte designs in Hamming association schemes. It was shown by Delsarte that a $t$-design with degree $s$ and $t\geq 2s-2$ in a Hamming association scheme induces an $s$-class association scheme. We prove that an extremal orthogonal array gives rise to a fission scheme of the latter one, which has $2s-1$ or $2s$ classes. As a corollary, a new necessary condition for the existence of tight orthogonal arrays of strength $3$ is obtained. Furthermore, as a counterpart to a result of Ionin and Shrikhande, we prove an inequality for Hamming distances in extremal orthogonal arrays. The inequality is tight as shown by examples related to the Golay codes. - Open Access
Three-dimensional symmetric designs of propriety 3
We define symmetric designs of dimension $n$ and propriety $d$, providing a unifying generalization of several classes of higher-dimensional symmetric designs previously studied. We focus on the case $n=d=3$, which leads to the following question: Can we fill the $v^3$ cells of a $v\times v\times v$ cube with $\{0,1\}$ in such a way that each layer parallel to each face contains a fixed number $k$ of ones, and that for every two parallel layers there are exactly $λ$ positions where they have matching ones? We establish necessary conditions on the parameters $(v,k,λ)$, introduce notions of difference sets and multipliers for these objects, and enumerate small examples up to equivalence. Furthermore, we construct infinite families of these objects using difference sets, symmetric designs, doubly regular tournaments, Hadamard matrices, Latin cubes, and association schemes on triples.Open AccessThree-dimensional symmetric designs of propriety 3
We define symmetric designs of dimension $n$ and propriety $d$, providing a unifying generalization of several classes of higher-dimensional symmetric designs previously studied. We focus on the case $n=d=3$, which leads to the following question: Can we fill the $v^3$ cells of a $v\times v\times v$ cube with $\{0,1\}$ in such a way that each layer parallel to each face contains a fixed number $k$ of ones, and that for every two parallel layers there are exactly $λ$ positions where they have matching ones? We establish necessary conditions on the parameters $(v,k,λ)$, introduce notions of difference sets and multipliers for these objects, and enumerate small examples up to equivalence. Furthermore, we construct infinite families of these objects using difference sets, symmetric designs, doubly regular tournaments, Hadamard matrices, Latin cubes, and association schemes on triples. - Open Access
Existence and nonexistence of spherical $5$-designs of minimal type
This paper investigates the existence and properties of spherical $5$-designs of minimal type. We focus on two cases: tight spherical $5$-designs and antipodal spherical $4$-distance $5$-designs. We prove that a tight spherical $5$-design is of minimal type if and only if it possesses a specific $Q$-polynomial coherent configuration structure. For tight spherical $5$-designs in $\mathbb{R}^d$ of minimal type, we demonstrate that half of the derived code forms an equiangular tight frames (ETF) with parameters $(d-1, \frac{(d-1)(d+1)}{3})$. This provides a sufficient condition for constructing such ETFs from maximal ETFs with parameters $(d, \frac{d(d+1)}{2})$. Moreover, we establish that tight spherical $5$-designs of minimal type cannot exist if the dimension $d$ satisfies a certain arithmetic condition, which holds for infinitely many values of $d$, including $d=119$ and $527$. For antipodal spherical $4$-distance $5$-designs, we utilize valency theory to derive necessary conditions for certain special types of antipodal spherical $4$-distance $5$-designs to be of minimal type.Open AccessExistence and nonexistence of spherical $5$-designs of minimal type
This paper investigates the existence and properties of spherical $5$-designs of minimal type. We focus on two cases: tight spherical $5$-designs and antipodal spherical $4$-distance $5$-designs. We prove that a tight spherical $5$-design is of minimal type if and only if it possesses a specific $Q$-polynomial coherent configuration structure. For tight spherical $5$-designs in $\mathbb{R}^d$ of minimal type, we demonstrate that half of the derived code forms an equiangular tight frames (ETF) with parameters $(d-1, \frac{(d-1)(d+1)}{3})$. This provides a sufficient condition for constructing such ETFs from maximal ETFs with parameters $(d, \frac{d(d+1)}{2})$. Moreover, we establish that tight spherical $5$-designs of minimal type cannot exist if the dimension $d$ satisfies a certain arithmetic condition, which holds for infinitely many values of $d$, including $d=119$ and $527$. For antipodal spherical $4$-distance $5$-designs, we utilize valency theory to derive necessary conditions for certain special types of antipodal spherical $4$-distance $5$-designs to be of minimal type. - Open Access
- 28 June 2025
- Published by Springer Nature in Designs, Codes and Cryptography
- p. 1-39
Unbiased weighing matrices of weight 9
We investigate unbiased weighing matrices of weight 9 and provide a construction method using mutually suitable Latin squares. For $$n \le 16$$ , we determine the maximum size among sets of mutually unbiased weighing matrices of order n and weight 9. Notably, our findings reveal that 13 is the smallest order where such pairs exist, and 16 is the first order for which a maximum class of unbiased weighing matrices is found.- 28 June 2025
- Published by Springer Nature in Designs, Codes and Cryptography
- p. 1-39
Open AccessUnbiased weighing matrices of weight 9
We investigate unbiased weighing matrices of weight 9 and provide a construction method using mutually suitable Latin squares. For $$n \le 16$$ , we determine the maximum size among sets of mutually unbiased weighing matrices of order n and weight 9. Notably, our findings reveal that 13 is the smallest order where such pairs exist, and 16 is the first order for which a maximum class of unbiased weighing matrices is found. - Open Access
Constructions of self-orthogonal and LCD subspace codes
Recently, the notions of self-orthogonal subspace codes and LCD subspace codes were introduced, and LCD subspace codes obtained from mutually unbiased weighing matrices were studied. In this paper, we provide a method of constructing self-orthogonal and LCD subspace codes from a set of matrices under certain conditions. In particular, we give constructions of self-orthogonal and LCD subspace codes from mutually quasi-unbiased weighing matrices, linked systems of symmetric designs, and linked systems of symmetric group divisible designs, Deza graphs and their equitable partitions.
Open AccessConstructions of self-orthogonal and LCD subspace codes
Recently, the notions of self-orthogonal subspace codes and LCD subspace codes were introduced, and LCD subspace codes obtained from mutually unbiased weighing matrices were studied. In this paper, we provide a method of constructing self-orthogonal and LCD subspace codes from a set of matrices under certain conditions. In particular, we give constructions of self-orthogonal and LCD subspace codes from mutually quasi-unbiased weighing matrices, linked systems of symmetric designs, and linked systems of symmetric group divisible designs, Deza graphs and their equitable partitions.
- 26 March 2024
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 40 (2) , 1-12
Strongly Regular Graphs from Pseudocyclic Association Schemes
- 26 March 2024
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 40 (2) , 1-12
Strongly Regular Graphs from Pseudocyclic Association Schemes
- 4 January 2024
- Published by Springer Nature in Bulletin of the Iranian Mathematical Society
- Vol. 50 (1) , 1-26
Embedding Dimensions of Matrices Whose Entries are Indefinite Distances in the Pseudo-Euclidean Space
- 4 January 2024
- Published by Springer Nature in Bulletin of the Iranian Mathematical Society
- Vol. 50 (1) , 1-26
Embedding Dimensions of Matrices Whose Entries are Indefinite Distances in the Pseudo-Euclidean Space
- Open Access
Embedding dimensions of matrices whose entries are indefinite distances in the pseudo-Euclidean space
A finite set of the Euclidean space is called an $s$-distance set provided the number of Euclidean distances in the set is $s$. Determining the largest possible $s$-distance set for the Euclidean space of a given dimension is challenging. This problem was solved only when dealing with small values of $s$ and dimensions. Lison\v{e}k (1997) achieved the classification of the largest 2-distance sets for dimensions up to $7$, using computer assistance and graph representation theory. In this study, we consider a theory analogous to these results of Lison\v{e}k for the pseudo-Euclidean space $\mathbb{R}^{p,q}$. We consider an $s$-indefinite-distance set in a pseudo-Euclidean space that uses the value \[ || x-y ||=(x_1-y_1)^2 +\cdots +(x_p -y_p)^2-(x_{p+1}-y_{p+1})^2-\cdots -(x_{p+q}-y_{p+q})^2 \] instead of the Euclidean distance. We develop a representation theory for symmetric matrices in the context of $s$-indefinite-distance sets, which includes or improves the results of Euclidean $s$-distance sets with large $s$ values. Moreover, we classify the largest possible $2$-indefinite-distance sets for small dimensions.Open AccessEmbedding dimensions of matrices whose entries are indefinite distances in the pseudo-Euclidean space
A finite set of the Euclidean space is called an $s$-distance set provided the number of Euclidean distances in the set is $s$. Determining the largest possible $s$-distance set for the Euclidean space of a given dimension is challenging. This problem was solved only when dealing with small values of $s$ and dimensions. Lison\v{e}k (1997) achieved the classification of the largest 2-distance sets for dimensions up to $7$, using computer assistance and graph representation theory. In this study, we consider a theory analogous to these results of Lison\v{e}k for the pseudo-Euclidean space $\mathbb{R}^{p,q}$. We consider an $s$-indefinite-distance set in a pseudo-Euclidean space that uses the value \[ || x-y ||=(x_1-y_1)^2 +\cdots +(x_p -y_p)^2-(x_{p+1}-y_{p+1})^2-\cdots -(x_{p+q}-y_{p+q})^2 \] instead of the Euclidean distance. We develop a representation theory for symmetric matrices in the context of $s$-indefinite-distance sets, which includes or improves the results of Euclidean $s$-distance sets with large $s$ values. Moreover, we classify the largest possible $2$-indefinite-distance sets for small dimensions.