Zobrazeno 1 - 10
of 290
pro vyhledávání: '"Munemasa, Akihiro"'
We determine the smallest size of a non-antipodal spherical design with harmonic indices $\{1,3,\dots,2m-1\}$ to be $2m+1$, where $m$ is a positive integer. This is achieved by proving an analogous result for interval designs.
Comment: 14 pages
Comment: 14 pages
Externí odkaz:
http://arxiv.org/abs/2410.09471
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 a
Externí odkaz:
http://arxiv.org/abs/2403.09985
In the present paper, we construct 3-designs using extended binary quadratic residue codes and their dual codes.
Comment: 11 pages. arXiv admin note: text overlap with arXiv:2303.16349. substantial text overlap with arXiv:2305.03285 by other aut
Comment: 11 pages. arXiv admin note: text overlap with arXiv:2303.16349. substantial text overlap with arXiv:2305.03285 by other aut
Externí odkaz:
http://arxiv.org/abs/2309.03206
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-regul
Externí odkaz:
http://arxiv.org/abs/2307.12710
Autor:
Miezaki, Tsuyoshi, Munemasa, Akihiro
In the present paper, we give harmonic weight enumerators and Jacobi polynomials for the first-order Reed--Muller codes and the extended Hamming codes. As a corollary, we show the nonexistence of combinatorial $4$-designs in these codes.
Comment
Comment
Externí odkaz:
http://arxiv.org/abs/2303.16349
Autor:
Munemasa, Akihiro, Tanaka, Yuuho
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 de
Externí odkaz:
http://arxiv.org/abs/2302.09283
Autor:
Ikuta, Takuya, Munemasa, Akihiro
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
Externí odkaz:
http://arxiv.org/abs/2109.14810
We classify maximal digraphs whose Hermitian spectral radius is at most $2$.
Externí odkaz:
http://arxiv.org/abs/2109.09114
Publikováno v:
In Finite Fields and Their Applications March 2024 95
In this paper, we discuss maximality of Seidel matrices with a fixed largest eigenvalue. We present a classification of maximal Seidel matrices of largest eigenvalue $3$, which gives a classification of maximal equiangular lines in a Euclidean space
Externí odkaz:
http://arxiv.org/abs/2102.11989