Related papers: Explicit motion planning in digital projective pro…
Starting from Borel's description of the mod-2 cohomology of real flag manifolds, we give a minimal presentation of the cohomology ring for semi complete flag manifolds $F_{k,m}:=F(1,\ldots,1,m)$ where $1$ is repeated $k$ times. The…
Significant progress has been made for assessing the influence of porosity on the performance metrics for cast components through various modeling techniques. However, a computationally efficient framework to account for porosity with…
Multi-material design optimization problems can, after discretization, be solved by the iterative solution of simpler sub-problems which approximate the original problem at an expansion point to first order. In particular, models…
Transformations of digital spaces preserving local and global topology play an important role in thinning, skeletonization and simplification of digital images. In the present paper, we introduce and study contractions of simple pair of…
We continue the study of freezing sets in digital topology, introduced in [2]. We show how to find a minimal freezing set for a "thick" convex disk X in the digital plane Z^2. We give examples showing the significance of the assumption that…
We prove a connectedness result for products of weighted projective spaces.
This note initiates an investigation of packing links into a region of Euclidean space to achieve a maximal density subject to geometric constraints. The upper bounds obtained apply only to the class of homotopically essential links and…
This paper is a companion paper to [Lipman and Daubechies 2011]. We provide numerical procedures and algorithms for computing the alignment of and distance between two disk type surfaces. We provide a convergence analysis of the discrete…
Let X be a subcomplex of the standard CW-decomposition of the n-dimensional torus. We exhibit an explicit optimal motion planning algorithm for X. This construction is used to calculate the topological complexity of complements of general…
To reduce the computational cost of humanoid motion generation, we introduce a new approach to representing robot kinematic reachability: the differentiable reachability map. This map is a scalar-valued function defined in the task space…
Many branches of theoretical and applied mathematics require a quantifiable notion of complexity. One such circumstance is a topological dynamical system - which involves a continuous self-map on a metric space. There are many notions of…
In robotics, a topological theory of motion planning was initiated by M. Farber. The multitasking motion planning problem is new and its theoretical part via topological complexity has hardly been developed, but the concrete implementations…
Recent advances in social and mobile technology have enabled an abundance of digital traces (in the form of mobile check-ins, association of mobile devices to specific WiFi hotspots, etc.) revealing the physical presence history of diverse…
Longest Increasing Subsequence (LIS) is a fundamental problem in combinatorics and computer science. Previously, there have been numerous works on both upper bounds and lower bounds of the time complexity of computing and approximating LIS,…
The $s$-th higher topological complexity of a space $X$, $TC_s(X)$, can be estimated from above by homotopical methods, and from below by homological methods. We give a thorough analysis of the gap between such estimates when $X=RP^m$, the…
With a view towards providing tools for analyzing and understanding digitized images, various notions from algebraic topology have been introduced into the setting of digital topology. In the ordinary topological setting, invariants such as…
We define a new version of Topological Complexity (TC) of a space, denoted as $\text{dTC}$, which, we think, fits better for motion planning for some autonomous systems. Like Topological complexity, \text{dTC} is also a homotopy invariant.…
High-dimensional motion planning problems can often be solved significantly faster by using multilevel abstractions. While there are various ways to formally capture multilevel abstractions, we formulate them in terms of fiber bundles.…
In this article we obtain linear programming bounds for the maximal sphere packing density of commutative spaces. A special case of our results solves a conjecture by Cohn and Zhao on linear programming bounds for sphere packings in…
The notion of effective topological complexity, introduced by B{\l}aszczyk and Kaluba, deals with using group actions in the configuration space in order to reduce the complexity of the motion planning algorithm. In this article we focus on…