From Sets to Quarks: Deriving the Standard Model Plus Gravitation from Simple Operations on Finite Sets Frank D
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Can We Rule out the Possibility of the Existence of an Additional Time Axis
Brian D. Koberlein Thomas J. Murray Time 2 ABSTRACT CAN WE RULE OUT THE POSSIBILITY THAT THERE IS MORE THAN ONE DIRECTION IN TIME? by Lynn Stephens The literature was examined to see if a proposal for the existence of additional time-like axes could be falsified. Some naïve large-time models are visualized and examined from the standpoint of simplicity and adequacy. Although the conclusion here is that the existence of additional time-like dimensions has not been ruled out, the idea is probably not falsifiable, as was first assumed. The possibility of multiple times has been dropped from active consideration by theorists less because of negative evidence than because it can lead to cumbersome models that introduce causality problems without providing any advantages over other models. Even though modern philosophers have made intriguing suggestions concerning the causality issue, usability and usefulness issues remain. Symmetry considerations from special relativity and from the conservation laws are used to identify restrictions on large-time models. In view of recent experimental findings, further research into Cramer’s transactional model is indicated. This document contains embedded graphic (.png and .jpg) and Apple Quick Time (.mov) files. The CD-ROM contains interactive Pacific Tech Graphing Calculator (.gcf) files. Time 3 NOTE TO THE READER The graphics in the PDF version of this document rely heavily on the use of color and will not print well in black and white. The CD-ROM attachment that comes with the paper version of this document includes: • The full-color PDF with QuickTime animation; • A PDF printable in black and white; • The original interactive Graphing Calculator files. -
Simulating Physics with Computers
International Journal of Theoretical Physics, VoL 21, Nos. 6/7, 1982 Simulating Physics with Computers Richard P. Feynman Department of Physics, California Institute of Technology, Pasadena, California 91107 Received May 7, 1981 1. INTRODUCTION On the program it says this is a keynote speech--and I don't know what a keynote speech is. I do not intend in any way to suggest what should be in this meeting as a keynote of the subjects or anything like that. I have my own things to say and to talk about and there's no implication that anybody needs to talk about the same thing or anything like it. So what I want to talk about is what Mike Dertouzos suggested that nobody would talk about. I want to talk about the problem of simulating physics with computers and I mean that in a specific way which I am going to explain. The reason for doing this is something that I learned about from Ed Fredkin, and my entire interest in the subject has been inspired by him. It has to do with learning something about the possibilities of computers, and also something about possibilities in physics. If we suppose that we know all the physical laws perfectly, of course we don't have to pay any attention to computers. It's interesting anyway to entertain oneself with the idea that we've got something to learn about physical laws; and if I take a relaxed view here (after all I'm here and not at home) I'll admit that we don't understand everything. -
Dirac Equation - Wikipedia
Dirac equation - Wikipedia https://en.wikipedia.org/wiki/Dirac_equation Dirac equation From Wikipedia, the free encyclopedia In particle physics, the Dirac equation is a relativistic wave equation derived by British physicist Paul Dirac in 1928. In its free form, or including electromagnetic interactions, it 1 describes all spin-2 massive particles such as electrons and quarks for which parity is a symmetry. It is consistent with both the principles of quantum mechanics and the theory of special relativity,[1] and was the first theory to account fully for special relativity in the context of quantum mechanics. It was validated by accounting for the fine details of the hydrogen spectrum in a completely rigorous way. The equation also implied the existence of a new form of matter, antimatter, previously unsuspected and unobserved and which was experimentally confirmed several years later. It also provided a theoretical justification for the introduction of several component wave functions in Pauli's phenomenological theory of spin; the wave functions in the Dirac theory are vectors of four complex numbers (known as bispinors), two of which resemble the Pauli wavefunction in the non-relativistic limit, in contrast to the Schrödinger equation which described wave functions of only one complex value. Moreover, in the limit of zero mass, the Dirac equation reduces to the Weyl equation. Although Dirac did not at first fully appreciate the importance of his results, the entailed explanation of spin as a consequence of the union of quantum mechanics and relativity—and the eventual discovery of the positron—represents one of the great triumphs of theoretical physics. -
The Sphere Packing Problem in Dimension 8 Arxiv:1603.04246V2
The sphere packing problem in dimension 8 Maryna S. Viazovska April 5, 2017 8 In this paper we prove that no packing of unit balls in Euclidean space R has density greater than that of the E8-lattice packing. Keywords: Sphere packing, Modular forms, Fourier analysis AMS subject classification: 52C17, 11F03, 11F30 1 Introduction The sphere packing constant measures which portion of d-dimensional Euclidean space d can be covered by non-overlapping unit balls. More precisely, let R be the Euclidean d vector space equipped with distance k · k and Lebesgue measure Vol(·). For x 2 R and d r 2 R>0 we denote by Bd(x; r) the open ball in R with center x and radius r. Let d X ⊂ R be a discrete set of points such that kx − yk ≥ 2 for any distinct x; y 2 X. Then the union [ P = Bd(x; 1) x2X d is a sphere packing. If X is a lattice in R then we say that P is a lattice sphere packing. The finite density of a packing P is defined as Vol(P\ Bd(0; r)) ∆P (r) := ; r > 0: Vol(Bd(0; r)) We define the density of a packing P as the limit superior ∆P := lim sup ∆P (r): r!1 arXiv:1603.04246v2 [math.NT] 4 Apr 2017 The number be want to know is the supremum over all possible packing densities ∆d := sup ∆P ; d P⊂R sphere packing 1 called the sphere packing constant. For which dimensions do we know the exact value of ∆d? Trivially, in dimension 1 we have ∆1 = 1. -
Sphere Packing, Lattice Packing, and Related Problems
Sphere packing, lattice packing, and related problems Abhinav Kumar Stony Brook April 25, 2018 Sphere packings Definition n A sphere packing in R is a collection of spheres/balls of equal size which do not overlap (except for touching). The density of a sphere packing is the volume fraction of space occupied by the balls. ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ In dimension 1, we can achieve density 1 by laying intervals end to end. In dimension 2, the best possible is by using the hexagonal lattice. [Fejes T´oth1940] Sphere packing problem n Problem: Find a/the densest sphere packing(s) in R . In dimension 2, the best possible is by using the hexagonal lattice. [Fejes T´oth1940] Sphere packing problem n Problem: Find a/the densest sphere packing(s) in R . In dimension 1, we can achieve density 1 by laying intervals end to end. Sphere packing problem n Problem: Find a/the densest sphere packing(s) in R . In dimension 1, we can achieve density 1 by laying intervals end to end. In dimension 2, the best possible is by using the hexagonal lattice. [Fejes T´oth1940] Sphere packing problem II In dimension 3, the best possible way is to stack layers of the solution in 2 dimensions. This is Kepler's conjecture, now a theorem of Hales and collaborators. mmm m mmm m There are infinitely (in fact, uncountably) many ways of doing this! These are the Barlow packings. Face centered cubic packing Image: Greg A L (Wikipedia), CC BY-SA 3.0 license But (until very recently!) no proofs. In very high dimensions (say ≥ 1000) densest packings are likely to be close to disordered. -
Physical Interpretation of the 30 8-Simplexes in the E8 240-Polytope
Physical Interpretation of the 30 8-simplexes in the E8 240-Polytope: Frank Dodd (Tony) Smith, Jr. 2017 - viXra 1702.0058 248-dim Lie Group E8 has 240 Root Vectors arranged on a 7-sphere S7 in 8-dim space. The 12 vertices of a cuboctahedron live on a 2-sphere S2 in 3-dim space. They are also the 4x3 = 12 outer vertices of 4 tetrahedra (3-simplexes) that share one inner vertex at the center of the cuboctahedron. This paper explores how the 240 vertices of the E8 Polytope in 8-dim space are related to the 30x8 = 240 outer vertices (red in figure below) of 30 8-simplexes whose 9th vertex is a shared inner vertex (yellow in figure below) at the center of the E8 Polytope. The 8-simplex has 9 vertices, 36 edges, 84 triangles, 126 tetrahedron cells, 126 4-simplex faces, 84 5-simplex faces, 36 6-simplex faces, 9 7-simplex faces, and 1 8-dim volume The real 4_21 Witting polytope of the E8 lattice in R8 has 240 vertices; 6,720 edges; 60,480 triangular faces; 241,920 tetrahedra; 483,840 4-simplexes; 483,840 5-simplexes 4_00; 138,240 + 69,120 6-simplexes 4_10 and 4_01; and 17,280 = 2,160x8 7-simplexes 4_20 and 2,160 7-cross-polytopes 4_11. The cuboctahedron corresponds by Jitterbug Transformation to the icosahedron. The 20 2-dim faces of an icosahedon in 3-dim space (image from spacesymmetrystructure.wordpress.com) are also the 20 outer faces of 20 not-exactly-regular-in-3-dim tetrahedra (3-simplexes) that share one inner vertex at the center of the icosahedron, but that correspondence does not extend to the case of 8-simplexes in an E8 polytope, whose faces are both 7-simplexes and 7-cross-polytopes, similar to the cubocahedron, but not its Jitterbug-transform icosahedron with only triangle = 2-simplex faces. -
Arxiv:2010.10200V3 [Math.GT] 1 Mar 2021 We Deduce in Particular the Following
HYPERBOLIC MANIFOLDS THAT FIBER ALGEBRAICALLY UP TO DIMENSION 8 GIOVANNI ITALIANO, BRUNO MARTELLI, AND MATTEO MIGLIORINI Abstract. We construct some cusped finite-volume hyperbolic n-manifolds Mn that fiber algebraically in all the dimensions 5 ≤ n ≤ 8. That is, there is a surjective homomorphism π1(Mn) ! Z with finitely generated kernel. The kernel is also finitely presented in the dimensions n = 7; 8, and this leads to the first examples of hyperbolic n-manifolds Mfn whose fundamental group is finitely presented but not of finite type. These n-manifolds Mfn have infinitely many cusps of maximal rank and hence infinite Betti number bn−1. They cover the finite-volume manifold Mn. We obtain these examples by assigning some appropriate colours and states to a family of right-angled hyperbolic polytopes P5;:::;P8, and then applying some arguments of Jankiewicz { Norin { Wise [15] and Bestvina { Brady [6]. We exploit in an essential way the remarkable properties of the Gosset polytopes dual to Pn, and the algebra of integral octonions for the crucial dimensions n = 7; 8. Introduction We prove here the following theorem. Every hyperbolic manifold in this paper is tacitly assumed to be connected, complete, and orientable. Theorem 1. In every dimension 5 ≤ n ≤ 8 there are a finite volume hyperbolic 1 n-manifold Mn and a map f : Mn ! S such that f∗ : π1(Mn) ! Z is surjective n with finitely generated kernel. The cover Mfn = H =ker f∗ has infinitely many cusps of maximal rank. When n = 7; 8 the kernel is also finitely presented. arXiv:2010.10200v3 [math.GT] 1 Mar 2021 We deduce in particular the following. -
Optimality and Uniqueness of the Leech Lattice Among Lattices
ANNALS OF MATHEMATICS Optimality and uniqueness of the Leech lattice among lattices By Henry Cohn and Abhinav Kumar SECOND SERIES, VOL. 170, NO. 3 November, 2009 anmaah Annals of Mathematics, 170 (2009), 1003–1050 Optimality and uniqueness of the Leech lattice among lattices By HENRY COHN and ABHINAV KUMAR Dedicated to Oded Schramm (10 December 1961 – 1 September 2008) Abstract We prove that the Leech lattice is the unique densest lattice in R24. The proof combines human reasoning with computer verification of the properties of certain explicit polynomials. We furthermore prove that no sphere packing in R24 can 30 exceed the Leech lattice’s density by a factor of more than 1 1:65 10 , and we 8 C give a new proof that E8 is the unique densest lattice in R . 1. Introduction It is a long-standing open problem in geometry and number theory to find the densest lattice in Rn. Recall that a lattice ƒ Rn is a discrete subgroup of rank n; a minimal vector in ƒ is a nonzero vector of minimal length. Let ƒ vol.Rn=ƒ/ j j D denote the covolume of ƒ, i.e., the volume of a fundamental parallelotope or the absolute value of the determinant of a basis of ƒ. If r is the minimal vector length of ƒ, then spheres of radius r=2 centered at the points of ƒ do not overlap except tangentially. This construction yields a sphere packing of density n=2 r Án 1 ; .n=2/Š 2 ƒ j j since the volume of a unit ball in Rn is n=2=.n=2/Š, where for odd n we define .n=2/Š .n=2 1/. -
Octonions and the Leech Lattice
Octonions and the Leech lattice Robert A. Wilson School of Mathematical Sciences, Queen Mary, University of London, Mile End Road, London E1 4NS 18th December 2008 Abstract We give a new, elementary, description of the Leech lattice in terms of octonions, thereby providing the first real explanation of the fact that the number of minimal vectors, 196560, can be expressed in the form 3 × 240 × (1 + 16 + 16 × 16). We also give an easy proof that it is an even self-dual lattice. 1 Introduction The Leech lattice occupies a special place in mathematics. It is the unique 24- dimensional even self-dual lattice with no vectors of norm 2, and defines the unique densest lattice packing of spheres in 24 dimensions. Its automorphism group is very large, and is the double cover of Conway’s group Co1 [2], one of the most important of the 26 sporadic simple groups. This group plays a crucial role in the construction of the Monster [13, 4], which is the largest of the sporadic simple groups, and has connections with modular forms (so- called ‘Monstrous Moonshine’) and many other areas, including theoretical physics. The book by Conway and Sloane [5] is a good introduction to this lattice and its many applications. It is not surprising therefore that there is a huge literature on the Leech lattice, not just within mathematics but in the physics literature too. Many attempts have been made in particular to find simplified constructions (see for example the 23 constructions described in [3] and the four constructions 1 described in [15]). -
Hyperdiamond Feynman Checkerboard in 4-Dimensional Spacetime
View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by CERN Document Server quant-ph/950301 5 THEP-95-3 March 1995 Hyp erDiamond Feynman Checkerb oard in 4-dimensional Spacetime Frank D. (Tony) Smith, Jr. e-mail: [email protected] and [email protected] P.O.Box for snail-mail: P.O.Box 430, Cartersville, Georgia 30120 USA WWW URL http://www.gatech.edu/tsmith/home.html Scho ol of Physics Georgia Institute of Technology Atlanta, Georgia 30332 Abstract A generalized Feynman Checkerb oard mo del is constructed using a processed by the SLAC/DESY Libraries on 22 Mar 1995. 〉 4-dimensional Hyp erDiamond lattice. The resulting phenomenological mo del is the D D E mo del describ ed in hep-ph/9501252 and 4 5 6 quant-ph/9503009. PostScript c 1995 Frank D. (Tony) Smith, Jr., Atlanta, Georgia USA QUANT-PH-9503015 Contents 1 Intro duction. 2 2 Feynman Checkerb oards. 3 3 Hyp erDiamond Lattices. 10 3.1 8-dimensional Hyp erDiamond Lattice. :: :: ::: :: :: :: 12 3.2 4-dimensional Hyp erDiamond Lattice. :: :: ::: :: :: :: 14 3.3 From 8 to 4 Dimensions. : ::: :: :: :: :: ::: :: :: :: 19 4 Internal Symmetry Space. 21 5 Protons, Pions, and Physical Gravitons. 25 5.1 3-Quark Protons. : :: :: ::: :: :: :: :: ::: :: :: :: 29 5.2 Quark-AntiQuark Pions. : ::: :: :: :: :: ::: :: :: :: 32 5.3 Spin-2 Physical Gravitons. ::: :: :: :: :: ::: :: :: :: 35 1 1 Intro duction. The 1994 Georgia Tech Ph. D. thesis of Michael Gibbs under David Finkel- stein [11] constructed a discrete 4-dimensional spacetime Hyp erDiamond lat- tice, here denoted a 4HD lattice, in the course of building a physics mo del. -
Arxiv:Hep-Th/9603202V1 29 Mar 1996
SLAC–PUB–7115 March 1996 DISCRETE PHYSICS AND THE DIRAC EQUATION∗ Louis H. Kauffman Department of Mathematics, Statistics and Computer Science University of Illinois at Chicago 851 South Morgan Street, Chicago IL 60607-7045 and H. Pierre Noyes Stanford Linear Accelerator Center Stanford University, Stanford, CA 94309 Abstract We rewrite the 1+1 Dirac equation in light cone coordinates in two signif- icant forms, and solve them exactly using the classical calculus of finite differ- ences. The complex form yields “Feynman’s Checkerboard”—a weighted sum arXiv:hep-th/9603202v1 29 Mar 1996 over lattice paths. The rational, real form can also be interpreted in terms of bit-strings. Submitted to Physics Letters A. PACS: 03.65.Pm, 02.70.Bf Key words: discrete physics, choice sequences, Dirac equation, Feynman checker- board, calculus of finite differences, rational vs. complex quantum mechanics ∗Work partially supported by Department of Energy contract DE–AC03–76SF00515 and by the National Science Foundation under NSF Grant Number DMS-9295277. 1 Introduction In this paper we give explicit solutions to the Dirac equation for 1+1 space-time. These solutions are valid for discrete physics [1] using the calculus of finite differences, and they have as limiting values solutions to the Dirac equation using infinitesimal calculus. We find that the discrete solutions can be directly interpreted in terms of sums over lattice paths in discrete space-time. We document the relationship of this lattice-path with the checkerboard model of Richard Feynman [2]. Here we see how his model leads directly to an exact solution to the Dirac equation in discrete physics and thence to an exact continuum solution by taking a limit. -
Symmetries and Exotic Smooth Structures on a K3 Surface WM Chen University of Massachusetts - Amherst, [email protected]
University of Massachusetts Amherst ScholarWorks@UMass Amherst Mathematics and Statistics Department Faculty Mathematics and Statistics Publication Series 2008 Symmetries and exotic smooth structures on a K3 surface WM Chen University of Massachusetts - Amherst, [email protected] S Kwasik Follow this and additional works at: https://scholarworks.umass.edu/math_faculty_pubs Part of the Physical Sciences and Mathematics Commons Recommended Citation Chen, WM and Kwasik, S, "Symmetries and exotic smooth structures on a K3 surface" (2008). JOURNAL OF TOPOLOGY. 268. Retrieved from https://scholarworks.umass.edu/math_faculty_pubs/268 This Article is brought to you for free and open access by the Mathematics and Statistics at ScholarWorks@UMass Amherst. It has been accepted for inclusion in Mathematics and Statistics Department Faculty Publication Series by an authorized administrator of ScholarWorks@UMass Amherst. For more information, please contact [email protected]. SYMMETRIES AND EXOTIC SMOOTH STRUCTURES ON A K3 SURFACE WEIMIN CHEN AND SLAWOMIR KWASIK Abstract. Smooth and symplectic symmetries of an infinite family of distinct ex- otic K3 surfaces are studied, and comparison with the corresponding symmetries of the standard K3 is made. The action on the K3 lattice induced by a smooth finite group action is shown to be strongly restricted, and as a result, nonsmoothability of actions induced by a holomorphic automorphism of a prime order ≥ 7 is proved and nonexistence of smooth actions by several K3 groups is established (included among which is the binary tetrahedral group T24 which has the smallest order). Concerning symplectic symmetries, the fixed-point set structure of a symplectic cyclic action of a prime order ≥ 5 is explicitly determined, provided that the action is homologically nontrivial.