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

Nakamigawa Tomoki  中上川 友樹

ORCIDConnect your ORCID iD *help
… Alternative Names

NAKAMIGAWA Tomoki  中上川 友樹

Less
Researcher Number 20386890
Other IDs
Affiliation (based on the past Project Information) *help 2022 – 2023: 湘南工科大学, 情報学部, 教授
2017 – 2021: 湘南工科大学, 工学部, 教授
2016: 湘南工科大学, 工学部, 准教授
2011 – 2013: 湘南工科大学, 工学部, 准教授
Review Section/Research Field
Principal Investigator
Basic Section 12030:Basic mathematics-related / Foundations of mathematics/Applied mathematics / General mathematics (including Probability theory/Statistical mathematics)
Keywords
Principal Investigator
組合せ論 / 離散数学 / 幾何グラフ / Tutte多項式 / コードダイアグラム / オイラー数 / トレミーの定理 / Genocci数 / トレミー関係式 / トレミー重み … More / 弦展開 / 増大木 / ヤング図形 / 三角形分割 / インターレースグラフ / グラフの石交換群 / グラフの自己同型群 / グラフパズル / グラフの自己同型 / グラフ理論 / 誘導部分グラフ / グラフ分割 / 極値グラフ理論 / ラムゼー理論 Less
  • Research Projects

    (3 results)
  • Research Products

    (43 results)
  • Co-Researchers

    (2 People)
  •  A study of combinatorial problems caused by the crossing of chordsPrincipal Investigator

    • Principal Investigator
      Nakamigawa Tomoki
    • Project Period (FY)
      2019 – 2023
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Review Section
      Basic Section 12030:Basic mathematics-related
    • Research Institution
      Shonan Institute of Technology
  •  A study of deformation operations of graphsPrincipal Investigator

    • Principal Investigator
      Nakamigawa Tomoki
    • Project Period (FY)
      2016 – 2018
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Foundations of mathematics/Applied mathematics
    • Research Institution
      Shonan Institute of Technology
  •  Study of Ramsey-type decomposition problemsPrincipal Investigator

    • Principal Investigator
      NAKAMIGAWA Tomoki
    • Project Period (FY)
      2011 – 2013
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      General mathematics (including Probability theory/Statistical mathematics)
    • Research Institution
      Shonan Institute of Technology

All 2023 2022 2021 2020 2019 2018 2017 2016 2014 2013 2012 2011

All Journal Article Presentation

  • [Journal Article] A Correspondence between Chord Diagrams and Families of 0-1 Young Diagrams2023

    • Author(s)
      Tomoki Nakamigawa
    • Journal Title

      Math arXiv

      Volume: -

    • Data Source
      KAKENHI-PROJECT-19K03607
  • [Journal Article] The expansion of a chord diagram and the Genocchi numbers2020

    • Author(s)
      Tomoki Nakamigawa
    • Journal Title

      Ars Mathematica Contemporanea

      Volume: 18 Issue: 2 Pages: 381-391

    • DOI

      10.26493/1855-3974.2239.7f1

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19K03607
  • [Journal Article] The Expansion of a Chord Diagram and the Tutte Polynomial2018

    • Author(s)
      Tomoki Nakamigawa and Tadashi Sakuma
    • Journal Title

      Discrete Mathematics

      Volume: 341 Issue: 6 Pages: 1573-1581

    • DOI

      10.1016/j.disc.2018.02.015

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-26400185, KAKENHI-PROJECT-18K03388, KAKENHI-PROJECT-16K05260
  • [Journal Article] The Expansion of a Chord Diagram and the Tutte Polynomial(extended abstract)2017

    • Author(s)
      T. Nakamigawa and T. Sakuma
    • Journal Title

      Electronic Notes in Discrete Mathematics

      Volume: 61 Pages: 917-923

    • DOI

      10.1016/j.endm.2017.07.054

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16K05260, KAKENHI-PROJECT-26400185
  • [Journal Article] Enumeration Problems on the Expansion of a Chord Diagram2016

    • Author(s)
      T. Nakamigawa
    • Journal Title

      Electronic Notes in Discrete Mathematics

      Volume: 54 Pages: 51-56

    • DOI

      10.1016/j.endm.2016.09.010

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-16K05260
  • [Journal Article] A Ramsey-type theorem for multiple disjoint copies of induced subgraphs2014

    • Author(s)
      T. Nakamigawa
    • Journal Title

      Discussiones Mathematicae Graph Theory

      Volume: 34 Pages: 249-261

    • Data Source
      KAKENHI-PROJECT-23540168
  • [Journal Article] Pebble exchange on graphs2013

    • Author(s)
      S. Fujita, T. Nakamigawa and T. Sakuma
    • Journal Title

      Discrete Applied Mathematics

      Volume: 184 Pages: 139-145

    • DOI

      10.1016/j.dam.2013.03.009

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23540168, KAKENHI-PROJECT-26400185
  • [Journal Article] グラフ上の石移動と石交換 (デザイン、符号、グラフおよびその周辺)2013

    • Author(s)
      中上川 友樹
    • Journal Title

      京都大学数理解析研究所講究録

      Volume: 1844 Pages: 113-123

    • NAID

      120005554626

    • Data Source
      KAKENHI-PROJECT-23540168
  • [Journal Article] Colored Pebble Motion on Graphs2012

    • Author(s)
      S. Fujita, T. Nakamigawa and T. Sakuma
    • Journal Title

      European J. Combinatorics

      Volume: 33 Issue: 5 Pages: 884-892

    • DOI

      10.1016/j.ejc.2011.09.019

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23540168
  • [Journal Article] Colored pebble motion on graphs2012

    • Author(s)
      S. Fujita, T. Nakamigawa and T. Sakuma
    • Journal Title

      European J. Combinatorics

      Volume: 33 Pages: 884-892

    • Data Source
      KAKENHI-PROJECT-23540168
  • [Journal Article] Counting lattice paths via a new cycle lemma2012

    • Author(s)
      T. Nakamigawa and N. Tokushige
    • Journal Title

      SIAM J. Discrete Math

      Volume: 26 Pages: 745-754

    • Data Source
      KAKENHI-PROJECT-23540168
  • [Journal Article] Counting lattice paths via a new cycle lemma2012

    • Author(s)
      T.Nakamigawa, N.Tokushige
    • Journal Title

      SIAM J. Discrete Math

      Volume: 26 Issue: 2 Pages: 745-754

    • DOI

      10.1137/100796431

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20340022, KAKENHI-PROJECT-23540168
  • [Journal Article] Nodedisjoint paths in a level block of generalized hierarchical completely-connected networks2012

    • Author(s)
      T. Takabatake and T. Nakamigawa
    • Journal Title

      Theoretical Computer Science

      Volume: 465 Pages: 28-34

    • DOI

      10.1016/j.tcs.2012.09.016

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23540168
  • [Journal Article] Nodedisjoint paths in a level block of Generalized hierarchical completely-connected networks2012

    • Author(s)
      T. Takabatake and T. Nakamigawa
    • Journal Title

      Theoretical Computer Science

      Volume: 465 Pages: 28-34

    • Data Source
      KAKENHI-PROJECT-23540168
  • [Presentation] Even-odd Increasing Trees and Expansion of a Chord Diagram2023

    • Author(s)
      Tomoki Nakamigawa
    • Organizer
      European Conference on Combinatorics, Graph Theory and Applications, Aug. 28-Sep. 1, 2023, at Charles University in Prague.
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K03607
  • [Presentation] 細分された辺を持つ凸多角形の三角形分割の数え上げ2022

    • Author(s)
      中上川 友樹
    • Organizer
      応用数学合同研究集会
    • Data Source
      KAKENHI-PROJECT-19K03607
  • [Presentation] On the Multiplicity of a Nonintersecting Chord Diagram Generated by Chord Expansions2021

    • Author(s)
      Tomoki Nakamigawa
    • Organizer
      28th British Combinatorial Conference
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K03607
  • [Presentation] 幾何グラフの展開と0-1ヤング図形2021

    • Author(s)
      中上川 友樹
    • Organizer
      応用数学合同研究集会
    • Data Source
      KAKENHI-PROJECT-19K03607
  • [Presentation] コードダイアグラムの展開とトレミー重み2020

    • Author(s)
      中上川 友樹
    • Organizer
      応用数学合同研究集会
    • Data Source
      KAKENHI-PROJECT-19K03607
  • [Presentation] The Expansion of a Chord Diagram and the Genocchi Numbers2019

    • Author(s)
      Tomoki Nakamigawa
    • Organizer
      27th British Combinatorial Conference
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K03607
  • [Presentation] n-交差の展開により生成される非交差コードダイアグラムの分布について2019

    • Author(s)
      中上川 友樹
    • Organizer
      応用数学合同研究集会
    • Data Source
      KAKENHI-PROJECT-19K03607
  • [Presentation] Pebble Exchange on Graphs and Graph Automorphism2018

    • Author(s)
      Tomoki Nakamigawa
    • Organizer
      10th International Colloquium on Graph Theory and combinatorics, July 9-13, 2018 at University Claude Bernard Lyon
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K05260
  • [Presentation] 一般三角形分割の出次数列について2018

    • Author(s)
      中上川 友樹
    • Organizer
      応用数学合同研究集会,龍谷大学,2018年12月.
    • Data Source
      KAKENHI-PROJECT-16K05260
  • [Presentation] グラフの石交換群2017

    • Author(s)
      中上川友樹,加藤立隆,佐久間雅
    • Organizer
      応用数学合同研究集会
    • Data Source
      KAKENHI-PROJECT-16K05260
  • [Presentation] The expansion of a chord diagram and the Tutte polynomial2017

    • Author(s)
      T. Nakamigawa and T. Sakuma
    • Organizer
      The European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB'17)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K05260
  • [Presentation] コードダイアグラムの展開とTutte多項式2016

    • Author(s)
      中上川 友樹,佐久間 雅
    • Organizer
      2016年度応用数学合同研究集会
    • Place of Presentation
      龍谷大学(滋賀県大津市)
    • Year and Date
      2016-12-15
    • Data Source
      KAKENHI-PROJECT-16K05260
  • [Presentation] Enumeration Problems on the Expansion of a Chord Diagram2016

    • Author(s)
      T. Nakamigawa
    • Organizer
      Discrete Mathematics Days - JMDA16
    • Place of Presentation
      カタルーニャ工科大学(スペイン,バルセロナ)
    • Year and Date
      2016-07-05
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K05260
  • [Presentation] A Ramsey-type Theorem for Multiple Disjoint Copies of Induced Subgraphs (Extended Abstract)2013

    • Author(s)
      T. Nakamigawa
    • Organizer
      Electronic Notes in Discrete Mathematics (Vol. 43 (Eldõs Centennial))
    • Data Source
      KAKENHI-PROJECT-23540168
  • [Presentation] An extremal problem for vertex decomposition of complete multipartite graphs2013

    • Author(s)
      Tomoki Nakamigawa
    • Organizer
      Graph Theory Conference in honor of Yoshimi Egawa on the occasion of his 60th birthday
    • Place of Presentation
      Kagurazaka Campus of Tokyo University of Science
    • Data Source
      KAKENHI-PROJECT-23540168
  • [Presentation] A Ramsey-type Theorem for Multiple Disjoint Copies of Induced Subgraphs (Extended Abstract)2013

    • Author(s)
      Tomoki Nakamigawa
    • Organizer
      Erdos Centennial Conference
    • Place of Presentation
      Budapest, Hungary
    • Data Source
      KAKENHI-PROJECT-23540168
  • [Presentation] An extremal problem for vertex decomposition of complete multipartite graphs2013

    • Author(s)
      T. Nakamigawa
    • Organizer
      Graph Theory Conference in honor of Yoshimi Egawa on the occasion of his 60th birthday
    • Data Source
      KAKENHI-PROJECT-23540168
  • [Presentation] Hamiltonian path in generalized hierarchical completely-connected networks2012

    • Author(s)
      T. Takabatake and T. Nakamigawa
    • Organizer
      The 3rd International Conference on Mathematical Models for Engineering Science
    • Place of Presentation
      Paris, France
    • Data Source
      KAKENHI-PROJECT-23540168
  • [Presentation] 誘導部分グラフの点素なコピーについて2012

    • Author(s)
      中上川 友樹
    • Organizer
      関西グラフ理論研究集会
    • Place of Presentation
      加計国際学術交流センター(倉敷)
    • Data Source
      KAKENHI-PROJECT-23540168
  • [Presentation] グラフの頂点集合の分割に関する問題2012

    • Author(s)
      中上川 友樹
    • Organizer
      応用数学合同研究集会
    • Place of Presentation
      龍谷大学瀬田キャンパス
    • Data Source
      KAKENHI-PROJECT-23540168
  • [Presentation] グラフ上の石移動と石交換2012

    • Author(s)
      中上川 友樹
    • Organizer
      RIMS共同研究『デザイン、符号、グラフおよびその周辺』
    • Place of Presentation
      京都大学数理解析研究所
    • Invited
    • Data Source
      KAKENHI-PROJECT-23540168
  • [Presentation] グラフ上の石移動と石交換2012

    • Author(s)
      中上川 友樹
    • Organizer
      RIMS 共同研究『デザイン, 符号, グラフおよびその周辺』
    • Place of Presentation
      京都大学数理解析研究所
    • Data Source
      KAKENHI-PROJECT-23540168
  • [Presentation] Hamiltonian path in generalized hierarchical completely-connected networks2012

    • Author(s)
      T. Takabatake, T. Nakamigawa
    • Organizer
      Proceedings of the 3rd International Conference on Mathematical Models for Engineering Science
    • Place of Presentation
      Paris, France
    • Data Source
      KAKENHI-PROJECT-23540168
  • [Presentation] 誘導部分グラフの点素なコピーについて2012

    • Author(s)
      中上川 友樹
    • Organizer
      渡辺守先生ご退職記念関西グラフ理論研究集会
    • Place of Presentation
      加計国際学術交流センター
    • Data Source
      KAKENHI-PROJECT-23540168
  • [Presentation] 誘導部分グラフの点素なコピーに関するラムゼー型問題2012

    • Author(s)
      中上川 友樹
    • Organizer
      日本数学会2012年度秋季総合分科会
    • Place of Presentation
      九州大学
    • Data Source
      KAKENHI-PROJECT-23540168
  • [Presentation] グラフの頂点集合の分割に関する問題2012

    • Author(s)
      中上川 友樹
    • Organizer
      応用数学合同研究集会
    • Place of Presentation
      龍谷大学
    • Data Source
      KAKENHI-PROJECT-23540168
  • [Presentation] Evaluation of the node-disjoint paths in a level block of generalized hierarchical completely-connected networks2012

    • Author(s)
      T. Takabatake, T. Nakamigawa
    • Organizer
      Proceedings of the 13th Symposium of Mathematics and its Applications, Politehnica University of Timisoara
    • Place of Presentation
      Politehnica University of Timisoara, Romania
    • Data Source
      KAKENHI-PROJECT-23540168
  • [Presentation] グラフ上の石交換2011

    • Author(s)
      中上川 友樹
    • Organizer
      応用数学合同研究集会
    • Place of Presentation
      龍谷大学瀬田キャンパス
    • Data Source
      KAKENHI-PROJECT-23540168
  • [Presentation] グラフの点素かつ同型な誘導部分グラフ2011

    • Author(s)
      中上川 友樹
    • Organizer
      日本数学会秋季総合分科会応用数学分科会
    • Place of Presentation
      信州大学松本キャンパス
    • Data Source
      KAKENHI-PROJECT-23540168
  • 1.  佐久間 雅 (60323458)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 5 results
  • 2.  徳重 典英
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results

URL: 

Are you sure that you want to link your ORCID iD to your KAKEN Researcher profile?
* This action can be performed only by the researcher himself/herself who is listed on the KAKEN Researcher’s page. Are you sure that this KAKEN Researcher’s page is your page?

この研究者とORCID iDの連携を行いますか?
※ この処理は、研究者本人だけが実行できます。

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi