A Simplicial Complex is Uniquely Determined by Its Set of Discrete Morse Functions
نویسندگان
چکیده
منابع مشابه
Every discrete, finite image is uniquely determined by its dipole histogram
A finite image I is a function assigning colors to a finite, rectangular array of discrete pixels. Thus, the information directly encoded by I is purely locational. Such locational information is of little visual use in itself: perception of visual structure requires extraction of relational image information. A very elementary form of relational information about I is provided by its dipole hi...
متن کاملConstructing discrete Morse functions
Morse theory has been considered a powerful tool in its applications to computational topology, computer graphics and geometric modeling. It was originally formulated for smooth manifolds. Recently, Robin Forman formulated a version of this theory for discrete structures such as cell complexes. It opens up several categories of interesting objects (particularly meshes) to applications of Morse ...
متن کاملSets uniquely determined by projections on axes II Discrete case
Fishburn, P. A subset S of N " = { 1,2,. , N} " is a discrete set of uniqueness if it is the only subset of N " with projections P,, Sets of uniqueness and additive sets are characterized by the absence of certain configurations in the lattice N ". The characterization shows that every additive set is a set of uniqueness. If n = 2, every set of uniqueness is also additive. However, when II 3 3,...
متن کاملOn Optimizing Discrete Morse Functions
In 1998, Forman introduced discrete Morse theory as a tool for studying CW complexes by producing smaller, simpler-to-understand complexes of critical cells with the same homotopy types as the original complexes. This paper addresses two questions: (1) under what conditions may several gradient paths in a discrete Morse function simultaneously be reversed to cancel several pairs of critical cel...
متن کاملComputing Optimal Discrete Morse Functions
The essential structural information of discrete Morse functions is captured by so-called Morse matchings. We show that computing optimal Morse matchings is NP-hard and give an integer programming formulation for the problem. Then we present first polyhedral results for the corresponding polytope and report on some preliminary computational results.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2017
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-017-9865-z