Related papers: Different versions of the nerve theorem and rainbo…
Tensor networks (TNs) have been gaining interest as multiway data analysis tools owing to their ability to tackle the curse of dimensionality and to represent tensors as smaller-scale interconnections of their intrinsic features. However,…
We use the topology of simplicial complexes to model political structures following [1]. Simplicial complexes are a natural tool to encode interactions in the structures since a simplex can be used to represent a subset of compatible…
Topological Neural Networks (TNNs) incorporate higher-order relational information beyond pairwise interactions, enabling richer representations than Graph Neural Networks (GNNs). Concurrently, topological descriptors based on persistent…
Graph Neural Networks (GNNs), despite achieving remarkable performance across different tasks, are theoretically bounded by the 1-Weisfeiler-Lehman test, resulting in limitations in terms of graph expressivity. Even though prior works on…
We provide an upper bound on the number of neurons required in a shallow neural network to approximate a continuous function on a compact set with a given accuracy. This method, inspired by a specific proof of the Stone-Weierstrass theorem,…
We describe a category of undirected graphs which comes equipped with a faithful functor into the category of (colored) modular operads. The associated singular functor from modular operads to presheaves is fully faithful, and its essential…
For any flag simplicial complex $\Theta$ obtained by stellar subdividing the boundary of the cross polytope in edges, we define a flag simplicial complex $\Gamma(\Theta)$ (dependent on the sequence of subdivisions) whose $f$-vector is the…
In a recent work [2] with Datta, we introduced the mu vector (with respect to a given field) of simplicial complexes and used it to study tightness and lower bounds. In this paper, we modify the definition of mu vectors. With the new…
We introduce necklicial nerve functors from enriched categories to simplicial sets, which include Cordier's homotopy coherent, Lurie's differential graded and Le Grignou's cubical nerves. It is shown that every necklicial nerve can be…
We consider a generalization of the classic Sperner lemma. This lemma states that every Sperner coloring of a triangulation of a simplex contains a fully colored simplex. We found a weaker assumption than Sperner's coloring. It is also…
In this revised form, the proof of the principal lemma has been simplified and the main theorem has been extended to all characteristics for those varieties which are smooth in codimension one. This principal theorem essentially says the…
Although neural networks traditionally are typically used to approximate functions defined over $\mathbb{R}^n$, the successes of graph neural networks, point-cloud neural networks, and manifold deep learning among other methods have…
We prove the following variant of Levi's Enlargement Lemma: for an arbitrary arrangement $\mathcal{A}$ of $x$-monotone pseudosegments in the plane and a pair of points $a,b$ with distinct $x$-coordinates and not on the same pseudosegment,…
In this paper, we develop the concept of multiple cylinder of relations which is a generalization of the relation cylinder, extending the multiple non-Hausdorff mapping cylinder to sequences of finite T0-spaces linked by a series of…
Szemeredi's Regularity Lemma is a very useful tool of extremal combinatorics. Recently, several refinements of this seminal result were obtained for special, more structured classes of graphs. We survey these results in their rich…
The fibre theorem \cite{schm2003} for the moment problem on closed semi-algebraic subsets of $\R^d$ is generalized to finitely generated real unital algebras. As an application two new theorems on the rational multidimensional moment…
This work is motivated by the following question in data-driven study of dynamical systems: given a dynamical system that is observed via time series of persistence diagrams that encode topological features of solutions snapshots, what…
We introduce the theory of strong homotopy types of simplicial complexes. Similarly to classical simple homotopy theory, the strong homotopy types can be described by elementary moves. An elementary move in this setting is called a strong…
This paper continues the development of a simplicial theory of weak omega-categories, by studying categories which are enriched in weak complicial sets. These complicial Gray-categories generalise both the Kan complex enriched categories of…
The Carpenter's Rule Theorem states that any chain linkage in the plane can be folded continuously between any two configurations while preserving the bar lengths and without the bars crossing. However, this theorem applies only to strictly…