Finite-product-preserving functors,Kan extensions,and strongly-finitary 2-monads

We study those 2-monads on the 2-categoryCat of categories which, as endofunctors, are the left Kan extensions of their restrictions to the sub-2-category of finite discrete categories, describing their algebras syntactically. Showing that endofunctors of this kind are closed under composition involves a lemma on left Kan extensions along a coproduct-preserving functor in the context of cartesian closed categories, which is closely related to an earlier result of Borceux and Day.The first author gratefully acknowledges the support of the Australian Research Council.     

Coinverters and categories of fractions for categories with structure

A category of fractions is a special case of acoinverter in the 2-categoryCat. We observe that, in a cartesian closed 2-category, the product of tworeflexive coinverter diagrams is another such diagram. It follows that an equational structure on a categoryA, if given by operationsA ⁿ A forn N along with natural transformations and equations, passes canonically to the categoryA [^–1] of fractions, provided that is closed under the operations. We exhibit categories with such structures as algebras for a class of 2-monads onCat, to be calledstrongly finitary monads.The first and third authors gratefully acknowledge the support of the Australian Research Council.     

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 2Cat. 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.     

Matrices, machines and behaviors

Sabadini, Walters and others have developed a categorical, machine based theory of concurrency in which there are four essential aspects: a distributive category of data-types; a bicategory Mach whose objects are data types, and whose arrows are input-output machines built from data types; a semantic category (or categories) Sem, suitable to contain the behaviors of machines, and a functor, behavior: MachSem. Suitable operations on machines and semantics are found so that the behavior functor preserves these operations. Then, if each machine is decomposable into primitive machines using these operations, the behavior of a general machine is deducible from the behavior of its parts. The theory of non-deterministic finite state automata provides an example of the paradigm and also throws some light on the classical theory of finite state automata.We describe a bicategory whose objects are natural numbers, in which an arrow M: np is a finite state automaton with n input states, p output states, and some additional internal states; we require that no transitions begin at output states or end at input states. A machine is represented by an q+n by q+p matrix. The bicategory supports additional operations: non-deterministic choice, parallel interleaving, and feedback. Enough operations are imposed on machines to show that each machine may be obtained from some atomic ones by means of the operations.The semantic category is the (Bloom-Ésik) iteration theory Mat _(X whose objects are natural numbers and whose arrows from n to p are n×p matrices with entries in the semiring of languages. The behavior functor associates to a machine M: np a matrix |M| of languages, one language to each pair of input and output states. Behavior preserves composition, feedback, takes non-deterministic choice to union, and parallel-interleaving to shuffle. Thus, behavior gives a compositional semantics to a primitive notion of concurrent processes.This work has been supported by the Australian Research Council, by CEC under grant number 6317, ASMICS II, by Italian MURST, and by the Italian CNR.Visit to Sydney supported by a grant from the Australian Research Council.Presented at the European Colloquium of Category Theory, Tours, France, 25–31 July 1994.     

Functorial Calculus in Monoidal Bicategories

The definition and calculus of extraordinary natural transformations is extended to a context internal to any autonomous monoidal bicategory. The original calculus is recaptured from the geometry of the monoidal bicategory V-Mod whose objects are categories enriched in a cocomplete symmetric monoidal category V and whose morphisms are modules.     

Group-universal unary varieties

LetV be a variety of unary algebras and letM(V) be the monoid of all unary polynomials ofV. Then every group appears as the automorphism group of an algebraA∈V if and only if the left ideals ofM(V) do not form an inclusion-ordered chain. The support of the National Research Council of Canada is gratefully acknowledged. Presented by J. Mycielski.     

A fully discrete H 1-Galerkin method with quadrature for nonlinear advection–diffusion–reaction equations

We propose and analyze a fully discrete H ¹-Galerkin method with quadrature for nonlinear parabolic advection–diffusion–reaction equations that requires only linear algebraic solvers. Our scheme applied to the special case heat equation is a fully discrete quadrature version of the least-squares method. We prove second order convergence in time and optimal H ¹ convergence in space for the computer implementable method. The results of numerical computations demonstrate optimal order convergence of scheme in H ^k for k = 0, 1, 2. Support of the Australian Research Council is gratefully acknowledged.     

Duals Invert

Monoidal objects (or pseudomonoids) in monoidal bicategories share many of the properties of the paradigmatic example: monoidal categories. The existence of (say, left) duals in a monoidal category leads to a dualization operation which was abstracted to the context of monoidal objects by Day et al. (Appl Categ Struct 11:229–260, 2003). We define a relative version of this called exact pairing for two arrows in a monoidal bicategory; when one of the arrows is an identity, the other is a dualization. In this context we supplement results of Day et al. (Appl Categ Struct 11:229–260, 2003) (and even correct one of them) and only assume the existence of biduals in the bicategory where necessary. We also abstract recent work of Day and Pastro (New York J Math 14:733–742, 2008) on Frobenius monoidal functors to the monoidal bicategory context. Our work began by focusing on the invertibility of components at dual objects of monoidal natural transformations between Frobenius monoidal functors. As an application of the abstraction, we recover a theorem of Walters and Wood (Theory Appl Categ 3:25–47, 2008) asserting that, for objects A and X in a cartesian bicategory , if A is Frobenius then the category Map(X,A) of left adjoint arrows is a groupoid. Also, the characterization in Walters and Wood (Theory Appl Categ 3:25–47, 2008) of left adjoint arrows between Frobenius objects of a cartesian bicategory is put into our current setting. In the same spirit, we show that when a monoidal object admits a dualization, its lax centre coincides with the centre defined in Street (Theory Appl Categ 13:184–190, 2004). Finally we look at the relationship between lax duals for objects and adjoints for arrows in a monoidal bicategory.     

Endomorphisms of complete heyting algebras

Each monoid can be represented as the endomorphism monoid of a complete Heyting algebra. More generally, the category of soberT ₁-spaces and their open continuous maps, and consequently the category of complete Heyting algebras are universal. On the other hand, it is often impossible to represent monoids using more special (Hausdorff) complete Heyting algebras: for instance, each finite commutative endomorphism monoid of such a Heyting algebra is weakly idempotent. Support of the Natural Sciences and Engineering Research Council of Canada and the Grant Agency of the Czech Republic under Grant 201/93/950 is gratefully acknowledged. Support of the Natural Sciences and Engineering Research Council of Canada is gratefully acknowledged.     

Beyond the Chu-construction

Starting from symmetric monoidal closed (= autonomous) categories, Po-Hsiang Chu showed how to construct new *-autonomous categories, i.e., autonomous categories that are self-dual by virtue of having a dualizing object. Recently, Michael Barr extended this to the nonsymmetric, but closed, case, utilizing monads and modules between them. Since these notions are well-understood for bicategories, we introduce a notion of cyclic *-autonomy for these that implies closedness and, moreover, is inherited when forming bicategories of monads and of interpolads. Since the initial step of Barr's construction also carries over to the bicategorical setting, we recover his main result as an easy corollary. Furthermore, the Chu-construction at this level may be viewed as a procedure for turning the endo-1-cells of a closed bicategory into the objects of a new closed bicategory, and hence conceptually is similar to constructing bicategories of monads and of interpolads.     

Infinite loop spaces,and coherence for symmetric monoidal bicategories

This paper proves three different coherence theorems for symmetric monoidal bicategories. First, we show that in a free symmetric monoidal bicategory every diagram of 2-cells commutes. Second, we show that this implies that the free symmetric monoidal bicategory on one object is equivalent, as a symmetric monoidal bicategory, to the discrete symmetric monoidal bicategory given by the disjoint union of the symmetric groups. Third, we show that every symmetric monoidal bicategory is equivalent to a strict one.     

Multilevel diagonal scaling preconditioners for boundary element equations on locally refined meshes

Summary. We study a multilevel preconditioner for the Galerkin boundary element matrix arising from a symmetric positive-definite bilinear form. The associated energy norm is assumed to be equivalent to a Sobolev norm of positive, possibly fractional, order m on a bounded (open or closed) surface of dimension d, with . We consider piecewise linear approximation on triangular elements. Successive levels of the mesh are created by selectively subdividing elements within local refinement zones. Hanging nodes may be created and the global mesh ratio can grow exponentially with the number of levels. The coarse-grid correction consists of an exact solve, and the correction on each finer grid amounts to a simple diagonal scaling involving only those degrees of freedom whose associated nodal basis functions overlap the refinement zone. Under appropriate assumptions on the choice of refinement zones, the condition number of the preconditioned system is shown to be bounded by a constant independent of the number of degrees of freedom, the number of levels and the global mesh ratio. In addition to applying to Galerkin discretisation of hypersingular boundary integral equations, the theory covers finite element methods for positive-definite, self-adjoint elliptic problems with Dirichlet boundary conditions. Received October 5, 2001 / Revised version received December 5, 2001 / Published online April 17, 2002 The support of this work through Visiting Fellowship grant GR/N21970 from the Engineering and Physical Sciences Research Council of Great Britain is gratefully acknowledged. The second author was also supported by the Australian Research Council     

Orbifolds and groupoids

We define a 2-category structure (Pre-Orb) on the category of reduced complex orbifold atlases. We construct a 2-functor F from (Pre-Orb) to the 2-category (Grp) of proper étale effective groupoid objects over the complex manifolds. Both on (Pre-Orb) and (Grp) there are natural equivalence relations on objects: (a natural extension of) equivalence of orbifold atlases on (Pre-Orb) and Morita equivalence in (Grp). We prove that F induces a bijection between the equivalence classes of its source and target.     

Flocks and ovals

An infinite family of q-clans, called the Subiaco q-clans, is constructed for q=2^e. Associated with these q-clans are flocks of quadratic cones, elation generalized quadrangles of order (q ², q), ovals of PG(2, q) and translation planes of order q ² with kernel GF(q). It is also shown that a q-clan, for q=2^e, is equivalent to a certain configuration of q+1 ovals of PG(2, q), called a herd.W. Cherowitzo gratefully acknowledges the support of the Australian Research Council and has the deepest gratitude and warmest regards for the Combinatorial Computing Research Group at the University of Western Australia for their congenial hospitality and moral support. I. Pinneri gratefully acknowledges the support of a University of Western Australia Research Scholarship.     

Bilimits are bifinal objects

We prove that a (lax) bilimit of a 2-functor is characterized by the existence of a limiting contraction in the 2-category of (lax) cones over the diagram. We also investigate the notion of bifinal object and prove that a (lax) bilimit is a limiting bifinal object in the 2-category of (lax) cones. Everything is developed in the context of marked 2-categories, so that the machinery can be applied to different levels of laxity, including pseudo-limits.     

Multi-dimensional Ramsey theorems — An example

In [1] V. Bergelson and N. Hindman used a 6-cell partition of [N]² to show that one cannot combine their major result with the Milliken-Taylor theorem and asked if one can provide an example with fewer than 6-cells. In this note we show that their 6-cell example can be collapsed into a 5-cell example.The author gratefully acknowledges support from the Council on Research of Louisiana State University.     

The Catalan Simplicial Set II

The Catalan simplicial set ? is known to classify skew-monoidal categories in the sense that a map from ? to a suitably defined nerve of Cat is precisely a skew-monoidal category (Buckley et al. 2014). We extend this result to the case of skew monoidales internal to any monoidal bicategory ??. We then show that monoidal bicategories themselves are classified by maps from ? to a suitably defined nerve of Bicat and extend this result to obtain a definition of skew-monoidal bicategory that aligns with existing theory.