Related papers: A note on isomorphisms between submonoids of $\mat…
Let R be a ring, M a nonzero left R-module, X an infinite set, and E the endomorphism ring of the direct sum of copies of M indexed by X. Given two subrings S and S' of E, we will say that S is equivalent to S' if there exists a finite…
Two graphs $G$ and $H$ are homomorphism indistinguishable over a class of graphs $\mathcal{F}$ if for all graphs $F \in \mathcal{F}$ the number of homomorphisms from $F$ to $G$ is equal to the number of homomorphisms from $F$ to $H$. Many…
Subgraph Isomorphism is a very basic graph problem, where given two graphs $G$ and $H$ one is to check whether $G$ is a subgraph of $H$. Despite its simple definition, the Subgraph Isomorphism problem turns out to be very broad, as it…
We give a complete classification of homomorphisms from the braid group on $n$ strands to the braid group on $2n$ strands when $n$ is at least 5. We also classify endomorphisms of the braid group on 4 strands, as well as homomorphisms from…
We give an explicit characterization for group extensions that correspond to elements of the symmetric cohomology $HS^2(G,A)$. We also give conditions for the map $HS^n(G,A)\to H^n(G,A)$ to be injective.
Let (G, *) be a semigroup, D subset of G, and n >= 2 be an integer. We say that (D, *) is an n-closed subset of G if a_1* ... *a_n in D for every a_1, ..., a_n in D. Hence every closed set is a 2-closed set. The concept of n-closed sets…
We consider the general question of how the homological finiteness property left-FPn holding in a monoid influences, and conversely depends on, the property holding in the substructures of that monoid. In particular we show that left-FPn is…
We consider semigroup actions on the interval generated by two attracting maps. It is known that if the generators are sufficiently $C^2$-close to the identity, then the minimal set coincides with the whole interval. In this article, we…
Given two structures $\mathcal{M}$ and $\mathcal{N}$ on the same domain, we say that $\mathcal{N}$ is a reduct of $\mathcal{M}$ if all $\emptyset$-definable relations of $\mathcal{N}$ are $\emptyset$-definable in $\mathcal{M}$. In this…
We study statistical properties of random numerical semigroups of a given genus. We analyze the graph of a typical numerical semigroup, understood as a function from $\mathbb{N}$ to $\mathbb{N}$. If $S$ is a numerical semigroup of genus…
A $k$-uniform hypergraph $M$ is set-homogeneous if it is countable (possibly finite) and whenever two finite induced subhypergraphs $U,V$ are isomorphic there is $g\in Aut(M)$ with $U^g=V$; the hypergraph $M$ is said to be homogeneous if in…
In this note the notion of kernel of a representation of a semisimple Hopf algebra is introduced. Similar properties to the kernel of a group representation are proved in some special cases. In particular, every normal Hopf subalgebra of a…
M.Newman has asked if it is the case that whenever H and K are isomorphic subgroups of a finite solvable group G with H maximal, then K is also maximal. This question was considered in a paper of I.M. Isaacs and the second author, where…
This paper presents and explores a theory of \emph{multiholomorphic maps}. This group of ideas generalizes the theory of pseudoholomorphic curves in a direction suggested by consideration of the kinds of compatible geometric structures that…
We show that the category of Poisson manifolds and Poisson maps, the category of symplectic microgroupoids and lagrangian submicrogroupoids (as morphisms), and the category of monoids and monoid morphisms in the microsymplectic category are…
Given a pseudomonad $\mathcal{T} $, we prove that a lax $\mathcal{T} $-morphism between pseudoalgebras is a $\mathcal{T} $-pseudomorphism if and only if there is a suitable (possibly non-canonical) invertible $\mathcal{T} $-transformation.…
A relational structure is homomorphism-homogeneous (HH-homogeneous for short) if every homomorphism between finite induced substructures of the structure can be extended to a homomorphism over the whole domain of the structure. Similarly, a…
We study the semigroup identities satisfied by finite rank plactic monoids. We find a new set of semigroup identities of the plactic monoid of rank $n$ for $n \geq 4$, which are shorter than those previously known when $n \geq 6$. Using…
A graph homomorphism between two graphs is a map from the vertex set of one graph to the vertex set of the other graph, that maps edges to edges. In this note we study the range of a uniformly chosen homomorphism from a graph G to the…
We construct the \emph{inverse partition semigroup} $\mathcal{IP}_X$, isomorphic to the \emph{dual symmetric inverse monoid} $\mathcal{I}^{\ast}_X$, introduced in [6]. We give a convenient geometric illustration for elements of…