Author
Yonghwan Kim
Recent research
- AI & ComputingOpen access
Two Self‐Stabilizing Algorithms for the Maximal Pentagon Partitioning Problem
ABSTRACT Given an undirected graph , a collection of disjoint subsets of nodes is called a pentagon partition if each subset satisfies one of the following conditions: (1) and the induced subgraph contains a simple cycle of length 5 (called pentagon ) or (2) . Let denote the set...
- AI & ComputingOpen access
Simple homotopy theory for Fukaya categories
Abstract We develop a categorical framework for simple homotopy theory in Fukaya categories, based on the fundamental group of the ambient symplectic manifold. When the first Chern class vanishes, we show that any isomorphism in the Fukaya category of a Weinstein manifold has tri...