相关论文: Optimal Triangulation of Regular Simplicial Sets

The Catalan simplicial set $\mathbb{C}$ is known to classify skew-monoidal categories in the sense that a map from $\mathbb{C}$ to a suitably defined nerve of $\mathrm{Cat}$ is precisely a skew-monoidal category \cite{Catalan1}. We extend…

Graph Neural Networks have a limitation of solely processing features on graph nodes, neglecting data on high-dimensional structures such as edges and triangles. Simplicial Convolutional Neural Networks (SCNN) represent higher-order…

The Barratt-Eccles operad is a simplicial operad formed by the classical homogeneous bar construction of the symmetric groups. We prove that these simplicial sets decompose as unions of prisms indexed by surjections. We observe that the…

Many monoidal-type objects are known to be classified by maps from the Catalan simplicial set $\mathbb{C}$ to various nerves of categories and higher categories. There are, for example, three different nerves of the 2-category of categories…

We consider triangulations of closed surfaces S with a given set of vertices V; every triangulation can be branched that is enhanced to a Delta-complex. Branched triangulations are considered up to the b-transit equivalence generated by…

A good cover in R^d is a collection of open contractible sets in R^d such that the intersection of any subcollection is either contractible or empty. Motivated by an analogy with convex sets, intersection patterns of good covers were…

A triangulation of a simplicial complex $\Delta$ is called uniform if the $f$-vector of its restriction to a face of $\Delta$ depends only on the dimension of that face. This paper proves that the entries of the $h$-vector of a uniform…

We extend the notion of the nerve of a category for a small class of crossed simplicial groups, explicitly describing them using generators and relations. We do this by first considering a generalised bar construction of a group before…

Casual structure can take the form of cone bundles on a manifold, more general local preorders on a topological space, or simplicial orientations implicit in a simplicial set. This note takes a triangulation of a conal manifold M to mean an…

For any category ${\mathcal E}$ and monad $T$ thereon, we introduce the notion of $T$-simplicial object in ${\mathcal E}$. Any $T$-category in the sense of Burroni induces a $T$-simplicial object as its nerve. This nerve construction…

We investigate the decomposition of a set $X$, which positively spans the Euclidean space $\mathbb{R}^{d}$ into a set of minimal positive bases, we call simplices, and into maximal sets positively spanning pointed cones, i.e. cones with…

For each finite Coxeter group $W$ and each standard Coxeter element of $W$, we construct a triangulation of the $W$-permutahedron. For particular realizations of the $W$-permutahedron, we show that this is a regular triangulation induced by…

In this paper we show that any $\infty$-operad is equivalent to the localization of a discrete $\Sigma$-free operad, working in the formalism of dendroidal sets. The key point is defining the root functor of a dendroidal set $X$, a functor…

Consider 2n points on the unit circle and a reference dissection D of the convex hull of the odd points. The accordion complex of D is the simplicial complex of subsets of pairwise noncrossing diagonals with even endpoints that cross a…

We propose a novel algorithm called Backpropagation Neural Tree (BNeuralT), which is a stochastic computational dendritic tree. BNeuralT takes random repeated inputs through its leaves and imposes dendritic nonlinearities through its…

In this paper we prove that every definable set has a definable triangulation which is locally Lipschitz and weakly bi-Lipschitz on the natural simplicial stratification of the simplicial complex. We also distinguish a class T of regularity…

We introduce a notion of normalised oplax $3$-functor suitable for the elementary homotopy theory of strict $3$-categories, following the combinatorics of orientals. We show that any such morphism induces a morphism of simplicial sets…

If X and Y are orthogonal hyperdefinable sets such that X is simple, then any group G interpretable in (X,Y) has a normal hyperdefinable X-internal subgroup N such that G/N is Y-internal; N is unique up to commensurability. In order to make…

A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum-weight triangulation (MWT) problem, we are looking for a triangulation of a given point set that minimizes the sum of the edge…

Simplicial complexes are gaining increasing scientific attention as they are generalized network structures that can represent the many-body interactions existing in complex systems raging from the brain to high-order social networks.…