Equivariant Invariants and Linear Geometry
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
The Hypersimplex Canonical Forms and the Momentum Amplituhedron-Like Logarithmic Forms
The hypersimplex canonical forms and the momentum amplituhedron-like logarithmic forms TomaszLukowski, 1 and Jonah Stalknecht1 1Department of Physics, Astronomy and Mathematics, University of Hertfordshire, Hatfield, Hertfordshire, AL10 9AB, United Kingdom E-mail: [email protected], [email protected] Abstract: In this paper we provide a formula for the canonical differential form of the hypersimplex ∆k;n for all n and k. We also study the generalization of the momentum ampli- tuhedron Mn;k to m = 2, and we conclude that the existing definition does not possess the desired properties. Nevertheless, we find interesting momentum amplituhedron-like logarith- mic differential forms in the m = 2 version of the spinor helicity space, that have the same singularity structure as the hypersimplex canonical forms. arXiv:2107.07520v1 [hep-th] 15 Jul 2021 Contents 1 Introduction 1 2 Hypersimplex2 2.1 Definitions3 2.2 Hypersimplex canonical forms4 3 Momentum amplituhedron9 3.1 Definition of m = 2 momentum amplituhedron 10 3.2 Momentum amplituhedron-like logarithmic forms 11 3.3 Geometry 12 4 Summary and outlook 15 A Definition of positive geometry and push-forward 15 1 Introduction Geometry has always played an essential role in physics, and it continues to be crucial in many recently developed branches of theoretical and high-energy physics. In recent years, this statement has been supported by the introduction of positive geometries [1] that encode a variety of observables in Quantum Field Theories [2{5], and beyond [6{8], see [9] for a com- prehensive review. These recent advances have also renewed the interest in well-established and very well-studied geometric objects, allowing us to look at them in a completely new way. -
Barycenters of Points That Are Constrained to a Polytope Skeleton
Barycenters of points that are constrained to a polytope skeleton ∗ ∗∗ ∗ PAVLE V. M. BLAGOJEVIC´ FLORIAN FRICK GÜNTER M. ZIEGLER 17. November 2014 Abstract We give a short and simple proof of a recent result of Dobbins that any point in an nd-polytope is the barycenter of n points in the d-skeleton. This new proof builds on the constraint method that we recently introduced to prove Tverberg-type results. A problem originally motivated by mechanics is to determine whether each point in a polytope is the barycenter of points in an appropriate skeleton of the polytope [1]. Its resolution by Dobbins recently appeared in Inventiones. Theorem 1 (Dobbins [4]). For any nd-polytope P and for any point p ∈ P , there are points p1,...,pn in the 1 d-skeleton of P with barycenter p = n (p1 + ··· + pn). Here we simplify the proof of this theorem by using the idea of equalizing distances of points to a certain unavoidable skeleton via equivariant maps to force them into the skeleton. We recently used this setup to give simple proofs of old and new Tverberg-type results [2]. Thus we obtain the following slight generalization of Theorem 1. Theorem 2. Let P be a d-polytope, p ∈ P , and k and n positive integers with kn ≥ d. Then there are points (k) 1 p1,...,pn in the k-skeleton P of P with barycenter p = n (p1 + ··· + pn). More generally, one could ask for a characterization of all possibly inhomogeneous dimensions of skeleta and barycentric coordinates: Problem 3. For given positive integers d and n characterize the dimensions d1,...,dn ≥ 0 and coefficients (d1) (dn) λ1,...,λn ≥ 0 with P λi =1 such that for any d-polytope P there are n points p1 ∈ P ,...,pn ∈ P with p = λ1p1 + ··· + λnpn. -
Thieves Can Make Sandwiches
Submitted exclusively to the London Mathematical Society doi:10.1112/0000/000000 Thieves can make sandwiches Pavle V. M. Blagojevi´cand Pablo Sober´on Dedicated to Imre B´ar´any on the occasion of his 70th birthday Abstract We prove a common generalization of the Ham Sandwich theorem and Alon's Necklace Splitting theorem. Our main results show the existence of fair distributions of m measures in Rd among r thieves using roughly mr=d convex pieces, even in the cases when m is larger than the dimension. The main proof relies on a construction of a geometric realization of the topological join of two spaces of partitions of Rd into convex parts, and the computation of the Fadell-Husseini ideal valued index of the resulting spaces. 1. Introduction Measure partition problems are classical, significant and challenging questions of Discrete Geometry. Typically easy to state, they hide a connection to various advanced methods of Algebraic Topology. In the usual setting, we are presented with a family of measures in a geometric space and a set of rules to partition the space into subsets, and we are asked if there is a partition of this type which splits each measure evenly. In this paper we consider convex partitions of the Euclidean space Rd. More precisely, an ordered d d d collection of n closed subsets K = (K1;:::;Kn) of R is a partition of R if it is a covering R = K1 [···[ Kn, all the interiors int(K1);:::; int(Kn) are non-empty, and int(Ki) \ int(Kj) = ; for all d 1 ≤ i < j ≤ n. -
Mixed Volumes of Hypersimplices, Root Systems and Shifted Young Tableaux Dorian Croitoru
Mixed Volumes of Hypersimplices, Root Systems and Shifted Young Tableaux by Dorian Croitoru M.A., University of Pittsburgh, 2005 Submitted to the Department of Mathematics in partial fulfillment of the requirements for the degree of Doctor of Philosophy at the MASSACHUSETTS INSTITUTE OF TECHNOLOGY September 2010 © Dorian Croitoru, 2010. All rights reserved. The author hereby grants to MIT permission to reproduce and to distribute publicly paper and electronic copies of this thesis document in whole or in part in any medium now known or hereafter created. Author......................................... Department of Mathematics July 21, 2010 Certifiedby...................................... Alexander Postnikov Associate Professor of Applied Mathematics Thesis Supervisor Accepted by . Bjorn Poonen Chairman, Department Committee on Graduate Students Mixed Volumes of Hypersimplices, Root Systems and Shifted Young Tableaux by Dorian Croitoru Submitted to the Department of Mathematics on July 21, 2010 in partial fulfillment of the requirements for the degree of Doctor of Philosophy Abstract This thesis consists of two parts. In the first part, we start by investigating the classical permutohedra as Minkowski sums of the hypersimplices. Their volumes can be expressed as polynomials whose coefficients { the mixed Eulerian numbers { are given by the mixed volumes of the hypersimplices. We build upon results of Postnikov and derive various recursive and combinatorial formulas for the mixed Eulerian numbers. We generalize these results to arbitrary root systems Φ, and obtain cyclic, recursive and combinatorial formulas for the volumes of the weight polytopes (Φ-analogues of permutohedra) as well as the mixed Φ-Eulerian numbers. These formulas involve Cartan matrices and weighted paths in Dynkin diagrams, and thus enable us to extend the theory of mixed Eulerian numbers to arbitrary matrices whose principal minors are invertible. -
Equivariant Topology and Applications
Equivariant Topology And Applications Benjamin Matschke Equivariant Topology And Applications Diploma Thesis Submitted By Benjamin Matschke Supervised by Prof. G¨unter M. Ziegler Coreferee Prof. John Sullivan Institut f¨urMathematik, Fakult¨atII, Technische Universit¨atBerlin Berlin, September 1st 2008 Acknowledgments First of all I would like to thank my advisor, G¨unter Ziegler, for introducing me into the beautiful world of Combinatorial Algebraic Topology and for all his support. For valuable discussions and ideas I am as well deeply indebted to Imre B´ar´any, Pavle Blagojevi´c,Bernhard Hanke, Sebastian Matschke, Carsten Schultz, Elmar Vogt and Rade Zivaljevi´c.ˇ They are great mathematicians and physicists who made this thesis benefit and me learn a lot. Ganz besonders m¨ochte ich mich bei meinen Eltern und meiner Oma f¨urdie famili¨areund auch finanzielle Unterst¨utzungbedanken. ♥ Last and most of all I want to thank my girl friend Jul ı a for all her love, patience and never-ending support. v Contents Acknowledgments v Summary ix Zusammenfassung (German summary) xi Preliminaries xiii Chapter I. The Configuration Space – Test Map Method 1 Chapter II. The Mass Partition Problem 3 1. Introduction 3 2. Elementary considerations 5 3. Test map for mass partitions 7 4. Applying the Fadell–Husseini index 11 5. Applying the ring structure of H∗(RP d) 12 6. Applying characteristic classes 17 7. Notes on Ramos’ results 19 8. A promising ansatz using bordism theory 22 Chapter III. Inscribed Polygons and Tetrahedra 27 1. Introduction 27 2. Test maps for the Square Peg Problem 29 3. Equilateral triangles on curves 30 4. -
An Algebraic Model for Free Rational G-Spectra for Compact Connected
Math. Z. DOI 10.1007/s00209-010-0741-2 Mathematische Zeitschrift An algebraic model for free rational G-spectra for connected compact Lie groups G J. P. C. Greenlees B. Shipley · Received: 30 June 2009 / Accepted: 9 June 2010 © Springer-Verlag 2010 Abstract We show that the category of free rational G-spectra for a connected compact Lie group G is Quillen equivalent to the category of torsion differential graded modules over the polynomial ring H ∗(BG). The ingredients are the enriched Morita equivalences of Schwede and Shipley (Topology 42(1):103–153, 2003), the functors of Shipley (Am J Math 129:351–379, 2007) making rational spectra algebraic, Koszul duality and thick subcategory arguments based on the simplicity of the derived category of a polynomial ring. Contents 1 Introduction ................................................ 2Overview.................................................. 3 The Morita equivalence for spectra .................................... 4 An introduction to Koszul dualities .................................... 5 The topological Koszul duality ...................................... 6TheAdamsspectralsequence....................................... 7 From spectra to chain complexes ..................................... 8 Models of the category of torsion H∗(BG)-modules ........................... 9Changeofgroups ............................................. J. P. C. Greenlees was partially supported by the EPSRC under grant EP/C52084X/1 and B. Shipley by the National Science Foundation under Grant No. 0706877. J. -
On the Square Peg Problem and Some Relatives 11
ON THE SQUARE PEG PROBLEM AND SOME RELATIVES BENJAMIN MATSCHKE Abstract. The Square Peg Problem asks whether every continuous simple closed planar curve contains the four vertices of a square. This paper proves this for the largest so far known class of curves. Furthermore we solve an analogous Triangular Peg Problem affirmatively, state topological intuition why the Rectangular Peg Problem should hold true, and give a fruitful existence lemma of edge-regular polygons on curves. Finally, we show that the problem of finding a regular octahedron on embedded spheres 3 in Ê has a “topological counter-example”, that is, a certain test map with boundary condition exists. 1. Introduction The Square Peg Problem was first posed by O. Toeplitz in 1911: Conjecture 1.1 (Square Peg Problem, Toeplitz [Toe11]). Every continuous em- 1 2 bedding γ : S → Ê contains four points that are the vertices of a square. The name Square Peg Problem might be a bit misleading: We do not require the square to lie inside the curve, otherwise there are easy counter-examples: arXiv:1001.0186v1 [math.MG] 31 Dec 2009 Toeplitz’ problem has been solved affirmatively for various restricted classes of curves such as convex curves and curves that are “smooth enough”, by various authors; the strongest version so far was due to W. Stromquist [Str89, Thm. 3] who established the Square Peg Problem for “locally monotone” curves. All known proofs are based on the fact that “generically” the number of squares on a curve is odd, which can be measured in various topological ways. See [Pak08], [VrZi08],ˇ [CDM10], and [Mat08] for surveys. -
Arxiv:1806.05307V1 [Math.CO] 14 Jun 2018 Way, the Nonnegative Grassmannian Is Similar to a Polytope
POSITIVE GRASSMANNIAN AND POLYHEDRAL SUBDIVISIONS ALEXANDER POSTNIKOV Abstract. The nonnegative Grassmannian is a cell complex with rich geo- metric, algebraic, and combinatorial structures. Its study involves interesting combinatorial objects, such as positroids and plabic graphs. Remarkably, the same combinatorial structures appeared in many other areas of mathematics and physics, e.g., in the study of cluster algebras, scattering amplitudes, and solitons. We discuss new ways to think about these structures. In particular, we identify plabic graphs and more general Grassmannian graphs with poly- hedral subdivisions induced by 2-dimensional projections of hypersimplices. This implies a close relationship between the positive Grassmannian and the theory of fiber polytopes and the generalized Baues problem. This suggests natural extensions of objects related to the positive Grassmannian. 1. Introduction The geometry of the Grassmannian Gr(k; n) is related to combinatorics of the hypersimplex ∆kn. Gelfand, Goresky, MacPherson, Serganova [GGMS87] studied the hypersimplex as the moment polytope for the torus action on the complex Grassmannian. In this paper we highlight new links between geometry of the posi- tive Grassmannian and combinatorics of the hypersimplex ∆kn. [GGMS87] studied the matroid stratification of the Grassmannian Gr(k; n; C), whose strata are the realization spaces of matroids. They correspond to matroid polytopes living inside ∆kn. In general, matroid strata are not cells. In fact, accord- ing to Mn¨ev's universality theorem [Mn¨e88],the matroid strata can be as compli- cated as any algebraic variety. Thus the matroid stratification of the Grassmannian can have arbitrarily bad behavior. There is, however, a semialgebraic subset of the real Grassmannian Gr(k; n; R), called the nonnegative Grassmannian Gr≥0(k; n), where the matroid stratification exhibits a well behaved combinatorial and geometric structure. -
An Equivariant Bivariant Chern Character
The Pennsylvania State University The Graduate School Department of Mathematics AN EQUIVARIANT BIVARIANT CHERN CHARACTER A Thesis in Mathematics by Jeff Raven c 2004 Jeff Raven Submitted in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy December 2004 We approve the thesis of Jeff Raven. Date of Signature Paul Baum Thesis Adviser Evan Pugh Professor of Mathematics Chair of Committee Nigel Higson Distinguished Professor of Mathematics Head, Department of Mathematics Victor Nistor Professor of Mathematics Pablo Laguna Professor of Physics, Astronomy & Astrophysics Abstract Using notions from homological algebra and sheaf theory Baum and Schneider defined a bivariant equivariant cohomology theory which shares many of the properties of equivariant KK -theory; indeed, these two theories have so much in common that when the group under consideration is profinite they are rationally isomorphic. This, combined with other similar results, led Baum and Schneider to conjecture that the same should be true for any totally disconnected group. We verify the conjecture for a large class of such groups, namely the countable discrete groups. iii Contents Acknowledgments ........................................ vi Chapter 1. Introduction ................................... 1 I Equivariant KK -Theory 5 Chapter 2. Proper Actions and Equivariant K-Theory .................. 6 2.1 ProperActions ................................... 6 2.2 EquivariantVectorBundles . .... 10 2.3 Equivariant K-Theory ............................... 13 2.4 Equivariant Spinc Structures ........................... 14 2.5 EquivariantBottElements. .... 18 Chapter 3. Kasparov’s Equivariant KK -Theory ...................... 21 3.1 C∗-Algebras..................................... 21 3.2 Hilbertmodules.................................. 22 3.3 Kasparov’s KK -Theory .............................. 25 3.4 Vector Bundles and KK G(X,X) ......................... 28 G 3.5 Dirac Operators and KK ∗ (M, pt)........................ -
21 TOPOLOGICAL METHODS in DISCRETE GEOMETRY Rade T
21 TOPOLOGICAL METHODS IN DISCRETE GEOMETRY Rade T. Zivaljevi´cˇ INTRODUCTION A problem is solved or some other goal achieved by “topological methods” if in our arguments we appeal to the “form,” the “shape,” the “global” rather than “local” structure of the object or configuration space associated with the phenomenon we are interested in. This configuration space is typically a manifold or a simplicial complex. The global properties of the configuration space are usually expressed in terms of its homology and homotopy groups, which capture the idea of the higher (dis)connectivity of a geometric object and to some extent provide “an analysis properly geometric or linear that expresses location directly as algebra expresses magnitude.”1 Thesis: Any global effect that depends on the object as a whole and that cannot be localized is of homological nature, and should be amenable to topological methods. HOW IS TOPOLOGY APPLIED IN DISCRETE GEOMETRIC PROBLEMS? In this chapter we put some emphasis on the role of equivariant topological methods in solving combinatorial or discrete geometric problems that have proven to be of relevance for computational geometry and topological combinatorics and with some impact on computational mathematics in general. The versatile configuration space/test map scheme (CS/TM) was developed in numerous research papers over the years and formally codified in [Ziv98].ˇ Its essential features are summarized as follows: CS/TM-1: The problem is rephrased in topological terms. The problem should give us a clue how to define a “natural” configuration space X and how to rephrase the question in terms of zeros or coincidences of the associated test maps. -
Arxiv:2010.00478V3 [Math.CO] 2 Dec 2020 References 29
A SURVEY OF MASS PARTITIONS EDGARDO ROLDAN-PENSADO´ AND PABLO SOBERON´ Abstract. Mass partition problems describe the partitions we can induce on a family of measures or finite sets of points in Euclidean spaces by dividing the ambient space into pieces. In this survey we describe recent progress in the area in addition to its connections to topology, discrete geometry, and computer science. Contents 1. Introduction 1 1.1. History 2 1.2. Continuous and discrete versions 3 1.3. Topological proof techniques 4 1.4. Computational complexity 6 1.5. Applications 7 2. Partitions by multiple hyperplanes 8 2.1. The Gr¨unbaum{Hadwiger{Ramos problem 8 2.2. Successive hyperplane partitions 9 2.3. Bisections by hyperplane arrangements 9 2.4. Necklace splitting 12 3. Convex Partitions of Rd 14 3.1. The Nandakumar{Ramana-Rao problem 15 3.2. The Holmsen{Kynˇcl{Valculescu conjecture 16 3.3. Partitions and their transversals 17 3.4. Partitions of families of lines 20 3.5. Partitions with restrictions on the pieces 21 4. More classes of partitions 22 4.1. Sets of fixed size 22 4.2. Partitions by fans and cones 23 4.3. Partitions with curves of bounded complexity 26 5. Extremal variants 27 5.1. Halving hyperplanes 28 5.2. The same-type lemma 28 Acknowledgments 29 arXiv:2010.00478v3 [math.CO] 2 Dec 2020 References 29 1. Introduction Mass partition problems study how partitions of Euclidean spaces split families of measures. For example, for a given measure, how can the total space be split so that each part has the same measure while satisfying some additional geometric property? These problems are also referred to as measure partition problems or Rold´an-Pensado's research is supported by CONACYT project 282280. -
Equivariant Topology Methods in Discrete Geometry
Equivariant topology methods in discrete geometry A dissertation presented by Benjamin Matschke | advised by G¨unterM. Ziegler | to the Department of Mathematics and Computer Science at Freie Universit¨atBerlin in June 2011. Equivariant topology methods in discrete geometry Benjamin Matschke FU Berlin Advisor and first reviewer: G¨unterM. Ziegler Second reviewer: Imre B´ar´any Third reviewer: Pavle V. M. Blagojevi´c Date of defense: August 2, 2011 Contents Preface vii Notations ix 1 The colored Tverberg problem 1 1 A new colored Tverberg theorem ....................... 1 1.1 Introduction .............................. 1 1.2 The main result ............................ 3 1.3 Applications .............................. 3 1.4 The configuration space/test map scheme ............. 5 1.5 First proof of the main theorem ................... 6 1.6 Problems ............................... 8 2 A transversal generalization .......................... 9 2.1 Introduction .............................. 9 2.2 Second proof of the main theorem .................. 11 2.3 The transversal configuration space/test map scheme ....... 14 2.4 A new Borsuk{Ulam type theorem .................. 16 2.5 Proof of the transversal main theorem ................ 21 3 Colored Tverberg on manifolds ........................ 23 3.1 Introduction .............................. 23 3.2 Proof ................................. 24 3.3 Remarks ................................ 25 2 On the square peg problem and some relatives 29 1 Introduction .................................. 29 2 Squares on curves ............................... 30 2.1 Some short historic remarks ..................... 30 2.2 Notations and the parameter space of polygons on curves ..... 31 2.3 Shnirel'man's proof for the smooth square peg problem ....... 32 2.4 A weaker smoothness criterion .................... 33 2.5 Squares on curves in an annulus ................... 38 2.6 Squares and rectangles on immersed curves ............