Spherical designs and some generalizations : An overview
|
|
- Leo Morton
- 5 years ago
- Views:
Transcription
1 Spherical designs and some generalizations : An overview Eiichi Bannai Shanghai Jiao Tong University 2015 April 21 Workshop on spherical designs and numerical analysis Shanghai, China
2 Spherical t-designs 1 S n 1 = {(x 1, x 2,, x n ) R n x x x2 n = 1}. Y S n 1, 0 < Y <. Definition (Delsarte-Goethals-Seidel,1977) Y is called a spherical t-design on S n 1 if and only if 1 f(x)dσ(x) = 1 f(x) S n 1 S n 1 Y x Y for any polynomials f(x) = f(x 1, x 2,..., x n ) of degree t.
3 Some generalizations 2 (1). Replacing the sphere S n 1 with other spaces. (i) compact symmetric spaces of rank 1 (= Projective spaces over R, C, H, O) (Further generalization: Designs on Grasmannian spaces, cf. talk of Martin Ehler ) (ii) ( V k) = Johnson J(v, k) association scheme (iii) F n 2 = Hamming association scheme H(n, 2) (or Q-polynomial association schemes) (2). Replacing the space of Polynomials of degree at most t by other set of functions But I will not talk much about these in this talk.
4 3 weighted spherical t-designs on S n 1 (=cubature formula of degree t) (II) Spherical t-designs (I) allow several concentric spheres (=Euclidean t-designs) (III)
5 (II) weighted spherical t-designs in S n 1 (=cubature formula of degree t on S n 1 ) Y S n 1, 0 < Y < w : Y R >0 4 (Y, w) is a weighted spherical t-design on S n 1 1 f(x)dσ(x) = w(y)f(y), S n 1 S n 1 y Y for f(x) = f(x 1,..., x n ), polynomial of degree t
6 (III) allow several concentric spheres (=Euclidean t-designs) 5 Y S n 1 (r 1 ) S n 1 (r 2 ) S n 1 (r p ) 0 < Y < w : Y R >0 Definition: (Y, w) is a Euclidean t-design p w(y S n 1 (r i )) i=1 f(x)dσ(x) = S n 1 (r i ) S n 1 (r i ) y Y f(x) = polynomial of degree t w(y)f(y),
7 Fisher type inequalities (I), (II) Y = t-design or (Y, w)=weighted t-design (III) (Y, w) = Euclidean t-design = Y = Y if t = 2e, 6 ( n 1+e ) ( e + n 1+e 1 ) e 1 = me, with m e = m e + m e m 1 + m 0 m i = dim(harm i (R n )) = ( n 1+i) ( i n 1+i 2 ) i 2 if t = 2e ( n 1+e) e if t = 2e, m e + m e m e p+1 if t = 2e + 1 more complicated
8 Tight designs: Those satisfying one of the equality in above 7 (I) tight spherical t-designs Delsarte-Goethals-Seidel (1977) Bannai-Damerell (1979/1980) Bannai-Sloane (1981) Bannai-Munemasa-Venkov (2004) Nebe-Venkov (2012) still open for t = 4, 5, 7 (II) tight weighted spherical t-designs = tight spherical t-design (reduced to (I))
9 (III) Classification problems of tight Euclidean t-designs 8 Neumaier-Seidel (1988) Delsarte-Seidel (1989) Bajnok (2006) B-B ( ) B-B-Hirao-Sawa (2010) many papers B-B (2014) Moscow J. of Combinatorics and Number Theory mostly on two shells (spheres) (The results are still very partial!)
10 Another generalization 9 (IV) spherical designs of harmonic index t Y S n 1, 0 < Y <, f(y) = 0, for f(y) Harm t (R n ). y Y (Note that Y is a spherical t-design f(y) = 0, for f(y) Harm i (R n ) and 1 i t.) y Y
11 Fisher type in equality for (IV) 10 Q i (x) = Gegenbauer polynomial of degree i. i.e. 1 Q i (x)q j (x)(1 x 2 ) n 3 2 = α i δ i,j, α i > 0 1 Q i (1) = ( n 1+i) ( i n 1+i 2 ) i 2 = dim(harmi (R n ) c 2e = min. value of Q 2e (x) Q 0 (x) = 1 Q 1 (x) = nx Q 2 (x) = n+2 2 (nx2 1) Q 3 (x) = n(n+4) ((n + 2)x 2 3) 3! Q 4 (x) = n(n+6) ((n + 4)(n + 2)x 4 6(n + 2)x 2 + 3) 4!
12 (The graph of y = Q 8 (x)) 11
13 Y = a spherical designs of harmonic index t. Let A(n, t) = smallest Y such that Y is a spherical design of harmonic index t on S n (1) t = 2e + 1 = Y 2, since Y = {y, y} is a design of harmonic index 2e + 1 on S n 1 So, A(n, 2e + 1) = 2 (2) t = 2 = Y n, Y = {e 1, e 2,..., e n } is a design of harmonic index 2 on S n 1 (3) n = 2 (t = 2e) = Y 2, x, y S 1 with the angle θ = π/2e is such an example So, A(2, 2e) = 2 for e
14 First nontrivial case: A(3, 4) Let m i = 2i + 1, and let f 1, f 2,..., f 2i+1 be an orthonormal basis of Harm i (R 3 ). Our case is i = 4. Then minimize { 9 j=1( y Y f j (y)) 2 Y S 2, Y is fixed.} (Note that this quantity is = 0, if and only if Y is a design of harmonic index 4 on S 2.) Y = 2, 3, 4 are shown to be impossible. Y = 5. Examples were found by numerical experiments. (Namely, we obtained regular pentagons of two different sizes.) 13
15 Theorem (B-Okuda-Tagami) (to appear in J. Approx. Theory (2015)) Y = a spherical 2e -design on S n 2, r = a root of Q 2e (x), Let Y S n 2 be defined by 14 Y = {(r, 1 r 2 x) S n 1 x Y }. Then Y is a design of harmonic index 2e on S n 1 Theorem (B-O-T) A(3, 4) = 5. Moreover, if Y is a design of harmonic index 4 on S 2 ( R 3 ), and Y = 5. Then Y is a pentagon on the circle of radius 1 r 2, where r is a zero of Q 4 (x) (for n = 3), i.e. r 1, r 2 = or those with any points replaced by their antipodal points.
16 15 Remark. 5 A(3, 4) 6. (A half of the 12 vertices of a regular icosahedron gives such an example. We want to determine A(n, t) for general n and t, but most cases are open.
17 Let (So, c t > 0.) c t = Min{Q t (x) 1 x 1}. 16 Apply Delsarte s method (LP-method) to F (s) = c t + Q t (s) on 1 s 1. (Note that F (s) 0, for 1 s 1. ) Then we get Theorem (B-O-T) If Y is a design of harmonic index t on S n 1, then Y b t (= b t,n ) := 1 + Q t(1) c t.
18 Proof. Calculate (x,y) Y Y F (x y) in two ways. 17 (i) F (x y) = (c t + Q t (x y)) = c t Y 2 (x,y) Y Y (x,y) Y Y (Since (x,y) Y Y Q t(x y) = 0 if Y is a design of harmonic index t.) (ii) F (x y) Y F (1). (x,y) Y Y (Since F (s) 0 on 1 s 0.) So, c t Y 2 Y F (1). Hence Y 1 + Q t(1) c t (= b t ).
19 18 In the above proof, note that, by using Addition formula, (x,y) Y Y Q i (x y) = = m i j=1 ( y Y (x,y) Y Y m i ( f j (x)f j (y)) j=1 f j (x)) 2 0. and = 0, if and only if y Y f(y) = 0, for f(x) Harm i(r n ). (So, (x,y) Y Y Q t(x y) = 0 if and only if Y is a design of harmonic index i.) Here, m j = dim(harm i (R n )), and {f 1, f 2,..., f mi } is any orthonormal basis of Harm i (R n ).
20 Values of b t = b t,n for designs of harmonic index t on S n 1 19 n = 3 n = 4 n = 5 n = 6 n = 7 n = 8 n = 9 n = 10 t = t = t = t = t = t = t = t = t =
21 Spherical designs of harmonic index LetY be a design of harmonic index 4 on S n 1. Then (n + 1)(n + 2) Y. 6 If Y = (n+1)(n+2) 3 6, then I(Y ) = {±α} with α = n+4 where Q 4 (α) gives the minimum value of Q 4 (x). So, Y gives a set of equiangular lines ( (n+1)(n+2) 6 lines) with inner product α = 3 n+4. Okuda-Yu (2015) showed that there exist no such set of equiangular lines (by using SDP-method). So, there is no tight spherical designs of harmonic index 4 if n 3. (Cf. Wei-Hsuan Yu s talk.)
22 What happens if t = 2e is fixed, and n? 21 t = 4 = b 4 = (n+1)(n+2) n2. 1 t = 6 = b 6 20(2+ 10) n3. t = 8 = b 8 1 ( 3,000) n4... t = 2e = b 2e (const)n e. (Note that this constant is explicitly calculable.) If Y is a tight design of harmonic index 2e, then I(Y ) = {±α}, and so, Y n(n+1) 2 (absolute bound). So, there are no tight designs of harmonic index 2e, if e 3, in general.
23 What happens for b 2e,n, if n is fixed and e? 22 lim e b 2e,n are, for n = 3, 4,..., 10: (6), (10), (15), (21) (38), (36), (45) (55), (resectively), where inside the parentheses denote the value n(n+1) 2. So, lim e b 2e,n is far bigger than n(n+1) 2, except for some small n, say n 6. It would be a very interesting open question, what are the values of A(3, 2e) (or A(4, 2e)) for large e. This implies that tight designs of harmonic index 2e do not exist in general (i.e. for large t), unless n is very small.
24 Let T = {t 1, t 2..., t l } be a set of natural numbers. Y S n 1, 0 < Y < is called a spherical design of harmonic index T, if y Y f(y) = 0 for f(x) Harm i(r n ) with i T. 23 (Spherical t-design is a design of harmonic index {1, 2,..., t}.) t = 8 {1, 2,..., 8}-design {2, 8}-design {4, 8}-design {6, 8}-design {8}-design Y 1 24 n4 Y n4 for {2, 8} Y n4 for {4, 8} Y 1 ( 3,000) n4
25 (V) spherical null t-design 24 Let Y S n 1, 0 < Y < w : Y R 0 Y is called a spherical null t-design y Y w(y)f(y) = 0 for f(x) = f(x 1,..., x n ) of degree t y Y w(y)f(y) = 0 for f(x) Harm i(r n ) with i = 0, 1,..., t
26 25 What are Fisher type lower bound for null spherical t-designs on S n 1? (working with Francis Campena) Let A(n, t) = min{ Y Y is a null spherical t-design} What are A(n, t)? Conjecture A(n, t) = 2(t + 1), n 2, t Partial results A(n, t) (t + 1), n 2, t A(2, t) = (t + 1), t A(3, 2) = 6, A(n, 2) = 6, n 2 (First open case A(3, 3), 7 A(3, 3) 8)
27 Replace S n 1 by association schemes (II) weighted combinatorial t-designs (cf. talks of Da Zhao and Zongchen Chen) (I) combinatorial t-designs designs in J(v, k) (III) relative t-designs on J(v, k) (Delsarte (1977), Pairs of vectors...) (cf. talk of Yan Zhu) (II) weighted t-designs in H(n, 2) (I) t-designs in H(n, 2) (III) relative t-designs on H(n, 2) (Delsarte (1977)) (=weighted regular t-wise balanced designs) (cf. talks by Yan Zhu and Lihang Hou) 26
28 Fisher type lower bouds (I) (II) = Y m e, for t = 2e where m i = m i + m i 1 + { ( + m 1 + m 0 v ) ( m i = rank(e i ) = i v i 1) for J(v, k) ( n i) for H(n, 2) 27 (III) = Y m e + m e 1 + m e p+1 for t = 2e study of tight relative t-designs on H(n, q) and J(v, k) (cf. talks by Yan Zhu and Lihang Hou)
29 Thank You
Design theory from the viewpoint of algebraic combinatorics
Design theory from the viewpoint of algebraic combinatorics Eiichi Bannai Shanghai Jiao Tong University May 27, 2017, at 9SHCC This talk is based on the paper: Eiichi Bannai, Etsuko Bannai, Hajime Tanaka,
More informationOn Euclidean designs and potential energy
On Euclidean designs and potential energy Tsuyoshi Miezaki Department of Mathematics Oita National College of Technology Oita, 870 0152, Japan miezaki@oita-ct.ac.jp Makoto Tagami Department of Mechanical
More informationEfficient Spherical Designs with Good Geometric Properties
Efficient Spherical Designs with Good Geometric Properties Rob Womersley, R.Womersley@unsw.edu.au School of Mathematics and Statistics, University of New South Wales 45-design with N = 1059 and symmetrtic
More informationMarkov chains, graph spectra, and some static/dynamic scaling limits
Markov chains, graph spectra, and some static/dynamic scaling limits Akihito Hora Hokkaido University I will talk about how I began to get interested in spectra of graphs and then was led to beautiful
More informationGroup theoretic aspects of the theory of association schemes
Group theoretic aspects of the theory of association schemes Akihiro Munemasa Graduate School of Information Sciences Tohoku University October 29, 2016 International Workshop on Algebraic Combinatorics
More informationSpherical t ɛ -Design for Numerical Approximations on the Sphere, I
Spherical t ɛ -Design for Numerical Approximations on the Sphere, I Xiaojun Chen Department of Applied Mathematics The Hong Kong Polytechnic University April 2015, Shanghai Jiaotong University X. Chen
More information2 2 + x =
Lecture 30: Power series A Power Series is a series of the form c n = c 0 + c 1 x + c x + c 3 x 3 +... where x is a variable, the c n s are constants called the coefficients of the series. n = 1 + x +
More informationQMC designs and covering of spheres by spherical caps
QMC designs and covering of spheres by spherical caps Ian H. Sloan University of New South Wales, Sydney, Australia Joint work with Johann Brauchart, Josef Dick, Ed Saff (Vanderbilt), Rob Womersley and
More informationEquiangular lines in Euclidean spaces
Equiangular lines in Euclidean spaces Gary Greaves 東北大学 Tohoku University 14th August 215 joint work with J. Koolen, A. Munemasa, and F. Szöllősi. Gary Greaves Equiangular lines in Euclidean spaces 1/23
More informationSpherical designs with close to the minimal number of points 1
Spherical designs with close to the minimal number of points Robert S. Womersley School of Mathematics and Statistics, University of New South Wales, Sydney, NSW, 05, Australia Abstract In this paper we
More informationStrongly regular graphs and Borsuk s conjecture
Seminar talk Department of Mathematics, Shanghai Jiao Tong University Strongly regular graphs and Borsuk s conjecture Andriy Bondarenko Norwegian University of Science and Technology and National Taras
More informationQuadrature using sparse grids on products of spheres
Quadrature using sparse grids on products of spheres Paul Leopardi Mathematical Sciences Institute, Australian National University. For presentation at 3rd Workshop on High-Dimensional Approximation UNSW,
More informationSpherical Designs in Four Dimensions (Extended Abstract)
Spherical Designs in Four Dimensions (Extended Abstract) N. J. A. Sloane AT&T Shannon Labs Florham Park NJ 07932-097 USA njas@research.att.com R. H. Hardin 227 Glenn Drive Pataskala OH 43062 USA rhh@cadence.com
More informationInvariant Semidefinite Programs
Invariant Semidefinite Programs Christine Bachoc Université Bordeaux I, IMB Modern trends in Optimization and its Application, IPAM Optimization Tutorials, september 14-17, 2010 Outline of Part I Invariant
More informationA Study of Linear Programming Bounds for Spherical Codes. A Major Qualifying Project Report. submitted to the Faculty. of the
Project Number: MA-WJM-4801 A Study of Linear Programming Bounds for Spherical Codes A Major Qualifying Project Report submitted to the Faculty of the WORCESTER POLYTECHNIC INSTITUTE in partial fulfillment
More informationNumerical Integration over unit sphere by using spherical t-designs
Numerical Integration over unit sphere by using spherical t-designs Congpei An 1 1,Institute of Computational Sciences, Department of Mathematics, Jinan University Spherical Design and Numerical Analysis
More informationThe Terwilliger algebra of a Q-polynomial distance-regular graph with respect to a set of vertices
The Terwilliger algebra of a Q-polynomial distance-regular graph with respect to a set of vertices Hajime Tanaka (joint work with Rie Tanaka and Yuta Watanabe) Research Center for Pure and Applied Mathematics
More informationQuadrature using sparse grids on products of spheres
Quadrature using sparse grids on products of spheres Paul Leopardi Mathematical Sciences Institute, Australian National University. For presentation at ANZIAM NSW/ACT Annual Meeting, Batemans Bay. Joint
More informationTHIS paper is an extended version of the paper [1],
INTERNATIONAL JOURNAL OF MATHEMATICAL MODELS AND METHODS IN APPLIED SCIENCES Volume 8 04 Alternating Schur Series and Necessary Conditions for the Existence of Strongly Regular Graphs Vasco Moço Mano and
More informationMoments of orthogonal arrays
Thirteenth International Workshop on Algebraic and Combinatorial Coding Theory Moments of orthogonal arrays Peter Boyvalenkov, Hristina Kulina Pomorie, BULGARIA, June 15-21, 2012 Orthogonal arrays H(n,
More informationUNIQUENESS OF CERTAIN SPHERICAL CODES
Can. J. Math., Vol. XXXIII, No. 2, 1981, pp. 437-449 UNIQUENESS OF CERTAIN SPHERICAL CODES EIICHI BANNAI AND N. J. A. SLOANE 1. Introduction. In this paper we show that there is essentially only one way
More informationA Study of Linear Programming Bounds for Spherical Codes. A Major Qualifying Project Report. submitted to the Faculty. of the
Project Number: MA-WJM-4801 A Study of Linear Programming Bounds for Spherical Codes A Major Qualifying Project Report submitted to the Faculty of the WORCESTER POLYTECHNIC INSTITUTE in partial fulfillment
More information1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 =
Chapter 5 Sequences and series 5. Sequences Definition 5. (Sequence). A sequence is a function which is defined on the set N of natural numbers. Since such a function is uniquely determined by its values
More informationSome parametric inequalities on strongly regular graphs spectra
INTERNATIONAL JOURNAL OF PURE MATHEMATICS Volume 3, 06 Some parametric inequalities on strongly regular graphs spectra Vasco Moço Mano and Luís de Almeida Vieira Email: vascomocomano@gmailcom Faculty of
More informationThe Multiplicities of a Dual-thin Q-polynomial Association Scheme
The Multiplicities of a Dual-thin Q-polynomial Association Scheme Bruce E. Sagan Department of Mathematics Michigan State University East Lansing, MI 44824-1027 sagan@math.msu.edu and John S. Caughman,
More informationOn the ideal of the shortest vectors in the Leech lattice and other lattices
On the ideal of the shortest vectors in the Leech lattice and other lattices William J. Martin Corre L. Steele Department of Mathematical Sciences Worcester Polytechnic Institute Worcester, Massachusetts
More informationApplications of semidefinite programming in Algebraic Combinatorics
Applications of semidefinite programming in Algebraic Combinatorics Tohoku University The 23rd RAMP Symposium October 24, 2011 We often want to 1 Bound the value of a numerical parameter of certain combinatorial
More informationALGEBRAIC COMBINATORICS. c1993 C. D. Godsil
ALGEBRAIC COMBINATORICS c1993 C. D. Godsil To Gillian Preface There are people who feel that a combinatorial result should be given a \purely combinatorial" proof, but I am not one of them. For me the
More informationTomato Packing and Lettuce-Based Crypto
Tomato Packing and Lettuce-Based Crypto A. S. Mosunov and L. A. Ruiz-Lopez University of Waterloo Joint PM & C&O Colloquium March 30th, 2017 Spring in Waterloo Love is everywhere... Picture from https://avatanplus.com/files/resources/mid/
More informationDelsarte-Yudin LP method and Universal Lower Bound on energy
Peter Dragnev, IPFW Delsarte-Yudin LP method and Universal Lower Bound on energy Peter Dragnev Indiana University-Purdue University Fort Wayne Joint work with: P. Boyvalenkov (BAS); D. Hardin, E. Saff
More informationSemidefinite programming bounds for spherical codes
Semidefinite programming bounds for spherical codes Christine Bachoc IMB, Université Bordeaux I 351, cours de la Libération 33405 Talence France bachoc@mathu-bordeaux1fr Fran Vallentin Centrum voor Wisunde
More informationOn non-antipodal binary completely regular codes
On non-antipodal binary completely regular codes J. Borges, J. Rifà Department of Information and Communications Engineering, Universitat Autònoma de Barcelona, 08193-Bellaterra, Spain. V.A. Zinoviev Institute
More informationApplications of Semidefinite Programming to Coding Theory
Applications of Semidefinite Programming to Coding Theory Christine Bachoc Institut de Mathématiques de Bordeaux Université Bordeaux 1 351, cours de la Libération, 33405 Talence, France Email: {christine.bachoc}@math.u-bordeaux1.fr
More informationRamsey Theory. May 24, 2015
Ramsey Theory May 24, 2015 1 König s Lemma König s Lemma is a basic tool to move between finite and infinite combinatorics. To be concise, we use the notation [k] = {1, 2,..., k}, and [X] r will denote
More informationOn fat Hoffman graphs with smallest eigenvalue at least 3
On fat Hoffman graphs with smallest eigenvalue at least 3 Qianqian Yang University of Science and Technology of China Ninth Shanghai Conference on Combinatorics Shanghai Jiaotong University May 24-28,
More informationGroup fusion power of association schemes
Group fusion power of association schemes Shanghai Jiao Tong University jasonzd@sjtu.edu.cn Aug 7th, 2018, G2R2 @ Novosibirsk There is a written proof of every mathematical theorem, in Russian. I couldn
More informationScaffolds. A graph-based system for computations in Bose-Mesner algebras. William J. Martin
A graph-based system for computations in Bose-esner algebras Department of athematical Sciences and Department of Computer Science Worcester Polytechnic Institute Algebraic Combinatorics Seminar Shanghai
More informationCovering maxima. Frank Vallentin (TU Delft, CWI Amsterdam) Mathieu Dutour Sikiric (RBI Zagreb) Achill Schurmann (TU Delft)
Covering maxima Frank Vallentin (TU Delft, CWI Amsterdam) Mathieu Dutour Sikiric (RBI Zagreb) Achill Schurmann (TU Delft) 1999 Develop a (nice) theory for lattice coverings! Rudolf Scharlau b 1,...,b n
More informationLinear Algebra Massoud Malek
CSUEB Linear Algebra Massoud Malek Inner Product and Normed Space In all that follows, the n n identity matrix is denoted by I n, the n n zero matrix by Z n, and the zero vector by θ n An inner product
More informationAP Calculus Testbank (Chapter 9) (Mr. Surowski)
AP Calculus Testbank (Chapter 9) (Mr. Surowski) Part I. Multiple-Choice Questions n 1 1. The series will converge, provided that n 1+p + n + 1 (A) p > 1 (B) p > 2 (C) p >.5 (D) p 0 2. The series
More informationVertex subsets with minimal width and dual width
Vertex subsets with minimal width and dual width in Q-polynomial distance-regular graphs University of Wisconsin & Tohoku University February 2, 2011 Every face (or facet) of a hypercube is a hypercube...
More informationEigenvalues and eigenfunctions of the Laplacian. Andrew Hassell
Eigenvalues and eigenfunctions of the Laplacian Andrew Hassell 1 2 The setting In this talk I will consider the Laplace operator,, on various geometric spaces M. Here, M will be either a bounded Euclidean
More informationThe \(D_4\) Root System is Not Universally Optimal
The \D_4\) Root System is Not Universally Optimal The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters. Citation Published Version
More informationSolutions to Laplace s Equations- II
Solutions to Laplace s Equations- II Lecture 15: Electromagnetic Theory Professor D. K. Ghosh, Physics Department, I.I.T., Bombay Laplace s Equation in Spherical Coordinates : In spherical coordinates
More informationButson-Hadamard matrices in association schemes of class 6 on Galois rings of characteristic 4
Butson-Hadamard matrices in association schemes of class 6 on Galois rings of characteristic 4 Akihiro Munemasa Tohoku University (joint work with Takuya Ikuta) November 17, 2017 Combinatorics Seminar
More informationButson-Hadamard matrices in association schemes of class 6 on Galois rings of characteristic 4
Butson-Hadamard matrices in association schemes of class 6 on Galois rings of characteristic 4 Akihiro Munemasa Tohoku University (joint work with Takuya Ikuta) November 17, 2017 Combinatorics Seminar
More informationSphere packing, lattice packing, and related problems
Sphere packing, lattice packing, and related problems Abhinav Kumar Stony Brook April 25, 2018 Sphere packings Definition A sphere packing in R n is a collection of spheres/balls of equal size which do
More informationOn Locating-Dominating Codes in Binary Hamming Spaces
Discrete Mathematics and Theoretical Computer Science 6, 2004, 265 282 On Locating-Dominating Codes in Binary Hamming Spaces Iiro Honkala and Tero Laihonen and Sanna Ranto Department of Mathematics and
More informationNATIONAL BOARD FOR HIGHER MATHEMATICS. M. A. and M.Sc. Scholarship Test. September 22, Time Allowed: 150 Minutes Maximum Marks: 30
NATIONAL BOARD FOR HIGHER MATHEMATICS M. A. and M.Sc. Scholarship Test September 22, 2012 Time Allowed: 150 Minutes Maximum Marks: 30 Please read, carefully, the instructions on the following page 1 INSTRUCTIONS
More informationPOINT CONFIGURATIONS THAT ARE ASYMMETRIC YET BALANCED
POINT CONFIGURATIONS THAT ARE ASYMMETRIC YET BALANCED HENRY COHN, NOAM D. ELKIES, ABHINAV KUMAR, AND ACHILL SCHÜRMANN Abstract. A configuration of particles confined to a sphere is balanced if they are
More informationPositive semidefinite rank
1/15 Positive semidefinite rank Hamza Fawzi (MIT, LIDS) Joint work with João Gouveia (Coimbra), Pablo Parrilo (MIT), Richard Robinson (Microsoft), James Saunderson (Monash), Rekha Thomas (UW) DIMACS Workshop
More informationThe Leech Lattice. Balázs Elek. November 8, Cornell University, Department of Mathematics
The Leech Lattice Balázs Elek Cornell University, Department of Mathematics November 8, 2016 Consider the equation 0 2 + 1 2 + 2 2 +... + n 2 = m 2. How many solutions does it have? Okay, 0 2 + 1 2 = 1
More informationLecture 4 February 2
4-1 EECS 281B / STAT 241B: Advanced Topics in Statistical Learning Spring 29 Lecture 4 February 2 Lecturer: Martin Wainwright Scribe: Luqman Hodgkinson Note: These lecture notes are still rough, and have
More informationReal Equiangular Frames
Peter G Casazza Department of Mathematics The University of Missouri Columbia Missouri 65 400 Email: pete@mathmissouriedu Real Equiangular Frames (Invited Paper) Dan Redmond Department of Mathematics The
More informationSome Extremal Self-Dual Codes and Unimodular Lattices in Dimension 40
Some Extremal Self-Dual Codes and Unimodular Lattices in Dimension 40 Stefka Bouyuklieva, Iliya Bouyukliev and Masaaki Harada October 17, 2012 Abstract In this paper, binary extremal singly even self-dual
More informationPolynomial interpolation on the sphere, reproducing kernels and random matrices
Polynomial interpolation on the sphere, reproducing kernels and random matrices Paul Leopardi Mathematical Sciences Institute, Australian National University. For presentation at MASCOS Workshop on Stochastics
More informationHonors Advanced Algebra Unit 3: Polynomial Functions November 9, 2016 Task 11: Characteristics of Polynomial Functions
Honors Advanced Algebra Name Unit 3: Polynomial Functions November 9, 2016 Task 11: Characteristics of Polynomial Functions MGSE9 12.F.IF.7 Graph functions expressed symbolically and show key features
More informationCompressed Sensing: Lecture I. Ronald DeVore
Compressed Sensing: Lecture I Ronald DeVore Motivation Compressed Sensing is a new paradigm for signal/image/function acquisition Motivation Compressed Sensing is a new paradigm for signal/image/function
More informationAdvanced Computational Fluid Dynamics AA215A Lecture 2 Approximation Theory. Antony Jameson
Advanced Computational Fluid Dynamics AA5A Lecture Approximation Theory Antony Jameson Winter Quarter, 6, Stanford, CA Last revised on January 7, 6 Contents Approximation Theory. Least Squares Approximation
More informationProgram (Day 1) Spectral mapping theorem and asymptotic behavior of quantum walks on infinite graphs
Program (Day 1) Nov.29 (Fri) Kawai Hall, Dept. of Math., Tohoku Univ. 9:25 9:30 10:10 10:20 11:00 11:10 11:50 14:00 14:40 14:50 15:30 15:40 16:30 18:00 Opening Address from Chair Spectral mapping theorem
More informationOn graphs with smallest eigenvalue at least 3 and their lattices
On graphs with smallest eigenvalue at least 3 and their lattices arxiv:1804.00369v1 [math.co] 2 Apr 2018 e-mail: Jack H. Koolen, Jae Young Yang, Qianqian Yang School of Mathematical Sciences, University
More informationMATH 1372, SECTION 33, MIDTERM 3 REVIEW ANSWERS
MATH 1372, SECTION 33, MIDTERM 3 REVIEW ANSWERS 1. We have one theorem whose conclusion says an alternating series converges. We have another theorem whose conclusion says an alternating series diverges.
More informationProduct of P-polynomial association schemes
Product of P-polynomial association schemes Ziqing Xiang Shanghai Jiao Tong University Nov 19, 2013 1 / 20 P-polynomial association scheme Definition 1 P-polynomial association scheme A = (X, {A i } 0
More information1 The Derivative and Differrentiability
1 The Derivative and Differrentiability 1.1 Derivatives and rate of change Exercise 1 Find the equation of the tangent line to f (x) = x 2 at the point (1, 1). Exercise 2 Suppose that a ball is dropped
More informationOn the number of ways of writing t as a product of factorials
On the number of ways of writing t as a product of factorials Daniel M. Kane December 3, 005 Abstract Let N 0 denote the set of non-negative integers. In this paper we prove that lim sup n, m N 0 : n!m!
More informationInterval methods for a classification of three-distance sets
Interval methods for a classification of three-distance sets Masashi Shinohara (Shiga University) EIGHTH SHANGHAI CONFERENCE on COMBINATORICS Shanghai, May 23-28, 2014 Masashi Shinohara (Shiga University)
More informationLow-discrepancy point sets lifted to the unit sphere
Low-discrepancy point sets lifted to the unit sphere Johann S. Brauchart School of Mathematics and Statistics, UNSW MCQMC 2012 (UNSW) February 17 based on joint work with Ed Saff (Vanderbilt) and Josef
More informationLecture # 3 Orthogonal Matrices and Matrix Norms. We repeat the definition an orthogonal set and orthornormal set.
Lecture # 3 Orthogonal Matrices and Matrix Norms We repeat the definition an orthogonal set and orthornormal set. Definition A set of k vectors {u, u 2,..., u k }, where each u i R n, is said to be an
More informationFUNCTIONAL ANALYSIS HAHN-BANACH THEOREM. F (m 2 ) + α m 2 + x 0
FUNCTIONAL ANALYSIS HAHN-BANACH THEOREM If M is a linear subspace of a normal linear space X and if F is a bounded linear functional on M then F can be extended to M + [x 0 ] without changing its norm.
More informationSpherical Euclidean Distance Embedding of a Graph
Spherical Euclidean Distance Embedding of a Graph Hou-Duo Qi University of Southampton Presented at Isaac Newton Institute Polynomial Optimization August 9, 2013 Spherical Embedding Problem The Problem:
More informationA Questionable Distance-Regular Graph
A Questionable Distance-Regular Graph Rebecca Ross Abstract In this paper, we introduce distance-regular graphs and develop the intersection algebra for these graphs which is based upon its intersection
More informationJournal of Integer Sequences, Vol. 3 (2000), Article Magic Carpets
Journal of Integer Sequences, Vol. 3 (2000), Article 00.2.5 Magic Carpets Erich Friedman Stetson University Deland, FL 32720 Mike Keith 4100 Vitae Springs Road Salem, OR 97306 Email addresses: efriedma@stetson.edu
More informationSemidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 2
Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 2 Instructor: Farid Alizadeh Scribe: Xuan Li 9/17/2001 1 Overview We survey the basic notions of cones and cone-lp and give several
More informationPacking, coding, and ground states From information theory to physics. Lecture III. Packing and energy minimization bounds in compact spaces
Packing, coding, and ground states From information theory to physics Lecture III. Packing and energy minimization bounds in compact spaces Henry Cohn Microsoft Research New England Pair correlations For
More informationInstructions: No books. No notes. Non-graphing calculators only. You are encouraged, although not required, to show your work.
Exam 3 Math 850-007 Fall 04 Odenthal Name: Instructions: No books. No notes. Non-graphing calculators only. You are encouraged, although not required, to show your work.. Evaluate the iterated integral
More informationarxiv:math/ v3 [math.co] 2 Dec 2005
arxiv:math/0505510v3 [math.co] 2 Dec 2005 Construction of spherical cubature formulas using lattices Pierre de la Harpe, Claude Pache, Boris Venkov Contact author: Claude Pache (Claude.Pache@math.unige.ch)
More informationStatistical learning theory, Support vector machines, and Bioinformatics
1 Statistical learning theory, Support vector machines, and Bioinformatics Jean-Philippe.Vert@mines.org Ecole des Mines de Paris Computational Biology group ENS Paris, november 25, 2003. 2 Overview 1.
More informationProblem Set 5: Solutions Math 201A: Fall 2016
Problem Set 5: s Math 21A: Fall 216 Problem 1. Define f : [1, ) [1, ) by f(x) = x + 1/x. Show that f(x) f(y) < x y for all x, y [1, ) with x y, but f has no fixed point. Why doesn t this example contradict
More informationarxiv:math/ v3 [math.mg] 1 Mar 2006
arxiv:math/0410324v3 [math.mg] 1 Mar 2006 THE KISSING PROBLEM IN THREE DIMENSIONS Oleg R. Musin Abstract The kissing number k(3) is the maximal number of equal size nonoverlapping spheres in three dimensions
More informationOn non-bipartite distance-regular graphs with valency k and smallest eigenvalue not larger than k/2
On non-bipartite distance-regular graphs with valency k and smallest eigenvalue not larger than k/2 J. Koolen School of Mathematical Sciences USTC (Based on joint work with Zhi Qiao) CoCoA, July, 2015
More informationM2PM1 Analysis II (2008) Dr M Ruzhansky List of definitions, statements and examples Preliminary version
M2PM1 Analysis II (2008) Dr M Ruzhansky List of definitions, statements and examples Preliminary version Chapter 0: Some revision of M1P1: Limits and continuity This chapter is mostly the revision of Chapter
More informationPreliminary Exam 2016 Solutions to Morning Exam
Preliminary Exam 16 Solutions to Morning Exam Part I. Solve four of the following five problems. Problem 1. Find the volume of the ice cream cone defined by the inequalities x + y + z 1 and x + y z /3
More informationComplex Variables, Summer 2016 Homework Assignments
Complex Variables, Summer 2016 Homework Assignments Homeworks 1-4, due Thursday July 14th Do twenty-four of the following problems. Question 1 Let a = 2 + i and b = 1 i. Sketch the complex numbers a, b,
More informationMath 215B: Solutions 3
Math 215B: Solutions 3 (1) For this problem you may assume the classification of smooth one-dimensional manifolds: Any compact smooth one-dimensional manifold is diffeomorphic to a finite disjoint union
More informationHomework Assignment #5 Due Wednesday, March 3rd.
Homework Assignment #5 Due Wednesday, March 3rd. 1. In this problem, X will be a separable Banach space. Let B be the closed unit ball in X. We want to work out a solution to E 2.5.3 in the text. Work
More informationCodes and invariant theory.
odes and invariant theory. Gabriele Nebe Lehrstuhl D für Mathematik, RWTH Aachen, 5056 Aachen, Germany, nebe@math.rwth-aachen.de 1 Summary. There is a beautiful analogy between most of the notions for
More informationc 2010 Society for Industrial and Applied Mathematics
SIAM J. NUMER. ANAL. Vol. 48, No. 6, pp. 2135 2157 c 2010 Society for Industrial and Applied Mathematics WELL CONDITIONED SPHERICAL DESIGNS FOR INTEGRATION AND INTERPOLATION ON THE TWO-SPHERE CONGPEI AN,
More informationLecture 5 : Projections
Lecture 5 : Projections EE227C. Lecturer: Professor Martin Wainwright. Scribe: Alvin Wan Up until now, we have seen convergence rates of unconstrained gradient descent. Now, we consider a constrained minimization
More informationYou may not start to read the questions printed on the subsequent pages until instructed to do so by the Invigilator.
MATHEMATICAL TRIPOS Part IB Thursday 7 June 2007 9 to 12 PAPER 3 Before you begin read these instructions carefully. Each question in Section II carries twice the number of marks of each question in Section
More informationSec 4.1 Limits, Informally. When we calculated f (x), we first started with the difference quotient. f(x + h) f(x) h
1 Sec 4.1 Limits, Informally When we calculated f (x), we first started with the difference quotient f(x + h) f(x) h and made h small. In other words, f (x) is the number f(x+h) f(x) approaches as h gets
More informationGeometric Series and the Ratio and Root Test
Geometric Series and the Ratio and Root Test James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University September 5, 2018 Outline 1 Geometric Series
More informationREVIEW OF ESSENTIAL MATH 346 TOPICS
REVIEW OF ESSENTIAL MATH 346 TOPICS 1. AXIOMATIC STRUCTURE OF R Doğan Çömez The real number system is a complete ordered field, i.e., it is a set R which is endowed with addition and multiplication operations
More informationarxiv: v1 [math.oc] 14 Oct 2014
arxiv:110.3571v1 [math.oc] 1 Oct 01 An Improved Analysis of Semidefinite Approximation Bound for Nonconvex Nonhomogeneous Quadratic Optimization with Ellipsoid Constraints Yong Hsia a, Shu Wang a, Zi Xu
More informationCALCULUS: Math 21C, Fall 2010 Final Exam: Solutions. 1. [25 pts] Do the following series converge or diverge? State clearly which test you use.
CALCULUS: Math 2C, Fall 200 Final Exam: Solutions. [25 pts] Do the following series converge or diverge? State clearly which test you use. (a) (d) n(n + ) ( ) cos n n= n= (e) (b) n= n= [ cos ( ) n n (c)
More information#A30 INTEGERS 17 (2017) CONFERENCE MATRICES WITH MAXIMUM EXCESS AND TWO-INTERSECTION SETS
#A3 INTEGERS 7 (27) CONFERENCE MATRICES WITH MAIMUM ECESS AND TWO-INTERSECTION SETS Koji Momihara Faculty of Education, Kumamoto University, Kurokami, Kumamoto, Japan momihara@educ.kumamoto-u.ac.jp Sho
More informationIntriguing sets of vertices of regular graphs
Intriguing sets of vertices of regular graphs Bart De Bruyn and Hiroshi Suzuki February 18, 2010 Abstract Intriguing and tight sets of vertices of point-line geometries have recently been studied in the
More informationNATIONAL BOARD FOR HIGHER MATHEMATICS. M. A. and M.Sc. Scholarship Test. September 19, Time Allowed: 150 Minutes Maximum Marks: 30
NATIONAL BOARD FOR HIGHER MATHEMATICS M. A. and M.Sc. Scholarship Test September 19, 2015 Time Allowed: 150 Minutes Maximum Marks: 30 Please read, carefully, the instructions on the following page 1 INSTRUCTIONS
More informationRecall that any inner product space V has an associated norm defined by
Hilbert Spaces Recall that any inner product space V has an associated norm defined by v = v v. Thus an inner product space can be viewed as a special kind of normed vector space. In particular every inner
More informationMath 6455 Nov 1, Differential Geometry I Fall 2006, Georgia Tech
Math 6455 Nov 1, 26 1 Differential Geometry I Fall 26, Georgia Tech Lecture Notes 14 Connections Suppose that we have a vector field X on a Riemannian manifold M. How can we measure how much X is changing
More informationLecture 1 Introduction
L. Vandenberghe EE236A (Fall 2013-14) Lecture 1 Introduction course overview linear optimization examples history approximate syllabus basic definitions linear optimization in vector and matrix notation
More information