(!

rt*ft)

4t9/n'W}-(-fffiXi+@
Field of Srudy and Srudy Program

Fuil name in your native

language BALADMM

(r$4 (Etr;E))
Nationality

(Farnily

namelSumame)

MOHAMMAD
(First

nme)

SAMY

(Middle name)

INDONESIA

(E #)

Proposed study program in Japan (State the outline ofyour major field ofstudy on this side and the concrete details ofyour study program on the back side

of this sheet. This section will be used as one of the most importart references for selection. The statement must be typewritten or witten in block letters.
Additional sheets of paper may be attached, if necessary. )

/E^roEftfratE,; :onfrf;il@t*, iEe&LNt+6tEr@4tr84Lt6ar, *frt F:4..hwaffig.?, F.ffit Efi4;+E,)E+#EaEf6r:;ts\

)
L. ie^&r4inaffi=r:tr aLaL.t-, ,L'g./r*e&ErrffEaEtuL<til'."

\-n-g-u.

If you have Japanese ianguage ability, write in Japanese.

Present field of

study

GAtraq-*lSW)

My present field of study is Mathematics. Here, I focused myself on Algebra and Combinatorics. For my flnal project, I

took one of Combinatorics topic that is the construction of interval t-design and spherical t-design.

2 Your research theme after arrivaL in Japan: CIearIy explain the research you vish to carry out in Japan. (ffiA'&AEfrX7*'z : E
Ai.*ir.( D ) r,tcfzlfift,f\ Lf:l, \i'AEE@i.i=d,^-t6: l )
Attached in separate paper

(study program on the back side of this sheet)

Detail of The Proposed Research

Research Theme

Extended construction of spherical l-design aud Euclidean l-design

Classification

Based on Mathematics Subject Classification 2010, this research

will be under these subjects

Primary:
05899 None of above [Subjects in Designs and Configuration
Secondary:

05E30 Associatiou schetnes, strongly regular graphs

65D32 Quadrature and cubature formulas
05E05 Symmetricfunctions and generalizations

Section], but

41A55
05830
12D10

il

this section

Approxirnate quadrature
Other design, configuratiotl
Polynomials : location of zeroes

3 Introduction
Cornbirratorics is a brauch of rnathematics concernitg the study of finite or countable discrete structures.
has many applications in optimization, computer science, ergodic theory and statistical physics. One
main aspects of combinatorics is about deciding when certain criteria can be met, including how to
construct and analize objects meeting the criteria. In this aspect, combinatoriai design play a big roie,
furthermore it is one of important objects in combinatorics'
Combinatorial design, especially block design, might be viewed, in a sense, as au approximation of
the discrete sphcre 56 of all k-subsets by the sub-coilection X of St, , where

It

Sp

:: {r

e IR'

: r] + r}+...+

"?

k,*.i {0,1}}.

Later, Delsarte, Goethals and Seidel 17] introduced an analogue concept ofdesigns for (continuous) sphere
by deflning what they called spheri,cal t-de,si'gn.
A spherical l-desigu is a finite subset X iu the unit sphere 5,-1 6 lR" which replaces the value of
the integral on the sphere of any polynomial of degree at most f by the average of the values of the
polynomial on the finite subset X, formally the fcxmula

f 'x)do(r)=*f

i1sa1

't|

4t 7x

ft")

is exact for ali poiynomials /(r) : l@o,nt,rz,....ra) of degree at most I (where o denotes the surface
rleasule orr S'l).
Generalizing the concept of spherical designs, Neumaier and Seidel l11l defined the concept of Euciiclean i-design in lR." as a finite set X in IR' for which
P

r,,

)-','j,"I Is,'f@)a"o@) :Iw(r)f(r)

rl
=",

15,

'

holds for any polynomial /(c) of deg(/) ( l, where {,9,, i < i < p} is the set of ail the concentric spheres
centerecl at the origin and intersect with X, X;.: X n S,. and u: X -) IR;'s is a weight function of X'
We inight viewed the spherical f-clesign as the Euclidean t-design with p : 1 aud a coustant weight'

4 Motivation
The rnai, problem i1 the stutly of spherical design and Euclideau desigu is to provide aD expliclt constluction of it. The curreutly known construction methods are varied, mostiy involving algebraic combinatorics
urethods.

Thus, i1 19g1. Rabau a1d Bajlok [12] stated t]rat the constructioil of spherical design in 1R" might be
viewed as the constructlon of interval t-design with Gegenbauer weight function. By having the interval

\
\

1
or non-tight i-desi*n
f-design, any spherical d"esign in ihe unit sphere ,5d C lRd can be lifted to the tight
]
q
Pd+r'
in the unit sphere 5d
I
this context zeto2/
trntcrval t-6esign itself can be studied frorn the perspective of poiynomial theory-in
bv usi[g Sturnl's
is
rnethod
possible
evaluation
of poiy,o*riats ptay the roie in the construction. The

theorem (see [13]).

of combinatorial
On the other hand, spherical clesign can be said as the geometrical interpretaiion
association
larnely
techniques,
combinatorial
for
sorne
reler,'aut
corrstructiou
desig,. This rnakes tire
spherical
(see [1] and [a])
graph
distance-regular
and
configuration,
coherent
scheme,
-Since

applied in the construction

desig, can be generalized into Euclidea,n design, these techniques can also be
(sec l2l and 16l)
t-desig[ aild EuThe goal of this research is to investigate soure construction methods of spherical
view'
points
of
clidean t-design from these

Related Result

Inspired. by the Kuperberg's method (see [8]),

have proposed these new theorems

iu

[3] as part of the

result in my previous research.

set oJ2u points
Theorerrr L Let s > 0 be an,inte,ger and,a: (or,rr....,4,) lR". iet alsoY be the
'res'pect to tlt'e
with
on
'interual
3-tlesi,grt
a'n
l-L,L)
of the forrns *oi * az 1... + a". Tlrc set ! lorrns
Tr'(r)
Gege'nbaue'r weiglfi Jurtctzon

: (t * r)Lz-

i'J

llall"

a'nrt o'nlg

if

:+t/d+t

Theorern 2 The setY oJ22 points o/ the Jorms *a1 la2, wi'th a;> 0, satisiyi'ng the
ea'istsonlyford:1'
onlr-7.1)with,r'especttoth,eGe4enbatteru;ezgh'tfunctzonut(r): (1 -n2)(d-2)12

t'nteruaiS-desi:gn

ii-t

rt ^^,1-') o
L. ut u -

Theorem 3 The 23 poi,nts fJA ! t/rr* JA Jorm an i,nterual S-d'es'ign on l-l,I) wi'th
wei,qhi.functionto(r):(l-rz;ta-zl/'i'fon'donlyi'ft'hezi'sarerootsoJpolynornial
a
dr
r."
-

2(d+t)2(d+3) -p,

Q@):t"-,-,;*

u;here-

i,s i,n, th,e

th'e Gegenbauer

interual

18d2-27d+5d3+ri2-108 27d-

t8d2

* 5(13

+02+108

Ol

O1

+ rc44{P + 9234d2 + 5832d * t458, a'nd

,r: uE@+ 3)3/2 _d3+L8d2_108d+216.
Moreouer, i,t'ts only erists for L < d < 6'
7-clest'gn
Theorem 4 ThesetY of 23 poi,ntsof theform!.a11,21.a3.uti,t,ha;>0,sati'sfyi'ngt'lt'ei'nterua'l
*'*2)td-2)12
L or
d:
ortly
:
eaists
(1
Jor
witlt .r.es,pect to tlte Gege,nbiuer we'igltt fu:nction u:(r)
,n
or

54116

-t

648r)b

3078d4

l-l,l)
d:2.

Theorern

l-l.ll

TheKuperbergsetY oJ2a poi'nts'L\/4+J"+'/4+:@!:T*taninterual7-desi'gnon

J"'n':tionu(r): (1 - n2)(d'-2)l' il th" zi's are' th'e' roots of

w1tlt respect to the Cegenbatter we'ight

poLynorni,al

*({-7)-.
r2d
^, \ rqo - ,3 2d3+t0dr-Lltd+6
=-=. ==+p,
Q(''):
6d5;66d4+2nat"'t20d2+318dt90
dt 1+
wi'rere

zs r,n

the open interual as prouzded i'n the table below:

p
d\

, ----(o-o
J

oooo

62880800

(0.00000i440015579, 0.000002166860188)
io.oooootoza 2t9404,0.000001951463832)

future research (as ilescribed

Tlcse theorerns also wiil be further generalized ald observed iri
following section).

i[

t]re

Objectiver

Objective 1 : Concerning the application of Sturm's theorem, I propose to use this method for
tire further construction of spherical design fbr d > 6. In my previous result, the spherical i-design
is constmcted for d < 6.
Objective 2 : I plan to investigate how association scheme, coherent corfiguration, and distanceregular graph relate with the construction of spherical design. This may lead to other characterizalioirs of Euclidearr desigrr.

Objective 3 : By using the result of Objective 2, I aim to construct Euclidean design usitg those
algebraic combinatorics methods.

7 People and Places

Tiris researcir is expected to be conducted at Graduate School of hrformation Science, Tohoku University,

with the supervision of Professor Akihiro Munemasa in his iab "Mathematics Structure

I".

Earlier

by the supervisor which is of relevance fbr this research includes [9], [10], and l5]. The iab
environment is also expected to support this research development.

u,-ork done

Research Planning

Objective 1 and 2 are going to be ca,rried out first. Technicaily, they are easier. Conceptually, Objective

attempts to compiete my previous research ; Objective 2 relates the study of previously known approaches

to coustruct sphericai and Euclideau design. This understairding will be a good start to tackle the last
obiectives which are the most ambitious ones.
An approximative schedule may be the following : Objective 1 and 2 seems to be within rear:h in the
first year of the research if accepted. If possible, the preparation for Objective 3 may conducted in this
first year. Since I predict that the construction of Euclidean design would take a greater effort, Objective
3 may be held in the second vear, hopefully, in my future graduate school.

References
l2l

B. Br;xon, "Construction of spherical l-designs", Geom Dedicala 43

B. B.+..ruoN, "On Euciidean designs", Adt. Geom.6 (2006), 431-446.

t3l

[,I.S- B.cr-4DnAM AND D. SupRuenro, "Anoteinnewconstructionof spherical (2t+l)-<lesigns", (2012)

t1l

(1990), rro. 2,767-179.

In, prog'ress
t4l

Er. B-4NN.tr aNo Er. BANNAT, "A survey on splielical designs and algebraic combitatorics on spheres",
Europeu'n

l5l

Ei.

J.

Cort,bi,n,,30 (2009), no. 6, 1392-1425.

A.

Mulrer.a.tsA) AND
Algebru, z An,uliz.16 (2004), 1-23.
B.tNNa.r,

B.

VENKOV

"The nonexistence of certain tiglrt spherical designs",

"New exarnples of Euciitlean tight 4-desigrts," Europeu'n J. Cornbin. S0 (2009), 655-667

codes and designs", Geom. Ded'i,cata6
l7l P. DerSasrB, J.-M. Gr.ie:rnalS, aNo J. J. SaIoel, "Spherical
(1977), no. 3, 363-388.
t6l

t8l
tel

Er.

BaNN-q.r

G. KupeReBRG, "Special ntoments", Adu. in Appl' Math.34 (2005), no. 4, 853-870'

A. MuNsN4ase, "Sphericai 5-designs obtained lrorn finite unita.ry gtoups", European J. Combin.25
(2004),261-267

L12l

A. Mu5BuLs.r, "sphericai design", Hand,book of Comb'inatorial Desi,gns, Second Edi,ti,on {2006),61'7-622

A. Nnulr-qtra4No J. J. Sstoor,, "Discrete neasures for spherical designs, eutactic stars, and lattices",
Ned,erl. Akad,. Wetensch. Proc Ser. A 91:Indag' Math.,50 (1988), 32L-334'
p. R.{B-A.g AND B. Be;uox, "Bounds for the number of nodes in Chebyshev type quadrature formulas",

[13]

c.

[10]
11

1l

J. Approrimati,on Th.eory 67 (1991), 199-214.

Y,qp, Fund,amental problems i.n algorzthrni.c algebra, oxford University Press, 2000.