Related papers: Decision trees, monotone functions, and semimatroi…
The probabilistic satisfiability of a logical expression is a fundamental concept known as the partition function in statistical physics and field theory, an evaluation of a related graph's Tutte polynomial in mathematics, and the…
Let X be a k-dimensional simplicial complex such that the (k-j-2)-dimensional homology of the links of all j-dimensional simplices in X vanishes. An upper bound is given on the (k-1)-th Betti number of X. Examples based on sum complexes…
Decision tree learning is increasingly being used for pointwise inference. Important applications include causal heterogenous treatment effects and dynamic policy decisions, as well as conditional quantile regression and design of…
We describe and analyze an algorithm for computing the homology (Betti numbers and torsion coefficients) of basic semialgebraic sets which works in weak exponential time. That is, out of a set of exponentially small measure in the space of…
It is folklore that tree-width is monotone under taking subgraphs (i.e. injective graph homomorphisms) and contractions (certain kinds of surjective graph homomorphisms). However, although tree-width is obviously not monotone under any…
We prove that multigraded Betti numbers of a simplicial forest are always either 0 or 1. Moreover a nonzero multidegree appears exactly at one homological degree in the resolution. Our work generalizes work of Bouchat on edge ideals of…
A multicomplex structure is defined from an ordered lattice of multigraphs. This structure will help us to observe the features of Persistent Homology in this context, its interaction with the ordering and the repercussions of the process…
We prove a conjecture of Courcelle, which states that a graph property is definable in MSO with modular counting predicates on graphs of constant treewidth if, and only if it is recognizable in the following sense: constant-width tree…
We study the cohomology of the generic determinantal varieties $M_{m,n}^s = \{ \varphi \in \mathbb C^{m\times n} : \mathrm{rank} \varphi <s \}$, their polar multiplicities, their sections $D_k \cap M_{m,n}^s$ by generic hyperplanes $D_k$ of…
We study Morse theory on noncompact manifolds equipped with exhaustions by compact pieces, defining the Morse homology of a pair which consists of the manifold and related geometric/homotopy data. We construct a collection of Morse data…
This is a survey article on trees, with a modest number of proofs to give a flavor of the way these topologies can be efficiently handled. Trees are defined in set-theorist fashion as partially ordered sets in which the elements below each…
The paper presents an algorithm for topological classification of nondegenerate saddle-focus singularities of integrable Hamiltonian systems with three degrees of freedom up to semi-local equivalence. In particular, we prove that any…
In this paper we state the homological domination principle for random multi-parameter simplicial complexes, claiming that the Betti number in one specific dimension (which is explicitly determined by the probability multi-parameter)…
A functorial semi-norm on singular homology is a collection of semi-norms on the singular homology groups of spaces such that continuous maps between spaces induce norm-decreasing maps in homology. Functorial semi-norms can be used to give…
Consider the configuration spaces of manifolds. An influential theorem of McDuff, Segal and Church shows that the (co)homology of the unordered configuration space is independent of number of points in a range of degree called the stable…
The cost functions considered are $c(x,y)=h(x-y)$, with $h\in C^2(R^n)$, homogeneous of degree $p\geq 2$, with positive definite Hessian in the unit sphere. We consider monotone maps $T$ concerning that cost and establish local…
We generalize the well-known "12" and "24" Theorems for reflexive polytopes of dimension 2 and 3 to any smooth reflexive polytope. Our methods apply to a wider category of objects, here called reflexive GKM graphs, that are associated with…
Developing an algorithm for computing the Betti numbers of semi-algebraic sets with singly exponential complexity has been a holy grail in algorithmic semi-algebraic geometry and only partial results are known. In this paper we consider the…
Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…
There has been considerable recent interest, primarily motivated by problems in applied algebraic topology, in the homology of random simplicial complexes. We consider the scenario in which the vertices of the simplices are the points of a…