Related papers: Weights for Monoids and Actions of Monoids
If $\mathcal{C}$ is a cocomplete monoidal category in which tensoring from both sides preserves coequalizers, then the category of monoids over $\mathcal{C}$ is cocomplete. The same holds if $\mathcal{C}$ has regular factorizations and…
Define the weight of a matrix to be the number of non-zero entries. One would like to count $m$ by $n$ matrices over a finite field by their weight and rank. This is equivalent to determining the probability distribution of the weight while…
We show that the word problem for braided monoidal categories is at least as hard as the unknotting problem. As a corollary, so is the word problem for Gray categories. We conjecture that the word problem for Gray categories is decidable.
One aim of this paper is to develop some aspects of the theory of monoidal derivators. The passages from categories and model categories to derivators both respect monoidal objects and hence give rise to natural examples. We also introduce…
In this article, we present weighted norm inequality for a fractional one-sided minimal function. We prove weighted weak and strong type norm inequalities for the one-sided minimal function on $\mathbb{R}.$ We construct two weight classes…
Motivated by the study of word problems of monoids, we explore two ways of viewing binary relations on $A^*$ as languages. We exhibit a hierarchy of classes of binary relations on $A^*$, according to the class of languages the relation…
Effectful categories have two classes of morphisms: pure morphisms, which form a monoidal category; and effectful morphisms, which can only be combined monoidally with central morphisms (such as the pure ones), forming a premonoidal…
We introduce the notion of Whitehead sequence which is defined for a base category together with a system of abstract actions over it. In the classical case of groups and group actions the Whitehead sequences are precisely the…
In recent years codes that are not Uniquely Decipherable (UD) are been studied partitioning them in classes that localize the ambiguities of the code. A natural question is how we can extend the notion of maximality to codes that are not…
We propose a definition of the category of hybrid systems in which executions are special types of morphisms. Consequently morphisms of hybrid systems send executions to executions. We plan to use this result to define and study networks of…
Preenvelopes of acts over a monoid are defined by analogy with Enochs' definition of preenvelopes of modules. Provided that it is closed for pure subacts, a class of acts is shown to be preenveloping precisely when it is closed under direct…
It has been recently shown that, under appropriate hypotheses, the $\omega$-limit sets of a dynamical system are characterized by internal chain transitivity. In this paper, we examine generalizations of these ideas in the context of the…
The non-empty finite subsets of a multiplicatively written monoid form a monoid under setwise multiplication. The same holds for finite subsets containing the identity element. Partly due to their unusual arithmetic properties, these…
A multicategory is what remains of a monoidal category when monoidal product is not available. A weak multicategory means that hom-sets are in fact categories, and in place of usual equations, there are natural isomorphisms, which have to…
There are different notions of computation, the most popular being monads, applicative functors, and arrows. In this article we show that these three notions can be seen as monoids in a monoidal category. We demonstrate that at this level…
In this paper we develope a categorical theory of relations and use this formulation to define the notion of quantization for relations. Categories of relations are defined in the context of symmetric monoidal categories. They are shown to…
The main purpose of this paper is to give a new definition for the notion of group-groupoid. Also, several basic properties of group-groupoids are established.
In the category of monoids we characterize monomorphisms that are normal, in an appropriate sense, to internal reflexive relations, preorders or equivalence relations. The zero-classes of such internal relations are first described in terms…
The article investigates the properties of associative ideals in monoids. Such ideals have some applications in the logic of non-standard sequences and category theory. The relations of these ideals with the verbal structure of words over…
A certain analysis of all possible associative binary operations on N is presented. This is equivalent with an analysis of all possible monoid structures on N. Several results and a conjecture in this regard are given.