BOUNDS FOR SOLID ANGLES OF LATTICES OF RANK THREE
|
|
- Valerie Franklin
- 5 years ago
- Views:
Transcription
1 BOUNDS FOR SOLID ANGLES OF LATTICES OF RANK THREE LENNY FUKSHANSKY AND SINAI ROBINS Abstract. We find sharp absolute consts C and C with the following property: every well-rounded lattice of rank 3 in a Euclidean space has a minimal basis so that the solid angle spanned by these basis vectors lies in the interval [C, C ]. In fact, we show that these absolute bounds hold for a larger class of lattices than just well-rounded, and the upper bound holds for all. We state a technical condition on the lattice that may prevent it from satisfying the absolute lower bound on the solid angle, in which case we derive a lower bound in terms of the ratios of successive minima of the lattice. We use this result to show that among all spherical triangles on the unit sphere in R N with vertices on the minimal vectors of a lattice, the smallest possible area is achieved by a configuration of minimal vectors of the normalized) face centered cubic lattice in R 3. Such spherical configurations come up in connection with the kissing number problem.. Introduction Given an integer N, let R N be the Euclidean space with the usual norm on it. The kissing number problem in dimension N asks for the maximal number of non-overlapping unit balls in R N that touch another unit ball. The answer to this problem is currently only known in dimensions N =, 3,, 8, see [], [], [], and []). In fact, in dimension 3 this was the subject of a famous argument between Isaac Newton and David Gregory, where Newton claimed that the kissing number is while Gregory believed it was 3; two different proofs that this number is finally appeared in the 950-s, by Schütte and van der Waerden [] and by Leech [8] see also [], [7] for details, including an extensive bibliography), although there were previous unsuccessful and incomplete attempts. The kissing number problem can be reformulated as follows: find the maximal configuration of points on the unit sphere in R N such that the angular separation between any pair of these points is at least π/3; by angular separation between two points we mean the smallest angle between the vectors connecting these two points to the origin in the plane spanned by these vectors. Such configurations are often expected to come from sets of minimal vectors i.e. vectors of smallest nonzero norm) of lattices, at least this is the case in all dimensions where the kissing number is known. For example, in dimension three an optimal configuration of points is given by the set of minimal vectors of the normalized) face centered cubic lattice A 3. Define a spherical lattice-minimal triangle to be a non-degenerate spherical triangle with vertices at the endpoints of minimal vectors of a lattice; as we will discuss below, the minimality condition forces the angular separation between every pair of these 000 Mathematics Subject Classification. Primary: 5C07, 05B30; Secondary: H06, 5M5. Key words and phrases. lattices, solid angles, spherical configurations.
2 LENNY FUKSHANSKY AND SINAI ROBINS points to be at least π/3. The above consideration raises the following naturally related question. Question. Given a spherical lattice-minimal triangle on a unit sphere in R N, what is the minimal possible two-dimensional spherical area it can have? In other words, although minimal vectors of the normalized lattice A 3 form the largest with respect to cardinality) configuration of points on the unit sphere with angular separation at least π/3, and hence produce spherical triangles of small area at least on the average), could it be that minimal vectors of some other lattice form some spherical triangle of even smaller area? Our first result answers this question. Theorem.. Any spherical lattice-minimal triangle on a unit sphere in R N has area at least ) = π , which is precisely the area of the spherical triangle formed by the vectors / ) / 0, / / 0 /, 0 / on the unit sphere in R 3. These are precisely minimal basis vectors of the face centered cubic lattice A 3, normalized to lie on the unit sphere. To prove Theorem., we use a somewhat more general and technical result, which we present next. We start with some basic notation. Let B N be a unit ball in R N. Given a lattice Λ R N of rank r, we define its successive minima by 0 < λ λ r λ i = inf{λ R >0 : Λ λb N contains i linearly independent vectors}. There exists a collection of linearly independent vectors x,..., x r in Λ such that x i = λ i for each i r; we will refer to them as vectors corresponding to successive minima. When r, these vectors form a basis for Λ, which is precisely a minimal basis; this is not necessarily true for r 5 see for insce [3]). Let us also write SΛ) = {x Λ : x = λ } for the set of all minimal vectors of Λ. In the special case when SΛ) contains r linearly independent vectors, i.e. when λ = = λ r, Λ is called a well-rounded lattice, abbreviated WR. WR lattices and configurations of their minimal vectors play an import role in discrete optimization problems see [0], [], [7]). In particular, spherical configurations which give good kissing numbers always come from WR lattices. We will say that a basis x,..., x r for a lattice Λ R N of rank r is minimal often referred to as Minkowski reduced in the literature - see for insce [6]) if x SΛ) and for each i r, x i Λ is a shortest vector such that the collection of vectors x,..., x i is extendable to a basis in Λ. Minimal bases for lattices are extensively studied for their imporce in number theory and discrete
3 BOUNDS FOR SOLID ANGLES OF LATTICES OF RANK THREE 3 geometry, as well as in computer science and engineering applications see [3], [3], []). In particular, if a lattice happens to have an orthogonal basis, it is easy to prove that this basis must be minimal. In fact, it turns out that even suitably defined near-orthogonality of the basis vectors is sufficient for a basis to be minimal or almost minimal - here we mean reduced vs Minkowski reduced). This idea has been successfully exploited by the famous LLL algorithm [9]. It should be mentioned that in addition to the notion of Minkowski reduction that we are using here other basis reduction procedures exist, most notably the Hermite-Korkine- Zolotareff reduction see for insce [0] for details); the common general principle behind various reduction procedures is the minimization of the orthogonality defect. In the reverse direction, one can ask how close to orthogonal does a minimal basis have to be? When r =, the answer is classical: if x, x is a minimal basis for a lattice Λ R N of rank two, then the normalized) angle between these vectors has to lie in the interval [/6, /3]; moreover, for every such lattice there exists a minimal basis with the normalized) angle between vectors lying in the interval [/6, /] since we will use this result, we include its proof in section to make our presentation self-contained). It is natural to ask for analogues of this statement for lattices of higher rank, starting with r = 3 as follows. Question. Do there exist absolute consts C and C such that every lattice of rank three has a minimal basis that spans a solid angle in the interval [C, C ]? Notice that when Λ is a WR lattice of rank three in R N, then SΛ) contains a minimal basis. In fact, by scaling if necessary, we can assume that λ = λ = λ 3 =, and then any three linearly independent vectors in SΛ) form a minimal basis and span a spherical lattice-minimal triangle on the unit sphere centered at the origin in R N. On the other hand, vertices of a spherical lattice-minimal triangle on the unit sphere centered at the origin in R N form a minimal basis for a WR lattice of rank three with λ = λ = λ 3 =. Since the solid angle in question is equal to the normalized spherical area of the corresponding spherical triangle, there is a direct connection between Question restricted to just WR lattices and Question. In this note, we answer Question completely for a wide class of lattices including all WR lattices and provide a partial answer with the const C depending on the lattice) for all the remaining lattices. We then use this result, along with our method, to answer Question. Let Λ be a lattice of rank 3 in R N and let x, x, x 3 be a fixed minimal basis for Λ, corresponding to successive minima λ, λ, λ 3, respectively. We will write θ ij for the angle between the vectors x i and x j, i < j 3, and will refer to θ, θ 3, θ 3 as the vertex angles corresponding to this minimal basis. We also define the ratios of successive minima 3) K = λ, K 3 = λ, K 3 = λ = K K 3. λ λ 3 λ 3 Then clearly max{k, K 3 }, and min{k, K 3 } < if and only if Λ is not WR. Let us also define ) ν := cos K K 3 cos θ + K cos θ 3 K ) ) K 3 K 3 < π 6. Remark.. Our measure of three-dimensional solid angles is always normalized to be between 0 and, i.e. we divide by π, the maximal possible solid angle which corresponds to the full sphere in R 3.
4 LENNY FUKSHANSKY AND SINAI ROBINS We can now state our next result. Theorem.. Let Λ R N be a lattice of rank 3. Then there exists a minimal basis x, x, x 3 for Λ such that 5) π/3 θ, θ 3 π/, π/3 θ 3 π/3. Fix any minimal basis x, x, x 3 for Λ satisfying 5), and let Ω be the solid angle formed by these vectors. Then Ω 0.5. If in addition 6) θ 3 cos cos θ + cos θ 3 ), then Ω The above condition is satisfied in particular by every WR lattice, and the bounds on Ω are sharp as demonstrated in Remark 3. below. On the other hand, if then in fact and θ 3 cos where ν is as in ). cos cos θ + cos θ 3 ) < θ 3 π/3, K K 3 cos θ + K cos θ 3 K K 3 K 3 ) ) < π 3, Ω π ν 3 ν 3 > 0, ν In section we discuss some basic two-dimensional lemmas, which will be later used in our main argument. Theorem. is proved in section 3: it follows immediately by combining Lemmas 3., 3., 3., Corollary 3.3, and Remark 3.. In section, we use the techniques developed in section 3 to prove Theorem.. We are now ready to proceed.. Preliminary two-dimensional lemmas We start with some basic lemmas about the angles between minimal basis vectors for lattices of rank, which we will use in our argument for lattices of rank 3. Lemma.. Let x and x be nonzero vectors in R N so that the angle θ between them satisfies either 0 < θ < π 3 or π 3 < θ < π. Then min { x x, x + x } < max{ x, x }. Proof. Notice that either In the first case: < cos θ = xt x x x <, or < cos θ = xt x x x <. x x = x x ) t x x ) = x + x x t x < x + x x x < max{ x, x }. In the second case: x + x = x + x ) t x + x ) = x + x + x t x < x + x x x < max{ x, x }.
5 BOUNDS FOR SOLID ANGLES OF LATTICES OF RANK THREE 5 Lemma.. Let Λ R N be a lattice of rank with successive minima λ λ, and let x, x be vectors in Λ corresponding to λ, λ, respectively. Let θ be the angle between x and x. Then π/3 θ π/3. Proof. Clearly θ 0, π). Assume that either 0 < θ < π/3 or π 3 Lemma. implies that min { x x, x + x } < x = λ, < θ < π, then which contradicts the definition of λ since the vectors x and x ± x are linearly independent. Lemma.3. Let Λ R N be a lattice of full rank with successive minima 0 < λ λ N, and vectors x,..., x N corresponding to these successive minima, respectively, chosen in such a way that all of them lie in the half-space x N 0. For every pair of indices i < j N, let θ ij be the angle between the vectors x i and x j. Then π/3 θ ij π/3. Proof. Let Λ ij = span Z {x i, x j }, then the successive minima µ, µ of Λ ij are: µ = λ i µ = λ j. Indeed, it is clear that µ µ and µ λ i, µ λ j, so suppose for insce that µ < λ i. Then there exists a vector y = a i x i + a j x j, such that 0 a i, a j Z and 7) y = µ < λ i. Then the collection of vectors 8) x,..., x i, y, x i+,..., x N must be linearly independent in Λ, and so by definition of successive minima, µ λ i, which is a contradiction. If, on the other hand, we assume that µ < λ j, then we can apply the same argument as above replacing µ with µ in 7) and inserting y for x j instead of x i in 8) to reach the same contradiction. Therefore λ i, λ j are the successive minima of Λ ij, and hence x i, x j are vectors corresponding to successive minima. Now the conclusion follows by Lemma. above. 3. Bounds for solid angles: proof of Theorem. In this section we prove a collection of lemmas, which together comprise the result of Theorem.. First we need to fix our choice of a minimal basis for a lattice of rank 3, which is accomplished by the following lemma. Lemma 3.. Let Λ R N be a lattice of rank 3. Then there exists a minimal basis x, x, x 3 for Λ such that 9) π/3 θ, θ 3 π/, π/3 θ 3 π/3, where θ ij is the angle between vectors x i and x j for all i < j 3.
6 6 LENNY FUKSHANSKY AND SINAI ROBINS Proof. Let 0 < λ λ λ 3 be successive minima of Λ, and let x, x, x 3 be the vectors corresponding to λ, λ, λ 3 respectively. Then Lemma.3 implies that π/3 θ ij π/3. In fact, if θ > π/, replace x with x, and if θ 3 > π/, replace x 3 with x 3. Then x, x, x 3 is a minimal basis satisfying 9), as required. In what follows, the measure of three-dimensional solid angles is normalized as specified in Remark., however we assume it is converted back to steradians when we compute values of trigonometric functions of Ω. Lemma 3.. Let Λ R N be a lattice of rank 3, and let x, x, x 3 be a minimal basis for Λ guaranteed by Lemma 3.. Let Ω be the solid angle formed by these vectors. Then Ω 0.5. If in addition 0) θ 3 cos cos θ + cos θ 3 ), then Ω Proof. With our choice of the basis x, x, x 3, we have ) π/3 θ, θ 3 π/, π/3 θ 3 π/3, Now make the choice of ±x 3 that makes θ 3 as small as possible for ) to hold; notice in particular that if θ 3 = π/, then ±x 3 can be chosen to ensure that π/3 θ 3 π/. From now on we will always assume this choice of x, x, x 3. Let ) α = θ + θ 3, β = θ θ 3, c = θ 3, and so π 3) 6 α π, π β π, π c π 6. Let Ω be the solid angle spanned by the vectors x, x, x 3, then L Huilier s theorem see, for insce, [5]) implies that ) Ω ) = α + c) α c) c + β) c β), when Ω is measured in steradians. Notice that for each c π/, π/), 5) c + β) c β) = c β c β is a decreasing function of β, and so 5) is minimized when β is as large as possible, and maximized when β = 0. To produce an upper bound for Ω, let us write 6) x = π/ θ, x = π/ θ 3, y = θ 3 π/, and x = x + x, so that 7) α = π x, c = π 8 + y, where 0 x π 3, π 6 y π 6, and y is as small as possible for 7) to hold. Then ), along with the fact that 5) is maximized when β = 0, implies that ) Ω 3π 8) 8 x + y ) π 8 x y ) π 8 + y )
7 BOUNDS FOR SOLID ANGLES OF LATTICES OF RANK THREE 7 It is not difficult to observe that with the constraints of 7) satisfied, the right hand side of 8) is a decreasing function of x, so to maximize it we can assume that x = 0, meaning that θ = θ 3 = π/. In this case π/3 θ 3 π/, meaning that π/6 y 0, and 9) Ω ) 3π 8 + y ) π 8 y ) π 8 + y ), where the right hand side of 9) is an increasing function of y. Therefore ) ) Ω 3π π ) 3, 8 8 and the upper bound for Ω follows. Next we produce a lower bound for Ω. Assume that in addition to ), the inequality 0) is also satisfied. Then 0) π/3 θ, θ 3 π/, π/3 θ 3 min { cos cos θ + cos θ 3 ), π/3 }, and x, x, x 3 is chosen so that θ 3 is as small as possible for 0) to hold. Then ) π 6 α π, π β π {, π c min cos cos α cos β ), π }. 6 The right hand side of ) is easily checked to be an increasing function of c when the constraints of ) are satisfied we use Sage mathematical software package [5] - see illustration in section 5). Therefore for each fixed pair of values of α and β, ) α + π ) α π ) π ) π ) + β β when 0) holds. Since θ, θ 3 π/3, it follows that β = θ θ 3 α π/3, ) Ω, and so 5) is minimized when β = min{α π/6, π/}. We can also assume without loss of generality that 0 < Ω < / i.e. the measure of Ω in steradians is between 0 and π), and so ) Ω is an increasing function of Ω. First assume that α π/6 π/, then α 5π/ and the above observations combined with ) imply that ) Ω 3) α + π ) α π ) π ) π ) 3 α. Next assume that α π/6 π/, then α 5π/ and the above observations combined with ) imply that ) Ω α + π ) α π ) π ) π 8 ) ) 7π π ) π π ) 3 ) >. 8 ) The lower bound for Ω now follows in the case when 0) is satisfied.
8 8 LENNY FUKSHANSKY AND SINAI ROBINS Corollary 3.3. Let Λ R N be a well-rounded lattice of rank 3, and let x, x, x 3 be a minimal basis for Λ guaranteed by Lemma 3.. Then 0) is satisfied, and so by Lemma Ω 0.5, Proof. Let λ be the common value of successive minima of Λ, and notice that x x x 3 = λ 3 + cos θ cos θ 3 + cos θ 3 )) λ, which means that cos θ cos θ 3 + cos θ 3. Remark 3.. The bounds of Lemma 3. are sharp. The lower bound is achieved by the fcc face centered cubic) lattice A 3 same as D 3 ) in R 3 with the choice of a minimal basis 0 x =, x =, x 3 = 0, 0 so that the angles between these vectors are θ = θ 3 = θ 3 = π/3. The upper bound is achieved by the integer lattice Z 3 in R 3 with the sdard choice of a minimal basis x = 0, x = so that the angles between these vectors are, x 3 = θ = θ 3 = θ 3 = π/. 0 0, Notice that both of these lattices are well-rounded, and so in fact the bounds of Corollary 3.3 are sharp. Next we consider the situation when 0) is not satisfied, in which case we can derive a lower bound for the solid angle formed by the minimal basis vectors of a lattice depending on the ratios of successive minima. Lemma 3.. Let Λ R N be a lattice of rank 3, let x, x, x 3 be a minimal basis for Λ, corresponding to successive minima λ, λ, λ 3, as guaranteed by Lemma 3., and let Ω be the solid angle formed by these vectors. By ), we can assume that π/3 θ, θ 3 π/, π/3 θ 3 π/3, and θ 3 is as small as possible for these inequalities to hold. Suppose in addition that 5) cos cos θ + cos θ 3 ) < θ 3 π/3. Let K, K 3, and K 3 be as in 3), then min{k, K 3 } < and 6) Ω 3 π ν ν 3 > 0, ν where 7) ν = cos K K 3 cos θ + K cos θ 3 K K 3 K 3 ) ) < π 6.
9 BOUNDS FOR SOLID ANGLES OF LATTICES OF RANK THREE 9 Proof. We use the notation from the proof of Lemma 3.. The first implication of 5) is that cos θ 3 < +cos θ +cos θ 3, so in particular cos θ +cos θ 3 /. Combining this observation with ), we obtain 8) π 3 θ π, π 3 θ 3 cos cos θ in addition to 5). Another implication of 5) is that Λ cannot be well-rounded, by Corollary 3.3. Therefore min{k, K 3 } <, and thus K 3 <. Notice that the vectors x, x, x x x 3 are linearly independent, and hence λ 3 x x x 3 ), = λ 3 + K 3 + K 3 K 3 K 3 cos θ K 3 cos θ 3 + K 3 cos θ 3 ). Therefore, since cos θ 3 / cos θ, cos θ /, and K 3 = K K 3, cos θ 3 K K 3 + K ) 3 K 3 K 3 cos θ K 3 cos θ 3 3 = ) K K 3 + K 3 K K 3 cos θ K cos θ 3 ) K K 3 + K 3 K + K K 3 ) cos θ K 3 K K + ) >, since min{k, K 3 } < and max{k, K 3 }. Therefore 9) θ 3 cos K K 3 cos θ + K cos θ 3 K ) ) K 3 K 3 < π 3. Let now ν be as in 7). It can now be easily checked that the right hand side of ) is a decreasing function of c when the constraints of 5) and 8) are satisfied we use Sage mathematical software package [5] - see illustration in section 5), and c ν < π/6 by 9). Therefore for each fixed pair of values of α and β, ) Ω 30) α + ν) α ν) ν + β) ν β), when 5) holds. The left hand side of 30) is now minimized when α is as small as possible. Notice that α π/3 + β, and hence 3) ) Ω π6 ) π ) + β + ν 6 + β ν ν + β) ν β), where 0 β π/. The right hand side of 3) is easily checked to be an increasing function of β, so to minimize take β = 0, therefore ) Ω 3 ) ν 3) 3 ν, ν and 6) now follows from 3), since the left hand side of 3) is an increasing function of Ω, as was indicated in the proof of Lemma 3..
10 0 LENNY FUKSHANSKY AND SINAI ROBINS. Area of spherical triangles: proof of Theorem. In this section we prove Theorem.. Consider a spherical lattice-minimal triangle T on the unit sphere centered at the origin in R N, and let x, x, x 3 be minimal vectors of some lattice L corresponding to the vertices of this triangle. Let Ω be the three-dimensional solid angle spanned by x, x, x 3, measured in steradians i.e. not normalized as in Remark.), then the measure of Ω is precisely the spherical two-dimensional area of T. Hence we want to show that Ω is greater or equal than the number in ). Let Λ = span Z {x, x, x 3 }. Then x, x, x 3 are minimal vectors in Λ, since they are minimal vectors in L and Λ L, and x = x = x 3 =. Since these vectors form a spherical triangle, they must be linearly independent, and so they form a minimal basis for Λ with solid angle Ω, in particular Λ is WR with all the successive minima equal to. If the vertex angles θ, θ 3, θ 3 corresponding to these vectors satisfy 5), then Theorem. implies the result with equality precisely in the case described in ), which is a minimal basis for the normalized fcc lattice see Remark 3.). Now assume that the vertex angles do not satisfy 5). This means that at least two of the angles θ, θ 3, θ 3 must lie in the interval π/, π/3]. Since Λ is WR we can reindex the three vectors as necessary, and so we can assume without loss of generality that π/ < θ θ 3 π/3, π/3 θ 3 θ. Let α, β, and c be as in ), then 5π 33) < α π 3, 0 β π, π 8 c π 6. Now Ω is given by ), and since it is proportional to the spherical area of our triangle, we want to undersd how small can it be. The right hand side of ) is easily checked to be an increasing function of c when the constraints of 33) are satisfied we use Sage mathematical software package [5] - see illustration in section 5); also, as discussed in the proof of Lemma 3., to minimize Ω we need to maximize β, so we can take β = π/. Therefore for each fixed value of α and β, ) Ω α + π ) α π ) π ) π ) β 8 β α + π ) α π ) ) 5π π 8 8 ) π ) ) 5π π π π ) 3 3) > >, 3 ) ) which means that Ω is greater than the number in ), and hence finishes the proof of the theorem. 5. Appendix: Sage code Here we present the Sage code illustrating the increasing/decreasing behavior of functions used in the arguments above. Here is the code corresponding to the proof of Lemma 3.:
11 BOUNDS FOR SOLID ANGLES OF LATTICES OF RANK THREE def plotterx = sliderpi/3,pi/), y = sliderpi/3,pi/)): z = var z ) a, b, c = x+y)/, x-y)/, z/ expressionz) = a+c)*a-c)*c+b)*c-b) zmin, zmax = pi/3, min*pi/3,arccoscosx)+cosy)-)) color =,.5,0) plotexpression, z, zmin, zmax, rgbcolor=color).showxmin=pi/,xmax=*pi/3,ymin=0,ymax=0.3) Here is the code corresponding to the proof of Lemma 3.: def plotterx = sliderpi/3,pi/), y = sliderpi/3,pi/)): if arccos-+cosx)+cosy)) <= *pi/3: z = var z ) a, b, c = x+y)/, x-y)/, z/ expressionz) = a+c)*a-c)*c+b)*c-b) zmin, zmax = arccos-+cosx)+cosy)), *pi/3 color =,.5,0) plotexpression, z, zmin, zmax, rgbcolor=color).showxmin=pi/3,xmax=*pi/3,ymin=0,ymax=.) else: print Bad Domain Here is the code corresponding to the proof of Theorem.: def plotterx = sliderpi/,*pi/3), y = sliderpi/3,*pi/3)): if y <= x: z = var z ) a, b, c = x+y)/, x-y)/, z/ expressionz) = a+c)*a-c)*c+b)*c-b) zmin, zmax = x, *pi/3 color =,.5,0) plotexpression, z, zmin, zmax, rgbcolor=color).showxmin=pi/3,xmax=*pi/3,ymin=0,ymax=.5) else: print Bad Domain Acknowledgment. We would like to thank Achill Schürmann and the anonymous referees for their helpful comments on the subject of this paper, and Andrew Ohana for helping us with some computations in Sage.
12 LENNY FUKSHANSKY AND SINAI ROBINS References [] C. Bachoc and F. Vallentin. New upper bounds for kissing numbers from semidefinite programmings. J. Amer. Math. Soc., 3):909 9, 008. [] A. H. Banihashemi and A. K. Khandani. On the complexity of decoding lattices using the Korkin-Zolotarev reduced basis. IEEE Trans. Inform. Theory, ):6 7, 998. [3] R. Baraniuk, S. Dash, and R. Neelamani. On nearly orthogonal lattice bases. SIAM J. Discrete Math., ):99 9, 007. [] J. H. Conway and N. J. A. Sloane. Sphere Packings, Lattices, and Groups. Springer-Verlag, Third edition, 999. [5] J. D. H. Donnay. Spherical Trigonometry. Church Press, 007. [6] P. M. Gruber and C. G. Lekkerkerker. Geometry of Numbers. North-Holland Publishing Co., 987. [7] W. Y. Hsiang. Least Action Principle of Crystal Formation of Dense Packing Type and Kepler s Conjecture. World Scientific Publishing Company, 00. [8] J. Leech. The problem of the thirteen spheres. Math. Gaz., 0: 3, 956. [9] A. K. Lenstra, H. W. Lenstra Jr., and L. Lovasz. Factoring polynomials with rational coefficients. Math. Ann., 6):55 53, 98. [0] J. Martinet. Perfect Lattices in Euclidean Spaces. Springer-Verlag, 003. [] O. R. Musin. The kissing number in four dimensions. Ann. of Math. ), 68): 3, 008. [] A. M. Odlyzko and N. J. A. Sloane. New bounds on the number of unit spheres that can touch a unit sphere in n dimensions. J. Combin. Theory Ser. A., 6):0, 979. [3] M. Pohst. On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications. Technical report. [] K. Schutte and B. L. van der Waerden. Das problem der dreizehn Kugeln. Math. Ann., 5:35 33, 953. [5] W. Stein and et al. Sage: Open source mathematics software. Department of Mathematics, Claremont McKenna College, 850 Columbia Avenue, Claremont, CA address: lenny@cmc.edu Division of Mathematical Sciences, Nanyang Technological University, SPMS-MAS- 03-0, Nanyang Link, Singapore address: rsinai@ntu.edu.sg
arxiv: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 informationSphere Packings, Coverings and Lattices
Sphere Packings, Coverings and Lattices Anja Stein Supervised by: Prof Christopher Smyth September, 06 Abstract This article is the result of six weeks of research for a Summer Project undertaken at the
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 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 informationThe 123 Theorem and its extensions
The 123 Theorem and its extensions Noga Alon and Raphael Yuster Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel Abstract It is shown
More information3d Crystallization. FCC structures. Florian Theil. Macroscopic Modeling of Materials with Fine Structure May Warwick University
FCC structures 1 Mathematics Institute Warwick University Macroscopic Modeling of Materials with Fine Structure May 2011 Outline 1 2 Outline 1 2 Extremum principles Crystalline structure is the minimizer
More informationNote on shortest and nearest lattice vectors
Note on shortest and nearest lattice vectors Martin Henk Fachbereich Mathematik, Sekr. 6-1 Technische Universität Berlin Straße des 17. Juni 136 D-10623 Berlin Germany henk@math.tu-berlin.de We show that
More informationsatisfying ( i ; j ) = ij Here ij = if i = j and 0 otherwise The idea to use lattices is the following Suppose we are given a lattice L and a point ~x
Dual Vectors and Lower Bounds for the Nearest Lattice Point Problem Johan Hastad* MIT Abstract: We prove that given a point ~z outside a given lattice L then there is a dual vector which gives a fairly
More informationINTEGRAL ORTHOGONAL BASES OF SMALL HEIGHT FOR REAL POLYNOMIAL SPACES
INTEGRAL ORTHOGONAL BASES OF SMALL HEIGHT FOR REAL POLYNOMIAL SPACES LENNY FUKSHANSKY Abstract. Let P N (R be the space of all real polynomials in N variables with the usual inner product, on it, given
More informationON FREE PLANES IN LATTICE BALL PACKINGS ABSTRACT. 1. Introduction
ON FREE PLANES IN LATTICE BALL PACKINGS MARTIN HENK, GÜNTER M ZIEGLER, AND CHUANMING ZONG ABSTRACT This note, by studying relations between the length of the shortest lattice vectors and the covering minima
More informationSELECTIVELY BALANCING UNIT VECTORS AART BLOKHUIS AND HAO CHEN
SELECTIVELY BALANCING UNIT VECTORS AART BLOKHUIS AND HAO CHEN Abstract. A set U of unit vectors is selectively balancing if one can find two disjoint subsets U + and U, not both empty, such that the Euclidean
More informationMaximal perpendicularity in certain Abelian groups
Acta Univ. Sapientiae, Mathematica, 9, 1 (2017) 235 247 DOI: 10.1515/ausm-2017-0016 Maximal perpendicularity in certain Abelian groups Mika Mattila Department of Mathematics, Tampere University of Technology,
More informationSome Sieving Algorithms for Lattice Problems
Foundations of Software Technology and Theoretical Computer Science (Bangalore) 2008. Editors: R. Hariharan, M. Mukund, V. Vinay; pp - Some Sieving Algorithms for Lattice Problems V. Arvind and Pushkar
More informationOn Siegel s lemma outside of a union of varieties. Lenny Fukshansky Claremont McKenna College & IHES
On Siegel s lemma outside of a union of varieties Lenny Fukshansky Claremont McKenna College & IHES Universität Magdeburg November 9, 2010 1 Thue and Siegel Let Ax = 0 (1) be an M N linear system of rank
More informationMAXIMAL PERIODS OF (EHRHART) QUASI-POLYNOMIALS
MAXIMAL PERIODS OF (EHRHART QUASI-POLYNOMIALS MATTHIAS BECK, STEVEN V. SAM, AND KEVIN M. WOODS Abstract. A quasi-polynomial is a function defined of the form q(k = c d (k k d + c d 1 (k k d 1 + + c 0(k,
More informationOn Nearly Orthogonal Lattice Bases
On Nearly Orthogonal Lattice Bases Ramesh Neelamani, Sanjeeb Dash, and Richard G. Baraniuk July 14, 2005 Abstract We study nearly orthogonal lattice bases, or bases where the angle between any basis vector
More informationSMALL REPRESENTATIONS OF INTEGERS BY INTEGRAL QUADRATIC FORMS arxiv: v1 [math.nt] 12 Mar 2019
SMALL REPRESENTATIONS OF INTEGERS BY INTEGRAL QUADRATIC FORMS arxiv:1903.05123v1 [math.nt] 12 Mar 2019 WAI KIU CHAN AND LENNY FUKSHANSKY Abstract. Given an isotropic quadratic form over a number field
More informationLattice Basis Reduction and the LLL Algorithm
Lattice Basis Reduction and the LLL Algorithm Curtis Bright May 21, 2009 1 2 Point Lattices A point lattice is a discrete additive subgroup of R n. A basis for a lattice L R n is a set of linearly independent
More informationGeometric variants of Hall s Theorem through Sperner s Lemma
Available online at www.sciencedirect.com Electronic Notes in Discrete Mathematics 44 (2013) 127 132 www.elsevier.com/locate/endm Geometric variants of Hall s Theorem through Sperner s Lemma Leonardo Martinez
More informationSphere Packings. Ji Hoon Chun. Thursday, July 25, 2013
Sphere Packings Ji Hoon Chun Thursday, July 5, 03 Abstract The density of a (point) lattice sphere packing in n dimensions is the volume of a sphere in R n divided by the volume of a fundamental region
More informationCOS 598D - Lattices. scribe: Srdjan Krstic
COS 598D - Lattices scribe: Srdjan Krstic Introduction In the first part we will give a brief introduction to lattices and their relevance in some topics in computer science. Then we show some specific
More informationCSE 206A: Lattice Algorithms and Applications Spring Basis Reduction. Instructor: Daniele Micciancio
CSE 206A: Lattice Algorithms and Applications Spring 2014 Basis Reduction Instructor: Daniele Micciancio UCSD CSE No efficient algorithm is known to find the shortest vector in a lattice (in arbitrary
More informationComputational complexity of lattice problems and cyclic lattices
Computational complexity of lattice problems and cyclic lattices Lenny Fukshansky Claremont McKenna College Undergraduate Summer Research Program ICERM - Brown University July 28, 2014 Euclidean lattices
More informationHow to Factor N 1 and N 2 When p 1 = p 2 mod 2 t
How to Factor N 1 and N 2 When p 1 = p 2 mod 2 t Kaoru Kurosawa and Takuma Ueda Ibaraki University, Japan Abstract. Let N 1 = p 1q 1 and N 2 = p 2q 2 be two different RSA moduli. Suppose that p 1 = p 2
More informationAn algebraic perspective on integer sparse recovery
An algebraic perspective on integer sparse recovery Lenny Fukshansky Claremont McKenna College (joint work with Deanna Needell and Benny Sudakov) Combinatorics Seminar USC October 31, 2018 From Wikipedia:
More informationDS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.
DS-GA 1002 Lecture notes 0 Fall 2016 Linear Algebra These notes provide a review of basic concepts in linear algebra. 1 Vector spaces You are no doubt familiar with vectors in R 2 or R 3, i.e. [ ] 1.1
More informationReduction of Smith Normal Form Transformation Matrices
Reduction of Smith Normal Form Transformation Matrices G. Jäger, Kiel Abstract Smith normal form computations are important in group theory, module theory and number theory. We consider the transformation
More informationLattice Basis Reduction Part 1: Concepts
Lattice Basis Reduction Part 1: Concepts Sanzheng Qiao Department of Computing and Software McMaster University, Canada qiao@mcmaster.ca www.cas.mcmaster.ca/ qiao October 25, 2011, revised February 2012
More informationA Note on Projecting the Cubic Lattice
A Note on Projecting the Cubic Lattice N J A Sloane (a), Vinay A Vaishampayan, AT&T Shannon Labs, 180 Park Avenue, Florham Park, NJ 07932-0971, USA and Sueli I R Costa, University of Campinas, Campinas,
More informationCovering an ellipsoid with equal balls
Journal of Combinatorial Theory, Series A 113 (2006) 1667 1676 www.elsevier.com/locate/jcta Covering an ellipsoid with equal balls Ilya Dumer College of Engineering, University of California, Riverside,
More informationAnalogs of Steiner s porism and Soddy s hexlet in higher dimensions via spherical codes
Analogs of Steiner s porism and Soddy s hexlet in higher dimensions via spherical codes Oleg R. Musin arxiv:1801.08278v2 [math.mg] 2 Feb 2018 Abstract In this paper we consider generalizations to higher
More informationInteger knapsacks and the Frobenius problem. Lenny Fukshansky Claremont McKenna College
Integer knapsacks and the Frobenius problem Lenny Fukshansky Claremont McKenna College Claremont Statistics, Operations Research, and Math Finance Seminar April 21, 2011 1 Integer knapsack problem Given
More informationRational exponents in extremal graph theory
Rational exponents in extremal graph theory Boris Bukh David Conlon Abstract Given a family of graphs H, the extremal number ex(n, H) is the largest m for which there exists a graph with n vertices and
More informationDimension-Preserving Reductions Between Lattice Problems
Dimension-Preserving Reductions Between Lattice Problems Noah Stephens-Davidowitz Courant Institute of Mathematical Sciences, New York University. noahsd@cs.nyu.edu Last updated September 6, 2016. Abstract
More informationarxiv: v1 [math.nt] 20 Nov 2017
REDUCED IDEALS FROM THE REDUCTION ALGORITHM HA THANH NGUYEN TRAN arxiv:171107573v1 [mathnt] 20 Nov 2017 Abstract The reduction algorithm is used to compute reduced ideals of a number field However, there
More informationGENERALIZED CANTOR SETS AND SETS OF SUMS OF CONVERGENT ALTERNATING SERIES
Journal of Applied Analysis Vol. 7, No. 1 (2001), pp. 131 150 GENERALIZED CANTOR SETS AND SETS OF SUMS OF CONVERGENT ALTERNATING SERIES M. DINDOŠ Received September 7, 2000 and, in revised form, February
More informationMathematical Research Letters 1, (1994) AVERAGE KISSING NUMBERS FOR NON-CONGRUENT SPHERE PACKINGS. Greg Kuperberg and Oded Schramm
Mathematical Research Letters 1, 339 344 (1994) AVERAGE KISSING NUMBERS FOR NON-CONGRUENT SPHERE PACKINGS Greg Kuperberg and Oded Schramm 1. Introduction Let P be a packing of n (round) balls in R 3. (A
More informationCSE 206A: Lattice Algorithms and Applications Spring Minkowski s theorem. Instructor: Daniele Micciancio
CSE 206A: Lattice Algorithms and Applications Spring 2014 Minkowski s theorem Instructor: Daniele Micciancio UCSD CSE There are many important quantities associated to a lattice. Some of them, like the
More informationFat Struts: Constructions and a Bound
Fat Struts: Constructions and a Bound N. J. A. Sloane, Vinay A. Vaishampayan, Sueli I. R. Costa AT&T Shannon Labs, Florham Park, NJ 0793, USA. Email: {njas,vinay}@research.att.com University of Campinas,
More informationOn the Generalised Hermite Constants
On the Generalised Hermite Constants NTU SPMS-MAS Seminar Bertrand MEYER IMB Bordeaux Singapore, July 10th, 2009 B. Meyer (IMB) Hermite constants Jul 10th 2009 1 / 35 Outline 1 Introduction 2 The generalised
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 informationTwo Proofs for Sylvester s Problem Using an Allowable Sequence of Permutations
Combinatorial and Computational Geometry MSRI Publications Volume 52, 2005 Two Proofs for Sylvester s Problem Using an Allowable Sequence of Permutations HAGIT LAST Abstract. The famous Sylvester s problem
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 informationConic Theta Functions and their relations to classical theta functions
Conic Theta Functions and their relations to classical theta functions International Number Theory Conference in Memory of Alf Van der Poorten The University of Newcastle, Australia Sinai Robins Nanyang
More informationMaximum union-free subfamilies
Maximum union-free subfamilies Jacob Fox Choongbum Lee Benny Sudakov Abstract An old problem of Moser asks: how large of a union-free subfamily does every family of m sets have? A family of sets is called
More informationGAPS BETWEEN FRACTIONAL PARTS, AND ADDITIVE COMBINATORICS. Antal Balog, Andrew Granville and Jozsef Solymosi
GAPS BETWEEN FRACTIONAL PARTS, AND ADDITIVE COMBINATORICS Antal Balog, Andrew Granville and Jozsef Solymosi Abstract. We give bounds on the number of distinct differences N a a as a varies over all elements
More informationarxiv: v3 [math.co] 31 Aug 2017
PERMUTATION INVARIANT LATTICES arxiv:1409.1491v3 [math.co] 31 Aug 2017 LENNY FUKSHANSKY, STEPHAN RAMON GARCIA, AND XUN SUN Abstract. We say that a Euclidean lattice in R n is permutation invariant if its
More informationLattices. SUMS lecture, October 19, 2009; Winter School lecture, January 8, Eyal Z. Goren, McGill University
Lattices SUMS lecture, October 19, 2009; Winter School lecture, January 8, 2010. Eyal Z. Goren, McGill University Lattices A lattice L in R n is L = {a 1 v 1 + + a n v n : a 1,..., a n Z}, where the v
More informationarxiv: v1 [math.co] 28 Oct 2016
More on foxes arxiv:1610.09093v1 [math.co] 8 Oct 016 Matthias Kriesell Abstract Jens M. Schmidt An edge in a k-connected graph G is called k-contractible if the graph G/e obtained from G by contracting
More informationUniqueness of the Solutions of Some Completion Problems
Uniqueness of the Solutions of Some Completion Problems Chi-Kwong Li and Tom Milligan Abstract We determine the conditions for uniqueness of the solutions of several completion problems including the positive
More informationGraph coloring, perfect graphs
Lecture 5 (05.04.2013) Graph coloring, perfect graphs Scribe: Tomasz Kociumaka Lecturer: Marcin Pilipczuk 1 Introduction to graph coloring Definition 1. Let G be a simple undirected graph and k a positive
More informationComputational Challenges in Perfect form theory
Computational Challenges in Perfect form theory Mathieu Dutour Sikirić Rudjer Bošković Institute, Zagreb Croatia April 24, 2018 I. Enumerating Perfect forms Notations We define S n the space of symmetric
More information1 i<j k (g ih j g j h i ) 0.
CONSECUTIVE PRIMES IN TUPLES WILLIAM D. BANKS, TRISTAN FREIBERG, AND CAROLINE L. TURNAGE-BUTTERBAUGH Abstract. In a stunning new advance towards the Prime k-tuple Conjecture, Maynard and Tao have shown
More informationBalanced bipartitions of graphs
2010.7 - Dedicated to Professor Feng Tian on the occasion of his 70th birthday Balanced bipartitions of graphs Baogang Xu School of Mathematical Science, Nanjing Normal University baogxu@njnu.edu.cn or
More informationLattice Packing from Quaternion Algebras
RIMS ôkyûroku Bessatsu B3 (01), 9 37 Lattice Packing from Quaternion Algebras By Fang-Ting Tu and Yifan Yang Abstract In this paper, we will discuss ideal lattices from a definite quaternion algebra, which
More informationOne square and an odd number of triangles. Chapter 22
One square and an odd number of triangles Chapter 22 Suppose we want to dissect a square into n triangles of equal area. When n is even, this is easily accomplished. For example, you could divide the horizontal
More informationHarmonic Polynomials and Dirichlet-Type Problems. 1. Derivatives of x 2 n
Harmonic Polynomials and Dirichlet-Type Problems Sheldon Axler and Wade Ramey 30 May 1995 Abstract. We take a new approach to harmonic polynomials via differentiation. Surprisingly powerful results about
More information1 x i. i=1 EVEN NUMBERS RAFAEL ARCE-NAZARIO, FRANCIS N. CASTRO, AND RAÚL FIGUEROA
Volume, Number 2, Pages 63 78 ISSN 75-0868 ON THE EQUATION n i= = IN DISTINCT ODD OR EVEN NUMBERS RAFAEL ARCE-NAZARIO, FRANCIS N. CASTRO, AND RAÚL FIGUEROA Abstract. In this paper we combine theoretical
More informationON A THEOREM OF TARTAKOWSKY
ON A THEOREM OF TARTAKOWSKY MICHAEL A. BENNETT Dedicated to the memory of Béla Brindza Abstract. Binomial Thue equations of the shape Aa n Bb n = 1 possess, for A and B positive integers and n 3, at most
More informationSHORTEST PERIODIC BILLIARD TRAJECTORIES IN CONVEX BODIES
SHORTEST PERIODIC BILLIARD TRAJECTORIES IN CONVEX BODIES MOHAMMAD GHOMI Abstract. We show that the length of any periodic billiard trajectory in any convex body K R n is always at least 4 times the inradius
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 informationLattice Reduction of Modular, Convolution, and NTRU Lattices
Summer School on Computational Number Theory and Applications to Cryptography Laramie, Wyoming, June 19 July 7, 2006 Lattice Reduction of Modular, Convolution, and NTRU Lattices Project suggested by Joe
More informationCountable subgroups of Euclidean space
Countable subgroups of Euclidean space Arnold W. Miller April 2013 revised May 21, 2013 In his paper [1], Konstantinos Beros proved a number of results about compactly generated subgroups of Polish groups.
More informationNEW CLASSES OF SET-THEORETIC COMPLETE INTERSECTION MONOMIAL IDEALS
NEW CLASSES OF SET-THEORETIC COMPLETE INTERSECTION MONOMIAL IDEALS M. R. POURNAKI, S. A. SEYED FAKHARI, AND S. YASSEMI Abstract. Let be a simplicial complex and χ be an s-coloring of. Biermann and Van
More informationLINEAR EQUATIONS WITH UNKNOWNS FROM A MULTIPLICATIVE GROUP IN A FUNCTION FIELD. To Professor Wolfgang Schmidt on his 75th birthday
LINEAR EQUATIONS WITH UNKNOWNS FROM A MULTIPLICATIVE GROUP IN A FUNCTION FIELD JAN-HENDRIK EVERTSE AND UMBERTO ZANNIER To Professor Wolfgang Schmidt on his 75th birthday 1. Introduction Let K be a field
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 informationMath in the Grocery Aisle: from stacking oranges to constructing error-correcting codes. Lenny Fukshansky Claremont McKenna College
Math in the Grocery Aisle: from stacking oranges to constructing error-correcting codes Lenny Fukshansky Claremont McKenna College GEMS February 28, 2009 1 What is the best way to pack oranges? (from Wikipedia)
More informationShortest Vector Problem (1982; Lenstra, Lenstra, Lovasz)
Shortest Vector Problem (1982; Lenstra, Lenstra, Lovasz) Daniele Micciancio, University of California at San Diego, www.cs.ucsd.edu/ daniele entry editor: Sanjeev Khanna INDEX TERMS: Point lattices. Algorithmic
More informationAnalytic and Algebraic Geometry 2
Analytic and Algebraic Geometry 2 Łódź University Press 2017, 179 188 DOI: http://dx.doi.org/10.18778/8088-922-4.20 ŁOJASIEWICZ EXPONENT OF OVERDETERMINED SEMIALGEBRAIC MAPPINGS STANISŁAW SPODZIEJA AND
More information1 Shortest Vector Problem
Lattices in Cryptography University of Michigan, Fall 25 Lecture 2 SVP, Gram-Schmidt, LLL Instructor: Chris Peikert Scribe: Hank Carter Shortest Vector Problem Last time we defined the minimum distance
More informationHermite normal form: Computation and applications
Integer Points in Polyhedra Gennady Shmonin Hermite normal form: Computation and applications February 24, 2009 1 Uniqueness of Hermite normal form In the last lecture, we showed that if B is a rational
More informationSUCCESSIVE-MINIMA-TYPE INEQUALITIES. U. Betke, M. Henk and J.M. Wills
SUCCESSIVE-MINIMA-TYPE INEQUALITIES U. Betke, M. Henk and J.M. Wills Abstract. We show analogues of Minkowski s theorem on successive minima, where the volume is replaced by the lattice point enumerator.
More informationPrimitive sets in a lattice
Primitive sets in a lattice Spyros. S. Magliveras Department of Mathematical Sciences Florida Atlantic University Boca Raton, FL 33431, U.S.A spyros@fau.unl.edu Tran van Trung Institute for Experimental
More informationA NEW UPPER BOUND FOR THE MINIMUM OF AN INTEGRAL LATTICE OF DETERMINANT 1
BULLETIN (New Series) OF THE AMERICAN MATHEMATICAL SOCIETY Volume 23, Number 2, October 1990 A NEW UPPER BOUND FOR THE MINIMUM OF AN INTEGRAL LATTICE OF DETERMINANT 1 J. H. CONWAY AND N. J. A. SLOANE ABSTRACT.
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 informationCOMPLETELY INVARIANT JULIA SETS OF POLYNOMIAL SEMIGROUPS
Series Logo Volume 00, Number 00, Xxxx 19xx COMPLETELY INVARIANT JULIA SETS OF POLYNOMIAL SEMIGROUPS RICH STANKEWITZ Abstract. Let G be a semigroup of rational functions of degree at least two, under composition
More informationOn the intersection of infinite matroids
On the intersection of infinite matroids Elad Aigner-Horev Johannes Carmesin Jan-Oliver Fröhlich University of Hamburg 9 July 2012 Abstract We show that the infinite matroid intersection conjecture of
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 informationAlgebraic integers of small discriminant
ACTA ARITHMETICA LXXV.4 (1996) Algebraic integers of small discriminant by Jeffrey Lin Thunder and John Wolfskill (DeKalb, Ill.) Introduction. For an algebraic integer α generating a number field K = Q(α),
More informationThe Shortest Vector Problem (Lattice Reduction Algorithms)
The Shortest Vector Problem (Lattice Reduction Algorithms) Approximation Algorithms by V. Vazirani, Chapter 27 - Problem statement, general discussion - Lattices: brief introduction - The Gauss algorithm
More informationA NOTE ON LINEAR FUNCTIONAL NORMS
A NOTE ON LINEAR FUNCTIONAL NORMS YIFEI PAN AND MEI WANG Abstract. For a vector u in a normed linear space, Hahn-Banach Theorem provides the existence of a linear functional f, f(u) = u such that f = 1.
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 informationTOTALLY ISOTROPIC SUBSPACES OF SMALL HEIGHT IN QUADRATIC SPACES
TOTALLY ISOTROPIC SUBSPACES OF SMALL HEIGHT IN QUADRATIC SPACES WAI KIU CHAN, LENNY FUKSHANSKY, AND GLENN R. HENSHAW Abstract. Let K be a global field or Q, F a nonzero quadratic form on K N, N 2, and
More informationA Course in Computational Algebraic Number Theory
Henri Cohen 2008 AGI-Information Management Consultants May be used for personal purporses only or by libraries associated to dandelon.com network. A Course in Computational Algebraic Number Theory Springer
More informationDistinct distances between points and lines in F 2 q
Distinct distances between points and lines in F 2 q Thang Pham Nguyen Duy Phuong Nguyen Minh Sang Claudiu Valculescu Le Anh Vinh Abstract In this paper we give a result on the number of distinct distances
More informationAn Analytic Approach to the Problem of Matroid Representibility: Summer REU 2015
An Analytic Approach to the Problem of Matroid Representibility: Summer REU 2015 D. Capodilupo 1, S. Freedman 1, M. Hua 1, and J. Sun 1 1 Department of Mathematics, University of Michigan Abstract A central
More informationJónsson posets and unary Jónsson algebras
Jónsson posets and unary Jónsson algebras Keith A. Kearnes and Greg Oman Abstract. We show that if P is an infinite poset whose proper order ideals have cardinality strictly less than P, and κ is a cardinal
More information12-neighbour packings of unit balls in E 3
12-neighbour packings of unit balls in E 3 Károly Böröczky Department of Geometry Eötvös Loránd University Pázmány Péter sétány 1/c H-1117 Budapest Hungary László Szabó Institute of Informatics and Economics
More informationCollatz cycles with few descents
ACTA ARITHMETICA XCII.2 (2000) Collatz cycles with few descents by T. Brox (Stuttgart) 1. Introduction. Let T : Z Z be the function defined by T (x) = x/2 if x is even, T (x) = (3x + 1)/2 if x is odd.
More informationOn Euclidean distance matrices
On Euclidean distance matrices R. Balaji and R. B. Bapat Indian Statistical Institute, New Delhi, 110016 November 19, 2006 Abstract If A is a real symmetric matrix and P is an orthogonal projection onto
More informationMeans of unitaries, conjugations, and the Friedrichs operator
J. Math. Anal. Appl. 335 (2007) 941 947 www.elsevier.com/locate/jmaa Means of unitaries, conjugations, and the Friedrichs operator Stephan Ramon Garcia Department of Mathematics, Pomona College, Claremont,
More informationNAVARRO VERTICES AND NORMAL SUBGROUPS IN GROUPS OF ODD ORDER
NAVARRO VERTICES AND NORMAL SUBGROUPS IN GROUPS OF ODD ORDER JAMES P. COSSEY Abstract. Let p be a prime and suppose G is a finite solvable group and χ is an ordinary irreducible character of G. Navarro
More informationTHE L p VERSION OF NEWMAN S INEQUALITY FOR LACUNARY POLYNOMIALS. Peter Borwein and Tamás Erdélyi. 1. Introduction and Notation
THE L p VERSION OF NEWMAN S INEQUALITY FOR LACUNARY POLYNOMIALS Peter Borwein and Tamás Erdélyi Abstract. The principal result of this paper is the establishment of the essentially sharp Markov-type inequality
More informationA proof of Freiman s Theorem, continued. An analogue of Freiman s Theorem in a bounded torsion group
A proof of Freiman s Theorem, continued Brad Hannigan-Daley University of Waterloo Freiman s Theorem Recall that a d-dimensional generalized arithmetic progression (GAP) in an abelian group G is a subset
More informationHeronian tetrahedra are lattice tetrahedra
Heronian tetrahedra are lattice tetrahedra Susan H. Marshall and Alexander R. Perlis Abstract Extending a similar result about triangles, we show that each Heronian tetrahedron may be positioned with integer
More informationM4. Lecture 3. THE LLL ALGORITHM AND COPPERSMITH S METHOD
M4. Lecture 3. THE LLL ALGORITHM AND COPPERSMITH S METHOD Ha Tran, Dung H. Duong, Khuong A. Nguyen. SEAMS summer school 2015 HCM University of Science 1 / 31 1 The LLL algorithm History Applications of
More informationMatchings in hypergraphs of large minimum degree
Matchings in hypergraphs of large minimum degree Daniela Kühn Deryk Osthus Abstract It is well known that every bipartite graph with vertex classes of size n whose minimum degree is at least n/2 contains
More informationTHE IMPLICIT FUNCTION THEOREM FOR CONTINUOUS FUNCTIONS. Carlos Biasi Carlos Gutierrez Edivaldo L. dos Santos. 1. Introduction
Topological Methods in Nonlinear Analysis Journal of the Juliusz Schauder Center Volume 32, 2008, 177 185 THE IMPLICIT FUNCTION THEOREM FOR CONTINUOUS FUNCTIONS Carlos Biasi Carlos Gutierrez Edivaldo L.
More informationSMALL ZEROS OF QUADRATIC FORMS WITH LINEAR CONDITIONS. Lenny Fukshansky. f ij X i Y j
SALL ZEROS OF QUADRATIC FORS WITH LINEAR CONDITIONS Lenny Fukshansky Abstract. Given a quadratic form and linear forms in N + 1 variables with coefficients in a number field K, suppose that there exists
More informationA Pair in a Crowd of Unit Balls
Europ. J. Combinatorics (2001) 22, 1083 1092 doi:10.1006/eujc.2001.0547 Available online at http://www.idealibrary.com on A Pair in a Crowd of Unit Balls K. HOSONO, H. MAEHARA AND K. MATSUDA Let F be a
More information