96 research outputs found

    Dualizability of automatic algebras

    Full text link
    We make a start on one of George McNulty's Dozen Easy Problems: "Which finite automatic algebras are dualizable?" We give some necessary and some sufficient conditions for dualizability. For example, we prove that a finite automatic algebra is dualizable if its letters act as an abelian group of permutations on its states. To illustrate the potential difficulty of the general problem, we exhibit an infinite ascending chain A1≤A2≤A3≤...b\mathbf A_1 \le \mathbf A_2 \le \mathbf A_3 \le ...b of finite automatic algebras that are alternately dualizable and non-dualizable

    Finite Abelian algebras are fully dualizable

    Full text link
    We show that every finite Abelian algebra A from congruence-permutable varieties admits a full duality. In the process, we prove that A also allows a strong duality, and that the duality may be induced by a dualizing structure of finite type. We give an explicit bound on the arities of the partial and total operations appearing in the dualizing structure. In addition, we show that the enriched partial hom-clone of A is finitely generated as a clone

    Dualizability in Low-Dimensional Higher Category Theory

    Get PDF
    These lecture notes form an expanded account of a course given at the Summer School on Topology and Field Theories held at the Center for Mathematics at the University of Notre Dame, Indiana during the Summer of 2012. A similar lecture series was given in Hamburg in January 2013. The lecture notes are divided into two parts. The first part, consisting of the bulk of these notes, provides an expository account of the author's joint work with Christopher Douglas and Noah Snyder on dualizability in low-dimensional higher categories and the connection to low-dimensional topology. The cobordism hypothesis provides bridge between topology and algebra, establishing important connections between these two fields. One example of this is the prediction that the nn-groupoid of so-called `fully-dualizable' objects in any symmetric monoidal nn-category inherits an O(n)-action. However the proof of the cobordism hypothesis outlined by Lurie is elaborate and inductive. Many consequences of the cobordism hypothesis, such as the precise form of this O(n)-action, remain mysterious. The aim of these lectures is to explain how this O(n)-action emerges in a range of low category numbers (n≤3n \leq 3). The second part of these lecture notes focuses on the author's joint work with Clark Barwick on the Unicity Theorem, as presented in arXiv:1112.0040. This theorem and the accompanying machinery provide an axiomatization of the theory of (∞,n)(\infty,n)-categories and several tools for verifying these axioms. The aim of this portion of the lectures is to provide an introduction to this material.Comment: 65 pages, 8 figures. Lecture Note

    Supernilpotence prevents dualizability

    Get PDF
    We address the question of the dualizability of nilpotent Mal’cev algebras, showing that nilpotent finite Mal’cev algebras with a nonabelian supernilpotent congruence are inherently nondualizable. In particular, finite nilpotent nonabelian Mal’cev algebras of finite type are nondualizable if they are direct products of algebras of prime power order. We show that these results cannot be generalized to nilpotent algebras by giving an example of a group expansion of infinite type that is nilpotent and nonabelian, but dualizable. To our knowledge this is the first construction of a nonabelian nilpotent dualizable algebra. It has the curious property that all its nonabelian finitary reducts with group operation are nondualizable. We were able to prove dualizability by utilizing a new clone theoretic approach developed by Davey, Pitkethly, and Willard. Our results suggest that supernilpotence plays an important role in characterizing dualizability among Mal’cev algebras
    • …
    corecore