トップ   新規 一覧 検索 最終更新   ヘルプ   最終更新のRSS

Hakata Workshop;Winter Meeting 2020 の履歴(No.3)

Hakata Workshop; Winter Meeting 2020†

〜Discrete Mathematics and its Applications〜

 

Our purpose in this meeting is giving an opportunity to make a speech and to communicate with researchers who study various fields not only Combinatorics.

Further information is available from the organizers below.

↑

Organizers†

  • Yoshihiro Mizoguchi (Kyushu University),
  • Tetsuji Taniguchi (Hiroshima Institute of Technology),
  • Osamu Shimabukuro (Nagasaki University),
  • Makoto Tagami (Kyushu Institute of Technology),
  • Hirotake Kurihara (Kitakyushu National College of Technology),
  • Shuya Chiba (Kumamoto University),
  • Tsuyoshi Miezaki (University of the Ryukyus),
  • Daniel GAINA (Kyushu University),
  • Ryoya Fukasaku(Kyushu University).
↑

Supported by†

↑

Date†

February 21 and 22, 2019

↑

Location†

  • Saturday, February 22 Seminar Room P (4F) in Reference Eki Higashi Building. 1-16-14 Hakata-Eki-Higashi, Hakata-Ku, Fukuoka City, 812-0013 (see http://www.re-rental.com/ , Google maps )
↑

Program†

↑

List of Poster session speakers†

↑

Software in Mathematics Demonstration Track in Hakata Workshop 2020†

  1. TBA
↑

Abstract†

↑

Shuya Chiba†

  • Title: Induced nets and Hamiltonicity of claw-free graphs
  • Abstract: The connected graph of degree sequence $3,3,3,1,1,1$ is called a net, and the vertices of degree $1$ in a net are called its end-vertices. In 1993, Broersma conjectured that a $2$-connected graph $G$ with no induced $K_{1,3}$ is hamiltonian if every end-vertex of each induced net of $G$ has degree at least $(|V(G)|-2)/3$, which is a generalization of two classical results obtained by Matthews and Sumner (1985) and by Duffus, Gould and Jacobson (1981). In this study, we prove this conjecture in the affirmative by analyzing the difference of the vertex degree between the Ryj\'a\v{c}ek closure and the original graph.
↑

Yuki Irie†

  • Title: Representations of Symmetric Groups and the Game of Maya
  • Abstract: In the 1970s, Mikio Sato conjectured that Maya, which is a game played with a Young diagram, is related to representations of symmetric groups. In support of this conjecture, he pointed out that its Sprague-Grundy function can be expressed in a form similar to the hook-length formula. Here, using the Sprague-Grundy function, we can give the winning way of the game.
     
    In this talk, we present a relation between representations of symmetric groups and Maya. Irreducible representations with degree prime to p play an important role, where p is a prime.
↑

Hiroyasu Hamada†

  • Title: C^*-algebras generated by multiplication operators and composition operators by functions with self-similar branches
  • Abstract: I talk about definitions and examples of C^*-algebras, definition and examples of composition operators, and my researches. In my researches, I explain C^*-algebras generated by multiplication operators and composition operators by functions with self-similar branches are isomorphic to the C^*-algebras associated with self-similar maps introduced by Kajiwara and Watatani under some condition.
↑

Tatsuyoshi Hamada†

  • Title: MathLibre: Mathematical Software Environment
  • Abstract: MathLibre is a project to archive open source mathematical software and free mathematical documents and offer them on Live Linux system. MathLibre Project is the direct descendant of KNOPPIX/Math Project. It provides a desktop for mathematicians that can be set up easily and quickly. If your machine is not DVD bootable, or has very special hardware devices which MathLibre cannot drive, we recommend you download virtual machine like “Virtual Box”. Once you have installed the virtual machine, you can start our live system from DVD or from ISO image file. The instructions for installing and using the virtual machine can be found in our DVD.