中文
相关论文

相关论文: Different versions of the nerve theorem and rainbo…

200 篇论文

One can associate to any strict globular $\omega$-category three augmented simplicial nerves called the globular nerve, the branching and the merging semi-cubical nerves. If this strict globular $\omega$-category is freely generated by a…

代数拓扑 · 数学 2007-05-23 Philippe Gaucher

One widely applied sufficient condition for the existence of a colorful simplex in a vertex-colored simplicial complex is a topological extension of Hall's transversal theorem due to Aharoni, Haxell, and Meshulam. We prove a similar…

组合数学 · 数学 2025-11-10 Ronen Wdowinski

Thomason's Homotopy Colimit Theorem has been extended to bicategories and this extension can be adapted, through the delooping principle, to a corresponding theorem for diagrams of monoidal categories. In this version, we show that the…

范畴论 · 数学 2011-03-24 A. R. Garzón , R. Pérez

Fr\'ed\'eric Meunier's question about a multicolored Sperner lemma is addressed, leaving the question of connectivity for the color hypergraphs of such a multicolored simplex. Sperner's lemma asserts the existence of a simplex using all the…

组合数学 · 数学 2012-09-04 Eric Babson

The most natural notion of a simplicial nerve for a (weak) bicategory was given by Duskin, who showed that a simplicial set is isomorphic to the nerve of a $(2,1)$-category (i.e. a bicategory with invertible $2$-morphisms) if and only if it…

范畴论 · 数学 2014-01-31 Nathaniel Watson

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…

范畴论 · 数学 2026-03-13 Soichiro Fujii , Stephen Lack

The well-known conditions for a simplicial set to be the nerve of a small category generalize with respect to two parameters: the dimension n of the things which compose, and the position i of the thing which is the result of the…

范畴论 · 数学 2022-10-26 Paul Glenn

The language of graph theory, or network science, has proven to be an exceptional tool for addressing myriad problems in neuroscience. Yet, the use of networks is predicated on a critical simplifying assumption: that the quintessential unit…

神经元与认知 · 定量生物学 2016-01-14 Chad Giusti , Robert Ghrist , Danielle S. Bassett

Universality theorems (in the sense of N. Mn\"{e}v) claim that the realization space of a combinatorial object (a point configuration, a hyperplane arrangement, a convex polytope, etc.) can be arbitrarily complicated. In the paper, we prove…

组合数学 · 数学 2019-10-30 Gaiane Panina

We define and study a homological version of Sullivan's rational de Rham complex for simplicial sets. This new functor can be generalised to simplicial symmetric spectra and in that context it has excellent categorical properties which…

代数拓扑 · 数学 2008-10-13 Neil Strickland

The universal approximation theorem states that a neural network with one hidden layer can approximate continuous functions on compact sets with any desired precision. This theorem supports using neural networks for various applications,…

机器学习 · 计算机科学 2024-08-13 Marcos Eduardo Valle , Wington L. Vital , Guilherme Vieira

The universal approximation theorem asserts that a single hidden layer neural network approximates continuous functions with any desired precision on compact sets. As an existential result, the universal approximation theorem supports the…

机器学习 · 计算机科学 2023-09-15 Wington L. Vital , Guilherme Vieira , Marcos Eduardo Valle

In this paper we introduce a functor, called the simplicial nerve of an A-infinity category, defined on the category of (small) A-infinity categories with values in simplicial sets. We prove that the simplicial nerve of any A-infinity…

代数拓扑 · 数学 2017-02-08 Giovanni Faonte

Recently, neural network architectures have been developed to accommodate when the data has the structure of a graph or, more generally, a hypergraph. While useful, graph structures can be potentially limiting. Hypergraph structures in…

代数拓扑 · 数学 2020-12-14 Eric Bunch , Qian You , Glenn Fung , Vikas Singh

We develop a topological lens on relational schema design by encoding functional dependencies (FDs) as simplices of an abstract simplicial complex. This dependency complex exposes multi-attribute interactions and enables homological…

数据库 · 计算机科学 2026-02-26 Bilge Senturk , Faruk Alpay

We introduce the notion of doubling and r-tupling for simplicial complexes, a notion reminiscent to that of matching complexes in graph theory. We prove a connectivity result for such complexes and relate r-tupling to stabilizing r times…

组合数学 · 数学 2025-06-13 Kathryn Lesh , Bridget Schreiner , Nathalie Wahl

The general goal of this paper is to gather and review several methods from homotopy and combinatorial topology and formal concepts analysis (FCA) and analyze their connections. FCA appears naturally in the problem of combinatorial…

代数拓扑 · 数学 2019-11-14 Anton Ayzenberg

We establish a Quillen equivalence relating the homotopy theory of Segal operads and the homotopy theory of simplicial operads, from which we deduce that the homotopy coherent nerve functor is a right Quillen equivalence from the model…

代数拓扑 · 数学 2014-02-26 Denis-Charles Cisinski , Ieke Moerdijk

We show that the nerve of a strict omega-category can be described algebraically as a simplicial set with additional operations subject to certain identities. The resulting structures are called sets with complicial identities. We also…

范畴论 · 数学 2013-09-03 Richard Steiner

We study a variety of natural constructions from topological combinatorics, including matching complexes as well as other graph complexes, from the perspective of the graph minor category of \parencite{MiProRa}. We prove that these…

组合数学 · 数学 2023-04-17 Dane Miyata , Eric Ramos