Algebraic combinatorics from the viewpoint of finite sets on a sphere
| Project/Area Number |
25800011
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Multi-year Fund |
|---|
| Research Field |
Algebra
|
|---|
| Research Institution | Aichi University of Education |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2013-04-01 – 2016-03-31
|
| Project Status |
Completed (Fiscal Year 2015)
|
| Budget Amount *help |
¥3,380,000 (Direct Cost: ¥2,600,000、Indirect Cost: ¥780,000)
Fiscal Year 2015: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2014: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2013: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
|
|---|
| Keywords | デルサルト理論 / 球面集合 / 正則グラフ / グラフの固有値 / 最適球面コード / s-距離集合 / アソシエーションスキーム / アダマール行列 / 複素球面 / ユークリッド空間 / 球面コード / 線形計画法 / スペクトラルギャップ / integral point set / 隣接行列 / グラフ / 埋め込み |
|---|
| Outline of Final Research Achievements |
We would like to obtain progress of optimal spherical codes in this research project. One of major problems of optimal spherical codes is to find a spherical finite set which has maximum minimum-distance between distinct points among the equal-sized spherical sets. The linear programming bound (Delsarte's method) is a powerful tool to obtain a bound for the size of spherical sets for given distances. For regular graphs, we gave the ``dual'' version of the linear programming bound. The spectrum (the eigenvalues of the adjacency matrix) of a regular graph has some dual relationship to the distances on a finite spherical set. We can expect similar results between spherical codes (spherical finite sets) and regular graphs, and developments of both objects from each other.
|
Report
(4 results)
Research Products
(33 results)
