DOCSLIB.ORG

Random Walks on Barycentric Subdivisions and the Strichartz Hexacarpet

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Random Walks on Barycentric Subdivisions and the Strichartz Hexacarpet Random Walks on Barycentric Subdivisions and the Strichartz Hexacarpet M. J. Begue1 D. J. Kelleher2 *G. J. H. Khan3 *D. M. Raisingh4 University of Connecticut Mathematics REU 2011 1Department of Mathematics University of Maryland 2Department of Mathematics University of Connecticut 3Department of Mathematics Boston University 4Department of Mathematics Cornell University YMC at Ohio State University, August 19, 2011 G. J. H. Khan D. M. RaisinghThe Strichartz (Universities Hexacarpet of Somewhere and Elsewhere)August 19, 2011 1 / 41 Simplexes and Simplicial Complices A d-dimensional simplex is the convex hull of d + 1 points in general position. A simplicial complex is a collection of simplices with a few conditions about how simplices intersect. G. J. H. Khan D. M. RaisinghThe Strichartz (Universities Hexacarpet of Somewhere and Elsewhere)August 19, 2011 2 / 41 Simplexes and Simplicial Complices A d-dimensional simplex is the convex hull of d + 1 points in general position. A simplicial complex is a collection of simplices with a few conditions about how simplices intersect. G. J. H. Khan D. M. RaisinghThe Strichartz (Universities Hexacarpet of Somewhere and Elsewhere)August 19, 2011 2 / 41 Simplicial complexes A simplicial complex is a collection of simplexes with a few added conditions. Condition 1: If a simplicial complex K contains a simplex J, then it contains all of the simplices J 0 ⊂ J Condition 2: If two simplices intersect, they intersect on a subsimplex. G. J. H. Khan D. M. RaisinghThe Strichartz (Universities Hexacarpet of Somewhere and Elsewhere)August 19, 2011 3 / 41 Simplicial complexes A simplicial complex is a collection of simplexes with a few added conditions. Condition 1: If a simplicial complex K contains a simplex J, then it contains all of the simplices J 0 ⊂ J Condition 2: If two simplices intersect, they intersect on a subsimplex. G. J. H. Khan D. M. RaisinghThe Strichartz (Universities Hexacarpet of Somewhere and Elsewhere)August 19, 2011 3 / 41 Simplicial complexes A simplicial complex is a collection of simplexes with a few added conditions. Condition 1: If a simplicial complex K contains a simplex J, then it contains all of the simplices J 0 ⊂ J Condition 2: If two simplices intersect, they intersect on a subsimplex. G. J. H. Khan D. M. RaisinghThe Strichartz (Universities Hexacarpet of Somewhere and Elsewhere)August 19, 2011 3 / 41 Simplicial complexes These are valid simplicial complexes: These are not: G. J. H. Khan D. M. RaisinghThe Strichartz (Universities Hexacarpet of Somewhere and Elsewhere)August 19, 2011 4 / 41 Simplicial complexes These are valid simplicial complexes: These are not: G. J. H. Khan D. M. RaisinghThe Strichartz (Universities Hexacarpet of Somewhere and Elsewhere)August 19, 2011 4 / 41 What is a barycenter? A barycenter is the center of gravity of a simplex. 1 P In algebraic terms, the barycenter of a simplex J is d+1 i vi where vi are the vertices of J. G. J. H. Khan D. M. RaisinghThe Strichartz (Universities Hexacarpet of Somewhere and Elsewhere)August 19, 2011 5 / 41 What is a barycenter? A barycenter is the center of gravity of a simplex. 1 P In algebraic terms, the barycenter of a simplex J is d+1 i vi where vi are the vertices of J. G. J. H. Khan D. M. RaisinghThe Strichartz (Universities Hexacarpet of Somewhere and Elsewhere)August 19, 2011 5 / 41 What is barycentric subdivision? Barycentric subdivision is defined recursively, but its formal definition is a bit tedious. Intuitively, we subdivide all of the faces of a simplex and connect the subdivision of the faces to the barycenter of that simplex. G. J. H. Khan D. M. RaisinghThe Strichartz (Universities Hexacarpet of Somewhere and Elsewhere)August 19, 2011 6 / 41 What is barycentric subdivision? Barycentric subdivision is defined recursively, but its formal definition is a bit tedious. Intuitively, we subdivide all of the faces of a simplex and connect the subdivision of the faces to the barycenter of that simplex. G. J. H. Khan D. M. RaisinghThe Strichartz (Universities Hexacarpet of Somewhere and Elsewhere)August 19, 2011 6 / 41 What is barycentric subdivision? Barycentric subdivision is defined recursively, but its formal definition is a bit tedious. Intuitively, we subdivide all of the faces of a simplex and connect the subdivision of the faces to the barycenter of that simplex. G. J. H. Khan D. M. RaisinghThe Strichartz (Universities Hexacarpet of Somewhere and Elsewhere)August 19, 2011 6 / 41 3-D Barycentric Subdivision This is what the barycentric subdivision of a tetrahedron (3-simplex) looks like G. J. H. Khan D. M. RaisinghThe Strichartz (Universities Hexacarpet of Somewhere and Elsewhere)August 19, 2011 7 / 41 Repeated Barycentric Subdivision We can repeatedly barycentrically divide a simplex K. We denote the n-th barycentric subdivision as Kn. G. J. H. Khan D. M. RaisinghThe Strichartz (Universities Hexacarpet of Somewhere and Elsewhere)August 19, 2011 8 / 41 Adjacent simplices We say that two d-simplexes in Kn are adjacent if they intersect along a d − 1 simplex. G. J. H. Khan D. M. RaisinghThe Strichartz (Universities Hexacarpet of Somewhere and Elsewhere)August 19, 2011 9 / 41 Approximating graphs Given Kn, we define a graph by assigning a vertex to each of simplices and an edge if those vertexes are adjacent. G. J. H. Khan D. M. RaisinghThe Strichartz (Universities Hexacarpet of Somewhere andAugust Elsewhere) 19, 2011 10 / 41 Approximating Graphs (Cont.) Here is the fourth level approximation: G. J. H. Khan D. M. RaisinghThe Strichartz (Universities Hexacarpet of Somewhere andAugust Elsewhere) 19, 2011 11 / 41 How to Determine Graphs Number of vertices of this graphs grows as ((d + 1)!)n where d is the dimension of the original simplex. So we use an alphabet to create words of length n to specify the cells of Kn. G. J. H. Khan D. M. RaisinghThe Strichartz (Universities Hexacarpet of Somewhere andAugust Elsewhere) 19, 2011 12 / 41 How to Determine Graphs Number of vertices of this graphs grows as ((d + 1)!)n where d is the dimension of the original simplex. So we use an alphabet to create words of length n to specify the cells of Kn. G. J. H. Khan D. M. RaisinghThe Strichartz (Universities Hexacarpet of Somewhere andAugust Elsewhere) 19, 2011 12 / 41 Words and Alphabets 00 01 11 10 05 15 02 12 04 14 03 13 55 54 24 53 23 25 52 22 50 42 43 33 32 20 51 21 41 44 34 31 40 45 35 30 G. J. H. Khan D. M. RaisinghThe Strichartz (Universities Hexacarpet of Somewhere andAugust Elsewhere) 19, 2011 13 / 41 Words and Alphabets So we have a way of specifying vertices. How do we find the edges? If we think of a good naming scheme, then given a word of length n (ex. 0534134), we can find its neighbors. But more on this later... G. J. H. Khan D. M. RaisinghThe Strichartz (Universities Hexacarpet of Somewhere andAugust Elsewhere) 19, 2011 14 / 41 Words and Alphabets So we have a way of specifying vertices. How do we find the edges? If we think of a good naming scheme, then given a word of length n (ex. 0534134), we can find its neighbors. But more on this later... G. J. H. Khan D. M. RaisinghThe Strichartz (Universities Hexacarpet of Somewhere andAugust Elsewhere) 19, 2011 14 / 41 Contraction and Projection Mappings We can perform contractions. This is the same as tacking on a letter to the front of the word. We also have a projection map from a cell to it's parent cell by deleting the last letter of the word. G. J. H. Khan D. M. RaisinghThe Strichartz (Universities Hexacarpet of Somewhere andAugust Elsewhere) 19, 2011 15 / 41 Contraction and Projection Mappings We can perform contractions. This is the same as tacking on a letter to the front of the word. We also have a projection map from a cell to it's parent cell by deleting the last letter of the word. G. J. H. Khan D. M. RaisinghThe Strichartz (Universities Hexacarpet of Somewhere andAugust Elsewhere) 19, 2011 15 / 41 Strichartz Hexacarpet Let the length of the words go to infinity with the same connections for each of the finite length words, we obtain the Strichartz Hexacarpet. But what does this look like? G. J. H. Khan D. M. RaisinghThe Strichartz (Universities Hexacarpet of Somewhere andAugust Elsewhere) 19, 2011 16 / 41 Permutohedron 0.5 0.4 0.3 0.2 0.1 0 0.4 0.2 0 1 −0.2 0.8 0.6 0.4 −0.4 0.2 Cayley graph of Sn with adjacent elements swapped G. J. H. Khan D. M. RaisinghThe Strichartz (Universities Hexacarpet of Somewhere andAugust Elsewhere) 19, 2011 17 / 41 Permutohedron 0.5 0.4 0.3 0.2 0.1 0 0.4 0.2 0 1 −0.2 0.8 0.6 0.4 −0.4 0.2 Cayley graph of Sn with adjacent elements swapped G. J. H. Khan D. M. RaisinghThe Strichartz (Universities Hexacarpet of Somewhere andAugust Elsewhere) 19, 2011 17 / 41 Permutohedron n+1 Take all the permutations the vector (1; 2; : : : ; n + 1) 2 R . Its convex hull of these vectors is the permutohedron G. J. H. Khan D. M. RaisinghThe Strichartz (Universities Hexacarpet of Somewhere andAugust Elsewhere) 19, 2011 18 / 41 Permutohedron n+1 Take all the permutations the vector (1; 2; : : : ; n + 1) 2 R . Its convex hull of these vectors is the permutohedron G. J. H. Khan D. M. RaisinghThe Strichartz (Universities Hexacarpet of Somewhere andAugust Elsewhere) 19, 2011 18 / 41 2nd Level approximation 0.7 0.6 0.5 0.4 0.3 0.2 0.1 0 0.4 0.2 0 1 −0.2 0.8 0.6 0.4 −0.4 0.2 0 G.
Load more

Recommended publications
  • Simplicial Complexes
    46 III Complexes III.1 Simplicial Complexes There are many ways to represent a topological space, one being a collection of simplices that are glued to each other in a structured manner. Such a collection can easily grow large but all its elements are simple. This is not so convenient for hand-calculations but close to ideal for computer implementations. In this book, we use simplicial complexes as the primary representation of topology. Rd k Simplices. Let u0; u1; : : : ; uk be points in . A point x = i=0 λiui is an affine combination of the ui if the λi sum to 1. The affine hull is the set of affine combinations. It is a k-plane if the k + 1 points are affinely Pindependent by which we mean that any two affine combinations, x = λiui and y = µiui, are the same iff λi = µi for all i. The k + 1 points are affinely independent iff P d P the k vectors ui − u0, for 1 ≤ i ≤ k, are linearly independent. In R we can have at most d linearly independent vectors and therefore at most d+1 affinely independent points. An affine combination x = λiui is a convex combination if all λi are non- negative. The convex hull is the set of convex combinations. A k-simplex is the P convex hull of k + 1 affinely independent points, σ = conv fu0; u1; : : : ; ukg. We sometimes say the ui span σ. Its dimension is dim σ = k. We use special names of the first few dimensions, vertex for 0-simplex, edge for 1-simplex, triangle for 2-simplex, and tetrahedron for 3-simplex; see Figure III.1.
    [Show full text]
  • F-VECTORS of BARYCENTRIC SUBDIVISIONS 1. Introduction This Work Is Concerned with the Effect of Barycentric Subdivision on the E
    f-VECTORS OF BARYCENTRIC SUBDIVISIONS FRANCESCO BRENTI AND VOLKMAR WELKER Abstract. For a simplicial complex or more generally Boolean cell complex ∆ we study the behavior of the f- and h-vector under barycentric subdivision. We show that if ∆ has a non-negative h-vector then the h-polynomial of its barycentric subdivision has only simple and real zeros. As a consequence this implies a strong version of the Charney-Davis conjecture for spheres that are the subdivision of a Boolean cell complex or the subdivision of the boundary complex of a simple polytope. For a general (d − 1)-dimensional simplicial complex ∆ the h- polynomial of its n-th iterated subdivision shows convergent be- havior. More precisely, we show that among the zeros of this h- polynomial there is one converging to infinity and the other d − 1 converge to a set of d − 1 real numbers which only depends on d. 1. Introduction This work is concerned with the effect of barycentric subdivision on the enumerative structure of a simplicial complex. More precisely, we study the behavior of the f- and h-vector of a simplicial complex, or more generally, Boolean cell complex, under barycentric subdivisions. In our main result we show that if the h-vector of a simplicial complex or Boolean cell complex is non-negative then the h-polynomial (i.e., the generating polynomial of the h-vector) of its barycentric subdivi- sion has only real simple zeros. Moreover, if one applies barycentric subdivision iteratively then there is a limiting behavior of the zeros of the h-polynomial, with one zero going to infinity and the other zeros converging.
    [Show full text]
  • Traversing Three-Manifold Triangulations and Spines 11
    TRAVERSING THREE-MANIFOLD TRIANGULATIONS AND SPINES J. HYAM RUBINSTEIN, HENRY SEGERMAN AND STEPHAN TILLMANN Abstract. A celebrated result concerning triangulations of a given closed 3–manifold is that any two triangulations with the same number of vertices are connected by a sequence of so-called 2-3 and 3-2 moves. A similar result is known for ideal triangulations of topologically finite non-compact 3–manifolds. These results build on classical work that goes back to Alexander, Newman, Moise, and Pachner. The key special case of 1–vertex triangulations of closed 3–manifolds was independently proven by Matveev and Piergallini. The general result for closed 3–manifolds can be found in work of Benedetti and Petronio, and Amendola gives a proof for topologically finite non-compact 3–manifolds. These results (and their proofs) are phrased in the dual language of spines. The purpose of this note is threefold. We wish to popularise Amendola’s result; we give a combined proof for both closed and non-compact manifolds that emphasises the dual viewpoints of triangulations and spines; and we give a proof replacing a key general position argument due to Matveev with a more combinatorial argument inspired by the theory of subdivisions. 1. Introduction Suppose you have a finite number of triangles. If you identify edges in pairs such that no edge remains unglued, then the resulting identification space looks locally like a plane and one obtains a closed surface, a two-dimensional manifold without boundary. The classification theorem for surfaces, which has its roots in work of Camille Jordan and August Möbius in the 1860s, states that each closed surface is topologically equivalent to a sphere with some number of handles or crosscaps.
    [Show full text]
  • Barycentric Subdivision and Isomorphisms of Groupoids
    BARYCENTRIC SUBDIVISION AND ISOMORPHISMS OF GROUPOIDS JASHA SOMMER-SIMPSON Abstract. Given groupoids G and H as well as an isomorphism Ψ : Sd G =∼ Sd H between subdivisions, we construct an isomorphism P : G =∼ H . If Ψ equals SdF for some functor F , then the constructed isomorphism P is equal to F . It follows that the restriction of Sd to the category of groupoids is conservative. These results do not hold for arbitrary categories. Contents 1. Introduction 1 2. Notation and overview of proof 2 3. Construction of Sd C 4 4. Sd preserves coproducts and identifies opposite categories 8 5. Sd C encodes objects and arrows of C 10 6. Sd G encodes composition in G up to opposites 17 7. Construction of and proof of the main theorem 27 References 40 Appendix A. Proof of Propositions 6.1.19 and 6.1.20 41 1. Introduction The categorical subdivision functor Sd : Cat ! Cat is defined as the compos- ite Π ◦ Sds ◦ N of the nerve functor N : Cat ! sSet, the simplicial barycen- tric subdivision functor Sds : sSet ! sSet, and the fundamental category functor Π: sSet ! Cat (left adjoint to N). The categorical subdivision functor Sd has deficiencies: for example, it is neither a left nor a right adjoint. Nevertheless, Sd bears similarities to its simplicial analog Sds, and has many interesting properties. For example, it is known that the second subdivision Sd2C of any small category C is a poset [4, ch. 13]. In general, there exist small categories B and C such that Sd B is isomorphic to Sd C but B is not isomorphic to C or to C op.
    [Show full text]
  • Mapping Surfaces with Earcut Arxiv:2012.08233V1 [Cs.CG] 15 Dec
    JOURNAL OF LATEX CLASS FILES, VOL. 14, NO. 8, AUGUST 2015 1 Mapping Surfaces with Earcut Marco Livesu, CNR IMATI Abstract—Mapping a shape to some parametric domain is a fundamental tool in graphics and scientific computing. In practice, a map between two shapes is commonly represented by two meshes with same connectivity and different embedding. The standard approach is to input a meshing of one of the two domains plus a function that projects its boundary to the other domain, and then solve for the position of the interior vertices. Inspired by basic principles in mesh generation, in this paper we present the reader a novel point of view on mesh parameterization: we consider connectivity as an additional unknown, and assume that our inputs are just two boundaries that enclose the domains we want to connect. We compute the map by simultaneously growing the same mesh inside both shapes.This change in perspective allows us to recast the parameterization problem as a mesh generation problem, granting access to a wide set of mature tools that are typically not used in this setting. Our practical outcome is a provably robust yet trivial to implement algorithm that maps any planar shape with simple topology to a homotopic domain that is weakly visible from an inner convex kernel. Furthermore, we speculate on a possible extension of the proposed ideas to volumetric maps, listing the major challenges that arise. Differently from prior methods – for which we show that a volumetric extension is not possible – our analysis leaves us reasoneable hopes that the robust generation of volumetric maps via compatible mesh generation could be obtained in the future.
    [Show full text]
  • Download This Article in PDF Format
    ESAIM: M2AN 48 (2014) 553–581 ESAIM: Mathematical Modelling and Numerical Analysis DOI: 10.1051/m2an/2013104 www.esaim-m2an.org ANALYSIS OF COMPATIBLE DISCRETE OPERATOR SCHEMES FOR ELLIPTIC PROBLEMS ON POLYHEDRAL MESHES Jer´ omeˆ Bonelle1 and Alexandre Ern2 Abstract. Compatible schemes localize degrees of freedom according to the physical nature of the underlying fields and operate a clear distinction between topological laws and closure relations. For elliptic problems, the cornerstone in the scheme design is the discrete Hodge operator linking gradients to fluxes by means of a dual mesh, while a structure-preserving discretization is employed for the gradient and divergence operators. The discrete Hodge operator is sparse, symmetric positive definite and is assembled cellwise from local operators. We analyze two schemes depending on whether the potential degrees of freedom are attached to the vertices or to the cells of the primal mesh. We derive new functional analysis results on the discrete gradient that are the counterpart of the Sobolev embeddings. Then, we identify the two design properties of the local discrete Hodge operators yielding optimal discrete energy error estimates. Additionally, we show how these operators can be built from local nonconforming gradient reconstructions using a dual barycentric mesh. In this case, we also prove an optimal L2-error estimate for the potential for smooth solutions. Links with existing schemes (finite elements, finite volumes, mimetic finite differences) are discussed. Numerical results are presented on three-dimensional polyhedral meshes. Mathematics Subject Classification. 65N12, 65N08, 65N30. Received November 12, 2012. Revised July 16, 2013. Published online January 20, 2014. 1. Introduction Engineering applications on complex geometries can involve polyhedral meshes with various element shapes.
    [Show full text]
  • Barycentric Characteristic Numbers
    BARYCENTRIC CHARACTERISTIC NUMBERS OLIVER KNILL If G is the category of finite simple graphs G = (V; E), the linear space V of valuations on G has a basis given by the f-numbers vk(G) counting complete subgraphs Kk+1 in G. The barycentric refinement G1 of G 2 G is the graph with Kl subgraphs as vertex set where new vertices a 6= b are connected if a ⊂ b or b ⊂ a. Under refinement, the clique data transform as ~v ! A~v with the upper triangular matrix Aij = i!S(j; i) with Stirling T numbers S(j; i). The eigenvectors χk of A with eigenvalues k! form an other basis in V. The χk are normalized so that the first nonzero entry is > 0 and all entries are in Z with no common prime factor. χ1 is the Euler P1 k characteristic k=0(−1) vk, the homotopy and so cohomology invariant on G. Half of the χk will be zero Dehn-Sommerville-Klee invariants like half the Betti numbers are redundant under Poincar´eduality. On the set Gd ⊂ G with clique number d, the valuations V have dimension d + 1 by discrete Hadwiger. A basis is the eigensystem ~χ of the upper left (d+1)× (d + 1) sub-matrix Ad of A. The functional χd+1(G) is volume, counting the facets of G. For x 2 V , define V−1(x) = 1 and Vk(x) as the number of complete subgraphs Kk+1 of the unit sphere S(x), the graph generated by the neighbors of x.
    [Show full text]
  • Discrete Exterior Calculus
    Discrete Exterior Calculus Thesis by Anil N. Hirani In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy California Institute of Technology Pasadena, California 2003 (Defended May 9, 2003) ii c 2003 Anil N. Hirani All Rights Reserved iii For my parents Nirmal and Sati Hirani my wife Bhavna and daughter Sankhya. iv Acknowledgements I was lucky to have two advisors at Caltech – Jerry Marsden and Jim Arvo. It was Jim who convinced me to come to Caltech. And on my first day here, he sent me to meet Jerry. I took Jerry’s CDS 140 and I think after a few weeks asked him to be my advisor, which he kindly agreed to be. His geometric view of mathematics and mechanics was totally new to me and very interesting. This, I then set out to learn. This difficult but rewarding experience has been made easier by the help of many people who are at Caltech or passed through Caltech during my years here. After Jerry Marsden and Jim Arvo as my advisors, the other person who has taught me the most is Mathieu Desbrun. It has been my good luck to have him as a guide and a collaborator. Amongst the faculty here, Al Barr has also been particularly kind and generous with advice. I thank him for taking an interest in my work and in my academic well-being. Amongst students current and former, special thanks to Antonio Hernandez for being such a great TA in CDS courses, and spending so many extra hours, helping me understand so much stuff that was new to me.
    [Show full text]
  • Laplacians on Discrete and Quantum Geometries
    August 1, 2012 AEI-2012-078 Laplacians on discrete and quantum geometries Gianluca Calcagni, Daniele Oriti, Johannes Thürigen Max Planck Institute for Gravitational Physics (Albert Einstein Institute) Am Mühlenberg 1, D-14476 Potsdam, Germany E-mail: [email protected], [email protected], [email protected] Abstract: We extend discrete calculus to a bra-ket formalism for arbitrary (p-form) fields on discrete geometries, based on cellular complexes. We then provide a general definition of discrete Laplacian using both the primal cellular complex and its topological dual. The precise implemen- tation of geometric volume factors is not unique and comparing the definition with a circumcentric and a barycentric dual we argue that the latter is, in general, more appropriate because it induces a Laplacian with more desirable properties. We give the expression of the discrete Laplacian in several different sets of geometric variables, suitable for computations in different quantum gravity formalisms. Furthermore, we investigate the possibility of transforming from position to momen- tum space for scalar fields, thus setting the stage for the calculation of heat kernel and spectral dimension in discrete quantum geometries. Keywords: Models of Quantum Gravity, Lattice Models of Gravity arXiv:1208.0354v1 [hep-th] 1 Aug 2012 Contents 1 Introduction 2 2 A bra-ket formalism for discrete position spaces 3 2.1 Two dualities in the continuum 4 2.2 Exterior forms on simplicial complexes 5 2.3 Choice of convention 6 2.4 Discrete Hodge duality 6 2.5
    [Show full text]
  • Constructions of Cubical Polytopes Alexander Schwartz
    Constructions of Cubical Polytopes Alexander Schwartz Berlin 2004 D 83 Constructions of Cubical Polytopes vorgelegt von Diplom-Mathematiker Alexander Schwartz der Fakult¨at II { Mathematik und Naturwissenschaften der Technischen Universit¨at Berlin zur Erlangung des akademischen Grades Doktor der Naturwissenschaften { Dr. rer. nat. { genehmigte Dissertation Promotionsausschuss: Berichter: Prof. Dr. Gun¨ ter M. Ziegler Prof. Dr. Martin Henk Vorsitzender: Prof. Dr. Alexander Bobenko Tag der wissenschaftlichen Aussprache: 16. Januar 2004 Berlin 2004 D 83 Abstract In this thesis we consider cubical d-polytopes, convex bounded d-dimensional polyhedra all of whose facets are combinatorially isomorphic to the (d − 1)- dimensional standard cube. It is known that every cubical d-polytope P determines a PL immersion of an abstract closed cubical (d−2)-manifold into the polytope boundary @P ∼= Sd−1. The immersed manifold is orientable if and only if the 2-skeleton of the cubical d-polytope (d ≥ 3) is \edge orientable" in the sense of Hetyei. He conjectured that there are cubical 4-polytopes that are not edge-orientable. In the more general setting of cubical PL (d − 1)-spheres, Babson and Chan have observed that every type of normal crossing PL immersion of a closed PL (d−2)-manifold into an (d−1)-sphere appears among the dual manifolds of some cubical PL (d − 1)-sphere. No similar general result was available for cubical polytopes. The reason for this may be blamed to a lack of flexible construction techniques for cubical polytopes, and for more general cubical complexes (such as the \hexahedral meshes" that are of great interest in CAD and in Numerical Analysis).
    [Show full text]
  • 5 Simplicial Maps, Simplicial Approximations and the Invariance of Homology
    Autumn Semester 2017{2018 MATH41071/MATH61071 Algebraic topology 5 Simplicial Maps, Simplicial Approximations and the Invariance of Homology Simplicial maps 5.1 Definition. Let K and L be simplicial complexes. Then an admis- sible vertex map from K to L is a function φ: V (K) ! V (L) such that, if f v0; v1; : : : ; vr g is a simplex of K, then f φ(v0); φ(v1); : : : ; φ(vr) g is a sim- plex of L. Note. φ need not be an injection and so the simplex f φ(v0); φ(v1); : : : ; φ(vr) g may contain repeated vertices in which case it is a simplex of dimension less than r. 5.2 Proposition. An admissible vertex map φ from K to L induces a continuous map of the underlying spaces jφj: jKj ! jLj by linear extension of the vertex map r r X X jφj tivi = tiφ(vi): i=0 i=0 Proof. The function jφj is well-defined and continuous by the Gluing Lemma since the simplices are closed subsets of jKj. 5.3 Definition. A continuous function f : jKj ! jLj between the under- lying spaces of two simplicial complexes is a simplicial map (with respect to K and L) if f = jφj for an admissible vertex map from K to L. 5.4 Proposition. Suppose that φ: V (K) ! V (L) is an admissible vertex map from a simplicial complex K to a simplicial complex L. Then φ induces homomorphisms φ∗ : Cr(K) ! Cr(L) defined on generators by 8 < hφ(v0); φ(v1); : : : ; φ(vr)i if the vertices φ(vi) φ∗(hv0; v1; : : : ; vri) = are all distinct, : 0 otherwise.
    [Show full text]
  • Bachelorarbeit Fakultät Für Mathematik Und Informatik Lehrgebiet Analysis
    Bachelorarbeit Fakult¨atf¨urMathematik und Informatik Lehrgebiet Analysis SS2021 Fixed Point Theorems for Real- and Set-Valued Functions in Finite- and Infinite-Dimensional Spaces Fabian Smetak Studiengang: B.Sc. Mathematik Matrikelnummer: 7783680 FernUniversit¨atin Hagen Betreuer: Prof. Dr. Delio Mugnolo Dr. Matthias T¨aufer Mai 2021 Abstract Fixed point theorems play an important role in various branches of mathematics and have diverse applications to other fields. At its core, this thesis is devoted to the fixed point theorem of Brouwer which states that a continuous function on a nonempty, compact and convex subset of a finite-dimensional space must have a fixed point. Although the theorem can be proven analytically, this thesis follows a different approach: We use Sperner's lemma { an important result from combina- torial topology { and simplicial subdivisions to show that any continuous function mapping a simplex into itself must have a fixed point. We then extend the theo- rem to sets that are homeomorphic to simplices. The second part of the thesis is concerned with generalizations of Brouwer's fixed point theorem. On the one hand, the restriction to finite-dimensional spaces is relaxed. By introducing the concept of compact operators, Schauder's fixed point theorem is established { an analogue to Brouwer's theorem for infinite-dimensional spaces. On the other hand, the concept of point-to-point mappings (i.e. functions) is generalized and point-to-set mappings (so-called correspondences or set-valued functions) are introduced. These consider- ations lead to Kakutani's fixed point theorem, a result that has gained significant traction in applications such as economics or game theory.
    [Show full text]