Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 6 of 6 for “"Cubical complex"”.
-
WEIGHTED CUBICAL HOMOLOGY
… we first introduce the definition of weighted cubical complex by adding a weight function to cubical complex. We also check the structure of weighted cubical complex such as weighted boundary map and weighted cubical complex. After this concept, the weighted cubical homology is generated by …
-
Maximal Surfaces in Complexes
Cubical complexes are defined in a manner analogous to that for simplicial complexes, the chief difference being that cubical complexes are unions of cubes rather than of simplices. A very natural cubical complex to consider is the complex C(k_1,...,k_n) where k_1,...,k_n are nonnegative integers. …
-
Combinatorics of CAT(0) cubical complexes, crossing complexes and co-skeletons
This thesis consists of three papers about cubical complexes: Chapter 1 is [Rowlands 22a], Chapter 2 is [Rowlands 23], and Chapter 3 is [Rowlands 22b]. Chapter 1 extends a result by Dancis to cubical complexes: Dancis proved that any d-dimensional simplicial manifold can be reconstructed from its …
-
Computational Homology Applied to Discrete Objects
… in a combinatorial way, as simplicial or cubical complexes are. Given a discrete object (a set of pixels, voxels or their analog in higher dimension) we can build a cubical complex and thus compute its homology groups. This thesis studies three approaches regarding the homology computation …
-
Βαρυκεντρικές υποδιαιρέσεις, σμήνη και απαρίθμηση μεταθέσεων
… root systems. Finally, the tranformation of the cubical h-vectors of a cubical complex under cubical barycentric subdivision is studied.
-
A Kruskal-Katona theorem for cubical complexes
The optimal number of faces in cubical complexes which lie in cubes refers to the maximum number of faces that can be constructed from a certain number of faces of lower dimension, or the minimum number of faces necessary to construct a certain number of faces of higher dimension. If <i>m</i> is …