arXiv subjects

Mitchell Buckley

Publications and source records attributed to Mitchell Buckley.

7 recordsLinked to original sources

arXiv2019

A Larson-Sweedler Theorem for Hopf V-Categories

The aim of this paper is to extend the classical Larson-Sweedler theorem, namely that a k-bialgebra has a non-singular integral (and in particular is Frobenius) if and only if it is a finite dimensional Hopf algebra, to the `many-object' setting of Hopf categories. To this end, we provide new characterizations of Frobenius V-categories and we develop the integral theory for Hopf V-categories. Our results apply to Hopf algebras in any braided monoidal category as a special case, and also relate to Turaev's Hopf group algebras and particular cases of weak and multiplier Hopf algebras.

math.CT↗

arXiv2017

Oplax Hopf Algebras

We introduce the notion of an oplax Hopf monoid in any braided monoidal bicategory, generalizing that of a Hopf monoid in a braided monoidal category in an appropriate way. We show that Hopf V-categories introduced in [BCV16] are a particular type of oplax Hopf monoids in the monoidal bicategory Span|V described in [B\"oh17]. Finally, we introduce Frobenius V-categories as the Frobenius objects in the same monoidal bicategory.

math.CT↗

arXiv2015

Formalizing parity complexes

We formalise, in Coq, the opening sections of Parity Complexes [Street1991] up to and including the all important excision of extremals algorithm. Parity complexes describe the essential combinatorial structure exhibited by simplexes, cubes and globes, that enable the construction of free $ω$-categories on such objects. The excision of extremals is a recursive algorithm that presents every cell in such a category as a (unique) composite of atomic cells. This is the sense in which the $ω$-category is (freely) generated from its atoms. Due to the complicated multi-dimensional nature of this work, the detail of definitions and proofs can be hard to follow and verify. Indeed, some corrections were required some years following the original publication~\cite{Street1994}. Our formalisation verifies that all cases of each result operate as stated. In particular, we indicate which portions of the theory can be proved directly from definitions, and which require more subtle and complex arguments. By identifying results that require the most complicated proofs, we are able to investigate where this theory might benefit from further study and which results need to be considered most carefully in future work.

math.CT↗

arXiv2015

Orientals and cubes, inductively

We provide direct inductive constructions of the orientals and the cubes, exhibiting them as the iterated cones, respectively, the iterated cylinders, of the terminal strict globular omega-category.

math.CT↗

arXiv2013

The Catalan simplicial set

The Catalan numbers are well-known to be the answer to many different counting problems, and so there are many different families of sets whose cardinalities are the Catalan numbers. We show how such a family can be given the structure of a simplicial set. We show how the low-dimensional parts of this simplicial set classify, in a precise sense, the structures of monoid and of monoidal category. This involves aspects of combinatorics, algebraic topology, quantum groups, logic, and category theory.

math.CT↗

arXiv2013

Skew-monoidal categories and the Catalan simplicial set

The basic data for a skew-monoidal category are the same as for a monoidal category, except that the constraint morphisms are no longer required to be invertible. The constraints are given a specific orientation and satisfy Mac Lane's five axioms. Whilst recent applications justify the use of skew-monoidal structure, they do not give an intrinsic justification for the form the structure takes (the orientation of the constraints and the axioms that they satisfy). This paper provides a perspective on skew-monoidal structure which, amongst other things, makes it quite apparent why this particular choice is a natural one. To do this, we use the Catalan simplicial set C. It turns out to be quite easy to describe: it is the nerve of the monoidal poset (2, v, 0) and has a Catalan number of simplices at each dimension (hence the name). Our perspective is that C classifies skew-monoidal structures in the sense that simplicial maps from C into a suitably-defined nerve of Cat are precisely skew-monoidal categories. More generally, skew monoidales in a monoidal bicategory K are classified by maps from C into the simplicial nerve of K.

math.CT↗

arXiv2013

Fibred 2-categories and bicategories

We generalise the usual notion of fibred category; first to fibred 2-categories and then to fibred bicategories. Fibred 2-categories correspond to 2-functors from a 2-category into 2-Cat. Fibred bicategories correspond to trihomomorphisms from a bicategory into Bicat. We describe the Grothendieck construction for each kind of fibration and present a few examples of each. Fibrations in our sense, between bicategories, are closed under composition and are stable under equiv-comma. The free such fibration on a homomorphism is obtained by taking an oplax comma along an identity.

math.CT↗