English
Related papers

Related papers: Higher-dimensional normalisation strategies for ac…

200 papers

Incidence relations among the cells of a regular CW complex produce a poset-enriched category of entrance paths whose classifying space is homotopy-equivalent to that complex. We show here that each acyclic partial matching (in the sense of…

Algebraic Topology · Mathematics 2018-06-05 Vidit Nanda

We propose a novel construction of finite hypergraphs and relational structures that is based on reduced products with Cayley graphs of groupoids. To this end we construct groupoids whose Cayley graphs have large girth not just in the usual…

Combinatorics · Mathematics 2024-01-15 Martin Otto

We give a survey of recent results related to the problem of characterizing finite-dimensional division algebras by the set of isomorphism classes of their maximal subfields. We also discuss various generalizations of this problem and some…

Rings and Algebras · Mathematics 2015-06-11 Vladimir I. Chernousov , Andrei S. Rapinchuk , Igor A. Rapinchuk

We present a framework for modeling complex, high-dimensional distributions on convex polytopes by leveraging recent advances in discrete and continuous normalizing flows on Riemannian manifolds. We show that any full-dimensional polytope…

Machine Learning · Computer Science 2025-03-18 Tomek Diederen , Nicola Zamboni

Networks are often studied as graphs, where the vertices stand for entities in the world and the edges stand for connections between them. While relatively easy to study, graphs are often inadequate for modeling real-world situations,…

Networking and Internet Architecture · Computer Science 2009-09-25 David I. Spivak

We introduce a taxonomy of interaction types and show that graphs are focal hypergraphs: every graph is canonically a focal hypergraph via its closed neighbourhood structure, and every graph dynamical model is a special case of the general…

Physics and Society · Physics 2026-03-05 Elkaïoum M. Moutuou

Hierarchical lattices that constitute spatially anisotropic systems are introduced. These lattices provide exact solutions for hierarchical models and, simultaneously, approximate solutions for uniaxially or fully anisotropic d=3 physical…

Statistical Mechanics · Physics 2007-05-23 A. Erbas , A. Tuncer , B. Yucesoy , A. N. Berker

In this dissertation, we compare the "classical" homology of an $\omega$-category (defined as the homology of its Street nerve) with its polygraphic homology. More precisely, we prove that both homologies generally do not coincide and call…

Category Theory · Mathematics 2021-04-27 Léonard Guetta

Stratified digraphs are popular models for feedforward neural networks. However, computation of their path homologies has been limited to low dimensions due to high computational complexity. A recursive algorithm is proposed to compute…

Computational Geometry · Computer Science 2024-12-12 Zhengtong Zhu , Zhiyi Chi

We construct finite volume hyperbolic manifolds with large symmetry groups. The construction makes use of the presentations of finite Coxeter groups provided by Barot and Marsh and involves mutations of quivers and diagrams defined in the…

Geometric Topology · Mathematics 2019-10-25 Anna Felikson , Pavel Tumarkin

Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even better, when the presentation is confluent and terminating,…

Formal Languages and Automata Theory · Computer Science 2010-05-02 Samuel Mimram

Diagram chasing is not an easy task. The coherence holds in a generalized sense if we have a mechanical method to judge whether given two morphisms are equal to each other. A simple way to this end is to reform a concerned category into a…

Logic in Computer Science · Computer Science 2020-10-09 Ryu Hasegawa

Superspecies are introduced to provide the nice constructions of all finite-dimensional superalgebras. All acyclic superspecies, or equivalently all finite-dimensional (gr-basic) gr-hereditary superalgebras, are classified according to…

Rings and Algebras · Mathematics 2007-10-12 Yang Han , Deke Zhao

Given a small category C, we show that there is a universal way of expanding C into a model category, essentially by formally adjoining homotopy colimits. The technique of localization becomes a method for imposing `relations' into these…

Algebraic Topology · Mathematics 2007-05-23 Daniel Dugger

We propose a methodology for the homogenization of periodic elastic lattices that covers the case of unstable lattices, having affine (macroscopic) or periodic (microscopic) mechanisms. The singular cell problems that are encountered when a…

Soft Condensed Matter · Physics 2025-07-02 Basile Audoly , Claire Lestringant , Hussein Nassar

A coherent presentation of an n-category is a presentation by generators, relations and relations among relations. Confluent and terminating rewriting systems generate coherent presentations, whose relations among relations are defined by…

Category Theory · Mathematics 2021-10-05 Benjamin Dupont , Philippe Malbos

We discuss two categorical characterizations of the class of acyclic maps between (path-connected) spaces. The first one is in terms of the higher categorical notion of an epimorphism. The second one employs the notion of a balanced map,…

Algebraic Topology · Mathematics 2018-05-15 G. Raptis

With every family of finitely many subsets of a finite-dimensional vector space over the Galois-field with two elements we associate a cyclic transversal polytope. It turns out that those polytopes generalize several well-known polytopes…

Combinatorics · Mathematics 2024-04-10 Jonas Frede , Volker Kaibel , Maximilian Merkert

A periodic cell complex, $K$, has a finite representation as the quotient space, $q(K)$, consisting of equivalence classes of cells identified under the translation group acting on $K$. We study how the Betti numbers and cycles of $K$ are…

Algebraic Topology · Mathematics 2025-11-14 Adam Onus , Vanessa Robins

We consider the problem of translating between irreducible closed sets and implicational bases in closure systems. To date, the complexity status of this problem is widely open, and it is further known to generalize the notorious hypergraph…

Data Structures and Algorithms · Computer Science 2025-11-04 Oscar Defrain , Arthur Ohana , Simon Vilmin
‹ Prev 1 4 5 6 7 8 10 Next ›