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

We show the problem of counting homomorphisms from the fundamental group of a homology $3$-sphere $M$ to a finite, non-abelian simple group $G$ is #P-complete, in the case that $G$ is fixed and $M$ is the computational input. Similarly,…

In this paper, firstly, we introduce a higher-dimensional analogue of hypergraphs, namely $\omega$-hypergraphs. This notion is thoroughly flexible because unlike ordinary $\omega$-graphs, an n-dimensional edge called an n-cell has many…

We present the guarded lambda-calculus, an extension of the simply typed lambda-calculus with guarded recursive and coinductive types. The use of guarded recursive types ensures the productivity of well-typed programs. Guarded recursive…

This is the second of two papers but has been written so as to have minimal dependence on the first paper (which is also on this archive). Let G be a group and let M be a CAT(0) proper metric space (e.g. a simply connected complete…

In physical systems possessing symmetry, reconstructing the underlying causal structure from observational data constitutes an inverse problem of fundamental importance. In this work, we formulate the inverse problem of causal inference…

Presentations of groups by rewriting systems (that is, by monoid presentations), have been fruitfully studied by encoding the rewriting system in a $2$--complex -- the Squier complex -- whose fundamental groupoid then describes the…

We unify the Kumjian-Renault Weyl groupoid construction with the Lawson-Lenz version of Exel's tight groupoid construction. We do this by utilising only a weak algebraic fragment of the C*-algebra structure, namely its *-semigroup reduct.…

After recalling basic definitions and constructions for a finite group $G$ action on a $k$-linear category we give a concise proof of the following theorem of Elagin: if $\mathcal{C} = \langle \mathcal{A}, \mathcal{B} \rangle$ is a…

Adapting a result of Bazhenov, Kalimullin, and Yamaleev, we show that if a Turing degree $\textbf{d}$ is the degree of categoricity of a computable structure $\mathcal{M}$ and is not the strong degree of categoricity of any computable…

Martinez-Rivillas and de Queiroz gave extensional Kan semantics for the untyped lambda-calculus and later constructed the concrete K-infinity homotopy-model. The two main mathematical results of the present paper are these. First, we show…

Let $\bold G$ be a reductive algebraic group defined over $\Q$, and let $\Gamma$ be an arithmetic subgroup of $\bold G(\Q)$. Let $X$ be the symmetric space for $\bold G(\R)$, and assume $X$ is contractible. Then the cohomology (mod torsion)…

Motivated by some alternatives to the classical logical model of boolean algebra, this paper deals with algebraic structures which extend skew lattices by locally invertible elements. Following the meme of the Ehresmann-Schein-Nambooripad…

Let $\Gamma$ be a dense countable subgroup of $\mathbb{R}$. Then, consider $IE(\Gamma)$; the group of piecewise linear bijections of $[0,1]$ with finitely many angles, all in $\Gamma$. We introduce and systematically study a family of…

We study relative Cohn path algebras, also known as Leavitt-Cohn path algebras, and we realize them as partial skew group rings (to do this we prove uniqueness theorems for relative Cohn path algebras). Furthermore, given any graph $E$ we…

We present a new model of computation, described in terms of monoidal categories. It conforms the Church-Turing Thesis, and captures the same computable functions as the standard models. It provides a succinct categorical interface to most…

For a locally compact quantum group $\mathbb{G}$, a (left) coideal is a (left) $\mathbb{G}$-invariant von Neumann subalgebra of $L^\infty(\mathbb{G})$. We introduce and analyze various generalizations of amenability and coamenability to…

Frame theory has been a popular subject in the design of structured signals and codes in recent years, with applications ranging from the design of measurement matrices in compressive sensing, to spherical codes for data compression and…

We introduce type-theoretic algebraic weak factorisation systems and show how they give rise to homotopy-theoretic models of Martin-L\"of type theory. This is done by showing that the comprehension category associated to a type-theoretic…

Identifying optimal collective variables to model transformations, using atomic-scale simulations, is a long-standing challenge. We propose a new method for the generation, optimization, and comparison of collective variables, which can be…

We analyse the structure of the quotient $\mathrm{A}_\sim(\Gamma,X,\mu)$ of the space of measure-preserving actions of a countable discrete group by the relation of weak equivalence. This space carries a natural operation of convex…