Related papers: Computing Connection Matrices of Conley Complexes …
We construct a new class of maximal acyclic matchings on the Salvetti complex of a locally finite hyperplane arrangement. Using discrete Morse theory, we then obtain an explicit proof of the minimality of the complement. Our construction…
In 1983 Kalai proved an incredible generalisation of Cayley's formula for the number of trees on a labelled vertex set to a formula for a class of $r$-dimensional simplicial complexes. These simplicial complexes generalise trees by means of…
We study the homology of random \v{C}ech complexes generated by a homogeneous Poisson process. We focus on 'homological connectivity' - the stage where the random complex is dense enough, so that its homology "stabilizes" and becomes…
In recent years it has been noted that a number of combinatorial structures such as real and complex hyperplane arrangements, interval greedoids, matroids and oriented matroids have the structure of a finite monoid called a left regular…
We enumerate plane complex algebraic curves of a given degree with one singularity of any given topological type. Our approach is to compute the homology classes of the corresponding equisingular strata in the parameter spaces of plane…
A $2$-matching complex is a simplicial complex which captures the relationship between $2$-matchings of a graph. In this paper, we will use discrete Morse Theory and the Matching Tree Algorithm to prove homotopical results. We will consider…
The extension of persistent homology to multi-parameter setups is an algorithmic challenge. Since most computation tasks scale badly with the size of the input complex, an important pre-processing step consists of simplifying the input…
In this paper, we shall compute the chain complex and the corresponding homology of some Morse function $f$ over integer coefficients. The definition of the correct boundary operator requires a careful construction of moduli space of…
Correlation clustering is a technique for aggregating data based on qualitative information about which pairs of objects are labeled 'similar' or 'dissimilar.' Because the optimization problem is NP-hard, much of the previous literature…
The matrix chain problem consists in finding the parenthesization of a matrix product $M := A_1 A_2 \cdots A_n$ that minimizes the number of scalar operations. In practical applications, however, one frequently encounters more complicated…
We define a new numerical range of an n\timesn complex matrix in terms of correlation matrices and develop some of its properties. We also define a related numerical range that arises from Alain Connes' famous embedding problem.
There have been many matching pursuit algorithms (MPAs) which handle the sparse signal recovery problem a.k.a. compressed sensing (CS). In the MPAs, the correlation computation step has a dominant computational complexity. In this letter,…
We compute numerically the homology of several graph complexes in low loop orders, extending previous results.
Let A be a basic connected finite dimensional algebra over an algebraically closed field, let G be a group, let T be a basic tilting A-module and let B the endomorphism algebra of T. Under a hypothesis on T, we establish a correspondence…
We provide a combinatorial recipe for constructing all posets of height at most two for which the corresponding type-A Lie poset algebra is contact. In the case that such posets are connected, a discrete Morse theory argument establishes…
The topology of the matching complex for the $2\times n$ grid graph is mysterious. We describe a discrete Morse matching for a family of independence complexes $\mathrm{Ind}(\Delta_n^m)$ that include these matching complexes. Using this…
Decomposition techniques for linear programming are difficult to extend to conic optimization problems with general non-polyhedral convex cones because the conic inequalities introduce an additional nonlinear coupling between the variables.…
We present a matrix-theoretic approach for studying and enumerating finite posets through their incidence representations, referred to as poset matrices. Naturally labelled posets are encoded as Boolean lower triangular matrices, allowing a…
We present a method to compute integral cohomology of posets. This toolbox is applicable as soon as the sub-posets under each object possess certain structure. This is the case for simplicial complexes and simplex-like posets. The method is…
Projected Hartree-Fock theory provides an accurate description of many kinds of strong correlations but does not properly describe weakly-correlated systems. On the other hand, single-reference methods such as configuration interaction or…