Related papers: Multisorted Boolean Clones Determined by Binary Re…
We construct a category equivalent to the category $\mathbf{Mon}$ of monoids and monoid homomorphisms, based on categories with strict factorization systems. This equivalence is then extended to the category $\mathbf{Mon_s}$ of unital…
A topological monoid is isomorphic to an endomorphism monoid of a countable structure if and only if it is separable and has a compatible complete ultrametric such that composition from the left is non-expansive. We also give a topological…
We determine the groups of minimal order in which all groups of order n can embedded for 1 < n < 16. We further determine the order of a minimal group in which all groups or order n or less can be embedded, also for 1 < n < 16.
This paper presents a method to find new De Bruijn cycles based on ones of lesser order. This is done by mapping a De Bruijn cycle to several vertex disjoint cycles in a De Bruijn digraph of higher order and connecting these cycles into one…
We study the problem of classifying the holomorphic $(m,n)$-subharmonic morphisms in complex space. This determines which holomorphic mappings preserves $m$-subharmonicity in the sense that the composition of the holomorphic mapping with a…
We investigate the partial orderings of the form (P(X),\subset), where X is a relational structure and P(X) the set of the domains of its isomorphic substructures. A rough classification of countable binary structures corresponding to the…
We give a full classification of representation types of the subcategories of representations of an $m \times n$ rectangular grid with monomorphisms (dually, epimorphisms) in one or both directions, which appear naturally in the context of…
In \cite{rupel3},the authors defined algebra homomorphisms from the dual Ringel-Hall algebra of certain hereditary abelian category $\mathcal{A}$ to an appropriate $q$-polynomial algebra. In the case that $\mathcal{A}$ is the representation…
Many classes of maps are characterized as (possibly multi-valued) maps preserving particular types of compact filters.
We show that every combinatorial model category can be obtained, up to Quillen equivalence, by localizing a model category of diagrams of simplicial sets. This says that any combinatorial model category can be built up from a category of…
We give a necessary and sufficient condition for two circles, each with finitely many points added inside, to be betweenness isomorphic. We fully characterize the betweenness isomorphism classes in the family consisting of all circles with…
Unsupervised clustering, also known as natural clustering, stands for the classification of data according to their similarities. Here we study this problem from the perspective of complex networks. Mapping the description of data…
Constructions are given of Noetherian maximal orders that are finitely presented algebras over a field K, defined by monomial relations. In order to do this, it is shown that the underlying homogeneous information determines the algebraic…
For any length category, we establish a set of rules (necessary and sufficient) that ensure a partial order on the isomorphism classes of simple objects such that the category is equivalent to the category of finite dimensional…
The relational width of a finite structure, if bounded, is always (1,1) or (2,3). In this paper we study the relational width of first-order expansions of finitely bounded homogeneous binary cores where binary cores are structures with…
Clones of functions play a foundational role in both universal algebra and theoretical computer science. In this work, we introduce clone merge monoids (cm-monoids), a unifying one-sorted algebraic framework that integrates abstract clones,…
This note contains additions to the paper 'Clustered cell decomposition in P-minimal structures' (arXiv:1612.02683). We discuss a question which was raised in that paper, on the order of clustered cells. We also consider a notion of cells…
One deals with arbitrary reduced free divisors in a polynomial ring over a field of characteristic zero, by stressing the ideal theoretic and homological behavior of the corresponding singular locus. A particular emphasis is given to both…
The distributive property can be studied through bilinear maps and various morphisms between these maps. The adjoint-morphisms between bilinear maps establish a complete abelian category with projectives and admits a duality. Thus the…
A countably infinite Boolean inverse monoid that can be written as an increasing union of finite Boolean inverse monoids (suitably embedded) is said to be of finite type. Borrowing terminology from $C^{\ast}$-algebra theory, we say that…