본문 바로가기
KERD
논문KCI 등재

ON 4-EQUIVALENCED ASSOCIATION SCHEMES

1

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류수학

초록

Let (Ω,S) be an association scheme where Ω is a non-empty finite set and S is a partition of Ω×Ω. For a positive integer k we say that (Ω,S) is k-equivalenced if each non-diagonal element of S has valency k. In this paper we focus on 4-equivalenced association schemes, and prove that they are transitive.

Abstract

Let (Ω,S) be an association scheme where Ω is a non-empty finite set and S is a partition of Ω×Ω. For a positive integer k we say that (Ω,S) is k-equivalenced if each non-diagonal element of S has valency k. In this paper we focus on 4-equivalenced association schemes, and prove that they are transitive.

참고문헌 (12)

  1. Z. Arad, "On even generalized table algebras", J. Algebraic Combin, 17(2), pp.163~170 (2003)
  2. Z. Arad, "On homogeneous standard integral table algebras of degree 4", Comm. Algebra, 34(2), pp.463~519 (2006)
  3. E. Bannai, "Algebraic Combinatorics. I", pp.1984, The Benjamin
  4. C. J. Colbourn, "Handbook of Combinatorial Designs" (2010), CRC press
  5. E. R. van Dam, "A characterization of association schemes from affine spaces", Des. Codes Cryptogr, 21(1-3), pp.83~86 (2000)
  6. J. D. Dixon, "Permutation Groups" (1996), Springer-Verlag
  7. "Classification of association schemes with small vertices"[URL]
  8. M. Hirasaka, "Every 3-equivalenced association scheme is Frobenius", J. Algebraic Combin, 41(1), pp.217~228 (2015)
  9. M. Muzychuk, "On pseudocyclic association schemes", Ars Math. Contemp, 5(1), pp.1~25 (2012)
  10. M. Muzychuk, "On association schemes all elements of which have valency 1 or 2", Discrete Math, 308(14), pp.3097~3103 (2008)
  11. P.-H. Zieschang, "An algebraic approach to association schemes", Lecture Notes in Math-ematics, 1628 (1996), Springer-Verlag
  12. P.-H. Zieschang, "Theory of Association Schemes, Springer Monograph in Mathematics" (2005), Springer-Verlag

관련 논문AI추천

이 간행물의 다른 논문 (26건)