Mitsugu Hirasaka’s research while affiliated with Pusan National University and other places

What is this page?


This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.

Publications (51)


Association schemes with a certain type of p-subschemes
  • Preprint
  • File available

December 2021

·

43 Reads

·

Mitsugu Hirasaka

In this article, we focus on association schemes with some properties derived from the orbitals of a transitive permutation group G with a one-point stabilizer H satisfying H<NG(H)<NG(NG(H))GH <N_G(H)<N_G(N_G(H))\unlhd G and NG(NG(H))=p3|N_G(N_G(H))|=p^3 where p is a prime. By a corollary of our main result we obtain some inequality which corresponds to the fact G:NG(NG(H))p+1|G:N_G(N_G(H))|\leq p+1.

Download

A Note on Moore Cayley Digraphs

September 2021

·

52 Reads

·

1 Citation

Graphs and Combinatorics

Let ΔΔ\varDelta be a digraph of diameter 2 with the maximum undirected vertex degree t and the maximum directed out-degree z. The largest possible number v of vertices of ΔΔ\varDelta is given by the following generalization of the Moore bound: v≤(z+t)2+z+1,v(z+t)2+z+1,\begin{aligned} v\le (z+t)^2+z+1, \end{aligned}and a digraph attaining this bound is called a Moore digraph. Apart from the case t=1t=1, only three Moore digraphs are known, which are also Cayley graphs. Using computer search, Erskine (J Interconnect Netw, 17: 1741010, 2017) ruled out the existence of further examples of Cayley digraphs attaining the Moore bound for all orders up to 485. We use an algebraic approach to this problem, which goes back to an idea of G. Higman from the theory of association schemes, also known as Benson’s Lemma in finite geometry, and show non-existence of Moore Cayley digraphs of certain orders.


Fig. 2 The relations r and s are linked with respect to (x, y, z)
Two-valenced association schemes and the Desargues theorem

December 2020

·

47 Reads

·

2 Citations

Arabian Journal of Mathematics

The main goal of the paper is to establish a sufficient condition for a two-valenced association scheme to be schurian and separable. To this end, an analog of the Desargues theorem is introduced for a noncommutative geometry defined by the scheme in question. It turns out that if the geometry has enough many Desarguesian configurations, then under a technical condition, the scheme is schurian and separable. This result enables us to give short proofs for known statements on the schurity and separability of quasi-thin and pseudocyclic schemes. Moreover, by the same technique, we prove a new result: given a prime p, any {1,p}\{1,p\}-scheme with thin residue isomorphic to an elementary abelian p-group of rank greater than two, is schurian and separable.


Association schemes with a certain type of p-subschemes

September 2020

·

54 Reads

Ars Mathematica Contemporanea

In this article, we focus on association schemes with some properties derived from the orbitals of a transitive permutation group G with a one-point stabilizer H satisfying H < NG(H)< NG(NG(H)) \trianglelefteq G and |NG(NG(H))|=p^3 where p is a prime, By a corollary of our main result we obtain some inequality which corresponds to the fact |G:NG(NG(H))|≤ p+ 1.


Cheracterization of p-scheme using thin residue

April 2019

·

62 Reads

In this paper, we are focusing on {1, 3}-schemes. In my work I am going to prove that {1, 3}-schemes whose thin residues are isomorphic to C 3 C 3 and each relation out of thin residue has valency 3, are finite. REFERENCES 1. S. Bandyopadhyay, P.O. Boykin, V. Roychowdhury, F. Vatan, A new proof for the existence of mutually unbiased bases, Quantum computation and quantum cryptography.


Two-valenced association schemes and the Desargues theorem

November 2018

·

67 Reads

The main goal of the paper is to establish a sufficient condition for a two-valenced association scheme to be schurian and separable. To this end, an analog of the Desargues theorem is introduced for a noncommutative geometry defined by the scheme in question. It turns out that if the geometry has enough many Desarguesian configurations, then under a technical condition the scheme is schurian and separable. This result enables us to give short proofs for known statements on the schurity and separability of quasi-thin and pseudocyclic schemes. Moreover, by the same technique we prove a new result: given a prime p, any {1,p}\{1,p\}-scheme with thin residue isomorphic to an elementary abelian p-group of rank greater than two, is schurian and separable.


Characterization of finite colored spaces with certain conditions

February 2018

·

11 Reads

A colored space is the pair (X,r) of a set X and a function r whose domain is (X2)\binom{X}{2}. Let (X,r) be a finite colored space and Y,ZXY,Z\subseteq X. We shall write YrZY\simeq_r Z if there exists a bijection f:YZf:Y\to Z such that r(U)=r(f(U)) for each U(Y2)U\in\binom{Y}{2}. We denote the numbers of equivalence classes with respect to r\simeq_r contained in (X2)\binom{X}{2} and (X3)\binom{X}{3} by a2(r)a_2(r) and a3(r)a_3(r), respectively. In this paper we prove that a2(r)a3(r)a_2(r)\leq a_3(r) when 5X5\leq |X|, and show what happens when the equality holds.


Characterization of finite metric space By their isometric sequences

February 2018

·

34 Reads

·

2 Citations

Let (X,d) be a finite metric space with X=n|X|=n. For a positive integer k we define Ak(X)A_k(X) to be the quotient set of all k-subsets of X by isometry, and we denote Ak(X)|A_k(X)| by aka_k. The sequence (a1,a2,,an)(a_1,a_2,\ldots,a_{n}) is called the \textit{isometric} sequence of (X,d). In this article we aim to characterize finite metric spaces by their isometric sequences under one of the following assumptions: (i) ak=1a_k=1 for some k with 2kn22\leq k\leq n-2; (ii) ak=2a_k=2 for some k with 4k1+1+4n24\leq k\leq \frac{1+\sqrt{1+4n}}{2}; (iii) a3=2a_3=2; (iv) a2=a3=3a_2=a_3=3. Furthermore, we give some criterion on how to embed such finite metric spaces to Euclidean spaces. We give some maximum cardinalities of subsets in the d-dimensional Euclidean space with small a3a_3, which are analogue pro


Schurity and separability of quasiregular coherent configurations

January 2018

·

309 Reads

·

6 Citations

Journal of Algebra

A permutation group is said to be quasiregular if every its transitive constituent is regular, and a quasiregular coherent configuration can be thought as a combinatorial analog of such a group: the transitive constituents are replaced by the homogeneous components. In this paper, we are interested in the question when the configuration is schurian, i.e., formed by the orbitals of a permutation group, or/and separable, i.e., uniquely determined by the intersection numbers. In these terms, an old result of Hanna Neumann is, in a sense, dual to the statement that the quasiregular coherent configurations with cyclic homogeneous components are schurian. In the present paper, we (a) establish the duality in a precise form and (b) generalize the latter result by proving that a quasiregular coherent configuration is schurian and separable if the groups associated with homogeneous components have distributive lattices of normal subgroups.



Citations (31)


... Namely, the already mentioned Bosák digraph, and the two digraphs of Jørgensen [14]; see later Theorem 3.2 by Erskine [9]. Some proofs of the non-existence of Cayley Moore digraphs for some order values have been given by López, Pérez-Rosés, and Pujolàs [17], López, Miret, and Fernández [16] , Erskine [9], and Gavrilyuk, Hirasaka, and Kabanov [12]. ...

Reference:

Moore mixed graphs from Cayley graphs
A Note on Moore Cayley Digraphs

Graphs and Combinatorics

... In [ELMP18], Epstein et al. showed that the optimal configuration determining one distinct triangle is the vertices of the square, and the optimal configurations determining two distinct triangles are the square with its center and the vertices of the regular pentagon. In [BDGPSed], Brenner et al. determine that the unique optimal configuration determining one distinct triangle is the d-simplex in R d for d ≥ 3. Finally, in [HS18], Hirasaka and Shinohara determined that an optimal configuration determining two triangles is the d-orthoplex in R d for d ≥ 3. As our main result, we provide a more elementary argument that the d-orthoplex is an optimal configuration determining two distinct triangles and offer a proof that it is in fact the unique optimal configuration determining two distinct triangles. ...

Characterization of finite metric space By their isometric sequences
  • Citing Article
  • February 2018

... In the case M = Λ, ζ Λ (s) := ζ Λ (Λ; s) is called the zeta function of Λ, and is the generating function for the sequence {a n } that counts the number of ideals of index n.In [20], Solomon gave a calculation of ζ Λ (s) in the case where Λ = ZG is an integral group ring of a finite cyclic group of prime order p. Work of Hironaka ([16], [15]) and Takegahara ([21]) in the 1980s produced the calculations of ζ ZG (s) where G is any abelian of order pq, where p and q are notnecessarily distinct primes. The same elementary approach was used by Hanaki and Hirasaka for integral adjacency rings of association schemes that have prime order or rank 2 [11], and by Hirasaka and Oh for quotient polynomial rings of the form Z[x]/(x − k)(x − a)(x − b) for k, a, b ∈ Z [14]. In [2], the authors applied a formula involving local zeta integrals due to Bushnell and Reiner in [6] to give explicit calculations of ζ ZB (s), where ZB was the integral adjacency ring of certain small association schemes with rational character tables. ...

The number of ideals of Z [ x ] containing x ( x − α )( x − β ) with given index
  • Citing Article
  • September 2017

Journal of Algebra

... In the case M = Λ, ζ Λ (s) := ζ Λ (Λ; s) is called the zeta function of Λ, and is the generating function for the sequence {a n } that counts the number of ideals of index n.In [20], Solomon gave a calculation of ζ Λ (s) in the case where Λ = ZG is an integral group ring of a finite cyclic group of prime order p. Work of Hironaka ([16], [15]) and Takegahara ([21]) in the 1980s produced the calculations of ζ ZG (s) where G is any abelian of order pq, where p and q are notnecessarily distinct primes. The same elementary approach was used by Hanaki and Hirasaka for integral adjacency rings of association schemes that have prime order or rank 2 [11], and by Hirasaka and Oh for quotient polynomial rings of the form Z[x]/(x − k)(x − a)(x − b) for k, a, b ∈ Z [14]. In [2], the authors applied a formula involving local zeta integrals due to Bushnell and Reiner in [6] to give explicit calculations of ζ ZB (s), where ZB was the integral adjacency ring of certain small association schemes with rational character tables. ...

Zeta functions of adjacency algebras of association schemes of prime order or rank two
  • Citing Article
  • February 2016

Hokkaido Mathematical Journal

... (a) Using the Hermite normal form approach. The zeta function of the integral adjacency algebra ZK n corresponding to the complete graph association scheme K n was computed using this method by Hanaki and Hirasaka [7] and extended in [9] to the zeta function of OK n where O is the ring of integers in an algebraic number field. ...

Zeta functions for tensor products of locally coprime integral adjacency algebras of association schemes

Communications in Algebra

... Thus, there exists a large family of non-Schurian schemes. We remark that there are substantial studies on construction of non-Schurian schemes, e.g., Evdokimov-Ponomarenko [5], Hanaki-Hirai-Ponomarenko [7], and Hirasaka-Kim [8]. Non-Schurian Schur rings are of particular interest since historically Wielandt [18,Theorem 26.4] found such an example, answering a question by Schur. ...

Association schemes in which the thin residue is an elementary abelian p-group of rank 2
  • Citing Article
  • May 2015

Journal of Algebra