Related papers: A Problem in Categories
The intractability of any problem and the randomness of its solutions have an obvious intuitive connection. However, the challenge till now has been that there is no practical way to firmly establish if the solution to a problem is actually…
The extensions of hypersubstitutions are mappings on the set of all terms. In the present paper we characterize all hypersubstitutions which provide bijections on the set of all terms. The set of all such hypersubstitutions forms a monoid.…
We study the collection of first-order logical schemata all of whose instances are theorems of a given theory $T$; we call these the validities of $T$ ($\mathsf{V}(T)$). It is easy to see that if $T$ is a decidable theory, then…
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…
We explore the possibility to derive basic calculus rules for some subdifferential constructions associated to set-valued maps between normed vector spaces. Then, we use these results in order to write optimality conditions for a special…
We combine two recent ideas: cartesian differential categories, and restriction categories. The result is a new structure which axiomatizes the category of smooth maps defined on open subsets of $\R^n$ in a way that is completely algebraic.…
We classify the solutions to an overdetermined elliptic problem in the plane in the finite connectivity case. This is achieved by establishing a one-to-one correspondence between the solutions to this problem and a certain type of minimal…
In this paper we study grouplike monoids, these are monoids that contain a group to which we add an ordered set of idempotents. We classify finite categories with two objects having grouplike endomorphism monoids, and we give a count of…
Let $G$ be a unitriangular matrix group of nilpotency class at most ten. We show that the Identity Problem (does a semigroup contain the identity matrix?) and the Group Problem (is a semigroup a group?) are decidable in polynomial time for…
It is well-known that small categories have equivalent descriptions as partial monoids. We provide a formulation of partial monoid and partial monoid homomorphism involving $s$ and $t$ instead of identities and then following a recent…
We consider classes of fundamental groups of complements of various kinds of codimension 2 embeddings and show that, in general, the problem of deciding whether or not a group in one class belongs to a smaller class is algorithmically…
Derivations provide a way of transporting ideas from the calculus of manifolds to algebraic settings where there is no sensible notion of limit. In this paper, we consider derivations in certain monoidal categories, called codifferential…
In this paper we deal with a non-linear Diophantine equation which arises from the determinant computation of an integer matrix. We show how to find a solution, when it exists. We define an equivalence relation and show how the set of all…
We consider matrix problems in Hilbert spaces (orthoscalar representations of quivers and posets). A criterion of tameness of the problem of classification of indecomposable orthoscalar representations of a quiver is given.
We consider the problem of realizing a group as the fundamental group of a graph of groups where the vertex groups are restricted to certain classes (for example, coming from a certain finite list of groups, or having bounded geometric…
For every fixed class of regular languages, there is a natural hierarchy of increasingly more general problems: Firstly, the membership problem asks whether a given language belongs to the fixed class of languages. Secondly, the separation…
Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…
In this paper, we study length categories using iterated extensions. We consider the problem of classifying all indecomposable objects in a length category, and the problem of characterizing those length categories that are uniserial. We…
The aim in packing problems is to decide if a given set of pieces can be placed inside a given container. A packing problem is defined by the types of pieces and containers to be handled, and the motions that are allowed to move the pieces.…
After explaining the importance of model categories in abstract homotopy theory, we provide concrete examples demonstrating that various categories of manifolds do not have all finite colimits, and hence cannot be model categories. We then…