English
Related papers

Related papers: Coherence via Well-Foundedness: Taming Set-Quotien…

200 papers

Higher-dimensional rewriting systems are tools to analyse the structure of formally reducing terms to normal forms, as well as comparing the different reduction paths that lead to those normal forms. This higher structure can be captured by…

Logic in Computer Science · Computer Science 2023-02-15 Nicolai Kraus , Jakob von Raumer

We study the coherence and conservativity of extensions of dependent type theories by additional strict equalities. By considering notions of congruences and quotients of models of type theory, we reconstruct Hofmann's proof of the…

Logic in Computer Science · Computer Science 2020-10-28 Rafaël Bocquet

Coherence theorems for covariant structures carried by a category have traditionally relied on the underlying term rewriting system of the structure being terminating and confluent. While this holds in a variety of cases, it is not a…

Category Theory · Mathematics 2007-05-31 Jonathan A. Cohen

Coherence phenomena appear in two different situations. In the context of category theory the term `coherence constraints' refers to a set of diagrams whose commutativity implies the commutativity of a larger class of diagrams. In the…

q-alg · Mathematics 2007-05-23 Martin Markl , Steve Shnider

The study of equality types is central to homotopy type theory. Characterizing these types is often tricky, and various strategies, such as the encode-decode method, have been developed. We prove a theorem about equality types of…

Logic · Mathematics 2019-05-16 Nicolai Kraus , Jakob von Raumer

We develop a technique for normalization for $\infty$-type theories. The normalization property helps us to prove a coherence theorem: the initial model of a given $\infty$-type theory is $0$-truncated. The coherence theorem justifies…

Logic · Mathematics 2022-12-23 Taichi Uemura

In homotopy type theory (HoTT), all constructions are necessarily stable under homotopy equivalence. This has shortcomings: for example, it is believed that it is impossible to define a type of semi-simplicial types. More generally, it is…

Logic in Computer Science · Computer Science 2016-11-01 Thorsten Altenkirch , Paolo Capriotti , Nicolai Kraus

Consider a family $\mathcal F$ of $C_{2r+1}$-free graphs, where $r\geq 2$. Suppose that each graph in $\mathcal F$ has minimum degree linear in its number of vertices. Thomassen showed that such a family has bounded chromatic number, or,…

Combinatorics · Mathematics 2022-06-16 Maya Sankar

Recently, Cochran and Harvey defined torsion-free derived series of groups and proved an injectivity theorem on the associated torsion-free quotients. We show that there is a universal construction which extends such an injectivity theorem…

Geometric Topology · Mathematics 2007-05-23 Jae Choon Cha

The principle of similarity, or homophily, is often used to explain patterns observed in complex networks such as transitivity and the abundance of triangles (3-cycles). However, many phenomena from division of labor to protein-protein…

Physics and Society · Physics 2022-10-12 Szymon Talaga , Andrzej Nowak

We prove a coherence theorem for invertible objects in a symmetric monoidal category. This is used to deduce associativity, skew-commutativity, and related results for multi-graded morphism rings, generalizing the well-known versions for…

Category Theory · Mathematics 2014-10-01 Daniel Dugger

Motivated by gauge theory, we develop a general framework for chain complex valued algebraic quantum field theories. Building upon our recent operadic approach to this subject, we show that the category of such theories carries a canonical…

Mathematical Physics · Physics 2019-06-14 Marco Benini , Alexander Schenkel , Lukas Woike

Higher inductive types are a class of type-forming rules, introduced to provide basic (and not-so-basic) homotopy-theoretic constructions in a type-theoretic style. They have proven very fruitful for the "synthetic" development of homotopy…

Logic · Mathematics 2020-07-08 Peter LeFanu Lumsdaine , Mike Shulman

Given a diagram of rings, one may consider the category of modules over them. We are interested in the homotopy theory of categories of this type: given a suitable diagram of model categories M(s) (as s runs through the diagram), we…

Algebraic Topology · Mathematics 2013-09-27 J. P. C. Greenlees , B. Shipley

We study the homomorphism induced in homology by a closed correspondence between topological spaces, using projections from the graph of the correspondence to its domain and codomain. We provide assumptions under which the homomorphism…

Algebraic Topology · Mathematics 2023-10-10 Shaun Harker , Hiroshi Kokubu , Konstantin Mischaikow , Paweł Pilarczyk

Determining whether two graphs are isomorphic is a fundamental problem with practical applications in areas such as molecular chemistry or social network analysis, yet it remains a challenging task, with exact solutions often being…

In recent years, algebraic topology and its modern development, the theory of persistent homology, has shown great potential in graph representation learning. In this paper, based on the mathematics of algebraic topology, we propose a novel…

Machine Learning · Computer Science 2022-06-14 Zuoyu Yan , Tengfei Ma , Liangcai Gao , Zhi Tang , Chao Chen

We give a new approach to intersection theory. Our "cycles" are closed manifolds mapping into compact manifolds and our "intersections" are elements of a homotopy group of a certain Thom space. The results are then applied in various…

Algebraic Topology · Mathematics 2014-11-11 John R. Klein , E. Bruce Williams

Topologists are sometimes interested in space-valued diagrams over a given index category, but it is tricky to say what such a diagram even is if we look for a notion that is stable under equivalence. The same happens in (homotopy) type…

Logic · Mathematics 2017-04-18 Nicolai Kraus , Christian Sattler

We consider the problem of defining the integers in Homotopy Type Theory (HoTT). We can define the type of integers as signed natural numbers (i.e., using a coproduct), but its induction principle is very inconvenient to work with, since it…

Logic in Computer Science · Computer Science 2020-07-02 Thorsten Altenkirch , Luis Scoccola
‹ Prev 1 2 3 10 Next ›