Related papers: Computing Minimal Presentations and Bigraded Betti…
This paper shows that Cohen-Macaulay algebras can be algebraically approximated in such a way that their Cohen-Macaulayness and minimal Betti numbers are preserved. This is achieved by showing that finitely generated modules over power…
The exact computation of the matching distance for multi-parameter persistence modules is an active area of research in computational topology. Achieving an easily obtainable exact computation of this distance would permit multi-parameter…
We propose a method for low-rank semidefinite programming in application to the semidefinite relaxation of unconstrained binary quadratic problems. The method improves an existing solution of the semidefinite programming relaxation to…
Let $\mathcal{L}$ be a rank one local system with field coefficient on the complement $M(\mathcal{A})$ of an essential complex hyperplane arrangement $\mathcal{A}$ in $\mathbb{C}^\ell$. Dimca-Papadima and Randell independently showed that…
Topological data analysis (TDA) is a rapidly growing area that applies techniques from algebraic topology to extract robust features from large-scale data. A key task in TDA is the estimation of (normalized) Betti numbers, which capture…
An effective technique for solving optimization problems over massive data sets is to partition the data into smaller pieces, solve the problem on each piece and compute a representative solution from it, and finally obtain a solution…
Persistent homology, an algebraic method for discerning structure in abstract data, relies on the construction of a sequence of nested topological spaces known as a filtration. Two-parameter persistent homology allows the analysis of data…
Bilevel optimization has been widely applied in many important machine learning applications such as hyperparameter optimization and meta-learning. Recently, several momentum-based algorithms have been proposed to solve bilevel optimization…
We consider the numerical solution of large-scale M-matrix algebraic Riccati equations with low-rank structures. We derive a new doubling iteration, decoupling the four original iteration formulae in the alternating-directional doubling…
We compute low-dimensional K-groups of certain rings associated with the study of the Hermite ring conjecture. This includes a monoid ring whose low-dimensional K-groups were recently computed by Krishna and Sarwar in the case where the…
We use duality theorems to obtain presentations of some categories of modules. To derive these presentations we generalize a result of Cautis-Kamnitzer-Morrison [arXiv:1210.6437v4]: Let $\mathfrak{g}$ be a reductive Lie algebra, and $A$ an…
Let $P$ be a finite partially ordered set with unique minimal element $\hat{0}$. We study the Betti poset of $P$, created by deleting elements $q\in P$ for which the open interval $(\hat{0}, q)$ is acyclic. Using basic simplicial topology,…
An important problem in computational topology is to calculate the homology of a space from samples. In this work, we develop a statistical approach to this problem by calculating the expected rank of an induced map on homology from a…
Random abstract simplicial complex representation provides a mathematical description of wireless networks and their topology. In order to reduce the energy consumption in this type of network, we intend to reduce the number of network…
In this paper, we obtain a combinatorial formula for computing the Betti numbers in the linear strand of edge ideals of bipartite Kneser graphs. We deduce lower and upper bounds for regularity of powers of edge ideals of these graphs in…
The chief aim of this paper is to describe a procedure which, given a $d$-dimensional absolutely irreducible matrix representation of a finite group over a finite field $\mathbb{E}$, produces an equivalent representation such that all…
We analyze the bit complexity of efficient algorithms for fundamental optimization problems, such as linear regression, $p$-norm regression, and linear programming (LP). State-of-the-art algorithms are iterative, and in terms of the number…
Let M in k[x,y] be a monomial ideal M=(m_1,m_2,...,m_r), where the m_i are a minimal generating set of M. We construct an explicit free resolution of k over S=k[x,y]/M for all monomial ideals M, and provide recursive formulas for the Betti…
We begin by introducing schemes of binoids, invertible $\mathcal{O}_M$-sets and cohomology of sheaves of abelian groups defined on schemes of binoids. We define the so-called punctured combinatorial \v{C}ech-Picard complex, whose first…
We consider the problem of efficiently computing a discrete Morse complex on simplicial complexes of arbitrary dimension and very large size. Based on a common graph-based formalism, we analyze existing data structures for simplicial…