Related papers: Free polynomial strong bimonoids
We study polynomial functors over locally cartesian closed categories. After setting up the basic theory, we show how polynomial functors assemble into a double category, in fact a framed bicategory. We show that the free monad on a…
We study the operad of associative algebras equipped with a derivation. We show that it is determined by polynomials in several variables and substitution. Replacing polynomials by rational functions gives an operad which is isomorphic to…
Let $R$ be a ring and $\sigma$ an endomorphism of $R$. In this note, we study skew polynomial rings and skew power series rings over idempotent reflexive rings and abelian rings. Also, we introduce the concept of right (resp., left)…
We use automated theorem provers to significantly shorten a formal development in higher order set theory. The development includes many standard theorems such as the fundamental theorem of arithmetic and irrationality of square root of…
Let S be a complete star-omega semiring and Sigma be an alphabet. For a weighted omega-pushdown automaton P with stateset 1...n, n greater or equal to 1, we show that there exists a mixed algebraic system over a complete semiring-semimodule…
We use pullbacks of rings to realize the submonoids $M$ of $(\N_0\cup\{\infty\})^k$ which are the set of solutions of a finite system of linear diophantine inequalities as the monoid of isomorphism classes of countably generated projective…
We study the category of polynomial functors from finitely generated free groups to a stable infinity-category D. We show that this category is equivalent to the category of excisive functors from pointed animas to D, and also to truncated…
We find polynomial-time solutions to the word problem for free-by-cyclic groups, the word problem for automorphism groups of free groups, and the membership problem for the handlebody subgroup of the mapping class group. All of these…
We calculate the probability that random polynomial matrices over a finite field with certain structures are right prime or left prime, respectively. In particular, we give an asymptotic formula for the probability that finitely many…
Given a finite commutative monoid $M$, we show that submonoids of $M\times [n]$ - where $[n] = \{0,1,\ldots,n\}$ is equipped with the max operation $\vee$ - may be enumerated via the transfer matrix method. When $M$ is also idempotent, we…
We examine two binary operations on the set of algebraic polynomials, known as multiplicative and additive finite free convolutions, specifically in the context of hypergeometric polynomials. We show that the representation of a…
The set of idempotents of any semigroup carries the structure of a biordered set, which contains a great deal of information concerning the idempotent generated subsemigroup of the semigroup in question. This leads to the construction of a…
For an arbitrary rational polyhedron we consider its decompositions into Minkowski summands and, dual to this, the free extensions of the associated pair of semigroups. Being free for the pair of semigroups is equivalent to flatness for the…
Many random combinatorial objects have a component structure whose joint distribution is equal to that of a process of mutually independent random variables, conditioned on the value of a weighted sum of the variables. It is interesting to…
In this work we consider two rich subclasses of weighted automata over fields: polynomially ambiguous weighted automata and copyless cost register automata. Primarily we are interested in understanding their expressiveness power. Over the…
Endowing the set of functional graphs (FGs) with the sum (disjoint union of graphs) and product (standard direct product on graphs) operations induces on FGs a structure of a commutative semiring R. The operations on R can be naturally…
In this paper we consider dimonoids, which are sets equipped with two associative binary operations. Dimonoids in the sense of J.-L. Loday are xamples of duplexes. The set of all permutations, gives an example of a duplex which is not a…
Commutative totally ordered monoids abound, number systems for example. When the monoid is not assumed commutative, one may be hard pressed to find an example. One suggested by Professor Orr Shalit are the countable ordinals with addition.…
We describe the pronilpotent quotients of a class of projective profinite groups, that we call $\omega$-presented groups, defined using a special type of presentations. The pronilpotent quotients of an $\omega$-presented group are…
I classify projective modules over idempotent semirings that are free on a monoid. The analysis extends to the case of the semiring of convex, piecewise-affine functions on a polyhedron, for which projective modules correspond to convex…