• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Group action, Polya-Redfield-De Bruijn Counting and its application

Research Project

Project/Area Number 13640081
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeSingle-year Grants
Section一般
Research Field Geometry
Research InstitutionNagasaki University

Principal Investigator

KAJIMOTO Hiroshi  Nagasaki University, Faculty of Education, Assistant Professor, 教育学部, 助教授 (50194741)

Co-Investigator(Kenkyū-buntansha) SUGAWARA Tamio  Nagasaki University, Faculty of Education, Professor, 教育学部, 教授 (10034711)
SAWAE Ryuichi  Okayama University of Science, Faculty of Science, Assistant Professor, 理学部, 助教授 (20226062)
Project Period (FY) 2001 – 2002
Project Status Completed (Fiscal Year 2002)
Budget Amount *help
¥3,300,000 (Direct Cost: ¥3,300,000)
Fiscal Year 2002: ¥1,400,000 (Direct Cost: ¥1,400,000)
Fiscal Year 2001: ¥1,900,000 (Direct Cost: ¥1,900,000)
KeywordsPrufer code / counting / blocks / Polya theory / group action / generating function / words / polya theory / Prtifer code / biconnected component / generationg function
Research Abstract

In this research project we reconsider the classical generating function formulae of enumeration of non-equivalent patterns with respect to given permutation group, due to Polya-Redfield-De Bruijn, with focus to the weight. We give a formula of generating function of the Twelvefold Way. Furthermore we pursue possibility of a weight which gives all the patterns one by one. On the other hand we extend the Prufer code of Cayley trees to connected labeled graphs those are 1-connected but not 2-connected, as an application of counting of the 3^<rd> row of the Twelvefold Way. This is done after an advice of our mathematical physics investigator, and intend to understand combinatorial meaning of a coefficients in the cluster expansion of state equation of an imperfect gas in statistical mechanics, by graph theory terms. Through these we mainly intend to contribute to algebraic combinatorics, such as combinatorial enumeration, P61Ya's counting theory and generating function.
Obtained results were announced by 2 international research conferences, and part of those are in press now. Though there are many unsatisfactory points as whole of the research, especially in one by one enumeration, we give a report of our research results in this term of project, with this grand-in-aid for scientific research. We appreciate helps of many anonymous cooperators.

Report

(3 results)
  • 2002 Annual Research Report   Final Research Report Summary
  • 2001 Annual Research Report
  • Research Products

    (4 results)

All Other

All Publications (4 results)

  • [Publications] Hiroshi Kajimoto: "An Extension of the Prufer Code and Assembly of Connected Graphs from their Blocks"Graphs and Combinatorics. (印刷中).

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2002 Final Research Report Summary
  • [Publications] Hiroshi Kajimoto: "An Extension of the Prufer code and Assembly of Connected Graphs from their Blocks"Graphs and Combinatorics. in press.

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2002 Final Research Report Summary
  • [Publications] Hiroshi Kajimoto: "An Extension of the Prufer Code and Assembly of Connected Graphs from their Blocks"Graphs and Combinatorics. (印刷中).

    • Related Report
      2002 Annual Research Report
  • [Publications] Hiroshi Kajimoto: "An Extension of the Prufer code and Assembly of Connected Grapha from their Blocks"Grapha and Combinatorics.

    • Related Report
      2001 Annual Research Report

URL: 

Published: 2001-04-01   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi