Data types with symmetries and polynomial functors over groupoids

Polynomial functors are useful in the theory of data types, where they are often called containers. They are also useful in algebra, combinatorics, topology, and higher category theory, and in this broader perspective the polynomial aspect is often prominent and justifies the terminology. For example, Tambara's theorem states that the category of finite polynomial functors is the Lawvere theory for commutative semirings. In this talk I will explain how an upgrade of the theory from sets to groupoids is useful to deal with data types with symmetries, and provides a common generalisation of and a clean unifying framework for quotient containers (cf. Abbott et al.), species and analytic functors (Joyal 1985), as well as the stuff types of Baez-Dolan. The multi-variate setting also includes relations and spans, multispans, and stuff operators. An attractive feature of this theory is that with the correct homotopical approach - homotopy slices, homotopy pullbacks, homotopy colimits, etc. - the groupoid case looks exactly like the set case. After some standard examples, I will illustrate the notion of data-types-with-symmetries with examples from quantum field theory, where the symmetries of complicated tree structures of graphs play a crucial role, and can be handled elegantly using polynomial functors over groupoids. (These examples, although beyond species, are purely combinatorial and can be appreciated without background in quantum field theory.) Locally cartesian closed 2-categories provide semantics for 2-truncated intensional type theory. For a fullfledged type theory, locally cartesian closed \infty-categories seem to be needed. The theory of these is being developed by D.Gepner and the author as a setting for homotopical species, and several of the results exposed in this talk are just truncations of \infty-results obtained in joint work with Gepner. Details will appear elsewhere.Comment: This is the final version of my conference paper presented at the 28th Conference on the Mathematical Foundations of Programming Semantics (Bath, June 2012); to appear in the Electronic Notes in Theoretical Computer Science. 16p

Towards a Convenient Category of Topological Domains

We propose a category of topological spaces that promises to be convenient for the purposes of domain theory as a mathematical theory for modelling computation. Our notion of convenience presupposes the usual properties of domain theory, e.g. modelling the basic type constructors, fixed points, recursive types, etc. In addition, we seek to model parametric polymorphism, and also to provide a flexible toolkit for modelling computational effects as free algebras for algebraic theories. Our convenient category is obtained as an application of recent work on the remarkable closure conditions of the category of quotients of countably-based topological spaces. Its convenience is a consequence of a connection with realizability models

A Convenient Category of Domains

We motivate and define a category of "topological domains", whose objects are certain topological spaces, generalising the usual $omega$-continuous dcppos of domain theory. Our category supports all the standard constructions of domain theory, including the solution of recursive domain equations. It also supports the construction of free algebras for (in)equational theories, provides a model of parametric polymorphism, and can be used as the basis for a theory of computability. This answers a question of Gordon Plotkin, who asked whether it was possible to construct a category of domains combining such properties

Geometric Configurations, Regular Subalgebras of E10 and M-Theory Cosmology

We re-examine previously found cosmological solutions to eleven-dimensional supergravity in the light of the E_{10}-approach to M-theory. We focus on the solutions with non zero electric field determined by geometric configurations (n_m, g_3), n\leq 10. We show that these solutions are associated with rank $g$ regular subalgebras of E_{10}, the Dynkin diagrams of which are the (line) incidence diagrams of the geometric configurations. Our analysis provides as a byproduct an interesting class of rank-10 Coxeter subgroups of the Weyl group of E_{10}.Comment: 48 pages, 27 figures, 5 tables, references added, typos correcte

Contacts and Meetings: Location, Duration and Distance Traveled

The role of contacts on travel behavior has been getting increasing attention. This paper reports on data collected on individualÕs social meetings and the choice of in-home/out-of-home meeting locations as well as the distance travelled and duration of out-home-meetings and its relationship to the type of contact met and other attributes of the meeting. Empirically we show that in-home meetings tend to occur most often with close contacts and less often with distant contacts. The purpose, meeting day, and household size suggest that leisure, weekend and large household size people tend to have their meetings either at their home or at their contactÕs home. In addition when meetings occur outside of the house, the duration is longer for close contacts and distance to the meeting location is directly inßuenced by duration and indirectly by the relationship type. Overall the paper illustrates that relationship type along with other meeting speciÞc and demographic variables is important in explaining the location, duration and distance travelled for social meetings.Travel behavior, social networks, meetings, network analysis