Results 71 to 80 of about 30,322 (203)
The Hopf monoid on nonnesting supercharacters of pattern groups
We construct supercharacter theories for a collection of unipotent matrix groups and produce a Hopf monoid from the supercharacters. These supercharacter theories are coarser than those defined by Diaconis--Isaacs for algebra groups and have ...
Andrews, Scott
core +1 more source
43 pages; v2 minor revisions and additions, now 48 ...
Böhm, Gabriella, Lack, Stephen
openaire +2 more sources
Infinity‐operadic foundations for embedding calculus
Abstract Motivated by applications to spaces of embeddings and automorphisms of manifolds, we consider a tower of ∞$\infty$‐categories of truncated right modules over a unital ∞$\infty$‐operad O$\mathcal {O}$. We study monoidality and naturality properties of this tower, identify its layers, describe the difference between the towers as O$\mathcal {O}$
Manuel Krannich, Alexander Kupers
wiley +1 more source
Two-sided homological properties of special and one-relator monoids
A monoid presentation is called special if the right-hand side of each defining relation is equal to 1. We prove results which relate the two-sided homological finiteness properties of a monoid defined by a special presentation with those of its group of
Robert D. Gray, Benjamin Steinberg
doaj +1 more source
A Levi–Civita Equation on Monoids, Two Ways
We consider the Levi–Civita equation f(xy)=g1(x)h1(y)+g2(x)h2(y)f\left( {xy} \right) = {g_1}\left( x \right){h_1}\left( y \right) + {g_2}\left( x \right){h_2}\left( y \right) for unknown functions f, g1, g2, h1, h2 : S → ℂ, where S is a monoid.
Ebanks Bruce
doaj +1 more source
We introduce an interesting class of left adequate monoids which we call pretzel monoids. These, on the one hand, are monoids of birooted graphs with respect to a natural ‘glue-and-fold’ operation, and on the other hand, are shown to be defined in the category of left adequate monoids by a natural class of presentations.
Daniel Heath +2 more
openaire +4 more sources
On the ET0L subgroup membership problem in bounded automata groups
Abstract We are interested in the subgroup membership problem in groups acting on rooted d$d$‐regular trees and a natural class of subgroups, the stabilisers of infinite rays emanating from the root. These rays, which can also be viewed as infinite words in the alphabet with d$d$ letters, form the boundary of the tree.
Alex Bishop +5 more
wiley +1 more source
Assembly of constructible factorization algebras
Abstract We provide a toolbox of extension, gluing, and assembly techniques for factorization algebras. Using these tools, we fill various gaps in the literature on factorization algebras on stratified manifolds, the main one being that constructible factorization algebras form a sheaf of symmetric monoidal ∞$\infty$‐categories.
Eilind Karlsson +2 more
wiley +1 more source
The ∞$\infty$‐categorical reflection theorem and applications
Abstract We prove an ∞$\infty$‐categorical version of the reflection theorem of AdÁmek and Rosický [Arch. Math. 25 (1989), no. 1, 89–94]. Namely, that a full subcategory of a presentable ∞$\infty$‐category that is closed under limits and κ$\kappa$‐filtered colimits is a presentable ∞$\infty$‐category.
Shaul Ragimov, Tomer M. Schlank
wiley +1 more source
On residually finite semigroups of cellullar automata [PDF]
We prove that if M is a monoid and A a finite set with more than one element, then the residual finiteness of M is equivalent to that of the monoid consisting of all cellular automata over M with alphabet A .
Tullio Ceccherini-Silberstein +1 more
doaj

