Related papers: The generic combinatorial simplex
In the present paper, we show that many combinatorial and topological objects, such as maps, hypermaps, three-dimensional pavings, constellations and branched coverings of the two--sphere admit any given finite automorphism group. This…
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…
An abstract simplicial complex is said to be $d$-representable if it records the intersection pattern of a collection of convex sets in $\mathbb{R}^d$. In this paper, we show that $d$-representability of a simplicial complex is equivalent…
We establish a regular sampling theory in the range of the analysis operator of a continuous frame having a unitary structure. The unitary structure is related with a unitary representation of a locally compact abelian group on a separable…
In the field of mathematics, a purely combinatorial equivalent to a simplicial complex, or more generally, a down-set, is an abstract structure known as a family of sets. This family is closed under the operation of taking subsets, meaning…
The present paper is motivated by the need to generalize the construction of the Scarf complex in order to give combinatorial resolutions of a much broader class of modules than just the monomial ideals. For any subset $A\subseteq…
The goal of this article is to study some basic algebraic and combinatorial properties of "generalized $n$-series" over a commutative ring $R$, which are functions $s: \mathbf{Z}_{\geq 0} \to R$ satisfying a mild condition. A special…
We study a number of local and global classification problems in generalized complex geometry. In the first topic, we characterize the local structure of generalized complex manifolds by proving that a generalized complex structure near a…
Here are versions of the proofs of two classic theorems of combinatorial topology. The first is the result that piecewise linearly homeomorphic simplicial complexes are related by stellar moves. This is used in the proof, modelled on that…
We call a real algebraic hypersurface in $(\mathbb{C}^*)^n$ simplicial if it is given by a real Laurent polynomial in $n$-variables that has exactly $n+1$ monomials with non-zero coefficients and such that the convex hull in $\mathbb{R}^n$…
We compare various viewpoints on down-sets (simplicial complexes), illustrating how the combinatorial inclusion-exclusion principle may serve as an alternative to more advanced methods of studying their face numbers.
A (simple) hypergraph is a family H of pairwise incomparable sets of a finite set. We say that a hypergraph H is a domination hypergraph if there is at least a graph G such that the collection of minimal dominating sets of G is equal to H.…
We take a unifying and new approach toward polynomial and trigonometric approximation in an arbitrary number of variables, resulting in a precise and general ready-to-use tool that anyone can easily apply in new situations of interest. The…
We prove that every combinatorial dynamical system in the sense of Forman, defined on a family of simplices of a simplicial complex, gives rise to a multivalued dynamical system F on the geometric realization of the simplicial complex.…
The image of the branch set of a PL branched cover between PL $n$-manifolds is a simplicial $(n-2)$-complex. We demonstrate that the reverse implication also holds: an open and discrete map $f \colon \mathbb{S}^n \to \mathbb{S}^n$ with the…
A graph is said to be well-dominated if all its minimal dominating sets are of the same size. The class of well-dominated graphs forms a subclass of the well studied class of well-covered graphs. While the recognition problem for the class…
In a previous work, we have associated a complete differential graded Lie algebra to any finite simplicial complex in a functorial way. Similarly, we have also a realization functor from the category of complete differential graded Lie…
We introduce a new framework of counting problems called #GDS that encompasses #$(\sigma, \rho)$-Set, a class of domination-type problems that includes counting dominating sets and counting total dominating sets. We explore the intricate…
Since the end of the XIXth century, we know that each birational map of the complex projective plane is the product of a finite number of quadratic birational maps of the projective plane; this motivates our work which essentially deals…
A simplicial set is said to be non-singular if its non-degenerate simplices are embedded. Let $sSet$ denote the category of simplicial sets. We prove that the full subcategory $nsSet$ whose objects are the non-singular simplicial sets…