Related papers: Algorithmic canonical stratifications of simplicia…
We establish several results combining discrete Morse theory and microlocal sheaf theory in the setting of finite posets and simplicial complexes. Our primary tool is a computationally tractable description of the bounded derived category…
We prove that any arithmetic locally symmetric space is homotopy equivalent to a simplicial complex where the number of simplices is bounded linearly in the volume of the space. This settles a well-known conjecture of Gelander. The main…
We generalize some homotopy calculation techniques such as splittings and matching trees that are introduced for the computations in the case of the independence complexes of graphs to arbitrary simplicial complexes, and exemplify their…
Renormalized homotopy continuation on toric varieties is introduced as a tool for solving sparse systems of polynomial equations, or sparse systems of exponential sums. The cost of continuation depends on a renormalized condition length,…
We present a complexity reduction algorithm for a family of parameter-dependent linear systems when the system parameters belong to a compact semi-algebraic set. This algorithm potentially describes the underlying dynamical system with…
We prove that for any $\ell \geq 0$, there exists an algorithm which takes as input a description of a semi-algebraic subset $S \subset \mathbb{R}^k$ given by a quantifier-free first order formula $\phi$ in the language of the reals, and…
We introduce a set of combinatorial techniques for studying the simplicial bounded cohomology of semi-simplicial sets, simplicial complexes and posets. We apply these methods to prove several new bounded acyclicity results for…
We give an approximate algorithm of computing holonomic systems of linear differential equations for definite integrals with parameters. We show that this algorithm gives a correct answer in finite steps, but we have no general stopping…
This paper introduces an algebraic combinatorial approach to simplicial cone decompositions, a key step in solving inhomogeneous linear Diophantine systems and counting lattice points in polytopes. We use constant term manipulation on the…
We use exponential start time clustering to design faster and more work-efficient parallel graph algorithms involving distances. Previous algorithms usually rely on graph decomposition routines with strict restrictions on the diameters of…
We present a new interior-point potential-reduction algorithm for solving monotone linear complementarity problems (LCPs) that have a particular special structure: their matrix $M\in{\mathbb R}^{n\times n}$ can be decomposed as $M=\Phi U +…
Symmetric tensor decomposition is an important problem with applications in several areas for example signal processing, statistics, data analysis and computational neuroscience. It is equivalent to Waring's problem for homogeneous…
Let $X^{2n}\subseteq \mathbb{P} ^N$ be a smooth projective variety. Consider the intersection cohomology complex of the local system $R^{2n-1}\pi{_*}\mathbb{Q}$, where $\pi$ denotes the projection from the universal hyperplane family of…
We give new rounding schemes for SDP relaxations for the problems of maximizing cubic polynomials over the unit sphere and the $n$-dimensional hypercube. In both cases, the resulting algorithms yield a $O(\sqrt{n/k})$ multiplicative…
A {\em local graph partitioning algorithm} finds a set of vertices with small conductance (i.e. a sparse cut) by adaptively exploring part of a large graph $G$, starting from a specified vertex. For the algorithm to be local, its complexity…
In this paper we develop a classical algorithm of complexity $O(K \, 2^n)$ to simulate parametrized quantum circuits (PQCs) of $n$ qubits, where $K$ is the total number of one-qubit and two-qubit control gates. The algorithm is developed by…
Intersection homology is defined for simplicial, singular and PL chains and it is well known that the three versions are isomorphic for a full filtered simplicial complex. In the literature, the isomorphism, between the singular and the…
We apply the homomorphism complex construction to partially ordered sets, introducing a new topological construction based on the set of maximal chains in a graded poset. Our primary objects of study are distributive lattices, with special…
We investigate the set of partial partitions of a finite set, ordered by inclusion. With this ordering the set of partial partitions can be studied as an abstract simplicial complex. We use the theory of shellable nonpure complexes to find…
The goal of this paper is to offer a new construction of the de Rham-Witt complex of smooth varieties over perfect fields of characteristic $p>0$. We introduce a category of cochain complexes equipped with an endomorphism $F$ of underlying…