Related papers: Computational Paths Form a Weak {\omega}-Groupoid

This paper investigates the effective categoricity of ultrahomogeneous structures. It is shown that any computable ultrahomogeneous structure is $\Delta^0_2$ categorical. A structure A is said to be weakly ultrahomogeneous if there is a…

The subject logic in computer science should entail proof theoretic applications. So the question arises whether open problems in computational complexity can be solved by advanced proof theoretic techniques. In particular, consider the…

We introduce a practical construction of group-equivariant and permutation-invariant functions of $N$ variables given a finite-dimensional space stable with respect to the group action. The construction applies to any connected linear Lie…

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…

In previous work, joint with Bux, Fluch, Marschler and Witzel, we proved that the braided Thompson groups are of type $\textrm{F}_\infty$. The proof utilized certain contractible cube complexes, which in this paper we prove are CAT(0). We…

We remark on the claim that the string-net model of Levin and Wen is a microscopic Hamiltonian formulation of the Turaev-Viro topological quantum field theory. Using simple counterexamples we indicate where interesting extra structure may…

We introduce group surface codes, which are a natural generalization of the $\mathbb{Z}_2$ surface code, and equivalent to quantum double models of finite groups with specific boundary conditions. We show that group surface codes can be…

Let $\alpha=(A_g,\alpha_g)_{g\in G}$ be a group-type partial action of a connected groupoid $G$ on a ring $A=\bigoplus_{z\in G_0}A_z$ and $B=A\star_{\alpha}G$ the corresponding partial skew groupoid ring. In the first part of this paper we…

We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…

Sharing of notations and theories across an inheritance hierarchy of mathematical structures, e.g., groups and rings, is important for productivity when formalizing mathematics in proof assistants. The packed classes methodology is a…

CM-type projective varieties X of complex dimension n are characterized by their CM-type rational Hodge structures on the cohomology groups. One may impose such a condition in a weakest form when the canonical bundle of X is trivial; the…

We describe a Martin-L\"of style dependent type theory, called Cocon, that allows us to mix the intensional function space that is used to represent higher-order abstract syntax (HOAS) trees with the extensional function space that…

We define a class of computable functions over real numbers using functional schemes similar to the class of primitive and partial recursive functions defined by G\"odel and Kleene. We show that this class of functions can also be…

We introduce a notion of topological property (T) for \'etale groupoids. This simultaneously generalizes Kazhdan's property (T) for groups and geometric property (T) for coarse spaces. One main goal is to use this property (T) to prove the…

We establish rigidity for partial transformation groupoids associated with algebraic actions of semigroups: If two such groupoids (satisfying appropriate conditions) are isomorphic, then the globalizations of the initial algebraic actions…

Structure monoids and groups are algebraic invariants of equational varieties. We show how to construct presentations of these objects from coherent categorifications of equational varieties, generalising several results of Dehornoy. We…

We study the computational content of various theorems with reverse mathematical strength around Arithmetical Transfinite Recursion ($\mathsf{ATR}_0$) from the point of view of computability-theoretic reducibilities, in particular Weihrauch…

A cohesive power of a computable structure is an effective ultrapower where a cohesive set acts as an ultrafilter. Let $\omega$, $\zeta$, and $\eta$ denote the respective order-types of the natural numbers, the integers, and the rationals.…

Using an algebraic point of view we present an introduction to the groupoid theory, that is, we give fundamental properties of groupoids as, uniqueness of inverses and properties of the identities, and study subgroupoids, wide subgroupoids…

Let $G$ be a reductive group over a nonarchimedean local field $F$. In the quest for a classification of irreducible smooth representations of $G$, it is critical to understand the case of supercuspidal representations -- those whose matrix…