Related papers: Algorithmic canonical stratifications of simplicia…
We provide a bottom up construction of torsion generators for weighted homology of a weighted complex over a discrete valuation ring $R=\mathbb{F}[[\pi]]$. This is achieved by starting from a basis for classical homology of the $n$-th…
Clustering is indispensable for data analysis in many scientific disciplines. Detecting clusters from heavy noise remains challenging, particularly for high-dimensional sparse data. Based on graph-theoretic framework, the present paper…
We use stratified Morse theory to construct a complex to compute the cohomology of the complement of a hyperplane arrangement with coefficients in a complex rank one local system. The linearization of this complex is shown to be the…
With the emergence of Artificial Intelligence, numerical algorithms are moving towards more approximate approaches. For methods such as PCA or diffusion maps, it is necessary to compute eigenvalues of a large matrix, which may also be dense…
Thanks to the locality principle, separation logics support modular, scalable analysis of large codebases by relying on local axioms and frame rules to focus only on the heap fragments required for verification. However, depending on the…
For any real-analytic hypersurface M in complex euclidean space of dimension >= 2 which does not contain any complex-analytic subvariety of positive dimension, we show that for every point p in M the local real-analytic CR automorphisms of…
The realization problem asks: When does an algebraic complex arise, up to homotopy, from a geometric complex? In the case of 2- dimensional algebraic complexes, this is equivalent to the D2 problem, which asks when homological methods can…
In this work we use Hodge theoretic methods to study homotopy types of complex projective manifolds with arbitrary fundamental groups. The main tool we use is the \textit{schematization functor} $X \mapsto (X\otimes \mathbb{C})^{sch}$,…
We present a parallelizable algorithm for computing the persistent homology of a filtered chain complex. Our approach differs from the commonly used reduction algorithm by first computing persistence pairs within local chunks, then…
We describe an algorithm that associates to each positive real number $r$ and each finite collection $C_r$ of planar pixels of size $r$ a planar piecewise linear set $S_r$ with the following additional property: if $C_r$ is the collection…
Let $X=\C^n$. In this paper we present an algorithm that computes the de Rham cohomology groups $H^i_{dR}(U,\C)$ where $U$ is the complement of an arbitrary Zariski-closed set $Y$ in $X$. Our algorithm is a merger of the algorithm given by…
In this paper, we establish the local superlinear convergence property of some polynomial-time interior-point methods for an important family of conic optimization problems. The main structural property used in our analysis is the…
A theory of numerical path-following in toric varieties was suggested in two previous papers. The motivation is solving systems of polynomials with real or complex coefficients. When those polynomials are not assumed 'dense', solving them…
We introduce some polynomial and analytic methods in the classification program for the complexity of planar graph homomorphisms. These methods allow us to handle infinitely many lattice conditions and isolate the new P-time tractable…
We study the efficient approximability of basic graph and logic problems in the literature when instances are specified hierarchically as in \cite{Le89} or are specified by 1-dimensional finite narrow periodic specifications as in…
In this paper we consider the classical maximum set packing problem where set cardinality is upper bounded by $k$. We show how to design a variant of a polynomial-time local search algorithm with performance guarantee $(k+2)/3$. This local…
Fix a finite group $G$. We analyze the computational complexity of the problem of counting homomorphisms $\pi_1(X) \to G$, where $X$ is a topological space treated as computational input. We are especially interested in requiring $G$ to be…
The local multiplicities of the Maxwell sets in the spaces of versal deformations of Pham holomorphic function singularities are calculated. A similar calculation for some other bifurcation sets (generalized Stokes' sets) defined by more…
We propose a new algorithm for curve skeleton computation which differs from previous algorithms by being based on the notion of local separators. The main benefits of this approach are that it is able to capture relatively fine details and…
Consider a set $P$ of $n$ points picked uniformly and independently from $[0,1]^d$ for a constant dimension $d$ -- such a point set is extremely well behaved in many aspects. For example, for a fixed $r \in [0,1]$, we prove a new…