DOCSLIB.ORG

Automatic and Q-Multiplicative Sequences Through the Lens of Higher Order Fourier Analysis

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Automatic and Q-Multiplicative Sequences Through the Lens of Higher Order Fourier Analysis Automatic and q-multiplicative sequences through the lens of Higher order Fourier analysis Jakub Konieczny Hebrew University of Jerusalem Jagiellonian University 6th International Conference on Uniform Distribution Theory CIRM, 1 – 5 October 2018 The Thue–Morse sequence (discovered by Prouhet) can be seen in many ways: 1 Explicit formula: ( +1 if n is evil (i.e., sum of binary digits is even); t(n) = −1 if n is odious (i.e., sum of binary digits is odd): 2 Recurrence: t(0) = +1; t(2n) = t(n); t(2n + 1) = −t(n): 3 Automatic sequence: 0 0 1 start +1 −1 1 j 4 2-Multiplicative sequence: t(2 ) = −1 for all j, and t(n + m) = t(n)t(m) if digits of n and m do not overlap, i.e., 2i j n and m < 2i for some i. Thue–Morse(–Prouhet) sequence t: N ! f+1; −1g +−−+−++−−++−+−−+−++−+−−++−−+−++− ::: 2 / 22 1 Explicit formula: ( +1 if n is evil (i.e., sum of binary digits is even); t(n) = −1 if n is odious (i.e., sum of binary digits is odd): 2 Recurrence: t(0) = +1; t(2n) = t(n); t(2n + 1) = −t(n): 3 Automatic sequence: 0 0 1 start +1 −1 1 j 4 2-Multiplicative sequence: t(2 ) = −1 for all j, and t(n + m) = t(n)t(m) if digits of n and m do not overlap, i.e., 2i j n and m < 2i for some i. Thue–Morse(–Prouhet) sequence t: N ! f+1; −1g +−−+−++−−++−+−−+−++−+−−++−−+−++− ::: The Thue–Morse sequence (discovered by Prouhet) can be seen in many ways: 2 / 22 2 Recurrence: t(0) = +1; t(2n) = t(n); t(2n + 1) = −t(n): 3 Automatic sequence: 0 0 1 start +1 −1 1 j 4 2-Multiplicative sequence: t(2 ) = −1 for all j, and t(n + m) = t(n)t(m) if digits of n and m do not overlap, i.e., 2i j n and m < 2i for some i. Thue–Morse(–Prouhet) sequence t: N ! f+1; −1g +−−+−++−−++−+−−+−++−+−−++−−+−++− ::: The Thue–Morse sequence (discovered by Prouhet) can be seen in many ways: 1 Explicit formula: ( +1 if n is evil (i.e., sum of binary digits is even); t(n) = −1 if n is odious (i.e., sum of binary digits is odd): 2 / 22 3 Automatic sequence: 0 0 1 start +1 −1 1 j 4 2-Multiplicative sequence: t(2 ) = −1 for all j, and t(n + m) = t(n)t(m) if digits of n and m do not overlap, i.e., 2i j n and m < 2i for some i. Thue–Morse(–Prouhet) sequence t: N ! f+1; −1g +−−+−++−−++−+−−+−++−+−−++−−+−++− ::: The Thue–Morse sequence (discovered by Prouhet) can be seen in many ways: 1 Explicit formula: ( +1 if n is evil (i.e., sum of binary digits is even); t(n) = −1 if n is odious (i.e., sum of binary digits is odd): 2 Recurrence: t(0) = +1; t(2n) = t(n); t(2n + 1) = −t(n): 2 / 22 j 4 2-Multiplicative sequence: t(2 ) = −1 for all j, and t(n + m) = t(n)t(m) if digits of n and m do not overlap, i.e., 2i j n and m < 2i for some i. Thue–Morse(–Prouhet) sequence t: N ! f+1; −1g +−−+−++−−++−+−−+−++−+−−++−−+−++− ::: The Thue–Morse sequence (discovered by Prouhet) can be seen in many ways: 1 Explicit formula: ( +1 if n is evil (i.e., sum of binary digits is even); t(n) = −1 if n is odious (i.e., sum of binary digits is odd): 2 Recurrence: t(0) = +1; t(2n) = t(n); t(2n + 1) = −t(n): 3 Automatic sequence: 0 0 1 start +1 −1 1 2 / 22 Thue–Morse(–Prouhet) sequence t: N ! f+1; −1g +−−+−++−−++−+−−+−++−+−−++−−+−++− ::: The Thue–Morse sequence (discovered by Prouhet) can be seen in many ways: 1 Explicit formula: ( +1 if n is evil (i.e., sum of binary digits is even); t(n) = −1 if n is odious (i.e., sum of binary digits is odd): 2 Recurrence: t(0) = +1; t(2n) = t(n); t(2n + 1) = −t(n): 3 Automatic sequence: 0 0 1 start +1 −1 1 j 4 2-Multiplicative sequence: t(2 ) = −1 for all j, and t(n + m) = t(n)t(m) if digits of n and m do not overlap, i.e., 2i j n and m < 2i for some i. 2 / 22 No! At least in some ways. l 1 Linear subword complexity: # w 2 f+1; −1g : w appears in t = O(l). 2 # fn < N : t(n) = t(n + 1)g ' N=3 6= N=2. −! t(n) = t(n + 1) iff 2 - ν2(n + 1) 3 # fn < N : t(n) = t(n + 1) = t(n + 2)g = 0. −! in general: t is cube-free But in other ways: Yes! N−1 1 X 1 t(n) = O(1=N) (not very hard). −! is shorthand for E E N n<N n<N n=0 −c 2 t(an + b) = O(N ) with c > 0. −! Gelfond (1968) n<NE −c 3 sup t(n)e(nα) = O(N ) with c > 0. −! shorthand: e(θ) = e2πiθ α2R n<NE Uniformity of Thue–Morse (1/3) Question (Mauduit & Sarközy (1998)) Is the Thue–Morse sequence uniform/pseudorandom in some meaningful sense? 3 / 22 But in other ways: Yes! N−1 1 X 1 t(n) = O(1=N) (not very hard). −! is shorthand for E E N n<N n<N n=0 −c 2 t(an + b) = O(N ) with c > 0. −! Gelfond (1968) n<NE −c 3 sup t(n)e(nα) = O(N ) with c > 0. −! shorthand: e(θ) = e2πiθ α2R n<NE Uniformity of Thue–Morse (1/3) Question (Mauduit & Sarközy (1998)) Is the Thue–Morse sequence uniform/pseudorandom in some meaningful sense? No! At least in some ways. l 1 Linear subword complexity: # w 2 f+1; −1g : w appears in t = O(l). 2 # fn < N : t(n) = t(n + 1)g ' N=3 6= N=2. −! t(n) = t(n + 1) iff 2 - ν2(n + 1) 3 # fn < N : t(n) = t(n + 1) = t(n + 2)g = 0. −! in general: t is cube-free 3 / 22 −c 2 t(an + b) = O(N ) with c > 0. −! Gelfond (1968) n<NE −c 3 sup t(n)e(nα) = O(N ) with c > 0. −! shorthand: e(θ) = e2πiθ α2R n<NE Uniformity of Thue–Morse (1/3) Question (Mauduit & Sarközy (1998)) Is the Thue–Morse sequence uniform/pseudorandom in some meaningful sense? No! At least in some ways. l 1 Linear subword complexity: # w 2 f+1; −1g : w appears in t = O(l). 2 # fn < N : t(n) = t(n + 1)g ' N=3 6= N=2. −! t(n) = t(n + 1) iff 2 - ν2(n + 1) 3 # fn < N : t(n) = t(n + 1) = t(n + 2)g = 0. −! in general: t is cube-free But in other ways: Yes! N−1 1 X 1 t(n) = O(1=N) (not very hard). −! is shorthand for E E N n<N n<N n=0 3 / 22 −c 3 sup t(n)e(nα) = O(N ) with c > 0. −! shorthand: e(θ) = e2πiθ α2R n<NE Uniformity of Thue–Morse (1/3) Question (Mauduit & Sarközy (1998)) Is the Thue–Morse sequence uniform/pseudorandom in some meaningful sense? No! At least in some ways. l 1 Linear subword complexity: # w 2 f+1; −1g : w appears in t = O(l). 2 # fn < N : t(n) = t(n + 1)g ' N=3 6= N=2. −! t(n) = t(n + 1) iff 2 - ν2(n + 1) 3 # fn < N : t(n) = t(n + 1) = t(n + 2)g = 0. −! in general: t is cube-free But in other ways: Yes! N−1 1 X 1 t(n) = O(1=N) (not very hard). −! is shorthand for E E N n<N n<N n=0 −c 2 t(an + b) = O(N ) with c > 0. −! Gelfond (1968) n<NE 3 / 22 Uniformity of Thue–Morse (1/3) Question (Mauduit & Sarközy (1998)) Is the Thue–Morse sequence uniform/pseudorandom in some meaningful sense? No! At least in some ways. l 1 Linear subword complexity: # w 2 f+1; −1g : w appears in t = O(l). 2 # fn < N : t(n) = t(n + 1)g ' N=3 6= N=2. −! t(n) = t(n + 1) iff 2 - ν2(n + 1) 3 # fn < N : t(n) = t(n + 1) = t(n + 2)g = 0. −! in general: t is cube-free But in other ways: Yes! N−1 1 X 1 t(n) = O(1=N) (not very hard). −! is shorthand for E E N n<N n<N n=0 −c 2 t(an + b) = O(N ) with c > 0. −! Gelfond (1968) n<NE −c 3 sup t(n)e(nα) = O(N ) with c > 0. −! shorthand: e(θ) = e2πiθ α2R n<NE 3 / 22 2 If p(x) 2 R[x]; p(N) ⊂ N, then t does not correlate with the values of p: 1 # fn < N : t(p(n)) = +1g = N + O(N 1−c): 2 Proved by Mauduit & Rivat (2009) for p(n) = n2 (already known for deg p = 1). Improved by Drmota, Mauduit & Rivat (2013): t(n2) is strongly normal, i.e., 1 # n < N : t((n + i)2) = for 0 ≤ i < k = N + O(N 1−c) i 2k for any k 2 N and any i 2 f+1; −1g for 0 ≤ i < k. For deg p ≥ 3 — open problem! Uniformity of Thue–Morse (2/3) Gelfond problems 1 Thue-Morse does not correlate with the primes: 1 # fn < N : n is prime; t(n) = +1g = π(N) + O(N 1−c): 2 −! π(N) = # primes ≤ N; Prime Number Theorem: π(N) ∼ N= log N Proved by Mauduit & Rivat (2010).
Load more

Recommended publications
  • Generalized Rudin–Shapiro Sequences
    ACTA ARITHMETICA LX.1 (1991) Generalized Rudin–Shapiro sequences by Jean-Paul Allouche (Talence) and Pierre Liardet* (Marseille) 1. Introduction 1.1. The Rudin–Shapiro sequence was introduced independently by these two authors ([21] and [24]) and can be defined by u(n) εn = (−1) , where u(n) counts the number of 11’s in the binary expansion of the integer n (see [5]). This sequence has the following property: X 2iπnθ 1/2 (1) ∀ N ≥ 0, sup εne ≤ CN , θ∈R n<N where one can take C = 2 + 21/2 (see [22] for improvements of this value). The order of magnitude of the left hand term in (1), as N goes to infin- 1/2 ity, is exactly N ; indeed, for each sequence (an) with values ±1 one has 1/2 X 2iπn(·) X 2iπn(·) N = ane ≤ ane , 2 ∞ n<N n<N where k k2 denotes the quadratic norm and k k∞ the supremum norm. Note that for almost every√ sequence (an) of ±1’s the supremum norm of the above sum is bounded by N Log N (see [23]). The inequality (1) has been generalized in [2] (see also [3]): X 2iπxu(n) 0 α(x) (2) sup f(n)e ≤ C N , f∈M2 n<N where M2 is the set of 2-multiplicative sequences with modulus 1. The * Research partially supported by the D.R.E.T. under contract 901636/A000/DRET/ DS/SR 2 J.-P. Allouche and P. Liardet exponent α(x) is explicitly given and satisfies ∀ x 1/2 ≤ α(x) ≤ 1 , ∀ x 6∈ Z α(x) < 1 , ∀ x ∈ Z + 1/2 α(x) = 1/2 .
    [Show full text]
  • Fibonacci, Kronecker and Hilbert NKS 2007
    Fibonacci, Kronecker and Hilbert NKS 2007 Klaus Sutner Carnegie Mellon University www.cs.cmu.edu/∼sutner NKS’07 1 Overview • Fibonacci, Kronecker and Hilbert ??? • Logic and Decidability • Additive Cellular Automata • A Knuth Question • Some Questions NKS’07 2 Hilbert NKS’07 3 Entscheidungsproblem The Entscheidungsproblem is solved when one knows a procedure by which one can decide in a finite number of operations whether a given logical expression is generally valid or is satisfiable. The solution of the Entscheidungsproblem is of fundamental importance for the theory of all fields, the theorems of which are at all capable of logical development from finitely many axioms. D. Hilbert, W. Ackermann Grundzuge¨ der theoretischen Logik, 1928 NKS’07 4 Model Checking The Entscheidungsproblem for the 21. Century. Shift to computer science, even commercial applications. Fix some suitable logic L and collection of structures A. Find efficient algorithms to determine A |= ϕ for any structure A ∈ A and sentence ϕ in L. Variants: fix ϕ, fix A. NKS’07 5 CA as Structures Discrete dynamical systems, minimalist description: Aρ = hC, i where C ⊆ ΣZ is the space of configurations of the system and is the “next configuration” relation induced by the local map ρ. Use standard first order logic (either relational or functional) to describe properties of the system. NKS’07 6 Some Formulae ∀ x ∃ y (y x) ∀ x, y, z (x z ∧ y z ⇒ x = y) ∀ x ∃ y, z (y x ∧ z x ∧ ∀ u (u x ⇒ u = y ∨ u = z)) There is no computability requirement for configurations, in x y both x and y may be complicated.
    [Show full text]
  • Formal Groups, Witt Vectors and Free Probability
    Formal Groups, Witt vectors and Free Probability Roland Friedrich and John McKay December 6, 2019 Abstract We establish a link between free probability theory and Witt vectors, via the theory of formal groups. We derive an exponential isomorphism which expresses Voiculescu's free multiplicative convolution as a function of the free additive convolution . Subsequently we continue our previous discussion of the relation between complex cobordism and free probability. We show that the generic nth free cumulant corresponds to the cobordism class of the (n 1)-dimensional complex projective space. This permits us to relate several probability distributions− from random matrix theory to known genera, and to build a dictionary. Finally, we discuss aspects of free probability and the asymptotic representation theory of the symmetric group from a conformal field theoretic perspective and show that every distribution with mean zero is embeddable into the Universal Grassmannian of Sato-Segal-Wilson. MSC 2010: 46L54, 55N22, 57R77, Keywords: Free probability and free operator algebras, formal group laws, Witt vectors, complex cobordism (U- and SU-cobordism), non-crossing partitions, conformal field theory. Contents 1 Introduction 2 2 Free probability and formal group laws4 2.1 Generalised free probability . .4 arXiv:1204.6522v3 [math.OA] 5 Dec 2019 2.2 The Lie group Aut( )....................................5 O 2.3 Formal group laws . .6 2.4 The R- and S-transform . .7 2.5 Free cumulants . 11 3 Witt vectors and Hopf algebras 12 3.1 The affine group schemes . 12 3.2 Witt vectors, λ-rings and necklace algebras . 15 3.3 The induced ring structure .
    [Show full text]
  • The Hirzebruch Genera of Complete Intersections 3
    THE HIRZEBRUCH GENERA OF COMPLETE INTERSECTIONS JIANBO WANG, ZHIWANG YU, YUYU WANG Abstract. Following Brooks’s calculation of the Aˆ-genus of complete intersections, a new and more computable formula about the Aˆ-genus and α-invariant will be described as polynomials of multi-degree and dimension. We also give an iterated formula of Aˆ-genus and the necessary and sufficient conditions for the vanishing of Aˆ-genus of complex even dimensional spin complete intersections. Finally, we obtain a general formula about the Hirzebruch genus of complete intersections, and calculate some classical Hirzebruch genera as examples. 1. Introduction A genus of a multiplicative sequence is a ring homomorphism, from the ring of smooth compact manifolds (up to suitable cobordism) to another ring. A multiplicative se- quence is completely determined by its characteristic power series Q(x). Moreover, ev- ery power series Q(x) determines a multiplicative sequence. Given a power series Q(x), there is an associated Hirzebruch genus, which is also denoted as a ϕQ-genus. For more details, please see Section 2. The focus of this paper is mainly on the description of the Hirzebruch genus of complete intersections with multi-degree and dimension. n+r A complex n-dimensional complete intersection Xn(d1,...,dr) CP is a smooth complex n-dimensional manifold given by a transversal intersection⊂ of r nonsin- gular hypersurfaces in complex projective space. The unordered r-tuple d := (d1,...,dr) is called the multi-degree, which denotes the degrees of the r nonsingular hypersur- faces, and the product d := d1d2 dr is called the total degree.
    [Show full text]
  • Arxiv:1403.5458V2 [Math.NT] 14 Jul 2015 ..Sqecso Nee Ubr 10 11 11 10 Value Their and Functions Zeta Riemann–Hurwitz of Class Coefficients a Integer with Sequences 6
    THE LAZARD FORMAL GROUP, UNIVERSAL CONGRUENCES AND SPECIAL VALUES OF ZETA FUNCTIONS PIERGIULIO TEMPESTA Abstract. A connection between the theory of formal groups and arithmetic number theory is established. In particular, it is shown how to construct general Almkvist–Meurman–type congruences for the uni- versal Bernoulli polynomials that are related with the Lazard universal formal group [31]-[33]. Their role in the theory of L–genera for multi- plicative sequences is illustrated. As an application, sequences of integer numbers are constructed. New congruences are also obtained, useful to compute special values of a new class of Riemann–Hurwitz–type zeta functions. Contents 1. Introduction: Formal group laws 2 2. The Lazard universal formal group, the universal Bernoulli polynomials and numbers 3 3. Generalized Almkvist–Meurman congruences 5 3.1. Some universal congruences 5 3.2. Related results 7 4. The Todd genus, the L- and A-genera and related universal polynomials 8 5. Universal congruences and integer sequences 10 arXiv:1403.5458v2 [math.NT] 14 Jul 2015 5.1. Sequences of integer numbers 10 5.2. Construction of integer sequences 11 5.3. Polynomial sequences with integer coefficients 11 6. A class of Riemann–Hurwitz zeta functions and their values at negative integers 12 6.1. Hurwitz zeta functions and formal group laws 12 6.2. The χ–universal numbers from Dirichlet characters and congruences 13 Appendix 14 References 15 Date: July 7, 2015. 1 2 PIERGIULIO TEMPESTA 1. Introduction: Formal group laws The theory of formal groups [9], [16] has been intensively investigated in the last decades, due to its relevance in many branches of mathematics, especially algebraic topology [10], [7], [25], [15], the theory of elliptic curves [29], and arithmetic number theory [1], [3], [31], [33].
    [Show full text]
  • Lesson D2: Multiplicative Sequences Unit D: Pontryagin Classes Objective
    80-min Lesson Plan Math 533: Fiber bundles and Characteristic classes Spring 2016 Lesson D2: Multiplicative sequences Unit D: Pontryagin classes Objective. At the end of this lesson, students will be able to: • Calculate the genus associated to a formal power series Assignments: • Read { MS section 19. • HW due Tuesday Materials and Equipment needed: • none Introduction. Today, we will associate a multiplicative sequence of polynomials to every formal power series. By evaluating these polynomials on Pontryagin classes and then inte- grating, we associate a rational number to every closed oriented manifold. Outline. introduction: 5 min lecture. Read introduction. Give reading. Relations between characteristic classes: 10 min lecture. ∗ ∗ ∗ ∗ Note: There is a natural map β : H (B; Z) ! H (B; Z2). Given a 2 H (B; Z) and b 2 H (B; Z2), we say that a = b (mod 2) , b = β(a). n Proposition. Given C ! E ! B, e(ER) = cn(E): ∗ 1 2 ∗ 1 Proof. Let H (CP ) = Z[x]=x and H (CP ) = Z[x] Since R e(T P 1) = P dim Hi( P 1) = 2, CP 1 C i C 1 1 we have c1(T CP ) = 2x = e(T CP ). 1 1 2 2 Define f : CP ! CP by f([z0; z1]) = [z0; z1]. ∗ 1 1 ∗ 1 1 ∗ 1 1 Since f (c1(γ1 )) = c1(T CP ), f (γ1 ) ' T CP ; hence f (e(γ1 )) = e(T CP ) = 2x. 1 1 Therefore, e(γ1 ) = x = c1(γ1 ). 1 1 Let ι: CP ! CP be the inclusion. 1 ∗ 1 ∗ 1 1 1 Then e(γ1 ) = e(ι (γ1) = ι (e(γ1)) = x and so e(γ1) = x = c1(γ1).
    [Show full text]
  • Chapter VII Real Singularities with a Milnor Fibration
    Progress in Mathematics Volume 241 Series Editors H. Bass J. Oesterlé A. Weinstein José Seade Andrea Malchiodi On the Topology of Isolated Singularities in Analytic Spaces Birkhäuser Verlag Basel Boston Berlin Author: José Seade Instituto de Matemáticas Unidad Cuernavaca Universidad Nacional Autónoma de México (UNAM) Av. Universidad s/n, col. Lomas de Chamilpa, Ciudad Universitaria C.P. 62210 Cuernavaca, Morelos México e-mail: [email protected] 2000 Mathematics Subject Classifi cation Primary 14Bxx, 32Sxx, 53Cxx, 55A25, 57C45; Secondary 11Fxx, 32L30, 34Mxx, 37F75 A CIP catalogue record for this book is available from the Library of Congress, Washington D.C., USA Bibliographic information published by Die Deutsche Bibliothek Die Deutsche Bibliothek lists this publication in the Deutsche Nationalbibliografi e; detailed bibliographic data is available in the Internet at <http://dnb.ddb.de>. ISBN 3-7643-7322-9 Birkhäuser Verlag, Basel – Boston – Berlin This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifi cally the rights of translation, reprinting, re-use of illustrations, broadcasting, reproduction on microfi lms or in other ways, and storage in data banks. For any kind of use whatsoever, permission from the copyright owner must be obtained. © 2006 Birkhäuser Verlag, P.O. Box 133, CH-4010 Basel, Switzerland Part of Springer Science+Business Media Printed on acid-free paper produced of chlorine-free pulp. TCF ∞ Printed in Germany ISBN-10: 3-7643-7322-9 e-ISBN: 3-7643-7395-4 ISBN-13: 978-3-7643-7322-1 9 8 7 6 5 4 3 2 1 www.birkhauser.ch To Swami Chidvilasananda and the Siddha lineage, whose light turned my life into a joyful path; and to Teresa, whose love is my everything.
    [Show full text]
  • Formal Groups Laws and Genera*
    Bulletin of the Manifold Atlas (2011) Formal groups laws and genera* TARAS PANOV Abstract. The article reviews role of formal group laws in bordism theory. 55N22, 57R77 1. Introduction The theory of formal group laws, which originally appeared in algebraic geometry, was brought into bordism theory in the pioneering work [9]. The applications of formal group laws in algebraic topology are closely connected with Hirzebruch genera [6], which are important invariants of bordism classes of manifolds. 2. Elements of the theory of formal group laws Let R be a commutative ring with unit. A formal power series F (u, v) ∈ R[[u, v]] is called a (commutative one-dimensional) formal group law over R if it satisfies the following equations: (1) F (u, 0) = u, F (0, v) = v; (2) F (F (u, v), w) = F (u, F (v, w)); (3) F (u, v) = F (v, u). The original example of a formal group law over a field k is provided by the expansion near the unit of the multiplication map G × G → G in a one-dimensional algebraic group over k. This also explains the terminology. A formal group law F over R is called linearisable if there exists a coordinate P i change u 7→ gF (u) = u + i>1 giu ∈ R[[u]] such that gF (F (u, v)) = gF (u) + gF (v). Note that every formal group law over R determines a formal group law over R ⊗ Q. Theorem 2.1. Every formal group law F is linearisable over R ⊗ Q. ∂F (u,w) Proof. Consider the series ω(u) = ∂w .
    [Show full text]
  • Notes for Nu Pre-Talbot Seminar 4/18/13
    NOTES FOR NU PRE-TALBOT SEMINAR 4/18/13 BEN KNUDSEN As the last speaker of the seminar, it falls to me to say something about topolog- ical modular forms. My approach will be contextual; we will try to learn something about tmf by examining the shape of the hole into which it should fit. 1. Genus, Index, and Orientation 1.1. An orientability problem. Question. Which vector bundles π : V ! X are orientable for real K-theory? One approach to this problem is through the Atiyah-Hirzebruch spectral se- quence.1 We may as well assume that V is orientable for ordinary cohomology, and then the usual Thom isomorphism gives an isomorphism of E2 pages, which may or may not extend to a map of spectral sequences: p p+q H (X; π−qko) +3 ko (X) p V p+q He (X ; π−qko) +3 kof (X): Z F2 Since this isomorphism is induced by cupping with the Thom classes µV and µV , the Leibniz rule implies that the first obstruction to the existence of the dashed arrow is n;−q πqko d2 µV = 0; where n = dim V . Now, one way to construct the AHSS is via the Postnikov tower of ko, in which n;−1 case the differentials are exactly the k-invariants; in particular, d2 is a stable 2 cohomology operation HF2 ! Σ HF2, and, as one can show, a nontrivial one, n;−1 2 whence d2 = Sq : Thus our necessary condition for orientability may be rewrit- ten as 2 F2 w2(V ) := Sq µV = 0: 1For the sake of exposition, I'm going to ride a little roughshod over the distinction between KO and ko.
    [Show full text]
  • Toroidal Crossings and Logarithmic Structures
    TOROIDAL CROSSINGS AND LOGARITHMIC STRUCTURES STEFAN SCHROER¨ AND BERND SIEBERT Second revision, 29 November 2004 Abstract. We generalize Friedman’s notion of d-semistability, which is a nec- essary condition for spaces with normal crossings to admit smoothings with regular total space. Our generalization deals with spaces that locally look like the boundary divisor in Gorenstein toroidal embeddings. In this situation, we replace d-semistability by the existence of global log structures for a given gerbe of local log structures. This leads to cohomological descriptions for the obstructions, existence, and automorphisms of log structures. We also apply toroidal crossings to mirror symmetry, by giving a duality construction involv- ing toroidal crossing varieties whose irreducible components are toric varieties. This duality reproduces a version of Batyrev’s construction of mirror pairs for hypersurfaces in toric varieties, but it applies to a larger class, including degenerate abelian varieties. Contents Introduction 1 1. Algebraic spaces and logarithmic structures 3 2. Logarithmic atlases 5 3. Cohomology and hypercoverings 8 4. The sheaf of automorphisms 9 5. The restricted conormal sheaf 13 6. Gorenstein toric varieties 17 7. Gorenstein toroidal crossings 19 8. Triple points and quadruple points 24 9. Smooth log atlases 26 10. Kato fans 27 11. A naive mirror construction 30 12. Batyrev’s mirror construction, degenerate abelian varieties 33 References 35 Introduction Deligne and Mumford [5] showed that any curve with normal crossing singulari- ties deforms to a smooth curve. This is no longer true for higher dimensional spaces. Friedman [7] discovered that an obstruction for the existence of smoothings with regular total space is an invertible sheaf on the singular locus.
    [Show full text]
  • Hirzebruch's Signature Theorem
    Overview References Signature Multiplicative Sequence Signature Theorem Acknowledgments Hirzebruch's Signature Theorem Multiplicative Sequence Approach Hao XIAO S4D4 - GRADUATE SEMINAR ON ADVANCED TOPOLOGY - CHARACTERISTIC CLASSES II Mathematisches Institut, Universit¨atBonn May 27, 2020 Overview References Signature Multiplicative Sequence Signature Theorem Acknowledgments Overview Outline of the talk: What is a Signature & the Signature Theorem? Why do we need multiplicative sequences? Classification of multiplicative sequences Proof of Signature Theorem Some applications of Signature Theorem Overview References Signature Multiplicative Sequence Signature Theorem Acknowledgments References Friedrich Hirzebruch, Topological methods in algebraic geometry, Classics in Mathematics. Springer-Verlag, Berlin, 1995. John W. Milnor and James D. Stasheff, Characteristic classes, Annals of Mathematics Studies, No. 76, Princeton University Press, Princeton, N. J.; University of Tokyo Press, Tokyo, 1974. Overview References Signature Multiplicative Sequence Signature Theorem Acknowledgments Signature Definition Let Mm be a connected compact oriented manifold. The signature σ(M) of M is defined to be zero if the dimension is not a multiple of 4 and 2n 4n as follows for m = 4n: Pick a basis a1;:::; ar for H (M ; Q) so that the symmetric matrix [hai [ aj ; µ4ni] is diagonal, then σ(M4n) is the number of positive diagonal entries minus the number of negative ones. The signature of a compact oriented but not connected manifold is the sum of the signatures of its connected components. Overview References Signature Multiplicative Sequence Signature Theorem Acknowledgments Signature Remark 2n 4n Note that H (M ; Q) is a unitary module over a division ring, i.e. a vector space, so it is valid to speak of basis.
    [Show full text]
  • Ergodic Averages with Deterministic Weights Tome 52, No 2 (2002), P
    R AN IE N R A U L E O S F D T E U L T I ’ I T N S ANNALES DE L’INSTITUT FOURIER Fabien DURAND & Dominique SCHNEIDER Ergodic averages with deterministic weights Tome 52, no 2 (2002), p. 561-583. <http://aif.cedram.org/item?id=AIF_2002__52_2_561_0> © Association des Annales de l’institut Fourier, 2002, tous droits réservés. L’accès aux articles de la revue « Annales de l’institut Fourier » (http://aif.cedram.org/), implique l’accord avec les conditions générales d’utilisation (http://aif.cedram.org/legal/). Toute re- production en tout ou partie cet article sous quelque forme que ce soit pour tout usage autre que l’utilisation à fin strictement per- sonnelle du copiste est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier doit contenir la présente mention de copyright. cedram Article mis en ligne dans le cadre du Centre de diffusion des revues académiques de mathématiques http://www.cedram.org/ , 561- ERGODIC AVERAGES WITH DETERMINISTIC WEIGHTS by F. DURAND and D. SCHNEIDER 1. Introduction. The purpose of this paper is to study ergodic averages with deter- ministic weights. More precisely we study the convergence of the ergodic averages of the type k where bounded sequence and u = a strictly increasing sequence of integers such that for some 6 1, i.e., there exists a constant C such that SN (0, U) , CN~. We define 6 (0, u) to be the infimum of the 6 satisfying xl for 0 and u. About in the case where 0 takes its values in U (the set of complex numbers of modulus 1), it is clear that for all sequences 0 and u, 6(0, u) is smaller than or equal to 1 and it is well-known (see [Ka] for example) that it is greater than or equal to 1/2.
    [Show full text]