Related papers: Discrete Morse Complexes
We present a family of complete acyclic Morse matchings on the face lattice of a hypersimplex. Since a hypersimplex is a convex polytope, there is a natural way to form a CW complex from its faces. In a future paper we will utilize these…
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…
We study the presence of abelian discrete symmetries in globally consistent orientifold compactifications based on rational conformal field theory. We extend previous work [1] by allowing the discrete symmetries to be a linear combination…
We introduce the Schur class of functions, discrete analytic on the integer lattice in the complex plane. As a special case, we derive the explicit form of discrete analytic Blaschke factors and solve the related basic interpolation…
We consider the general model for dynamical systems defined on a simplicial complex. We describe the conjugacy classes of these systems and show how symmetries in a given simplicial complex manifest in the dynamics defined thereon,…
For a simplicial complex K on m vertices and simplicial complexes K1,...,Km a composed simplicial complex K(K1,...,Km) is introduced. This construction generalizes an iterated simplicial wedge construction studied by A. Bahri, M. Bendersky,…
We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.
It is known that the suspension of a simplicial complex can be realized with only one additional point. Suitable iterations of this construction generate highly symmetric simplicial complexes with various interesting combinatorial and…
This article deals with the notion of factorability. Elements of a factorable group or monoid possess a normal form, which leads to a small complex homotopy equivalent to its bar complex, thus computing its homology. We investigate the…
The edge group of a simplicial complex is a well-known, combinatorial version of the fundamental group. It is a group associated to a simplicial complex that consists of equivalence classes of edge loops and that is isomorphic to the…
We show how to construct homology bases for certain CW complexes in terms of discrete Morse theory and cellular homology. We apply this technique to study certain subcomplexes of the half cube polytope studied in previous works. This…
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…
On symplectic manifolds, we introduce a Morse-type complex with elements generated by pairs of critical points of a Morse function. The differential of the complex consists of gradient flows and an integration of the symplectic structure…
To a complex polynomial function $f$ with arbitrary singularities we associate the number of Morse points in a general linear Morsification $f_{t} := f - t\ell$. We produce computable algebraic formulas in terms of invariants of $f$ for the…
We survey a research program on the strong convergence of unitary and permutation representations of discrete groups. We also take the opportunity to flesh out details that have not appeared elsewhere.
We introduce a combinatorial characterization of simpliciality for arrangements of hyperplanes. We then give a sharp upper bound for the number of hyperplanes of such an arrangement in the projective plane over a finite field, and present…
A novel basis of discrete analytic polynomials on a rhombic lattice is introduced and the associated convolution product is studied. A class of discrete analytic functions that are rational with respect to this product is also described.
In this paper, we investigate discrete topological complexity $TC(K)$ introduced for situations where the configuration space possesses a simplicial structure. %Simplicial complexes are well-known and commonly used in programming for…
We develop a new method to compute the homology groups of finite topological spaces (or equivalently of finite partially ordered sets) by means of spectral sequences giving a complete and simple description of the corresponding…
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…