Related papers: Computing the Homology of Semialgebraic Sets I: La…
We present an efficient method for the computation of homogenized coefficients of divergence-form operators with random coefficients. The approach is based on a multiscale representation of the homogenized coefficients. We then implement…
This paper presents a new algorithm for the convex hull problem, which is based on a reduction to a combinatorial decision problem POLYTOPE-COMPLETENESS-COMBINATORIAL, which in turn can be solved by a simplicial homology computation. Like…
In this paper we investigate how to estimate the hardness of Boolean satisfiability (SAT) encodings for the Logical Equivalence Checking problem (LEC). Meaningful estimates of hardness are important in cases when a conventional SAT solver…
We prove new upper bounds on homotopy and homology groups of o-minimal sets in terms of their approximations by compact o-minimal sets. In particular, we improve the known upper bounds on Betti numbers of semialgebraic sets defined by…
We describe an essential improvement of our recent algorithm for computing cohomology of Lie (super)algebra based on partition of the whole cochain complex into minimal subcomplexes. We replace the arithmetic of rational numbers or integers…
Studying distributed computing through the lens of algebraic topology has been the source of many significant breakthroughs during the last two decades, especially in the design of lower bounds or impossibility results for deterministic…
Given complex numbers $w_1, \ldots, w_n$, we define the weight $w(X)$ of a set $X$ of 0-1 vectors as the sum of $w_1^{x_1} \cdots w_n^{x_n}$ over all vectors $(x_1, \ldots, x_n)$ in $X$. We present an algorithm, which for a set $X$ defined…
An efficient algorithm is proposed for Bayesian model calibration, which is commonly used to estimate the model parameters of non-linear, computationally expensive models using measurement data. The approach is based on Bayesian statistics:…
A smoothing algorithm is presented for solving the soft-margin Support Vector Machine (SVM) optimization problem with an $\ell^{1}$ penalty. This algorithm is designed to require a modest number of passes over the data, which is an…
We will find a lower bound on the recognition complexity of the theories that are nontrivial relative to some equivalence relation (this relation may be equality), namely, each of these theories is consistent with the formula, whose sense…
Deep learning methods have demonstrated outstanding performances on classification and regression tasks on homogeneous data types (e.g., image, audio, and text data). However, tabular data still pose a challenge, with classic machine…
We present a quantum algorithm for systems of (possibly inhomogeneous) linear ordinary differential equations with constant coefficients. The algorithm produces a quantum state that is proportional to the solution at a desired final time.…
We develop a quantum topological data analysis (QTDA) protocol based on the estimation of the density of states (DOS) of the combinatorial Laplacian. Computing topological features of graphs and simplicial complexes is crucial for analyzing…
We compute the l^2-Betti numbers of the complement of a finite collection of affine hyperplanes in complex space. At most one of the l^2-Betti numbers is non-zero.
This paper depicts algorithms for solving the decision Boolean Satisfiability Problem. An extreme problem is formulated to analyze the complexity of algorithms and the complexity for solving it. A novel and easy reformulation as a lottery…
We propose a decomposition framework for the parallel optimization of the sum of a differentiable function and a (block) separable nonsmooth, convex one. The latter term is typically used to enforce structure in the solution as, for…
A linear constraint is given on the Betti numbers of a compact hyper-Kaehler manifold, using an index formula for c_1c_{n-1} on an almost complex manifold. The topology of some other manifolds with reduced holonomy is also discussed…
We describe a recursive algorithm that decomposes an algebraic set into locally closed equidimensional sets, i.e. sets which each have irreducible components of the same dimension. At the core of this algorithm, we combine ideas from the…
This article explores Rota-Baxter operators on finite-dimensional $\omega$-Lie algebras over a field of characteristic not 2. We provide several methods for constructing left-symmetric algebras, $\omega$-Lie algebras, and Hom-Lie algebras…
Finding an optimal parameter of a black-box function is important for searching stable material structures and finding optimal neural network structures, and Bayesian optimization algorithms are widely used for the purpose. However, most of…