中文
相关论文

相关论文: Diagrammatic sets and rewriting in weak higher cat…

200 篇论文

In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of $n$ definable sets belonging to some fixed definable family of sets in an o-minimal structure. This generalizes the…

组合数学 · 数学 2014-02-26 Saugata Basu

We present a computational implementation of diagrammatic sets, a model of higher-dimensional diagram rewriting that is "topologically sound": diagrams admit a functorial interpretation as homotopies in cell complexes. This has potential…

范畴论 · 数学 2023-08-01 Amar Hadzihasanovic , Diana Kessler

We introduce constructible directed complexes, a combinatorial presentation of higher categories inspired by constructible complexes in poset topology. Constructible directed complexes with a greatest element, called atoms, encompass common…

范畴论 · 数学 2019-09-18 Amar Hadzihasanovic

We implement a novel representation of model search spaces as diagrams over a category of models, where we have restricted attention to a broad class of models whose structure is presented by \C-sets. (Co)limits in these diagram categories…

计算机科学中的逻辑 · 计算机科学 2022-06-20 Kristopher Brown , Tyler Hanks , James Fairbanks

Polygraphs are a higher-dimensional generalization of the notion of directed graph. Based on those as unifying concept, this monograph on polygraphs revisits the theory of rewriting in the context of strict higher categories, adopting the…

Twisted diagrams are "diagrams" with components in different categories. Structure maps are defined using auxiliary data which consists of functors relating the various categories to each other. Prime examples of the construction are…

代数拓扑 · 数学 2008-05-28 Thomas Huettemann , Oliver Roendigs

Equality saturation, a technique for program optimisation and reasoning, has gained attention due to the resurgence of equality graphs (e-graphs). E-graphs represent equivalence classes of terms under rewrite rules, enabling simultaneous…

计算机科学中的逻辑 · 计算机科学 2025-05-05 Aleksei Tiurin , Dan R. Ghica , Nick Hu

In a graph $\Gamma=(V,E)$, we consider the common closed neighbourhood of a subset of vertices and use this notion to introduce a Moore closure operator in $V.$ We also consider the closed twin equivalence relation in which two vertices are…

群论 · 数学 2024-10-15 Daniela Bubboloni , Nicolas Pinzauti

We study properties of differential graded (dg) operads modulo weak equivalences, that is, modulo the relation given by the existence of a chain of dg operad maps inducing a homology isomorphism. This approach, naturally arising in string…

高能物理 - 理论 · 物理学 2008-02-03 Martin Markl

In previous work, we introduce an axiomatic framework within which to prove theorems about many varieties of infinite-dimensional categories simultaneously. In this paper, we establish criteria implying that an $\infty$-category - for…

范畴论 · 数学 2020-07-17 Emily Riehl , Dominic Verity

We show that in a weak globular $\omega$-category, all composition operations are equivalent and commutative for cells with sufficiently degenerate boundary, which can be considered a higher-dimensional generalisation of the Eckmann-Hilton…

In this paper we study a model structure on a category of schemes with a group action and the resulting unstable and stable equivariant motivic homotopy theories. The new model structure introduced here samples a comparison to the one by…

代数拓扑 · 数学 2013-12-03 Philip Herrmann

This thesis finds its place in the interplay between algebraic and geometric combinatorics. We focus on studying two different families of lattices in relation to the weak order: the permutree lattices and the $s$-weak order. The first part…

组合数学 · 数学 2023-11-08 Daniel Tamayo Jiménez

We prove analogues of classical results for higher homotopy groups and singular homology groups of pseudotopological spaces. Pseudotopological spaces are a generalization of (\v{C}ech) closure spaces which are in turn a generalization of…

代数拓扑 · 数学 2024-09-30 Nikola Milićević , Nicholas A. Scoville

We compare computads with multitopic sets. Both these kinds of structures have n-dimensional objects (called n-cells and n-pasting diagrams, respectively). The computads form a subclass of the more familiar class of omega-categories, while…

范畴论 · 数学 2008-11-21 Victor Harnik , Michael Makkai , Marek Zawadowski

Higher-dimensional rewriting is founded on a duality of rewrite systems and cell complexes, connecting computational mathematics to higher categories and homotopy theory: the two sides of a rewrite rule are two halves of the boundary of an…

范畴论 · 数学 2023-04-20 Amar Hadzihasanovic , Diana Kessler

In this short note we show that E-infinity quasi-categories can be replaced by strictly commutative objects in the larger category of diagrams of simplicial sets indexed by finite sets and injections. This complements earlier work on…

代数拓扑 · 数学 2015-04-13 Dimitar Kodjabachev , Steffen Sagave

In these notes we describe models of globular weak $(\infty,m)$-categories ($m\in\mathbb{N}$) in the Grothendieck style, i.e for each $m\in\mathbb{N}$ we define a globular coherator $\Theta^{\infty}_{\mathbb{M}^m}$ whose set-models are…

范畴论 · 数学 2021-02-22 Camell Kachour

We introduce a dependent type theory whose models are weak {\omega}-categories, generalizing Brunerie's definition of {\omega}-groupoids. Our type theory is based on the definition of {\omega}-categories given by Maltsiniotis, himself…

计算机科学中的逻辑 · 计算机科学 2017-06-12 Eric Finster , Samuel Mimram

Let $R$ be a semilocal principal ideal domain. Two algebraic objects over $R$ in which scalar extension makes sense (e.g. quadratic spaces) are said to be of the same genus if they become isomorphic after extending scalars to all…

环与代数 · 数学 2016-01-12 Eva Bayer-Fluckiger , Uriya A. First