Related papers: Relations between counting functions on free group…
The classical theory of free analysis generalizes the noncommutative (nc) polynomials and rational functions, easily providing such results as an nc analogue of the Jacobian conjecture. However, the classical theory misses out on important…
With every reduced $E$-Fountain semigroup $S$ which satisfies the generalized right ample condition we associate a category with zero morphisms $\mathcal{C}(S)$. Under some assumptions we prove an isomorphism of $\Bbbk$-algebras $\Bbbk…
We show that the second bounded cohomology of the free product of racks and quandles is infinite-dimensional as a real vector space. This is similar to the case of groups. As a corollary, we show that the second bounded cohomology of the…
Two measures of how near an arbitrary function between groups is to being a homomorphism are considered. These have properties similar to conjugates and commutators. The authors show that there is a rich theory based on these structures,…
We develop the viewpoint that the opposite of the category of W*-algebras and unital normal *-homomorphisms is analogous to the category of sets and functions. For each pair of W*-algebras, we construct their free exponential, which in the…
Submodular functions are a fundamental object of study in combinatorial optimization, economics, machine learning, etc. and exhibit a rich combinatorial structure. Many subclasses of submodular functions have also been well studied and…
For a group $G$ acting over a set $X$, the set of all the $G$-equivariant functions, i.e., the set of functions which conmute with the action, ($g\cdot f(x)=g\cdot f(x), \forall g\in G, \forall x\in X$), is a monoid with the composition.…
We prove that it is decidable whether or not a finitely generated submonoid of a virtually free group is graded, introduce a new geometric characterization as quasi-geodesic monoids, and show that their word problem is rational (as a…
Let $F$ be a finitely generated free group. We present an algorithm such that, given a subgroup $H\leqslant F$, decides whether $H$ is the fixed subgroup of some family of automorphisms, or family of endomorphisms of $F$ and, in the…
The problem of determining gauge and monoidal equivalence classes of fusion categories is considered from the perspective of geometric invariant theory. It is shown that the gauge (or monoidal) class of a fusion category is determined by…
For any block of a finite group over an algebraically closed field of characteristic $2$ which has dihedral, semidihedral, or generalized quaternion defect groups, we determine explicitly the decomposition of the associated diagonal…
The word problem for categories with free products and coproducts (sums), SP-categories, is directly related to the problem of determining the equivalence of certain processes. Indeed, the maps in these categories may be directly…
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.
We introduce the notion of pie algebra for a 2-monad, these bearing the same relationship to the flexible and semiflexible algebras as pie limits do to flexible and semiflexible ones. We see that in many cases, the pie algebras are…
The Post Correspondence Problem is a classical decision problem about equalisers of free monoid homomorphisms. We prove connections between several variations of this classical problem, but in the setting of free groups and free group…
A binary relation over a free monoid is synchronous if it can be recognized by a synchronous automaton that reads its two tapes simultaneously. We consider the case where the free monoid is generated by a single element (which makes it…
The category of all monads over many-sorted sets (and over other "set-like" categories) is proved to have coequalizers and strong cointersections. And a general diagram has a colimit whenever all the monads involved preserve monomorphisms…
We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…
Let $k$ be a unital commutative ring. In this paper, we study polynomial functors from the category of finitely generated free nilpotent groups to the category of $k$-modules, focusing on comparisons across different nilpotency classes and…
In this paper, we consider various graphs, namely: power graph, cyclic graph, enhanced power graph and commuting graph, on a finite semigroup $S$. For an arbitrary pair of these four graphs, we classify finite semigroups such that the…