UvA-DARE (Digital Academic Repository) Lattices, codes and Radon transforms Boguslavsky, M. Link to publication
|
|
- Jemima Watts
- 5 years ago
- Views:
Transcription
1 UvA-DARE (Digital Academic Repository) Lattices, codes and Radon transforms Boguslavsky, M. Link to publication Citation for published version (APA): Boguslavsky, M. I. (1999). Lattices, codes and Radon transforms General rights It is not permitted to download or to forward/distribute the text or part of it without the consent of the author(s) and/or copyright holder(s), other than for strictly personal, individual use, unless the work is under an open content license (like Creative Commons). Disclaimer/Complaints regulations If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library: or a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible. UvA-DARE is a service provided by the library of the University of Amsterdam ( Download date: 15 Nov 2018
2 Chapter 2 Homogeneous spaces in duality In this chapter, we mention first some notions from the theory of homogeneous spaces in duality as developed in [Hell] and [Hel2]. This theory delivers a unified point of view on many dualities arising in coding and lattices theories. We prove relations on T-functions, two known bounds on generalized Hamming weights and generalized Hermite parameters, and give a new interpretation of Nogin weight/multiplicity duality. It seems to us that many other applications of these technique are possible. For example, in proofs of Theorems 4.1, 4.2, and 4.3 in Chapter 4, the key step is equivalent to the use of the Plancherel formula for a suitable Radon transform in P m (F 9 ). 2.1 General Theory In this section, we follow the books [Hell] and [Hel2]. Let G be a locally compact group, X and H two (left) coset spaces X = G/Hx and H = G/H^, where Hx and H^ are two closed subgroups of G. Let K be the intersection IflS. Let us make the following assumptions: (i) The groups G, Hx, H=, Hx n H-= are unimodular (i.e. the leftinvariant Haar measures are right-invariant); (ii) For any hx Hx the inclusion hxh-= C H-^Hx implies hx H-=; 21
3 Homogeneous spaces in duality for any h E G H E the inclusion h E H x C H X H E implies h E G H x \ (iii) The set H X H E is closed. Homogeneous spaces X and E are called homogeneous spaces in duality. We shall say that x G X and G E are incident and denote it by x tx if the cosets xh x and H E are not disjoint. The classical example of the homogenous spaces in duality is the pair (points in R", hyperplanes in R n ) with the incidence relation (x M Other examples are the pair of real Grassmanians (Ç(n, m),ç(n,nm 1)), ([Hell]), symmetric spaces, complex spaces, and quadrics in C ([GGV]), The transform considered in 2.3 can be regarded as the F 5 -analogue of the real X-ray transform, widely applied in radiology and tomography [LS]. We put x = { G E : x M } C E, f = {x G X : M x} C X. The factor G/K may be identified with the set {(x, ) G X x E : x tx f}. The maps x i-)- x and H>- can be also described via the double filtration G/K P / \ *, (2.1) X = G/H X E = G/H E where p(## x D ff s ) = gh x and TT(## X n # s ) = gh s. Namely, x = 7r(p-\x)),i = p(n- 1 (0). Given Haar measures that satisfy (i) we may construct nice G- invariant measures m(x) on each f and /i(f) on each x (cf. [Hell, p. 143].) by The Radon transform ƒ : E -> C of a function ƒ : X -> C is defined /(0= fj(x)dm(x); (2.2) the duaj Radon transform <j) : X» C of a function </> : H > C is defined by 0(z) = I m dm- (2.3) 22
4 CHAPTER 2 Lemma 2.1 flhell], Plancherel formula.) Let ƒ : X -> C and </> : E» C 6e continuous compact support functions. Then ƒ and f are continuous and J x f(x)4>(x) dx = j[ ƒ (0^(0 de- (2.4) Note. For a discrete group G the formal equalities Y,mk*)= /(*Mö = /«Mö (2.5) show that Eq. (2.4) holds also for any functions ƒ and < such that all series in (2.5) converge absolutely. The proof for the general case is similar but requires some additional facts about measures and groups. Actually, equality (2.4) holds in a more general case of a double filtration like (2.1) than that of conditions (i)-(iii). However, the existence of a nice group structure is often useful and helps to choose the right homogeneous space representation. The problem of the inversion of a Radon transform (2.2) and of the dual transform (2.3), is, in general, rather complicated 1, and there is no general inversion formula. In some special cases this problem was solved. For the classical case of the pair (R n, hyperplanes in R n ) this problem was solved by J. Radon [Rad]. The inversion formulas are quite different in the cases of the even and odd dimensions. For a pair of real Grassmannians, the Radon transform was inverted by Helgason [Hell]. We did not find an inversion formula for lattice spaces being investigated in the next section. The case of codes is simpler and an inversion formula for a Radon transform in a projective space over a finite field is obtained in Section 2.3. An equivalent result was proved by Nogin [Nog3] in connection with one problem about projective multisets. : A Radon transform often maps some "non-essential" functions to the all-zero function (see [GGV].) In the case of a vector space over a finite field these "nonessential" functions are somewhat similar to latin squares (see the cover.) Indeed, take the rows and the columns of a latin square as one space H, and the cells as the other space X. The numbers in cells define a certain function on X and the Radon tranform of this function is constant on E. 23
5 Homogeneous spaces in duality 2.2 A Duality Between Vectors and (n 1)- sublattices Let A(n) denote the group of integer n x n matrices with the determinant ±1: A(n) := {M G GL n {Z) : det M\ = 1} ~ SL n (Z) x {±1}. The subset G = R(n) C GL n+1 (Z) defined by G - *( ) := ( ^ * ) (2.6, is a group with the respect to the usual matrix multiplication. The map x i-)- Mx = M'x + v, M I ) G R(n),x e Z n defines an action of i?(n) on Z n. Note that this is also a transitive action of R(n) on the set of all shifts of bases of Z n. Let Hx denote the stabilizer of the point 0: H x = St(0) ~ A(n); (2.7) let n be a shift of an (n l)-sublattice of Z n and let i/n denote the stabilizer of IT. Assume now that II is the sublattice Ilo C Z" spanned by the first n 1 base vectors; then H s = St(U 0 ) = St(v u v 2,...,» _!> ~ Ä(n - 1) x {±1}. (2.8) Lemma 2.2 The spaces X = G/Hx and S = GjH-= defined by Eq. (2.6), (2.7) and (2.8) satisfy conditions (i), (ii) and (Hi). PROOF. Conditions (i) and (iii) are obvious. Let us check condition (ii). We need to prove that if hx G Hx is such that for any h-= G H-= there exist gx G Hx and g-= G H-= satisfying h x h s = g~g x (2.9) then hx G Hs- Applying the right and the left hand sides of (2.9) to the origin, we get hx(h s 0)=g a (g x 0). (2.10) 24
6 CHAPTER 2 Since g x 0 = 0, the right hand side of (2.10) belongs to n 0. It is clear that H-= acts transitively on n 0, so /i=0 runs through Ilo as /i= runs through H E. Thus, h x (p) G n 0 for any p 6 n 0) i.e. h x G H3. The dual statement of (ii) is proved similarly. A Recall that by L^m' we denote the set of all primitive m-sublattices of a lattice L and denote by LH the set of all shifts of primitive m- sublattices of L by vectors of L. The intersection of H x with Lf s is A(n-l) 0 0 K:=H x nh E = 0 ±10 I ~A{n-l) x {±1} The factorspace X = G/H x can be identified with Z n, and the factorspace S = G/H^ can be identified with the set (Z")^n_1 ' of all integer shifts of primitive (n l)-sublattices in Z. It can be checked that with our choice of Ilo a point x G X is incident with a shift of sublattice e G s iff x G e Note. A different choice of Ilo m (2-8) will give a different incidence relation; for example, when H-= stabilizes n = n A = (vi, u 2,..., u n _i) + \v n, A G z, we get the incidence relation x tx 44> ind^^a;, ) = A. The Plancherel formula (2.4) gives ƒ(*)*(*) = E /(0^(0 (2.11) xez" fe(z") ln - 1] for any ƒ : L > C and </> : L^" -1 '» C such that both series converge absolutely. Theorem 2.1 For any lattice L of rank n Q L (q) T - l (p) = E_p ll$li e f (g). (2.12) 25
7 Homogeneous spaces in duality PROOF. Let us apply Eq. (2.11) to f(x) = gll x 1 and 0(f) = pikh, where the norms are given by the positive quadratic form associated to L. By the definitions, Q L {q)-tr\p) E i M E p" = E xez" / \çe(z") 1 7 çiixii j2 p m 7 Shift a sublattice f e Ü- n ^ by a vector x. We can replace now a summation over all f G L'" -1! by a summation over all f x = f + x G Li"" 1 ], ll^ll = f and apply then the Plancherel formula (2.11): E (V"EH= W \ S P KI (2.11) gimi p * ^ çlmiplieil = ^p^e,(g). A Thus, we proved that the product of the 0-function of a lattice with the T n_1 -function equals the weighted sum of shifted sublattice O-functions. Applying the duality relations (1.7), (1.14) we get the following corollary Corollary 2.1 For any lattice L CÄ holds e L (<i)-tl(p detl )= E p m d<i)- (2.13) 2.3 Weight/Multiplicity Duality for Projective Multisets Nogin [Nog3] proposed the following construction of new linear codes from the known ones. 26
8 CHAPTER 2 The projective multiset Yc of a linear [n, k, d] q -code C (see 1.1.2) can be considered as a multiset of n hyperplanes with multiplicities v(h) in the projectivization PC of the code C. Assign multiplicity zero to any hyperplane not in the multiset. The weight of a 1-subcode c G PC equals wt(c) = 2>(JÏ). (2.14) A natural problem is to invert relations (2.14), i.e. given the set of weights {wt(c) c G PC} one wants to reconstruct the multiplicities {u(h)}. Nogin proved the following inversion formula for (2.14): u{h) = ^Pcwt(c)-gE c g wt(^ (2 i5) Now, for any given function wt : P _1» Z one can reconstruct a set of "multiplicities". These "multiplicities" do not necessarily correspond to an actual set of multiplicities of a projective multiset. However, they can be corrected to an actual set of multiplicities by a linear transform (see [Nog3]). Nogin used this inversion to construct new long linear codes: one can take a "small" code Ci, construct from it in a certain way a set of "weights", apply Eq. (2.15) to obtain a set of "multiplicities" and correct them to a set of multiplicities of a projective multiset. The code Ci corresponding to this multiset is much longer than C\ and its spectrum is determined by the spectrum of C\. This construction has a natural interpretation via a Radon transform. Consider the group G := PGL(k l, q ) with the standard action on PC and subgroups H x := St(P) and H-= := St(H), where P is an arbitrary but fixed point in PC, and H is a hyperplane containing P. The conditions (i)-(iii) (see page 21) can be easily checked, so the pair (X = G/Hx,z, = G/H-=) is a pair of homogeneous spaces in duality. The incidence relation is the Radon transform and the dual are given by HO = /(*)> (2-16) m = i>(0- (2-17) Ç3x 27
9 Homogeneous spaces in duality These transform can be inverted in the following way. Consider a function ƒ : X -> R. We want to express ƒ via its Radon transform ƒ. Let p m denote the number of points in an m-dimensional projective space over q, p m = ^^1" 1. Let us introduce the following functionals s ((f)), <j(f) and operators D(f>, A/ defined on the function spaces {(f) : S -» C} {ƒ : X -> C} by Pra-l Pm-1 Theorem ie Radon transform (2.16) and the dual Radon transform (2.17) are inverted by the formulas PROOF. It is sufficient to prove Eq. (2.18) for the indicator function of the one-point set {P}, i.e. for the function Ip W = 1 0, x? P The result can be then extended to arbitrary functions by the linearity of the Radon transform. For Ip(x) it is clear that /p(0 = { o', UP ; S(lp) = Pm-l SO A Note that Eq. (2.14) can be rewritten as wt(c) = n v(c). Using the inversion formula (2.18) for the function v(c) we get Eq. (2.15). 28
10 CHAPTER Generalized Plotkin Bound In this section, we prove a lower bound for generalized Hamming weights (see [TV2] and [HKYL].) We show that this bound can be regarded as a corollary of the Plancherel formula. We use the following lemma, which is due to van der Geer and van der Vlugt: Lemma 2.3 ([GVl]) For any r-subcode D holds wt( >) = i r wt(c). y y c D (2.19) Let the incidence relation between r-subcodes of a code C be given by ctxi D & c G D, where c 6 C is a codeword and D C C is an r-subcode. Theorem 2.3 For any linear [n, k, d] q -code C and f or any r = the following holds l,...,k E wt(d) T3I PROOF. We use twice Eq. (2.19) (lemma 2.3) and once Eq. (2.4) (lemma 2.1): r L fc J q E DeCM w t(d) (2.19),. (2.4) 1 - S Ew.(c) l =' DeCH CM ) - T E #{D e ch c e D} wt(c) = 1 <7 r r-1 -Ç (2.19) 1 q T r-l -q nq k ~ T q k - 1 r L j q (2.19) wt(c)^ J 5 cec 29 (g fc -g fc - x )wt(c) y q cec Ocxc
11 Homogeneous spaces in duality A An easy corollary of this theorem is the following bound on d r (this is Theorem 1.1 from [TV2].) Corollary 2.2 ([TV2]) The r-h generalized Hamming weight d r (C) of an [n, k, d] q -code C satisfies A tr\ < n (g r -!)g fc " r d^c> ^ ^ittl ' 2.5 Generalized Minkowski Hlawka Theorem This theorem is a nonconstructive lower bound on 7 >m. It was first proved by Thunder [Thul] in greater generality (see ) We give a shorter and simpler proof of this theorem based on the Plancherel formula. Let Z(j) = C0)r(i/2)/7T J/ ' 2, where Ç(j) is the Riemann ^-function Theorem 2.4 ( Generalized Minkowski-Hlawka Theorem) For any m < n there exists a lattice L C M" with j m (L) > (n U^n- m+ \ Z^). (2.20) For m = 1 we get the classical Minkowski-Hlawka theorem. The idea of our proof is the same as in Siegel's proof of Minkowsi-Hlawka theorem [Sie]. The main ingredient of that proof is Siegel mean value theorem, which states that for a compactly supported continous function <j> : M. n -> R, f é(x)dx = an)f Y,<t>{gz)dg, (2.21) where C n is the factorspace S, L n (R)/5L n (Z) with the Haar measure dg scaled so that vol(5l n (R)/5L n (Z)) = 1 and P is the set of primitive 30
12 CHAPTER 2 integer vectors in R. We shall prove a generalization of this mean value theorem is a corollary of the Plancherel formula for the pair of homogenous spaces in duality (C n,tz m ), where 1Z m is the space of all m-lattices in R n, and the incidence relation is [xi M < > "M is a primitive sublattice of L". (2.22) The standard way to represent C n as a homogenous space is to identify it with S L n (R) / S L n (Z). However, it is more convenient for us to identify it with the factorspace of real unitary matrices by the integer unitary matrices. Let U n (R) ~ SL n (R) x {±1} be the subgroup of GL n (R) consisting of all matrices A with deta = 1 and let U n (Z) ~ SL n (Z) x {±1} be the subgroup of all integer matrices in [/ (E). It is clear that C n = U n (R)/U n (Z) (2.23) and that U n (M) acts transitively on the set 7Z m. Thus, n m = U n (R)/St(M 0 ), (2.24) where M 0 is any fixed m-lattice in E". In coordinates, when M 0 is spanned by the first m basis vectors we have In the sequel, the integrations over C n and TZ m are assumed to be with the respect to the measures induced by the Haar measure on f/ (M) scaled so that vol n = 1. One can check that the pair of spaces ( n,lz m ) is a pair of homogenous spaces of duality in the sense of conditions (i)-(iii) on page 21with the incidence relation (2.22). Theorem 2.5 (Generalized Siegel mean value theorem) Let < ( ) be a compactly supported function on TZ m. Then where c I Y. ^( M ) dl = f ^( M ) dm i ( 2-25 ) MxiL T(n/2 + l) V T\7=2 Z(J) J 31
13 Homogeneous spaces in duality- Note. For m = 1 we have C = 2((n) and not ((n) as in in (2.21) because our space 7?-i does not coincide with R n but is in fact the factor R n /{±1}. PROOF. We should simply use the Plancherel formula (2.4) for the pair (jc n,lz m ) of homogenous spaces in duality defined by (2.23) and (2.24). It is easy to check that M e 1Z m is incident to L E C n iff M is a primitive m-sublattice of L. Take <f>(-) as the function on 1Z m and f(l) = 1 as the function on C n. We have / f(l)$(l)dl= f <j){m)hm)dm. JC n Jllm Substituting ƒ (L) = 1 and using the definitions we get ƒ J2 4>{M) dl= f vol(m)(/.(m) dm. It is clear that vol(m) is independent of M. In fact, it equals the volume of the space of all n-lattices with a fixed m-sublattice. Define the constant C by 1/C = vol(m). Thus C I Y, ^( M ) dl = i <M M ) dm. Similarly to Siegel's argument, one computes now the value of C via a rather technical inductive calculation in the space of matrices. A Theorem 2.4 follows now by the standard argument: let B R C lz m be the ball B R = {M\ det M < R 2 } of radius R and let <j>(m) be the indicator function of this ball. The right hand side of Eq. (2.25) equals \o\{b R ). So if R is such that vol B R < C, then EMCXL 4>(M) < 1 for at least one L G C n. Thus, any m-sublattice of L is outside B R, so lm(l) > R 2. This completes the proof of Theorem 2.4. A The bound of this theorem is asymptotically good, that is, it differs from the lower bound (1.19) just by a multiplicative constant. 32
14 CHAPTER 2 Note that a similar bound for generalized Hamming weights of codes (generalized Gilbert-Varshamov bound, see [TV2]) can be proved similarly, by using the Placherel formula for the pair of homogenous spaces in duality ([n, k] q codes, [n, r] q codes). 33
15 Homogeneous spaces in duality 34
Citation for published version (APA): Harinck, S. (2001). Conflict issues matter : how conflict issues influence negotiation
UvA-DARE (Digital Academic Repository) Conflict issues matter : how conflict issues influence negotiation Harinck, S. Link to publication Citation for published version (APA): Harinck, S. (2001). Conflict
More informationOn a unified description of non-abelian charges, monopoles and dyons Kampmeijer, L.
UvA-DARE (Digital Academic Repository) On a unified description of non-abelian charges, monopoles and dyons Kampmeijer, L. Link to publication Citation for published version (APA): Kampmeijer, L. (2009).
More informationData-driven methods in application to flood defence systems monitoring and analysis Pyayt, A.
UvA-DARE (Digital Academic Repository) Data-driven methods in application to flood defence systems monitoring and analysis Pyayt, A. Link to publication Citation for published version (APA): Pyayt, A.
More informationRecent revisions of phosphate rock reserves and resources: a critique Edixhoven, J.D.; Gupta, J.; Savenije, H.H.G.
UvA-DARE (Digital Academic Repository) Recent revisions of phosphate rock reserves and resources: a critique Edixhoven, J.D.; Gupta, J.; Savenije, H.H.G. Published in: Earth System Dynamics DOI: 10.5194/esd-5-491-2014
More informationMass loss and evolution of asymptotic giant branch stars in the Magellanic Clouds van Loon, J.T.
UvA-DARE (Digital Academic Repository) Mass loss and evolution of asymptotic giant branch stars in the Magellanic Clouds van Loon, J.T. Link to publication Citation for published version (APA): van Loon,
More informationUvA-DARE (Digital Academic Repository) Lattices, codes and Radon transforms Boguslavsky, M. Link to publication
UvA-DARE (Digital Academic Repository) Lattices, codes and Radon transforms Boguslavsky, M. Link to publication Citation for published version (APA): Boguslavsky, M. I. (1999). Lattices, codes and Radon
More informationUvA-DARE (Digital Academic Repository)
UvA-DARE (Digital Academic Repository) Facile synthesis of NaYF4:Yb, Ln/NaYF4:Yb core/shell upconversion nanoparticles via successive ion layer adsorption and one-pot reaction technique Zeng, Q.; Xue,
More informationUvA-DARE (Digital Academic Repository) Converting lignin to aromatics: step by step Strassberger, Z.I. Link to publication
UvA-DARE (Digital Academic Repository) Converting lignin to aromatics: step by step Strassberger, Z.I. Link to publication Citation for published version (APA): Strassberger, Z. I. (2014). Converting lignin
More informationRotational symmetry breaking in the topological superconductor SrxBi2Se3 probed by uppercritical
UvA-DARE (Digital Academic Repository) Rotational symmetry breaking in the topological superconductor SrxBi2Se3 probed by uppercritical field experiments Pan, Y.; Nikitin, A.; Araizi Kanoutas, G.; Huang,
More informationNMDA receptor dependent functions of hippocampal networks in spatial navigation and memory formation de Oliveira Cabral, H.
UvA-DARE (Digital Academic Repository) NMDA receptor dependent functions of hippocampal networks in spatial navigation and memory formation de Oliveira Cabral, H. Link to publication Citation for published
More informationPublished in: Tenth Tbilisi Symposium on Language, Logic and Computation: Gudauri, Georgia, September 2013
UvA-DARE (Digital Academic Repository) Estimating the Impact of Variables in Bayesian Belief Networks van Gosliga, S.P.; Groen, F.C.A. Published in: Tenth Tbilisi Symposium on Language, Logic and Computation:
More informationNMDA receptor dependent functions of hippocampal networks in spatial navigation and memory formation de Oliveira Cabral, H.
UvA-DARE (Digital Academic Repository) NMDA receptor dependent functions of hippocampal networks in spatial navigation and memory formation de Oliveira Cabral, H. Link to publication Citation for published
More informationUvA-DARE (Digital Academic Repository)
UvA-DARE (Digital Academic Repository) Automatic segmentation of the striatum and globus pallidus using MIST: Multimodal Image Segmentation Tool Visser, E.; Keuken, M.C.; Douaud, G.; Gaura, V.; Bachoud-Levi,
More informationCitation for published version (APA): Weber, B. A. (2017). Sliding friction: From microscopic contacts to Amontons law
UvA-DARE (Digital Academic Repository) Sliding friction Weber, B.A. Link to publication Citation for published version (APA): Weber, B. A. (2017). Sliding friction: From microscopic contacts to Amontons
More informationUvA-DARE (Digital Academic Repository) Phenotypic variation in plants Lauss, K. Link to publication
UvA-DARE (Digital Academic Repository) Phenotypic variation in plants Lauss, K. Link to publication Citation for published version (APA): Lauss, K. (2017). Phenotypic variation in plants: Roles for epigenetics
More informationUvA-DARE (Digital Academic Repository) The syntax of relativization de Vries, M. Link to publication
UvA-DARE (Digital Academic Repository) The syntax of relativization de Vries, M. Link to publication Citation for published version (APA): de Vries, M. (2002). The syntax of relativization Utrecht: LOT
More informationCitation for published version (APA): Hin, V. (2017). Ontogenesis: Eco-evolutionary perspective on life history complexity.
UvA-DARE (Digital Academic Repository) Ontogenesis Hin, V. Link to publication Citation for published version (APA): Hin, V. (2017). Ontogenesis: Eco-evolutionary perspective on life history complexity.
More informationCoherent X-ray scattering of charge order dynamics and phase separation in titanates Shi, B.
UvA-DARE (Digital Academic Repository) Coherent X-ray scattering of charge order dynamics and phase separation in titanates Shi, B. Link to publication Citation for published version (APA): Shi, B. (2017).
More informationPhysiological and genetic studies towards biofuel production in cyanobacteria Schuurmans, R.M.
UvA-DARE (Digital Academic Repository) Physiological and genetic studies towards biofuel production in cyanobacteria Schuurmans, R.M. Link to publication Citation for published version (APA): Schuurmans,
More informationUvA-DARE (Digital Academic Repository) Electrokinetics in porous media Luong, D.T. Link to publication
UvA-DARE (Digital Academic Repository) Electrokinetics in porous media Luong, D.T. Link to publication Citation for published version (APA): Luong, D. T. (2014). Electrokinetics in porous media General
More informationMonitoring and modelling hydrological fluxes in support of nutrient cycling studies in Amazonian rain forest ecosystems Tobon-Marin, C.
UvA-DARE (Digital Academic Repository) Monitoring and modelling hydrological fluxes in support of nutrient cycling studies in Amazonian rain forest ecosystems Tobon-Marin, C. Link to publication Citation
More informationCombining radar systems to get a 3D - picture of the bird migration Liechti, F.; Dokter, A.; Shamoun-Baranes, J.Z.; van Gasteren, J.R.; Holleman, I.
UvA-DARE (Digital Academic Repository) Combining radar systems to get a 3D - picture of the bird migration Liechti, F.; Dokter, A.; Shamoun-Baranes, J.Z.; van Gasteren, J.R.; Holleman, I. Published in:
More informationCHAPTER 2: CONVEX SETS AND CONCAVE FUNCTIONS. W. Erwin Diewert January 31, 2008.
1 ECONOMICS 594: LECTURE NOTES CHAPTER 2: CONVEX SETS AND CONCAVE FUNCTIONS W. Erwin Diewert January 31, 2008. 1. Introduction Many economic problems have the following structure: (i) a linear function
More informationUvA-DARE (Digital Academic Repository) Matrix perturbations: bounding and computing eigenvalues Reis da Silva, R.J. Link to publication
UvA-DARE (Digital Academic Repository) Matrix perturbations: bounding and computing eigenvalues Reis da Silva, R.J. Link to publication Citation for published version (APA): Reis da Silva, R. J. (2011).
More informationLattices and Hermite normal form
Integer Points in Polyhedra Lattices and Hermite normal form Gennady Shmonin February 17, 2009 1 Lattices Let B = { } b 1,b 2,...,b k be a set of linearly independent vectors in n-dimensional Euclidean
More informationSTRUCTURE THEORY OF UNIMODULAR LATTICES
STRUCTURE THEORY OF UNIMODULAR LATTICES TONY FENG 1 Unimodular Lattices 11 Definitions Let E be a lattice, by which we mean a free abelian group equipped with a symmetric bilinear form, : E E Z Definition
More informationB. Appendix B. Topological vector spaces
B.1 B. Appendix B. Topological vector spaces B.1. Fréchet spaces. In this appendix we go through the definition of Fréchet spaces and their inductive limits, such as they are used for definitions of function
More informationElementary 2-Group Character Codes. Abstract. In this correspondence we describe a class of codes over GF (q),
Elementary 2-Group Character Codes Cunsheng Ding 1, David Kohel 2, and San Ling Abstract In this correspondence we describe a class of codes over GF (q), where q is a power of an odd prime. These codes
More informationSupport weight enumerators and coset weight distributions of isodual codes
Support weight enumerators and coset weight distributions of isodual codes Olgica Milenkovic Department of Electrical and Computer Engineering University of Colorado, Boulder March 31, 2003 Abstract In
More information1: Introduction to Lattices
CSE 206A: Lattice Algorithms and Applications Winter 2012 Instructor: Daniele Micciancio 1: Introduction to Lattices UCSD CSE Lattices are regular arrangements of points in Euclidean space. The simplest
More information1 Directional Derivatives and Differentiability
Wednesday, January 18, 2012 1 Directional Derivatives and Differentiability Let E R N, let f : E R and let x 0 E. Given a direction v R N, let L be the line through x 0 in the direction v, that is, L :=
More informationChapter 2. Error Correcting Codes. 2.1 Basic Notions
Chapter 2 Error Correcting Codes The identification number schemes we discussed in the previous chapter give us the ability to determine if an error has been made in recording or transmitting information.
More informationOptimization and approximation on systems of geometric objects van Leeuwen, E.J.
UvA-DARE (Digital Academic Repository) Optimization and approximation on systems of geometric objects van Leeuwen, E.J. Link to publication Citation for published version (APA): van Leeuwen, E. J. (2009).
More informationCitation for published version (APA): Ochea, M. I. (2010). Essays on nonlinear evolutionary game dynamics Amsterdam: Thela Thesis
UvA-DARE (Digital Academic Repository) Essays on nonlinear evolutionary game dynamics Ochea, M.I. Link to publication Citation for published version (APA): Ochea, M. I. (200). Essays on nonlinear evolutionary
More informationI ƒii - [ Jj ƒ(*) \'dzj'.
I93 2 -] COMPACTNESS OF THE SPACE L p 79 ON THE COMPACTNESS OF THE SPACE L p BY J. D. TAMARKIN* 1. Introduction, Let R n be the ^-dimensional euclidean space and L p (p>l) the function-space consisting
More informationCitation for published version (APA): Adhyaksa, G. W. P. (2018). Understanding losses in halide perovskite thin films
UvA-DARE (Digital Academic Repository) Understanding losses in halide perovskite thin films Adhyaksa, G.W.P. Link to publication Citation for published version (APA): Adhyaksa, G. W. P. (2018). Understanding
More informationCitation for published version (APA): Jak, S. (2013). Cluster bias: Testing measurement invariance in multilevel data
UvA-DARE (Digital Academic Repository) Cluster bias: Testing measurement invariance in multilevel data Jak, S. Link to publication Citation for published version (APA): Jak, S. (2013). Cluster bias: Testing
More informationIntroduction to Real Analysis Alternative Chapter 1
Christopher Heil Introduction to Real Analysis Alternative Chapter 1 A Primer on Norms and Banach Spaces Last Updated: March 10, 2018 c 2018 by Christopher Heil Chapter 1 A Primer on Norms and Banach Spaces
More informationStanford Mathematics Department Math 205A Lecture Supplement #4 Borel Regular & Radon Measures
2 1 Borel Regular Measures We now state and prove an important regularity property of Borel regular outer measures: Stanford Mathematics Department Math 205A Lecture Supplement #4 Borel Regular & Radon
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationMath 429/581 (Advanced) Group Theory. Summary of Definitions, Examples, and Theorems by Stefan Gille
Math 429/581 (Advanced) Group Theory Summary of Definitions, Examples, and Theorems by Stefan Gille 1 2 0. Group Operations 0.1. Definition. Let G be a group and X a set. A (left) operation of G on X is
More informationVector spaces. EE 387, Notes 8, Handout #12
Vector spaces EE 387, Notes 8, Handout #12 A vector space V of vectors over a field F of scalars is a set with a binary operator + on V and a scalar-vector product satisfying these axioms: 1. (V, +) is
More informationMeasurable functions are approximately nice, even if look terrible.
Tel Aviv University, 2015 Functions of real variables 74 7 Approximation 7a A terrible integrable function........... 74 7b Approximation of sets................ 76 7c Approximation of functions............
More informationTHE INVERSE FUNCTION THEOREM
THE INVERSE FUNCTION THEOREM W. PATRICK HOOPER The implicit function theorem is the following result: Theorem 1. Let f be a C 1 function from a neighborhood of a point a R n into R n. Suppose A = Df(a)
More informationGeometric approximation of curves and singularities of secant maps Ghosh, Sunayana
University of Groningen Geometric approximation of curves and singularities of secant maps Ghosh, Sunayana IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF) if you wish
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 informationEE512: Error Control Coding
EE51: Error Control Coding Solution for Assignment on BCH and RS Codes March, 007 1. To determine the dimension and generator polynomial of all narrow sense binary BCH codes of length n = 31, we have to
More information4.2. ORTHOGONALITY 161
4.2. ORTHOGONALITY 161 Definition 4.2.9 An affine space (E, E ) is a Euclidean affine space iff its underlying vector space E is a Euclidean vector space. Given any two points a, b E, we define the distance
More information212a1214Daniell s integration theory.
212a1214 Daniell s integration theory. October 30, 2014 Daniell s idea was to take the axiomatic properties of the integral as the starting point and develop integration for broader and broader classes
More information(x, y) = d(x, y) = x y.
1 Euclidean geometry 1.1 Euclidean space Our story begins with a geometry which will be familiar to all readers, namely the geometry of Euclidean space. In this first chapter we study the Euclidean distance
More informationClimate change and topography as drivers of Latin American biome dynamics Flantua, S.G.A.
UvA-DARE (Digital Academic Repository) Climate change and topography as drivers of Latin American biome dynamics Flantua, S.G.A. Link to publication Citation for published version (APA): Flantua, S. G.
More informationSystem-theoretic properties of port-controlled Hamiltonian systems Maschke, B.M.; van der Schaft, Arjan
University of Groningen System-theoretic properties of port-controlled Hamiltonian systems Maschke, B.M.; van der Schaft, Arjan Published in: Proceedings of the Eleventh International Symposium on Mathematical
More informationMATH JORDAN FORM
MATH 53 JORDAN FORM Let A,, A k be square matrices of size n,, n k, respectively with entries in a field F We define the matrix A A k of size n = n + + n k as the block matrix A 0 0 0 0 A 0 0 0 0 A k It
More informationCSE 206A: Lattice Algorithms and Applications Winter The dual lattice. Instructor: Daniele Micciancio
CSE 206A: Lattice Algorithms and Applications Winter 2016 The dual lattice Instructor: Daniele Micciancio UCSD CSE 1 Dual Lattice and Dual Basis Definition 1 The dual of a lattice Λ is the set ˆΛ of all
More informationCHAPTER 6. Representations of compact groups
CHAPTER 6 Representations of compact groups Throughout this chapter, denotes a compact group. 6.1. Examples of compact groups A standard theorem in elementary analysis says that a subset of C m (m a positive
More informationCourse Summary Math 211
Course Summary Math 211 table of contents I. Functions of several variables. II. R n. III. Derivatives. IV. Taylor s Theorem. V. Differential Geometry. VI. Applications. 1. Best affine approximations.
More informationARCS IN FINITE PROJECTIVE SPACES. Basic objects and definitions
ARCS IN FINITE PROJECTIVE SPACES SIMEON BALL Abstract. These notes are an outline of a course on arcs given at the Finite Geometry Summer School, University of Sussex, June 26-30, 2017. Let K denote an
More informationAn exponential separation between quantum and classical one-way communication complexity
An exponential separation between quantum and classical one-way communication complexity Ashley Montanaro Centre for Quantum Information and Foundations, Department of Applied Mathematics and Theoretical
More information6 The Fourier transform
6 The Fourier transform In this presentation we assume that the reader is already familiar with the Fourier transform. This means that we will not make a complete overview of its properties and applications.
More informationOrthogonal Arrays & Codes
Orthogonal Arrays & Codes Orthogonal Arrays - Redux An orthogonal array of strength t, a t-(v,k,λ)-oa, is a λv t x k array of v symbols, such that in any t columns of the array every one of the possible
More informationTactical Decompositions of Steiner Systems and Orbits of Projective Groups
Journal of Algebraic Combinatorics 12 (2000), 123 130 c 2000 Kluwer Academic Publishers. Manufactured in The Netherlands. Tactical Decompositions of Steiner Systems and Orbits of Projective Groups KELDON
More informationCitation for published version (APA): Halbersma, R. S. (2002). Geometry of strings and branes. Groningen: s.n.
University of Groningen Geometry of strings and branes Halbersma, Reinder Simon IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF) if you wish to cite from it. Please
More informationMATH32031: Coding Theory Part 15: Summary
MATH32031: Coding Theory Part 15: Summary 1 The initial problem The main goal of coding theory is to develop techniques which permit the detection of errors in the transmission of information and, if necessary,
More informationMeasuring more or less: Estimating product period penetrations from incomplete panel data Hoogendoorn, A.W.
UvA-DARE (Digital Academic Repository) Measuring more or less: Estimating product period penetrations from incomplete panel data Hoogendoorn, A.W. Link to publication Citation for published version (APA):
More information1 Differentiable manifolds and smooth maps. (Solutions)
1 Differentiable manifolds and smooth maps Solutions Last updated: March 17 2011 Problem 1 The state of the planar pendulum is entirely defined by the position of its moving end in the plane R 2 Since
More information6 Orthogonal groups. O 2m 1 q. q 2i 1 q 2i. 1 i 1. 1 q 2i 2. O 2m q. q m m 1. 1 q 2i 1 i 1. 1 q 2i. i 1. 2 q 1 q i 1 q i 1. m 1.
6 Orthogonal groups We now turn to the orthogonal groups. These are more difficult, for two related reasons. First, it is not always true that the group of isometries with determinant 1 is equal to its
More informationReview of Linear Algebra
Review of Linear Algebra Throughout these notes, F denotes a field (often called the scalars in this context). 1 Definition of a vector space Definition 1.1. A F -vector space or simply a vector space
More informationMINIMAL GENERATING SETS OF GROUPS, RINGS, AND FIELDS
MINIMAL GENERATING SETS OF GROUPS, RINGS, AND FIELDS LORENZ HALBEISEN, MARTIN HAMILTON, AND PAVEL RŮŽIČKA Abstract. A subset X of a group (or a ring, or a field) is called generating, if the smallest subgroup
More informationOpen Questions in Coding Theory
Open Questions in Coding Theory Steven T. Dougherty July 4, 2013 Open Questions The following questions were posed by: S.T. Dougherty J.L. Kim P. Solé J. Wood Hilbert Style Problems Hilbert Style Problems
More informationOctober 25, 2013 INNER PRODUCT SPACES
October 25, 2013 INNER PRODUCT SPACES RODICA D. COSTIN Contents 1. Inner product 2 1.1. Inner product 2 1.2. Inner product spaces 4 2. Orthogonal bases 5 2.1. Existence of an orthogonal basis 7 2.2. Orthogonal
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 informationMarkov Chains and Stochastic Sampling
Part I Markov Chains and Stochastic Sampling 1 Markov Chains and Random Walks on Graphs 1.1 Structure of Finite Markov Chains We shall only consider Markov chains with a finite, but usually very large,
More informationLocally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem
56 Chapter 7 Locally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem Recall that C(X) is not a normed linear space when X is not compact. On the other hand we could use semi
More informationLecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University
Lecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University February 7, 2007 2 Contents 1 Metric Spaces 1 1.1 Basic definitions...........................
More information1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer 11(2) (1989),
Real Analysis 2, Math 651, Spring 2005 April 26, 2005 1 Real Analysis 2, Math 651, Spring 2005 Krzysztof Chris Ciesielski 1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer
More informationMultivariate Differentiation 1
John Nachbar Washington University February 23, 2017 1 Preliminaries. Multivariate Differentiation 1 I assume that you are already familiar with standard concepts and results from univariate calculus;
More informationLecture 5: CVP and Babai s Algorithm
NYU, Fall 2016 Lattices Mini Course Lecture 5: CVP and Babai s Algorithm Lecturer: Noah Stephens-Davidowitz 51 The Closest Vector Problem 511 Inhomogeneous linear equations Recall that, in our first lecture,
More informationCitation for published version (APA): Nguyen, X. C. (2017). Different nanocrystal systems for carrier multiplication
UvA-DARE (Digital Academic Repository) Different nanocrystal systems for carrier multiplication Nguyen, X.C. Link to publication Citation for published version (APA): Nguyen, X. C. (2017). Different nanocrystal
More informationMATH 326: RINGS AND MODULES STEFAN GILLE
MATH 326: RINGS AND MODULES STEFAN GILLE 1 2 STEFAN GILLE 1. Rings We recall first the definition of a group. 1.1. Definition. Let G be a non empty set. The set G is called a group if there is a map called
More information1 Differentiable manifolds and smooth maps. (Solutions)
1 Differentiable manifolds and smooth maps Solutions Last updated: February 16 2012 Problem 1 a The projection maps a point P x y S 1 to the point P u 0 R 2 the intersection of the line NP with the x-axis
More informationA GUIDE FOR MORTALS TO TAME CONGRUENCE THEORY
A GUIDE FOR MORTALS TO TAME CONGRUENCE THEORY Tame congruence theory is not an easy subject and it takes a considerable amount of effort to understand it. When I started this project, I believed that this
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 informationa 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 11 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,, a n, b are given real
More informationSection 3 Error Correcting Codes (ECC): Fundamentals
Section 3 Error Correcting Codes (ECC): Fundamentals Communication systems and channel models Definition and examples of ECCs Distance For the contents relevant to distance, Lin & Xing s book, Chapter
More informationAn impossibility theorem concerning multilateral international comparison of volumes van Veelen, C.M.
UvA-DARE (Digital Academic Repository) An impossibility theorem concerning multilateral international comparison of volumes van Veelen, C.M. Published in: Econometrica DOI: 10.1111/1468-0262.00280 Link
More informationwhere m is the maximal ideal of O X,p. Note that m/m 2 is a vector space. Suppose that we are given a morphism
8. Smoothness and the Zariski tangent space We want to give an algebraic notion of the tangent space. In differential geometry, tangent vectors are equivalence classes of maps of intervals in R into the
More informationLove and fear of water: Water dynamics around charged and apolar solutes van der Post, S.T.
UvA-DARE (Digital Academic Repository) Love and fear of water: Water dynamics around charged and apolar solutes van der Post, S.T. Link to publication Citation for published version (APA): van der Post,
More informationIntro to harmonic analysis on groups Risi Kondor
Risi Kondor Any (sufficiently smooth) function f on the unit circle (equivalently, any 2π periodic f ) can be decomposed into a sum of sinusoidal waves f(x) = k= c n e ikx c n = 1 2π f(x) e ikx dx 2π 0
More informationFinite-Dimensional Cones 1
John Nachbar Washington University March 28, 2018 1 Basic Definitions. Finite-Dimensional Cones 1 Definition 1. A set A R N is a cone iff it is not empty and for any a A and any γ 0, γa A. Definition 2.
More informationA connection between number theory and linear algebra
A connection between number theory and linear algebra Mark Steinberger Contents 1. Some basics 1 2. Rational canonical form 2 3. Prime factorization in F[x] 4 4. Units and order 5 5. Finite fields 7 6.
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 informationSome notes on Coxeter groups
Some notes on Coxeter groups Brooks Roberts November 28, 2017 CONTENTS 1 Contents 1 Sources 2 2 Reflections 3 3 The orthogonal group 7 4 Finite subgroups in two dimensions 9 5 Finite subgroups in three
More informationMath 121 Homework 5: Notes on Selected Problems
Math 121 Homework 5: Notes on Selected Problems 12.1.2. Let M be a module over the integral domain R. (a) Assume that M has rank n and that x 1,..., x n is any maximal set of linearly independent elements
More informationThe cocycle lattice of binary matroids
Published in: Europ. J. Comb. 14 (1993), 241 250. The cocycle lattice of binary matroids László Lovász Eötvös University, Budapest, Hungary, H-1088 Princeton University, Princeton, NJ 08544 Ákos Seress*
More informationTopological vectorspaces
(July 25, 2011) Topological vectorspaces Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ Natural non-fréchet spaces Topological vector spaces Quotients and linear maps More topological
More informationfor all subintervals I J. If the same is true for the dyadic subintervals I D J only, we will write ϕ BMO d (J). In fact, the following is true
3 ohn Nirenberg inequality, Part I A function ϕ L () belongs to the space BMO() if sup ϕ(s) ϕ I I I < for all subintervals I If the same is true for the dyadic subintervals I D only, we will write ϕ BMO
More informationMath 676. A compactness theorem for the idele group. and by the product formula it lies in the kernel (A K )1 of the continuous idelic norm
Math 676. A compactness theorem for the idele group 1. Introduction Let K be a global field, so K is naturally a discrete subgroup of the idele group A K and by the product formula it lies in the kernel
More information(VII.B) Bilinear Forms
(VII.B) Bilinear Forms There are two standard generalizations of the dot product on R n to arbitrary vector spaces. The idea is to have a product that takes two vectors to a scalar. Bilinear forms are
More informationLecture 5. Ch. 5, Norms for vectors and matrices. Norms for vectors and matrices Why?
KTH ROYAL INSTITUTE OF TECHNOLOGY Norms for vectors and matrices Why? Lecture 5 Ch. 5, Norms for vectors and matrices Emil Björnson/Magnus Jansson/Mats Bengtsson April 27, 2016 Problem: Measure size of
More informationSome Open Problems on Quasi-Twisted and Related Code Constructions and Good Quaternary Codes
Some Open Problems on Quasi-Twisted and Related Code Constructions and Good Quaternary Codes Nuh Aydin and Tsvetan Asamov Department of Mathematics Kenyon College Gambier, OH 43022 {aydinn,asamovt}@kenyon.edu
More information