Related papers: Simplification Techniques for Maps in Simplicial T…
We characterize primary operations in differential cohomology via stacks, and illustrate by differentially refining Steenrod squares and Steenrod powers explicitly. This requires a delicate interplay between integral, rational, and mod p…
We establish a simple recurrence formula for the number $Q_g^n$ of rooted orientable maps counted by edges and genus. We also give a weighted variant for the generating polynomial $Q_g^n(x)$ where $x$ is a parameter taking the number of…
We present a topological framework for finding low-flop algorithms for evaluating element stiffness matrices associated with multilinear forms for finite element methods posed over straight-sided affine domains. This framework relies on…
We use a version of localization in equivariant cohomology for the norm-square of the moment map, described by Paradan, to give several weighted decompositions for simple polytopes. As an application, we study Euler-Maclaurin formulas.
Numerically solving a second quantised many-body model in the permutation symmetric Fock space can be challenging for two reasons: (i) an increased complication in the calculations of the matrix elements of various operators, and (ii) a…
Computational topology is an area that revisits topological problems from an algorithmic point of view, and develops topological tools for improved algorithms. We survey results in computational topology that are concerned with graphs drawn…
This is a survey of known algorithms in algebraic topology with a focus on finite simplicial complexes and, in particular, simplicial manifolds. Wherever possible an elementary approach is chosen. This way the text may also serve as a…
We give some formulas of the James-Hopf maps by using combinatorial methods. An application is to give a product decomposition of the spaces $\Omega\Sigma^2(X)$.
The complexity of algorithms solving the motion planning problem is measured by a homotopy invariant TC(X) of the configuration space X of the system. Previously known lower bounds for TC(X) use the structure of the cohomology algebra of X.…
The motivation of this work is to define cohomology classes in the space of knots that are both easy to find and to evaluate, by reducing the problem to simple linear algebra. We achieve this goal by defining a combinatorial graded cochain…
This manuscript develops a geometric approach to ordinary cohomology of smooth manifolds, constructing a cochain complex model based on co-oriented smooth maps from manifolds with corners. Special attention is given to the pull-back product…
We use a well known problem in discrete and computational geometry (partitions of measures by $k$-fans) as a motivation and as a point of departure to illustrate many aspects, both theoretical and computational, of the problem of…
This paper presents a practical approach for the optimization of topological simplification, a central pre-processing step for the analysis and visualization of scalar data. Given an input scalar field f and a set of "signal" persistence…
We extend the shell and kernel reductions for hyperexponential functions over the field of rational functions to a monomial extension. Both of the reductions are incorporated into one algorithm. As an application, we present an additive…
Following the classical results of Stong, we introduce a cohomological analogue of a core of a finite sheaved topological space and propose an algorithm for simplification in this category. In particular we generalize the notion of beat…
We present a method to simplify expressions in the context of an equational theory. The basic ideas and concepts of the method have been presented previously elsewhere but here we tackle the difficult task of making it efficient in…
We give new lower bounds for the (higher) topological complexity of a space, in terms of the Lusternik-Schnirelmann category of a certain auxiliary space. We also give new lower bounds for the rational topological complexity of a space, and…
We present new, practical algorithms for the hypersurface implicitization problem: namely, given a parametric description (in terms of polynomials or rational functions) of the hypersurface, find its implicit equation. Two of them are for…
A novel meshing scheme, based on regular tetra-kai-decahedron, also referred to as truncated octahedron, cells is presented for use in spatial topology optimization. A tetra-kai-decahedron mesh ensures face connectivity between elements…
We rewrite classical topological definitions using the category-theoretic notation of arrows and are led to concise reformulations in terms of simplicial categories and orthogonality of morphisms, which we hope might be of use in the…