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 7 of 7 for “"cell decompositions"”.
-
Combinatorial Models for Nonnegativity in Flag Varieties
… nonnegative Grassmannian admits a widely studied cell decomposition due to Alexander Postnikov, whose cells are indexed by positroids and modeled by several equivalent combinatorial objects. Subsequent work by authors including Lauren Williams, Suho Oh, and Carolina Benedetti has further developed …
-
Springer theory and the geometry of quiver flag varieties
… over homogeneous spaces because we have the cellular fibration technique and for equivariant Borel-Moore homology we can use localization to torus-fixed points. Examples of Steinberg algebras include group rings of Weyl groups, Khovanov-Lauda-Rouquier algebras, nil Hecke algebras. 2. …
-
Matroid-Theoretic Approaches to Compactified Jacobians and Vector Bundles
… lattice of periodicity, one obtains a class of cell decompositions of real tori. We prove an enumerative result on the $f$-vectors of these decompositions. These subdivisions arise in the context of compactified Jacobians of nodal curves, where the cell structure encodes the inclusions of orbit …
-
Qualitative topological coverage of unknown environments by mobile robots
… coverage information is overcome by embedding a cell decomposition, called slice decomposition, within the map. This is achieved using landmarks in the topological map as cell boundaries in slice decomposition. Slice decomposition is a new cell decomposition method which uses the landmarks in the …
-
Qualitative Topological Coverage of Unknown Environments by Mobile Robots
… coverage information is overcome by embedding a cell decomposition, called slice decomposition, within the map. This is achieved using landmarks in the topological map as cell boundaries in slice decomposition. Slice decomposition is a new cell decomposition method which uses the landmarks in the …
-
Vizualizace algoritmů pro plánování cesty
Bakalářská práce se zabývá plánováním cesty robota a návrhem programu pro vizualizaci vybraných algoritmů používaných v této oblasti. Cílem práce je vytvořit vizualizační nástroj, který umožní názorně sledovat chování různých algoritmů plánování cesty v prostředí s překážkami.
-
Cusp Pattern Enumeration and Completion Search for Mixed-Platonic 3-Manifold
… finite-volume hyperbolic 3-manifold ad-mitting a cellulation by regular ideal tetrahedra and regular ideal octahedra [4]. We develop a completion search algorithm that, given a candidate cusp cellulation, determines all compatible mixed-platonic cellulations by assigning embeddings to cusp cells …