Searcharxiv⌕ Search

arXiv subjects

Akihiro Munemasa

Publications and source records attributed to Akihiro Munemasa.

At least 19 recordsLinked to original sources
arXiv2026

On the spherical design properties of a $P$- and $Q$-polynomial association scheme

We show that the strength as a spherical design of the spherical embedding of a $P$- and $Q$-polynomial association scheme with at least three classes with respect to a $Q$-polynomial idempotent is at most five, provided that the multiplicity is at least three. We also identify the examples that attain this upper bound on the strength. Our result improves on Suda's earlier upper bound of eight [J. Combin. Des. 19 (2011)], and is considered dual to the results of Lewis [Discrete Math. 223 (2000)] and Miklavič [Electron. J. Combin. 32 (2025)] concerning the girth of a $Q$-polynomial distance-regular graph with diameter and valency both at least three. To establish our upper bound, we introduce and discuss a polynomial method that works by constructing an appropriate polynomial that vanishes at every point of the spherical embedding.

math.CO↗
arXiv2026

New Constructions of Distance-Biregular Graphs

We construct a new family of distance-biregular graphs related to hyperovals and a new sporadic example of a distance-biregular graph related to Mathon's perp system. The infinite family can be explained using 2-$\bipartB$-homogeneity, while the sporadic example belongs to a generalization of a construction by Delorme. Additionally, we establish a new non-existence condition for distance-biregular graphs which, for instance, rules out the existence of a distance-biregular graph on $225+60$ vertices.

math.CO↗
arXiv2026

The Minimal Absolute Value of Sums of Fifth Roots of Unity

We determine the minimal absolute value of a non-vanishing sum of $n$ fifth roots of unity chosen with repetition, and characterize the corresponding sums. As a function of $n$, the minimal absolute value is monotone non-increasing over congruence classes of $n$ modulo $5$ and its only jumps occur when $n=5F_m$, $n=L_m$, or $n=2L_m$, where $F_m$ and $L_m$ denote the $m$-th Fibonacci and Lucas numbers respectively. To prove our results we reduce the problem to a series of inequalities involving rational approximations of the golden ratio $φ=(1+\sqrt{5})/2$, the solutions of which can be characterized using the theory of continued fractions.

math.NT↗
arXiv2026

Sets of equiangular lines in dimension $18$ constructed from $A_5^3 \oplus A_1^4$

In 2023, Greaves, Syatriadi, and Yatsyna found a set of $57$ equiangular lines in $\mathbb{R}^{18}$, breaking the previous record. In 2025, Lin, Munemasa, Taniguchi, and Yoshino constructed a large number of sets of $57$ equiangular lines in $\mathbb{R}^{18}$ as affine equiangular sets in an integral overlattice of $A_9^2 \oplus A_1$. In this paper, we construct further sets of $57$ equiangular lines in $\mathbb{R}^{18}$ from Latin squares of order $6$ and Pasch configurations, realized as affine equiangular sets in an integral overlattice of $A_5^3 \oplus A_1^4$. Unlike the previously known examples, these sets are not strongly maximal. Moreover, some of them have only five distinct Seidel eigenvalues, fewer than any previously known examples.

math.CO↗
arXiv2026

Roux schemes which carry association schemes locally

A roux scheme is an association scheme formed from a special "roux" matrix and the regular permutation representation of an associated group. They were introduced by Iverson and Mixon for their connection to equiangular tight frames and doubly transitive lines. We show how roux matrices can be produced from association schemes and characterise roux schemes for which the neighbourhood of a vertex induces an association scheme possessing the same number of relations as the thin radical. An important example arises from the $64$ equiangular lines in $\mathbb{C}^8$ constructed by Hoggar which we prove is unique (determined by its parameters up to isomorphism). We also characterise roux schemes by their eigenmatrices and provide new families of roux schemes using our construction.

math.CO↗
arXiv2025

Sets of equiangular lines in dimension $18$ constructed from $A_9 \oplus A_9 \oplus A_1$

In 2023, Greaves et~al.\ constructed several sets of 57 equiangular lines in dimension 18. Using the concept of switching root introduced by Cao et~al.\ in 2021, these sets of equiangular lines are embedded in a lattice of rank 19 spanned by norm 3 vectors together with a switching root. We characterize this lattice as an overlattice of the root lattice $A_9\oplus A_9\oplus A_1$, and show that there are at least $246896$ sets of 57 equiangular lines in dimension $18$ arising in this way, up to isometry. Additionally, we prove that all of these sets of equiangular lines are strongly maximal. Here, a set of equiangular lines is said to be strongly maximal if there is no set of equiangular lines properly containing it even if the dimension of the underlying space is increased. Among these sets, there are ones with only six distinct Seidel eigenvalues.

math.CO↗
arXiv2025

3-Designs from PSL(2,q) with cyclic starter blocks

We consider when the projective special linear group over a finite field defines a $3$-design with a cyclic starter block. We will show that the equivalences of the existence of such $3$-$(q+1,5,3)$ and $3$-$(q+1,10,18)$ designs for a prime power $q\equiv 1\pmod{20}$, and $3$-$(q+1,13,33)$ and $3$-$(q+1,26,150)$ designs for a prime power $q\equiv 1\pmod{52}$, respectively.

math.CO↗
arXiv2025

Universal graph series, chromatic functions, and their index theory

In the present paper, we introduce the concept of universal graph series. We then present four invariants of graphs and discuss some of their properties. In particular, one of these invariants is a generalization of the chromatic symmetric function and a complete invariant for graphs.

math.CO↗
arXiv2023

Weakly distance-regular circulants, I

We classify certain non-symmetric commutative association schemes. As an application, we determine all the weakly distance-regular circulants of one type of arcs by using Schur rings. We also give the classification of primitive weakly distance-regular circulants.

math.CO↗
arXiv2023

Convex subgraphs and spanning trees of the square cycles

We classify connected spanning convex subgraphs of the square cycles. We then show that every spanning tree of $C_n^2$ is contained in a unique nontrivial connected spanning convex subgraph of $C_n^2$. As a result, we obtain a purely combinatorial derivation of the formula for the number of spanning trees of the square cycles.

math.CO↗
arXiv2022

Constellations in prime elements of number fields

Given any number field, we prove that there exist arbitrarily shaped constellations consisting of pairwise non-associate prime elements of the ring of integers. This result extends the celebrated Green-Tao theorem on arithmetic progressions of rational primes and Tao's theorem on constellations of Gaussian primes. Furthermore, we prove a constellation theorem on prime representations of binary quadratic forms with integer coefficients. More precisely, for a non-degenerate primitive binary quadratic form $F$ which is not negative definite, there exist arbitrarily shaped constellations consisting of pairs of integers $(x,y)$ for which $F(x,y)$ is a rational prime. The latter theorem is obtained by extending the framework from the ring of integers to the pair of an order and its invertible fractional ideal.

math.NT↗
arXiv2022

Extended double covers of non-symmetric association schemes of class $2$

In this paper, we give a method to construct non-symmetric association schemes of class $3$ from non-symmetric association schemes of class $2$. This construction is a non-symmetric analogue of the construction of Taylor graphs as an antipodal double cover of a complete graph. We also mention how our construction interact with doubling introduced by Pasechnik.

math.CO↗
arXiv2021

Signed analogue of line graphs and their smallest eigenvalues

In this paper, we show that every connected signed graph with smallest eigenvalue strictly greater than $-2$ and large enough minimum degree is switching equivalent to a complete graph. This is a signed analogue of a theorem of Hoffman. The proof is based on what we call Hoffman's limit theorem which we formulate for Hermitian matrices, and also the extension of the concept of Hoffman graph and line graph for the setting of signed graphs.

math.CO↗