19 papers
Ontology-Grounded Project Memory for Coding Agents
James Adam
Coding agents have become the primary means of generating new code in many software projects, and the resulting velocity of changes makes keeping track of the reasons behind those…
On the Sequential topological complexity of directed (parametrized) motion planning algorithms
Navnath Daundkar, Abhishek Sarkar, Ankur Sarkar
We introduce sequential analogues of directed (parametrized) topological complexity, in the context of motion planning problems requiring a system to traverse a prescribed sequence…
Monoidal and symmetrized parametrized topological complexity
Ramandeep Singh Arora, Navnath Daundkar
We introduce and study monoidal and symmetrized versions of parametrized topological complexity. First, we develop parametrized analogues of the monoidal topological complexity the…
New Bounds on Distributional Sectional Category and Applications to Distributional Homotopic Distance
Navnath Daundkar, J. M. García-Calcines
In this paper, we establish several new bounds for the distributional sectional category (). We first prove Jauhari's conjecture, thereby establishing a cohomologi…
Discrete version of topological complexity of maps
Sutirtha Datta, Navnath Daundkar, Abhishek Sarkar +1
We introduce and study discrete analogs of Scott's and Murillo-Wu's topological complexity of maps. We prove that these discrete analogs are contiguity invariants and are, in fact,…
On the complexity of parametrized motion planning algorithms
Navnath Daundkar, Ekansh Jauhari
We study a probabilistic variant of the r-th sequential parametrized topological complexity, which bounds this classical invariant from below and measures the difficulty in constru…