Related papers: Subdivision of Simplicial Complex
We generalize regular subdivisions (polyhedral complexes resulting from the projection of the lower faces of a polyhedron) introducing the class of recursively-regular subdivisions. Informally speaking, a recursively-regular subdivision is…
We study when co-evolving (or adaptive) higher-order networks defined on directed hypergraphs admit a simplicial description. Binary and triadic couplings are modelled by time-dependent weight tensors. Using representation theory of the…
Complex networks can be used to represent complex systems which originate in the real world. Here we study a transformation of these complex networks into simplicial complexes, where cliques represent the simplices of the complex. We extend…
Providing an abstract representation of natural and human complex structures is a challenging problem. Accounting for the system heterogenous components while allowing for analytical tractability is a difficult balance. Here I introduce…
We study the realizability of simplicial complexes with a given pair of integer sequences, representing the node degree distribution and the facet size distribution, respectively. While the $s$-uniform variant of the problem is…
A hypergraph can be obtained from a simplicial complex by deleting some non-maximal simplices. By [11], a hypergraph gives an associated simplicial complex. By [4], the embedded homology of a hypergraph is the homology of the infimum chain…
By the simple finite element method, we study the symplectic, multisymplectic structures and relevant preserving properties in some semi-linear elliptic boundary value problem in one-dimensional and two-dimensional spaces respectively. We…
We present a novel barycentric interpolation algorithm designed for analytic functions $f\in\mathcal{A}(E)$ defined on the complex plane. The algorithm, which encompasses both polynomial and rational interpolation, is tailored to handle…
We introduce harmonic persistent homology spaces for filtrations of finite simplicial complexes. As a result we can associate concrete subspaces of cycles to each bar of the barcode of the filtration. We prove stability of the harmonic…
Simplicial arrangements are classical objects in discrete geometry. Their classification remains an open problem but there is a list conjectured to be complete at least for rank three. A further important class in the theory of hyperplane…
We study distance relations in various simplicial complexes associated with low-dimensional manifolds. In particular, complexes satisfying certain topological conditions with vertices as simple multi-curves. We obtain bounds on the…
Dictionary learning for sparse representations has been successful in many reconstruction tasks. Simplicial learning is an adaptation of dictionary learning, where subspaces become clipped and acquire arbitrary offsets, taking the form of…
We investigate the collapsibility of systolic finite simplicial complexes of arbitrary dimension. The main tool we use in the proof is discrete Morse theory. We shall consider a convex subcomplex of the complex and project any simplex of…
A characterization is presented of barycenters of the Radon probability measures supported on a closed convex subset of a given space. A case of particular interest is studied, where the underlying space is itself the space of finite signed…
The paper contains an exposition of part of topology using partitions of unity. The main idea is to create variants of the Tietze Extension Theorem and use them to derive classical theorems. This idea leads to a new result generalizing…
Clustering of mixed-type datasets can be a particularly challenging task as it requires taking into account the associations between variables with different level of measurement, i.e., nominal, ordinal and/or interval. In some cases,…
We present an optimization model defined on the manifold of the set of stochastic matrices. Geometrically, the model is akin to identifying a maximum-volume $n$-dimensional simplex that has a given barycenter and is enclosed by the…
Generalizing pseudospherical drawings, we introduce a new class of simple drawings, which we call separable drawings. In a separable drawing, every edge can be closed to a simple curve that intersects each other edge at most once. Curves of…
A simplicial complex is a generalization of a graph: a collection of n-ary relationships (instead of binary as the edges of a graph), named simplices. In this paper, we develop a new tool to study the structure of simplicial complexes: we…
Biological and physical systems often exhibit distinct structures at different spatial/temporal scales. Persistent homology is an algebraic tool that provides a mathematical framework for analyzing the multi-scale structures frequently…