Related papers: Simplification Techniques for Maps in Simplicial T…
The aim of this paper is to give the geometric realization of regular path complexes via (co)homology groups with coefficients in a ring $R$. Concretely, for each regular path complex $P$, we associate it with a singular $\Delta$-complex…
Graphs are ubiquitous to model the irregular (non-Euclidean) structure of complex data, but they are limited to pairwise relationships and fail to model the complexities of the datasets exhibiting higher-order interactions. In that context,…
Robotic manipulation in complex, constrained spaces is vital for widespread applications but challenging, particularly when navigating narrow passages with elongated objects. Existing planning methods often fail in these low-clearance…
In the past two decades, extensive research has been conducted on the (co)homology of various models of random simplicial complexes. So far, it has always been examined merely as a list of groups. This paper expands upon this by describing…
In this note, we give an algorithm that starting with a Sullivan algebra gives us its minimal model. This algorithm is a kind of modified AT-model algorithm used to compute in the past other kinds of topology information such as…
Topological Data Analysis (TDA) studies the shape of data. A common topological descriptor is the persistence diagram, which encodes topological features in a topological space at different scales. Turner, Mukeherjee, and Boyer showed that…
Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…
This paper is the second one in a series of papers about operations in motivic cohomology. Here we show that in the context of smooth schemes over a field of characteristic zero all the bi-stable operations can be obtained in the usual way…
We express the rational cohomology of the unordered configuration space of a compact oriented manifold as a representation of its mapping class group in terms of a weight-decomposition of the rational cohomology of the mapping space from…
We find an algorithm to compute the cohomology groups of spherical vector bundles on complex projective K3 surfaces, in terms of their Mukai vectors. In many good cases, we give significant simplifications of the algorithm. As an…
We study certain topological problems that are inspired by applications to autonomous robot manipulation. Consider a continuous map $f\colon X\to Y$, where $f$ can be a kinematic map from the configuration space $X$ to the working space $Y$…
We construct algorithms and topological invariants that allow us to distinguish the topological type of a surface, as well as functions and vector fields for their topological equivalence. In the first part we discus the main structures…
Building up on work of Epstein, May and Drury, we define and investigate the mod $p$ Steenrod operations on the de Rham cohomology of smooth algebraic stacks over a field of characteristic $p>0$. We then compute the action of the operations…
Modular graph forms are a class of modular covariant functions which appear in the genus-one contribution to the low-energy expansion of closed string scattering amplitudes. Modular graph forms with holomorphic subgraphs enjoy the…
A mathematically rigorous Hamiltonian formulation for classical and quantum field theories is given. New results include clarifications of the structure of linear fields, and a plausible formulation for nonlinear fields. Many mathematical…
Algorithms for persistent homology and zigzag persistent homology are well-studied for persistence modules where homomorphisms are induced by inclusion maps. In this paper, we propose a practical algorithm for computing persistence under…
These course notes are about computing modular forms and some of their arithmetic properties. Their aim is to explain and prove the modular symbols algorithm in as elementary and as explicit terms as possible, and to enable the devoted…
In this paper, we propose a topology optimization (TO) framework where the design is parameterized by a set of convex polygons. Extending feature mapping methods in TO, the representation allows for direct extraction of the geometry. In…
In the present work, a new computational framework for structural topology optimization based on the concept of moving deformable components is proposed. Compared with the traditional pixel or node point-based solution framework, the…
Quadratic-support functions [Aravkin, Burke, and Pillonetto; J. Mach. Learn. Res. 14(1), 2013] constitute a parametric family of convex functions that includes a range of useful regularization terms found in applications of convex…