Logics with rigidly guarded data tests

The notion of orbit finite data monoid was recently introduced by Bojanczyk as an algebraic object for defining recognizable languages of data words. Following Buchi's approach, we introduce a variant of monadic second-order logic with data equality tests that captures precisely the data languages recognizable by orbit finite data monoids. We also establish, following this time the approach of Schutzenberger, McNaughton and Papert, that the first-order fragment of this logic defines exactly the data languages recognizable by aperiodic orbit finite data monoids. Finally, we consider another variant of the logic that can be interpreted over generic structures with data. The data languages defined in this variant are also recognized by unambiguous finite memory automata

On the representation theory of finite J-trivial monoids

In 1979, Norton showed that the representation theory of the 0-Hecke algebra admits a rich combinatorial description. Her constructions rely heavily on some triangularity property of the product, but do not use explicitly that the 0-Hecke algebra is a monoid algebra. The thesis of this paper is that considering the general setting of monoids admitting such a triangularity, namely J-trivial monoids, sheds further light on the topic. This is a step to use representation theory to automatically extract combinatorial structures from (monoid) algebras, often in the form of posets and lattices, both from a theoretical and computational point of view, and with an implementation in Sage. Motivated by ongoing work on related monoids associated to Coxeter systems, and building on well-known results in the semi-group community (such as the description of the simple modules or the radical), we describe how most of the data associated to the representation theory (Cartan matrix, quiver) of the algebra of any J-trivial monoid M can be expressed combinatorially by counting appropriate elements in M itself. As a consequence, this data does not depend on the ground field and can be calculated in O(n^2), if not O(nm), where n=|M| and m is the number of generators. Along the way, we construct a triangular decomposition of the identity into orthogonal idempotents, using the usual M\"obius inversion formula in the semi-simple quotient (a lattice), followed by an algorithmic lifting step. Applying our results to the 0-Hecke algebra (in all finite types), we recover previously known results and additionally provide an explicit labeling of the edges of the quiver. We further explore special classes of J-trivial monoids, and in particular monoids of order preserving regressive functions on a poset, generalizing known results on the monoids of nondecreasing parking functions.Comment: 41 pages; 4 figures; added Section 3.7.4 in version 2; incorporated comments by referee in version

Parabolic sheaves on logarithmic schemes

We show how the natural context for the definition of parabolic sheaves on a scheme is that of logarithmic geometry. The key point is a reformulation of the concept of logarithmic structure in the language of symmetric monoidal categories, which might be of independent interest. Our main result states that parabolic sheaves can be interpreted as quasi-coherent sheaves on certain stacks of roots.Comment: 37 page

A correspondence between a class of monoids and self-similar group actions II

The first author showed in a previous paper that there is a correspondence between self-similar group actions and a class of left cancellative monoids called left Rees monoids. These monoids can be constructed either directly from the action using Zappa-Sz\'ep products, a construction that ultimately goes back to Perrot, or as left cancellative tensor monoids from the covering bimodule, utilizing a construction due to Nekrashevych, In this paper, we generalize the tensor monoid construction to arbitrary bimodules. We call the monoids that arise in this way Levi monoids and show that they are precisely the equidivisible monoids equipped with length functions. Left Rees monoids are then just the left cancellative Levi monoids. We single out the class of irreducible Levi monoids and prove that they are determined by an isomorphism between two divisors of its group of units. The irreducible Rees monoids are thereby shown to be determined by a partial automorphism of their group of units; this result turns out to be signficant since it connects irreducible Rees monoids directly with HNN extensions. In fact, the universal group of an irreducible Rees monoid is an HNN extension of the group of units by a single stable letter and every such HNN extension arises in this way.Comment: Some very minor corrections made and the dedication adde

Hopf monoids from class functions on unitriangular matrices

We build, from the collection of all groups of unitriangular matrices, Hopf monoids in Joyal's category of species. Such structure is carried by the collection of class function spaces on those groups, and also by the collection of superclass function spaces, in the sense of Diaconis and Isaacs. Superclasses of unitriangular matrices admit a simple description from which we deduce a combinatorial model for the Hopf monoid of superclass functions, in terms of the Hadamard product of the Hopf monoids of linear orders and of set partitions. This implies a recent result relating the Hopf algebra of superclass functions on unitriangular matrices to symmetric functions in noncommuting variables. We determine the algebraic structure of the Hopf monoid: it is a free monoid in species, with the canonical Hopf structure. As an application, we derive certain estimates on the number of conjugacy classes of unitriangular matrices.Comment: Final Version, 32 pages, accepted in "Algebra and Number Theory