Related papers: Topology of the view complex
This paper introduces path triangulation of points in a bounded, simply connected surface region, replacing ordinary triangles in a Delaunay triangulation with path triangles from homotopy theory. A {\bf path triangle} has a border that is…
Community detection in graphs is a problem that is likely to be relevant whenever network data appears, and consequently the problem has received much attention with many different methods and algorithms applied. However, many of these…
Collective synchronization in complex systems arises from the interplay between topology and dynamics, yet how to design and control such patterns in higher-order networks remains unclear. Here we show that a Dirac spectral programming…
We consider causal 3-dimensional triangulations with the topology of $S^2\times [0,1]$ or $D^2\times [0,1]$ where $S^2$ and $D^2$ are the two-dimensional sphere and disc, respectively. These triangulations consist of slices and we show that…
We introduce a notion of Morse shellings (and tilings) on finite simplicial complexes which extends the classical one and its relation to discrete Morse theory.Skeletons and barycentric subdivisions of Morse shellable (or tileable)…
In many areas of applied geometric/numeric computational mathematics, including geo-mapping, computer vision, computer graphics, finite element analysis, medical imaging, geometric design, and solid modeling, one has to compute incidences,…
Cluster varieties are geometric objects that have recently found applications in several areas of mathematics and mathematical physics. This thesis studies the geometry of a large class of cluster varieties associated to compact oriented…
Let $X$ be a smooth irreducible projective variety over a field $\mathbf{k}$ of dimension $d.$ Let $\tau: \mathbb{Q}_l\to \mathbb{C}$ be any field embedding. Let $f: X\to X$ be a surjective endomorphism. We show that for every…
The character table of the symmetric group $S_n$, of permutations of $n$ objects, is of fundamental interest in theoretical physics, combinatorics as well as computational complexity theory. We investigate the implications of an identity,…
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 first develop a general framework for Laplace operators defined in terms of the combinatorial structure of a simplicial complex. This includes, among others, the graph Laplacian, the combinatorial Laplacian on simplicial complexes, the…
In this paper, we use subword complexes to provide a uniform approach to finite type cluster complexes and multi-associahedra. We introduce, for any finite Coxeter group and any nonnegative integer k, a spherical subword complex called…
Let X,Y be finite sets and T a set of functions from X -> Y which we will call "tableaux". We define a simplicial complex whose facets, all of the same dimension, correspond to these tableaux. Such "tableau complexes" have many nice…
The mapping class group of a closed surface of genus $g$ is an extension of the Torelli group by the symplectic group. This leads to two natural problems: (a) compute (stably) the symplectic decomposition of the lower central series of the…
Simplicial complexes can be viewed as high dimensional generalizations of graphs that explicitly encode multi-way ordered relations between vertices at different resolutions, all at once. This concept is central towards detection of higher…
A well-known conjecture of Simon (1994) states that any pure $d$-dimensional shellable complex on $n$ vertices can be extended to $\Delta_{n-1}^{(d)}$, the $d$-skeleton of the $(n-1)$-dimensional simplex, by attaching one facet at a time…
The ordering of scalar fields after a phase transition in which a group $G$ of global symmetries is spontaneously broken to a subgroup $H$ provides a possible explanation for the origin of structure in the universe, as well as leading to…
A prominent self-supervised learning paradigm is to model the representations as clusters, or more generally as a mixture model. Learning to map the data samples to compact representations and fitting the mixture model simultaneously leads…
We develop a version of discrete Morse theory for finite regular CW complexes equipped with an auxiliary stratification. The key construction is the halo of a cell, which contains all those faces in the boundary that enter closed…
In connection with commutative algebra, Bayer et al. introduced cut complexes in [Topology of cut complexes of graphs, SIAM J.\ Discrete Math., 38(2):1630-1675, 2024]. For a positive integer $k$, the $k$-cut complex of a graph $G$, denoted…