DOCSLIB.ORG

Volume 30, Number 2 (2009)

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

A BSTR A ABSTRACTS CTS mailing offices 2000 MATHEMATICS and additional of Papers Presented to the Periodicals postage SUBJECT paid at Providence, RI American Mathematical Society CLASSIFICATION Volume 30, Number 2, Issue 156 Spring 2009 Compiled in the Editorial Offices of MATHEMATICAL REVIEWS and ZENTRALBLATT MATH 00 General 44 Integral transforms, operational calculus 01 History and biography 45 Integral equations 03 Mathematical logic and foundations 46 Functional analysis Editorial Committee 05 Combinatorics 47 Operator theory 06 Order, lattices, ordered 49 Calculus of variations and optimal Robert J. Daverman, Chair Volume 30 • Number 2 Spring 2009 Volume algebraic structures control; optimization Susan J. Friedlander 08 General algebraic systems 51 Geometry 11 Number theory 52 Convex and discrete geometry Michel L. Lapidus 12 Field theory and polynomials 53 Differential geometry Matthew Miller 13 Commutative rings and algebras 54 General topology 14 Algebraic geometry 55 Algebraic topology Steven H. Weintraub 15 Linear and multilinear algebra; 57 Manifolds and cell complexes matrix theory 58 Global analysis, analysis on manifolds 16 Associative rings and algebras 60 Probability theory and stochastic 17 Nonassociative rings and algebras processes 18 Category theory; homological 62 Statistics Abstracts for algebra 65 Numerical analysis 19 K-theory 68 Computer science Urbana, March 27–29, 2009 ........................ 389 20 Group theory and generalizations 70 Mechanics of particles and systems 22 Topological groups, Lie groups 74 Mechanics of deformable solids Raleigh, April 4–5, 2009 .............................. 469 26 Real functions 76 Fluid mechanics 28 Measure and integration 78 Optics, electromagnetic theory 30 Functions of a complex variable 80 Classical thermodynamics, heat transfer 31 Potential theory 81 Quantum theory 32 Several complex variables and 82 Statistical mechanics, structure of matter analytic spaces 83 Relativity and gravitational theory 33 Special functions 85 Astronomy and astrophysics 34 Ordinary differential equations 86 Geophysics 35 Partial differential equations 90 Operations research, mathematical 37 Dynamical systems and ergodic programming theory 91 Game theory, economics, social and 39 Difference and functional equations behavioral sciences 40 Sequences, series, summability 92 Biology and other natural sciences 41 Approximations and expansions 93 Systems theory; control 42 Fourier analysis 94 Information and communication, circuits 43 Abstract harmonic analysis 97 Mathematics education ISSN 0192-5857 Pages 389–542 AMS Abstracts of Papers Presented to the AMS Abstracts of Papers Presented ISSN 0192-5857 American Mathematical Society 201 Charles Street, Providence, RI 02904-2294 USA GST No. R121892046 AMS License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use 160 Pages on 40 lb paper • Spine: 1/4" • Print in Black Ink • Trim 7" x 10" SUBMISSION INFORMATION ABSTRACTS PUBLISHED IN THIS JOURNAL are those submitted by authors who intend to present them at AMS meetings (see the front cover). The abstracts for each meeting are sorted by the two-digit 2000 Mathematics Subject Classification chosen by the author and appear in the order received. See the back cover for the 2000 Mathematics Subject Classification. THE SUITABILITY OF A PAPER for presentation to the Society is judged from the abstract as outlined in Article X, Section 6 of the bylaws: Papers intended for presentation at any meeting of the Society shall be passed upon in advance by a program committee appointed by or under the authority of the Council; and only such papers shall be presented as shall have been approved by such committee. Papers in form unsuitable for publication, if accepted for presentation, shall be referred to on the program as preliminary communications or reports. In addition, the editors of the Abstracts have adopted the following policy: In order to be accepted for publication, an abstract must have mathematical research content. It should not contain libelous, defamatory, or tasteless remarks, commercial promotions, nor political or religious arguments. Papers may not be presented if published in full before the date of the Society meeting or if previously presented to any learned Society except the National Academy of Sciences or the Royal Society of Canada. The AMS assumes no responsibility for the content or inappropriate remarks in any published abstract. GENERAL INFORMATION ON ABSTRACTS is found at http://www.ams.org/abstracts. ABSTRACTS ARE PRINTED from copy submitted by the author. Web submission is the required electronic format. To view the interactive template, visit the Abstracts submission page on the AMS website at http://www.ams.org/ cgi-bin/abstracts/abstract.pl. Step-by-step submission instructions are included in the template. No knowl- edge of LATEX is necessary; however, any mathematical displays or accent marks in text or in names must be coded in LATEX. Requests for general information concerning abstracts may be sent to [email protected]. THE ABSTRACT RECEIPT DEADLINES FOR ALL MEETINGS will be strictly enforced. Unfortunately, late papers cannot be accommodated. When all talks have been scheduled for a given meeting, the attendant abstracts will be available for viewing on the AMS website through the program display for that meeting. NOTATIONS IN THIS JOURNAL are the following: * Indicates who will present the paper at the meeting. SUBSCRIPTION INFORMATION CHANGES OF ADDRESS should be reported six weeks in advance to avoid disruption of service. Changes of address and all general correspondence should be sent to Member and Customer Services, American Mathematical Society, 201 Charles Street, Providence, RI 02904-2294 USA (email: [email protected] or fax: 401-455-4026); dues payments and orders for AMS publications should be addressed to the Society at P.O. Box 845904, Boston, MA 02284-5904 USA; all correspondence relating to advance registration for meetings should be addressed to the Society, 201 Charles Street, Providence, RI 02904-2294 USA. Abstracts of Papers Presented to the American Mathematical Society (ISSN 0192-5857) is published four times a year by the American Mathematical Society at 201 Charles Street, Providence, RI 02904-2294. The subscription price for Volume 30 (2009) is US$144 list, US$115 institutional member, US$86 individual member. A late charge of 10% of the subscription price will be imposed on orders received from nonmembers after January 1 of the subscription year. Periodicals postage paid at Providence, RI. Add for postage: Surface delivery to destinations outside the U.S.—US$10, to India—US$16. Expedited delivery to destinations in North America—US$14, elsewhere—US$40. POSTMASTER: Send address change notices to Abstracts of Papers Presented to the American Mathematical Society, 201 Charles Street, Providence, RI 02904-2294 USA. c 2009 by the American Mathematical Society. All rights reserved. Printed in the United States of America. ∞ This journal is printed on acid-free paper and falls within the guidelines established to ensure permanence and durability. License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use 10987654321 1312111009 PAPERS PRESENTED AT MEETINGS THIS CALENDAR lists meetings of the Society which have been approved by the Council at which papers may be presented. Programs of Annual Meetings appear in the Notices and on the AMS website; programs for sectional meetings appear on the AMS Web pages in the Meetings & Conferences section, and are electronically archived in the Notices section on the AMS website. ABSTRACT ABSTRACT MEETING # DATE PLACE DEADLINE ISSUE 1049 April 25–26, 2009 San Francisco, CA March 3 Vol 30, No. 3 1050 April 25–26, 2009 Worcester, MA March 3 Vol 30, No. 3 1051 October 16–18, 2009 Waco, TX August 25 Vol 30, No. 4 1052 October 24–25, 2009 University Park, PA September 1 Vol 30, No. 4 1053 October 30–November 1, Boca Raton, FL September 8 Vol 30, No. 4 2009 1054 November 7–8, 2009 Riverside, CA September 15 Vol 30, No. 4 1055 December 16–20, 2009 Seoul, South Korea TBA TBA 1056 January 13–16, 2010 San Francisco, CA September 22 Vol 31, No. 1 URBANA, IL, March 27–29, 2009 Abstracts of the 1047th Meeting. 00 General 1047-00-2 Gilles Pisier*, Texas A & M University amd Universit´eParisVI.Complex interpolation between Hilbert, Banach and operator spaces. Let B(X, Y ) denote the Banach space of bounded operators between two Banach spaces X, Y . We describe the complex interpolation spaces θ θ (B(p0 ),B(p1 )) or (B(Lp0 ),B(Lp1 )) for any pair 1 ≤ p0,p1 ≤∞and 0 <θ<1. In the same vein, given a locally compact Abelian group G,let M(G) (resp. PM(G)) be the space of complex measures (resp. pseudo-measures) on G equipped with the usual | | norm µ M(G) = µ (G) (resp. ˛ ˛ b µPM(G) =sup{|µˆ(γ)| γ ∈ G}). We describe similarly the interpolation space (M(G),PM(G))θ. Various extensions and variants of this result will be given, e.g. to Schur multipliers on B(2) and to operator spaces. Motivated by a question of Vincent Lafforgue, we study the Banach spaces X satisfying the following property: there is a function ε → ∆X (ε) tending to zero with ε>0 such that every operator T : L2 → L2 with T ≤ε that is simultaneously contractive (i.e. of α norm ≤ 1) on L1 and on L∞ must be of norm ≤ ∆X (ε)onL2(X). We show that ∆X (ε) ∈ O(ε )forsomeα>0 iff X is isomorphic to a quotient of a subspace of an ultraproduct of θ-Hilbertian spaces for some θ>0where θ-Hilbertian is meant in a slightly more general sense than in our previous work. (Received May 27, 2008) 1047-00-19 Stewart E Brekke* ([email protected]), 2900 Maple Ave, Downers Grove, IL 60515. Geometric Figures as Sets of Convergent, Divergent and Parallel Lines and Surfaces. Preliminary report. Plane figures such as angles, triangles and polygons, to name a few,can be thought of as sets of convergent, divergent and parallel lines.
Recommended publications
  • Framing Cyclic Revolutionary Emergence of Opposing Symbols of Identity Eppur Si Muove: Biomimetic Embedding of N-Tuple Helices in Spherical Polyhedra - /

    Framing Cyclic Revolutionary Emergence of Opposing Symbols of Identity Eppur Si Muove: Biomimetic Embedding of N-Tuple Helices in Spherical Polyhedra - /

    Alternative view of segmented documents via Kairos 23 October 2017 | Draft Framing Cyclic Revolutionary Emergence of Opposing Symbols of Identity Eppur si muove: Biomimetic embedding of N-tuple helices in spherical polyhedra - / - Introduction Symbolic stars vs Strategic pillars; Polyhedra vs Helices; Logic vs Comprehension? Dynamic bonding patterns in n-tuple helices engendering n-fold rotating symbols Embedding the triple helix in a spherical octahedron Embedding the quadruple helix in a spherical cube Embedding the quintuple helix in a spherical dodecahedron and a Pentagramma Mirificum Embedding six-fold, eight-fold and ten-fold helices in appropriately encircled polyhedra Embedding twelve-fold, eleven-fold, nine-fold and seven-fold helices in appropriately encircled polyhedra Neglected recognition of logical patterns -- especially of opposition Dynamic relationship between polyhedra engendered by circles -- variously implying forms of unity Symbol rotation as dynamic essential to engaging with value-inversion References Introduction The contrast to the geocentric model of the solar system was framed by the Italian mathematician, physicist and philosopher Galileo Galilei (1564-1642). His much-cited phrase, " And yet it moves" (E pur si muove or Eppur si muove) was allegedly pronounced in 1633 when he was forced to recant his claims that the Earth moves around the immovable Sun rather than the converse -- known as the Galileo affair. Such a shift in perspective might usefully inspire the recognition that the stasis attributed so widely to logos and other much-valued cultural and heraldic symbols obscures the manner in which they imply a fundamental cognitive dynamic. Cultural symbols fundamental to the identity of a group might then be understood as variously moving and transforming in ways which currently elude comprehension.
  • Some Topics Concerning Graphs, Signed Graphs and Matroids

    Some Topics Concerning Graphs, Signed Graphs and Matroids

    SOME TOPICS CONCERNING GRAPHS, SIGNED GRAPHS AND MATROIDS DISSERTATION Presented in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in the Graduate School of the Ohio State University By Vaidyanathan Sivaraman, M.S. Graduate Program in Mathematics The Ohio State University 2012 Dissertation Committee: Prof. Neil Robertson, Advisor Prof. Akos´ Seress Prof. Matthew Kahle ABSTRACT We discuss well-quasi-ordering in graphs and signed graphs, giving two short proofs of the bounded case of S. B. Rao's conjecture. We give a characterization of graphs whose bicircular matroids are signed-graphic, thus generalizing a theorem of Matthews from the 1970s. We prove a recent conjecture of Zaslavsky on the equality of frus- tration number and frustration index in a certain class of signed graphs. We prove that there are exactly seven signed Heawood graphs, up to switching isomorphism. We present a computational approach to an interesting conjecture of D. J. A. Welsh on the number of bases of matroids. We then move on to study the frame matroids of signed graphs, giving explicit signed-graphic representations of certain families of matroids. We also discuss the cycle, bicircular and even-cycle matroid of a graph and characterize matroids arising as two different such structures. We study graphs in which any two vertices have the same number of common neighbors, giving a quick proof of Shrikhande's theorem. We provide a solution to a problem of E. W. Dijkstra. Also, we discuss the flexibility of graphs on the projective plane. We conclude by men- tioning partial progress towards characterizing signed graphs whose frame matroids are transversal, and some miscellaneous results.
  • Octonion Multiplication and Heawood's

    Octonion Multiplication and Heawood's

    CONFLUENTES MATHEMATICI Bruno SÉVENNEC Octonion multiplication and Heawood’s map Tome 5, no 2 (2013), p. 71-76. <http://cml.cedram.org/item?id=CML_2013__5_2_71_0> © Les auteurs et Confluentes Mathematici, 2013. Tous droits réservés. L’accès aux articles de la revue « Confluentes Mathematici » (http://cml.cedram.org/), implique l’accord avec les condi- tions générales d’utilisation (http://cml.cedram.org/legal/). Toute reproduction en tout ou partie de cet article sous quelque forme que ce soit pour tout usage autre que l’utilisation á fin strictement personnelle du copiste est constitutive d’une infrac- tion 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/ Confluentes Math. 5, 2 (2013) 71-76 OCTONION MULTIPLICATION AND HEAWOOD’S MAP BRUNO SÉVENNEC Abstract. In this note, the octonion multiplication table is recovered from a regular tesse- lation of the equilateral two timensional torus by seven hexagons, also known as Heawood’s map. Almost any article or book dealing with Cayley-Graves algebra O of octonions (to be recalled shortly) has a picture like the following Figure 0.1 representing the so-called ‘Fano plane’, which will be denoted by Π, together with some cyclic ordering on each of its ‘lines’. The Fano plane is a set of seven points, in which seven three-point subsets called ‘lines’ are specified, such that any two points are contained in a unique line, and any two lines intersect in a unique point, giving a so-called (combinatorial) projective plane [8,7].
  • Matchgates Revisited

    Matchgates Revisited

    THEORY OF COMPUTING, Volume 10 (7), 2014, pp. 167–197 www.theoryofcomputing.org RESEARCH SURVEY Matchgates Revisited Jin-Yi Cai∗ Aaron Gorenstein Received May 17, 2013; Revised December 17, 2013; Published August 12, 2014 Abstract: We study a collection of concepts and theorems that laid the foundation of matchgate computation. This includes the signature theory of planar matchgates, and the parallel theory of characters of not necessarily planar matchgates. Our aim is to present a unified and, whenever possible, simplified account of this challenging theory. Our results include: (1) A direct proof that the Matchgate Identities (MGI) are necessary and sufficient conditions for matchgate signatures. This proof is self-contained and does not go through the character theory. (2) A proof that the MGI already imply the Parity Condition. (3) A simplified construction of a crossover gadget. This is used in the proof of sufficiency of the MGI for matchgate signatures. This is also used to give a proof of equivalence between the signature theory and the character theory which permits omittable nodes. (4) A direct construction of matchgates realizing all matchgate-realizable symmetric signatures. ACM Classification: F.1.3, F.2.2, G.2.1, G.2.2 AMS Classification: 03D15, 05C70, 68R10 Key words and phrases: complexity theory, matchgates, Pfaffian orientation 1 Introduction Leslie Valiant introduced matchgates in a seminal paper [24]. In that paper he presented a way to encode computation via the Pfaffian and Pfaffian Sum, and showed that a non-trivial, though restricted, fragment of quantum computation can be simulated in classical polynomial time. Underlying this magic is a way to encode certain quantum states by a classical computation of perfect matchings, and to simulate certain ∗Supported by NSF CCF-0914969 and NSF CCF-1217549.
  • The Geometry of Dimer Models

    The Geometry of Dimer Models

    THE GEOMETRY OF DIMER MODELS DAVID CIMASONI Abstract. This is an expanded version of a three-hour minicourse given at the winterschool Winterbraids IV held in Dijon in February 2014. The aim of these lectures was to present some aspects of the dimer model to a geometri- cally minded audience. We spoke neither of braids nor of knots, but tried to show how several geometrical tools that we know and love (e.g. (co)homology, spin structures, real algebraic curves) can be applied to very natural problems in combinatorics and statistical physics. These lecture notes do not contain any new results, but give a (relatively original) account of the works of Kaste- leyn [14], Cimasoni-Reshetikhin [4] and Kenyon-Okounkov-Sheffield [16]. Contents Foreword 1 1. Introduction 1 2. Dimers and Pfaffians 2 3. Kasteleyn’s theorem 4 4. Homology, quadratic forms and spin structures 7 5. The partition function for general graphs 8 6. Special Harnack curves 11 7. Bipartite graphs on the torus 12 References 15 Foreword These lecture notes were originally not intended to be published, and the lectures were definitely not prepared with this aim in mind. In particular, I would like to arXiv:1409.4631v2 [math-ph] 2 Nov 2015 stress the fact that they do not contain any new results, but only an exposition of well-known results in the field. Also, I do not claim this treatement of the geometry of dimer models to be complete in any way. The reader should rather take these notes as a personal account by the author of some selected chapters where the words geometry and dimer models are not completely irrelevant, chapters chosen and organized in order for the resulting story to be almost self-contained, to have a natural beginning, and a happy ending.
  • Lectures 4 and 6 Lecturer: Michel X

    Lectures 4 and 6 Lecturer: Michel X

    18.438 Advanced Combinatorial Optimization Feb 13 and 25, 2014 Lectures 4 and 6 Lecturer: Michel X. Goemans Scribe: Zhenyu Liao and Michel X. Goemans Today, we will use an algebraic approach to solve the matching problem. Our goal is to derive an algebraic test for deciding if a graph G = (V; E) has a perfect matching. We may assume that the number of vertices is even since this is a necessary condition for having a perfect matching. First, we will define a few basic needed notations. Definition 1 A skew-symmetric matrix A is a square matrix which satisfies AT = −A, i.e. if A = (aij) we have aij = −aji for all i; j. For a graph G = (V; E) with jV j = n and jEj = m, we construct a n × n skew-symmetric matrix A = (aij) with an entry aij = −aji for each edge (i; j) 2 E and aij = 0 if (i; j) is not an edge; the values aij for the edges will be specified later. Recall: Definition 2 The determinant of matrix A is n X Y det(A) = sgn(σ) aiσ(i) σ2Sn i=1 where Sn is the set of all permutations of n elements and the sgn(σ) is defined to be 1 if the number of inversions in σ is even and −1 otherwise. Note that for a skew-symmetric matrix A, det(A) = det(−AT ) = (−1)n det(A). So if n is odd we have det(A) = 0. Consider K4, the complete graph on 4 vertices, and thus 0 1 0 a12 a13 a14 B−a12 0 a23 a24C A = B C : @−a13 −a23 0 a34A −a14 −a24 −a34 0 By computing its determinant one observes that 2 det(A) = (a12a34 − a13a24 + a14a23) : First, it is the square of a polynomial q(a) in the entries of A, and moreover this polynomial has a monomial precisely for each perfect matching of K4.
  • Some Applications of Generalized Action Graphs and Monodromy Graphs

    Some Applications of Generalized Action Graphs and Monodromy Graphs

    Some applications of generalized action graphs and monodromy graphs Tomaˇz Pisanski (University of Primorska and University of Ljubljana) 2015 International Conference on Graph Theory UP FAMNIT, Koper, May 26–28, 2015 Tomaˇz Pisanski (University of Primorska and University of Ljubljana)Some applications of generalized action graphs and monodromy graphs Thanks Thanks to my former students Alen Orbani´c, Mar´ıa del R´ıo-Francos and their and my co-authors, in particular to Jan Karab´aˇs and many others whose work I am freely using in this talk. Tomaˇz Pisanski (University of Primorska and University of Ljubljana)Some applications of generalized action graphs and monodromy graphs Snub Cube - Chirality in the sense of Conway Snube cube is vertex-transitive (uniform) chiral polyhedron. It comes in two oriented forms. Tomaˇz Pisanski (University of Primorska and University of Ljubljana)Some applications of generalized action graphs and monodromy graphs Motivation We would like to have a single combinatorial mechanism that would enable us to deal with such phenomena. Our goal is to unify several existing structures in such a way that the power of each individual structure is preserved. Tomaˇz Pisanski (University of Primorska and University of Ljubljana)Some applications of generalized action graphs and monodromy graphs Example: The Cube Example The cube may be considered as an oriented map: R, r, as a map: r0, r1, r2 as a polyhedron .... Question What is the dual of a cube and how can we describe it? Question How can we tell that the cube is a regular map and amphichiral oriented map? Tomaˇz Pisanski (University of Primorska and University of Ljubljana)Some applications of generalized action graphs and monodromy graphs Plan We define generalized action graphs as semi-directed graphs in which the edge set is partitioned into directed 2-factors (forming an action digraph) and undirected 1-factors (forming a monodromy graph) and use them to describe several combinatorial structures, such as maps and oriented maps.
  • Finite Field

    Finite Field

    Finite field From Wikipedia, the free encyclopedia In mathematics, a finite field or Galois field (so-named in honor of Évariste Galois) is a field that contains a finite number of elements. As with any field, a finite field is a set on which the operations of multiplication, addition, subtraction and division are defined and satisfy certain basic rules. The most common examples of finite fields are given by the integers mod n when n is a prime number. TheFinite number field - Wikipedia,of elements the of free a finite encyclopedia field is called its order. A finite field of order q exists if and only if the order q is a prime power p18/09/15k (where 12:06p is a amprime number and k is a positive integer). All fields of a given order are isomorphic. In a field of order pk, adding p copies of any element always results in zero; that is, the characteristic of the field is p. In a finite field of order q, the polynomial Xq − X has all q elements of the finite field as roots. The non-zero elements of a finite field form a multiplicative group. This group is cyclic, so all non-zero elements can be expressed as powers of a single element called a primitive element of the field (in general there will be several primitive elements for a given field.) A field has, by definition, a commutative multiplication operation. A more general algebraic structure that satisfies all the other axioms of a field but isn't required to have a commutative multiplication is called a division ring (or sometimes skewfield).
  • $\Mathbb {F} 1 $ for Everyone

    $\Mathbb {F} 1 $ for Everyone

    F1 for everyone Oliver Lorscheid Abstract. This text serves as an introduction to F1-geometry for the general math- ematician. We explain the initial motivations for F1-geometry in detail, provide an overview of the different approaches to F1 and describe the main achievements of the field. Prologue F1-geometry is a recent area of mathematics that emerged from certain heuristics in combinatorics, number theory and homotopy theory that could not be explained in the frame work of Grothendieck’s scheme theory. These ideas involve a theory of algebraic geometry over a hypothetical field F1 with one element, which includes a theory of algebraic groups and their homogeneous spaces, an arithmetic curve SpecZ over F1 that compactifies the arithmetic line SpecZ and K-theory that stays in close relation to homotopy theory of topological spaces such as spheres. Starting in the mid 2000’s, there was an outburst of different approaches towards such theories, which bent and extended scheme theory. Meanwhile some of the initial problems for F1-geometry have been settled and new applications have been found, for instance in cyclic homology and tropical geometry. The first thought that crosses one’s mind in this context is probably the question: What is the “field with one element”? Obviously, this oxymoron cannot be taken literally as it would imply a mathematical contradiction. It is resolved as follows. First of all we remark that we do not need to define F1 itself—what is needed for the aims of F1-geometry is a suitable category of schemes over F1. However, many approaches contain an explicit definition of F1, and in most cases, the field with one element is not a field and has two elements.
  • Symmetric Cubic Graphs of Small Girth 1 Introduction

    Symmetric Cubic Graphs of Small Girth 1 Introduction

    Symmetric cubic graphs of small girth Marston Conder1 Roman Nedela2 Department of Mathematics Institute of Mathematics University of Auckland Slovak Academy of Science Private Bag 92019 Auckland 975 49 Bansk´aBystrica New Zealand Slovakia Email: [email protected] Email: [email protected] Abstract A graph Γ is symmetric if its automorphism group acts transitively on the arcs of Γ, and s-regular if its automorphism group acts regularly on the set of s-arcs of Γ. Tutte (1947, 1959) showed that every cubic finite symmetric cubic graph is s-regular for some s ≤ 5. We show that a symmetric cubic graph of girth at most 9 is either 1-regular or 2′-regular (following the notation of Djokovic), or belongs to a small family of exceptional graphs. On the other hand, we show that there are infinitely many 3-regular cubic graphs of girth 10, so that the statement for girth at most 9 cannot be improved to cubic graphs of larger girth. Also we give a characterisation of the 1- or 2′-regular cubic graphs of girth g ≤ 9, proving that with five exceptions these are closely related with quotients of the triangle group ∆(2, 3, g) in each case, or of the group h x,y | x2 = y3 = [x,y]4 = 1 i in the case g = 8. All the 3-transitive cubic graphs and exceptional 1- and 2-regular cubic graphs of girth at most 9 appear in the list of cubic symmetric graphs up to 768 vertices produced by Conder and Dobcs´anyi (2002); the largest is the 3-regular graph F570 of order 570 (and girth 9).
  • Pfaffian Orientations, Flat Embeddings, and Steinberg's Conjecture

    Pfaffian Orientations, Flat Embeddings, and Steinberg's Conjecture

    PFAFFIAN ORIENTATIONS, FLAT EMBEDDINGS, AND STEINBERG'S CONJECTURE A Thesis Presented to The Academic Faculty by Peter Whalen In Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in the School of Mathematics Georgia Institute of Technology May 2014 PFAFFIAN ORIENTATIONS, FLAT EMBEDDINGS, AND STEINBERG'S CONJECTURE Approved by: Robin Thomas, Advisor Vijay Vazarani School of Mathematics College of Computing Georgia Institute of Technology Georgia Institute of Technology Sergey Norin Xingxing Yu Department of Mathematics and School of Mathematics Statistics Georgia Institute of Technology McGill University William Trotter Date Approved: 15 April 2014 School of Mathematics Georgia Institute of Technology To Krista iii ACKNOWLEDGEMENTS First and foremost, I would like to thank my advisor, Robin Thomas, for his years of guidance and encouragement. He has provided a constant stream of problems, ideas and opportunities and I am grateful for his continuous support. Robin has had the remarkable ability to present a problem and the exact number of hints and suggestions to allow me to push the boundaries of what I can do. Under his tutelage, I've grown both as a mathematician and as a professional. But perhaps his greatest gift is his passion, for mathematics and for his students. As a mentor and as a role-model, I'm grateful to him for his inspiration. I'd like to thank my undergraduate advisor, Sergey Norin, without whom I would have never fallen in love with graph theory. It is a rare teacher that truly changes a life; I'd like to thank Paul Seymour and Robert Perrin for being two that sent me down this path.
  • Abstract Motivic Homotopy Theory

    Abstract Motivic Homotopy Theory

    Abstract motivic homotopy theory Dissertation zur Erlangung des Grades Doktor der Naturwissenschaften (Dr. rer. nat.) des Fachbereiches Mathematik/Informatik der Universitat¨ Osnabruck¨ vorgelegt von Peter Arndt Betreuer Prof. Dr. Markus Spitzweck Osnabruck,¨ September 2016 Erstgutachter: Prof. Dr. Markus Spitzweck Zweitgutachter: Prof. David Gepner, PhD 2010 AMS Mathematics Subject Classification: 55U35, 19D99, 19E15, 55R45, 55P99, 18E30 2 Abstract Motivic Homotopy Theory Peter Arndt February 7, 2017 Contents 1 Introduction5 2 Some 1-categorical technicalities7 2.1 A criterion for a map to be constant......................7 2.2 Colimit pasting for hypercubes.........................8 2.3 A pullback calculation............................. 11 2.4 A formula for smash products......................... 14 2.5 G-modules.................................... 17 2.6 Powers in commutative monoids........................ 20 3 Abstract Motivic Homotopy Theory 24 3.1 Basic unstable objects and calculations..................... 24 3.1.1 Punctured affine spaces......................... 24 3.1.2 Projective spaces............................ 33 3.1.3 Pointed projective spaces........................ 34 3.2 Stabilization and the Snaith spectrum...................... 40 3.2.1 Stabilization.............................. 40 3.2.2 The Snaith spectrum and other stable objects............. 42 3.2.3 Cohomology theories.......................... 43 3.2.4 Oriented ring spectra.......................... 45 3.3 Cohomology operations............................. 50 3.3.1 Adams operations............................ 50 3.3.2 Cohomology operations........................ 53 3.3.3 Rational splitting d’apres` Riou..................... 56 3.4 The positive rational stable category...................... 58 3.4.1 The splitting of the sphere and the Morel spectrum.......... 58 1 1 3.4.2 PQ+ is the free commutative algebra over PQ+ ............. 59 3.4.3 Splitting of the rational Snaith spectrum................ 60 3.5 Functoriality..................................