20130124 の履歴(No.1)
九州大学 代数・組合せ数学 日韓合同ワークショップ†
～ Japan-Korea Workshop on Algebra and Combinatorics ～
The 11th Japan-Korea Workshop on Algebra and Combinatorics will take place at Fukuoka City in Japan, from 24-25, January 2013. The workshop is held once a year, alternatively in Japan and in Korea. It is intended to provide researchers of both countries, especially young researchers including graduate students, with opportunities to exchange rather informal information of ongoing studies in the area. Further information is available from the organizers below.
Organizers†
Eiichi Bannai (Shanghai Jiao Tong University)
Jung Rae Cho (Pusan National University)
Mitsugu Hirasaka (Pusan National University)
Tatsuro Ito (Kanazawa University)
Hyun Kwang Kim (POSTECH)
Jack Koolen (POSTECH)
Yoshihiro Mizoguchi (Kyushu University),
Akihiro Munemasa (Tohoku University)
Supported by†
Global COE Program "Education and Research Hub for Mathematics-for-Industry"
Date†
- January 24, 2013. 10:00-18:00
Location†
- Seminar Room 2 in ACROS Fukuoka Foundation 1-1-1 Tenjin, Chuo-ku, Fukuoka City, 810-0001 (see http://www.acros.or.jp/english/access/)
Accommodation†
The place of the workshop is located at Tenjin area which is in the center of Fukuoka City and closed to Nakasu and Hakata. You can find many hotels around Tenjin, Nakasu or Hakata (see http://www.booking.com/ ).
Program†
January 24 (Thursday) at Room 2 in ACROS Fukuoka†
- Openning Speech Yoshihiro Mizoguchi
- Chair: Akihiro Munemasa
- 10:00-10:45 Ferenc Szollosi(Tohoku University)
- Modular combinatorial designs and Hadamard matrices modulo 5
- 11:00-11:45 Gary Greaves (Tohoku University)
- TBA
- Chair: Mitsugu Hirasaka
- 13:30-14:15 Shun'ichi Yokoyama (Kyushu University / JST CREST)
- Developments in Computer Algebra Research: the Next Generation
- 14:30-15:45 Takao Komatsu (Hirosaki University)
- Poly-Cauchy numbers and their combinatorial properties
- Chair: Hyun Kwang Kim (POSTECH)
- 16:00-16:45 Jong Yoon Hyun (Ewha Womans University)
- A new family of strongly regular graphs using weakly regular p-ary bent functions
- 17:00-17:45 Phan Thanh Toan (POSTECH)
- TBA
January 25 (Friday) at at Room 2 in ACROS Fukuoka†
- Chair: Eiichi Bannai
- 10:00-10:45 Xiao-Dong Zhang (Shanghai Jiao Tong University)
- The Dirichlet eigenvalues of graphs and the Faber-Krahn Inequality
- 11:00-11:45 Ryuzaburo Noda
- Some upper bound for the number of blocks in block designs
- Chair: Tatsuro Ito
- 13:30-14:15 Joon Yop Lee (POSTECH)
- Multidimensional matrices uniquely recovered by their lines
- 14:30-15:45 Satoshi Tsujimoto (Kyoto University)
- Dunkl shift operators and Bannai-Ito polynomials
- Chair: Jack Koolen
- 16:00-16:45 Andreas Holmsen (KAIST)
- TBA
- 17:00-17:45 Jon-Lark Kim (Sogang University)
- TBA
- Closing Speech Yoshihiro Mizoguchi
Abstract†
吴耀琨（上海交通大学）†
Yaokun Wu (Shanhai Jiao Tong University)
- Title: Some combinatorial analysis of infinite matrix product
- Abstract:
The infinite product of a nonnegative square matrix is well understood thanks to the Perron-Frobenius Theory. In many contexts, say inhomogeneous Markov chain or opinion dynamics, one needs to consider the infinite product of several nonnegative square matrices of the same size. This general problem is much more complicated and seems that there is not any systematic theory for the analysis of the relevant dynamical behavior yet.
In this talk, we will discuss some combinatorial results obtained by the speaker and others (to be named during the lecture) on the dynamical behavior of the infinite matrix product of a set of matrices (of some special forms).
小関 健太（国立情報学研究所）†
Kenta Ozeki (National Institute of Informatics, Japan)
- Title: On the Hamiltonicity of graphs on a surface
- Abstract:
A cycle in a graph G is called Hamiltonian if it passes through all vertices in G. In this talk, we will concentrate on a Hamiltonian cycle in graphs on a Topological surface, for example, the sphere (the plane), the projective plane, the torus, and so on. One of the most classical result of this area is the one due to Tutte that stats that “every 4-connected plane graph has a Hamiltonian cycle”. I would like to introduce some other results, some of which are obtained very recently. I also mention the connection between “the toughness” and the Hamiltonicity of graphs on a surface.
This is a joint work with K. Kawarabayashi (National Institute of Informatics, Japan).
陳小君（香港理工大学）†
Xiaojun Chen (The Hong Kong Polytechnic University)
- Title: Computational Existence Proofs for Spherical t-Designs
- Abstract:
Spherical t-designs provide quadrature rules for the sphere which
are exact for polynomials up to degree t. In this talk, we
propose a computational algorithm based on interval arithmetic
which, for given t, upon successful completion will have proved
the existence of a t-design with
nodes and will have
computed narrow interval enclosures which are known to contain these
nodes with mathematical certainty. Since there is no theoretical
result which proves the existence of a t-design with
nodes for arbitrary t, our method contributes to the theory
because it was tested successfully for t＝ 1, 2, ..., 100, i.e.,
for all t considered so far. The t-design is usually not
unique; our method aims at finding a well-conditioned one. The
method relies on computing an interval enclosure for the zero of a
highly nonlinear system of dimension
. We therefore develop
several special approaches which allow us to use interval arithmetic
efficiently in this particular situation. The computations were all
done using the MATLAB toolbox INTLAB. At the end of this talk,
applications of well conditioned spherical designs for integration, interpolation and
regularized least squares approximations on the
two-sphere are discussed.
Joint work with Congpei An, Andreas Frommer, Bruno Lang, Ian Sloan and Womersley.
References
[1] C. An, X. Chen, I. H. Sloan and R. S. Womersley, Well conditioned
spherical designs for integration and interpolation on the
two-sphere, SIAM J. Numerical Analysis, 48(2010), 2135—2157.
[2] C. An, X. Chen, I. H. Sloan and R. S. Womersley,
Regularized least squares approximations on the sphere using spherical designs,
submitted to SIAM J. Numerical Analysis, under revision.
[3] X. Chen, A. Frommer and B. Lang, Computational existence proofs for
spherical t-designs, Numerische Mathematik, 117(2011), 289—305.
[4] X. Chen and R. S. Womersley, Existence of solutions to systems of
underdetermined equations and spherical designs, SIAM J. Numerical
Analysis, 44(2006), 2326—2341.
[5] X. Chen, R. S. Womersley and J. J. Ye,
Minimizing the condition number of a Gram matrix, SIAM J. Optimization, 21(2011), 127—148.
木村 拓馬（佐世保工業高等専門学校），木下 武彦（京都大学数理解析研究所），中尾 充宏（佐世保工業高等専門学校）†
Takuma Kimura (Sasebo National College of Technology), Takehiko Kinoshita (RIMS, Kyoto University) and Mitsuhiro T. Nakao (Sasebo National College of Technology)
- Title: A numerical method to prove the existence of solutions for nonlinear parabolic problems
- Abstract:
We present numerical verification methods for parabolic problems. Our main result is a constructive a posteriori estimates of inverse operators for initial-boundary value problems in linear parabolic PDEs on a bounded domain.
The proposed a posteriori estimates is based on error analysis of the Galerkin approximation for boundary value problems in space direction and the piecewise linear interpolation for initial value problems in time. Applying the result, we can numerically prove the existence of solutions for nonlinear parabolic initial-boundary value problems. Some numerical results will be shown in the talk.
田中 守（東北大学大学院 理学研究科）†
Mamoru Tanaka (Tohoku University)
- Title: Higher eigenvalues of the Laplacian on a graph and partitions of the graph
- Abstract:
We can regard the 2-nd eigenvalue of the Laplacian on a connected finite graph as strength of connection between two disjoint subgraphs in the graph. In this talk, I will give a relation between the k-th eigenvalue of the Laplacian on a connected finite graph and the minimum among the 2-nd eigenvalues of the Laplacians on the subgraphs in a partition of the graph.
平坂 貢（釜山国立大学）†
Mitsugu Hirasaka (Pusan National University)
- Title: Characterization of p-valenced association schemes
- Abstract:
Let
be an assocaition scheme
and p a prime.
We say that
is p-valenced if
is
a power of p
for each i with
where
is the constant
out-degree of the digraph
.
In this talk we show some conditions for a p-valenced association scheme to be
induced by a transitive permutation group.