English
Related papers

Related papers: Products in a Category with Only One Object

200 papers

The groups G_{k,1} of Richard Thompson and Graham Higman can be generalized in a natural way to monoids, that we call M_{k,1}, and to inverse monoids, called Inv_{k,1}; this is done by simply generalizing bijections to partial functions or…

Group Theory · Mathematics 2016-01-27 J. C. Birget

We introduce a family of mathematical objects called $\mathcal{P}$-schemes, where $\mathcal{P}$ is a poset of subgroups of a finite group $G$. A $\mathcal{P}$-scheme is a collection of partitions of the right coset spaces $H\backslash G$,…

Computational Complexity · Computer Science 2017-09-26 Zeyu Guo

We solve the satisfiability problem for a three-sorted fragment of set theory (denoted $3LQST_0^R$), which admits a restricted form of quantification over individual and set variables and the finite enumeration operator $\{\text{-},…

Logic in Computer Science · Computer Science 2015-06-05 Domenico Cantone , Marianna Nicolosi-Asmundo

Graph products of monoids provide a common framework for free products and direct products. Trace monoids are graph products of finitely generated free monoids. We investigate the interaction of certain finitary conditions with graph…

Rings and Algebras · Mathematics 2026-03-10 Dandan Yang , Victoria Gould

We find a finite free resolution of the counit of the free unitary quantum groups of van Daele and Wang and, more generally, Bichon's universal cosovereign Hopf algebras with a generic parameter matrix. This allows us to compute Hochschild…

Quantum Algebra · Mathematics 2024-04-12 Isabelle Baraquin , Uwe Franz , Malte Gerhold , Anna Kula , Mariusz Tobolski

Using automata-theoretic approach, Giambruno and Restivo have investigated on the intersection of two finitely generated submonoids of the free monoid over a finite alphabet. In particular, they have obtained Hanna Neumann property for a…

Formal Languages and Automata Theory · Computer Science 2013-06-12 Shubh Narayan Singh , K. V. Krishna

We study categorical models for the unitless fragment of multiplicative linear logic. We find that the appropriate notion of model is a special kind of promonoidal category. Since the theory of promonoidal categories has not been developed…

Logic in Computer Science · Computer Science 2013-05-14 Robin Houston

The Steinberg tensor product theorem is a fundamental result in the modular representation theory of reductive algebraic groups. It describes any finite-dimensional simple module of highest weight $\lambda$ over such a group as the tensor…

Representation Theory · Mathematics 2024-10-15 Arun S. Kannan

We prove that if a Cartesian product of alternating groups is topologically finitely generated, then it is the profinite completion of a finitely generated residually finite group. The same holds for Cartesian producs of other simple groups…

Group Theory · Mathematics 2007-05-23 Martin Kassabov , Nikolay Nikolov

A braided tensor category $FM_{\kappa}$ of `factorizable D-modules' over configuration spaces is introduced, analogous to the category $FS_q$ of factorizable sheaves from q-alg/9604001. This category is equivalent to the category of finite…

q-alg · Mathematics 2008-02-03 Sergei Khoroshkin , Vadim Schechtman

We show that the finite difference B\"acklund formula for the Schr\"odinger Hamiltonians is a particular element of the transformation group on the set of Riccati equations considered by two of us in a previous paper. Then, we give a group…

Mathematical Physics · Physics 2007-05-23 José F. Cariñena , David J. Fernández C. , Arturo Ramos

We study Whitehead products in the rational homotopy groups of a general component of a function space. For the component of any based map f: X \to Y, in either the based or free function space, our main results express the Whitehead…

Algebraic Topology · Mathematics 2008-12-11 Gregory Lupton , Samuel Bruce Smith

While modal extensions of decidable fragments of first-order logic are usually undecidable, their monodic counterparts, in which formulas in the scope of modal operators have at most one free variable, are typically decidable. This only…

Logic in Computer Science · Computer Science 2025-09-11 Alessandro Artale , Christopher Hampson , Roman Kontchakov , Andrea Mazzullo , Frank Wolter

We consider the value 1 problem for probabilistic automata over finite words: it asks whether a given probabilistic automaton accepts words with probability arbitrarily close to 1. This problem is known to be undecidable. However, different…

Formal Languages and Automata Theory · Computer Science 2017-09-12 Nathanaël Fijalkow

Let G be a finite group that acts on an abelian monoid A. If f: A -> G is a map so that f(a f(a)(b)) = f(a)f(b), for all a, b in A, then the submonoid S = {(a, f(a)) | a in A} of the associated semidirect product of A and G is said to be a…

Rings and Algebras · Mathematics 2007-11-06 Isabel Goffa , Eric Jespers

We establish estimates for the number of ways to represent any reduced residue class as a product of a prime and an integer free of small prime factors. Our best results is conditional on the Generalised Riemann hypothesis (GRH). As a…

Number Theory · Mathematics 2021-07-07 Kam Hung Yau

We present a new class of hermitian one-matrix models originated in the W-infinity algebra: more precisely, the polynomials defining the W-infinity generators in their fermionic bilinear form are shown to expand the orthogonal basis of a…

High Energy Physics - Theory · Physics 2009-11-07 Henry D. Herce , Guillermo R. Zemba

We develop first steps in the study of factorizations of elements in ultraproducts of commutative cancellative monoids into irreducible elements. A complete characterization of the (multi-)sets of lengths in such objects is given. As…

Commutative Algebra · Mathematics 2023-11-29 Daniel Windisch

We assemble polynomials in a locally cartesian closed category into a tricategory, allowing us to define the notion of a polynomial pseudomonad and polynomial pseudoalgebra. Working in the context of natural models of type theory, we prove…

Category Theory · Mathematics 2018-02-06 Steve Awodey , Clive Newstead

We detail a construction of a symmetric monoidal structure, called the reduced tensor product on the 2-category of braided tensor categories $\mathbf{BTC}(\mathcal{A})$ containing a fixed symmetric fusion subcategory $\mathcal{A}$. The…

Quantum Algebra · Mathematics 2024-04-15 Thomas A. Wasserman