Related papers: A Problem in Categories
A \textit{distinguishing partition} of a group $X$ with automorphism group ${aut}(X)$ is a partition of $X$ that is fixed by no nontrivial element of ${aut}(X)$. In the event that $X$ is a complete multipartite graph with its automorphism…
We show that the word problem for braided monoidal categories is at least as hard as the unknotting problem. As a corollary, so is the word problem for Gray categories. We conjecture that the word problem for Gray categories is decidable.
In this note, we find a sharp bound for the minimal number (or in general, indexing set) of subspaces of a fixed (finite) codimension needed to cover any vector space V over any field. If V is a finite set, this is related to the problem of…
Given an undirected graph representing similarities between a set of items and an additive measure evaluating the items, we treat the position of a special subset of items in an ordinal ranking through a collection of combinatorial…
The nonlinear concepts of mixed summable families and maps for the spaces that only non-void sets are developed. Several characterizations of the corresponding concepts are achieved and the proof for a general Pietsch Domination-type…
Matrix-valued polynomials in any finite number of freely noncommuting variables that enjoy certain canonical partial convexity properties are characterized, via an algebraic certificate, in terms of Linear Matrix Inequalities and Bilinear…
In the literature two notions of the word problem for a variety occur. A variety has a decidable word problem if every finitely presented algebra in the variety has a decidable word problem. It has a uniformly decidable word problem if…
We classify the matrices M which correspond to finite categories
We study the problem of determining whether a given frame is scalable, and when it is, understanding the set of all possible scalings. We show that for most frames this is a relatively simple task in that the frame is either not scalable or…
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…
We introduce the notion of a definable category--a category equivalent to a full subcategory of a locally finitely presentable category that is closed under products, directed colimits and pure subobjects. Definable subcategories are…
This paper investigates self-maps T from X to X which satisfy a distance constraint in a metric space which mixed point-dependent non-expansive properties, or in particular contractive ones, and potentially expansive properties related to…
Restriction categories were established to handle maps that are partially defined with respect to composition. Tensor topology realises that monoidal categories have an intrinsic notion of space, and deals with objects and maps that are…
We prove that, if X is a variety over an uncountable algebraically closed field k of characteristic zero, then any irreducible exceptional divisor E on a resolution of singularities of X which is not uniruled, belongs to the image of the…
In Categorial Topology, given a category (as a "geometric object") we can consider its properties preserved under continuous action (a "deformation") of a comma-propagation operation. However, the Metacategory space, valid for all…
Let X and Y be curves over a finite field. In this article we explore methods to determine whether there is a rational map from Y to X by considering L-functions of certain covers of X and Y and propose a specific family of covers to…
Weighted counting problems are a natural generalization of counting problems where a weight is associated with every computational path of polynomial-time non-deterministic Turing machines and the goal is to compute the sum of the weights…
We consider the possibility problem of determining if a document is a possible world of a probabilistic document, in the setting of probabilistic XML. This basic question is a special case of query answering or tree automata evaluation, but…
A new approach is suggested to characterize algebraically automorphisms of the category of free algebras of a given variety. It gives in many cases an answer to the problem set by the first of authors, if automorphisms of such a category…
Given an essentially small triangulated category it is possible to give a metric on it, to complete it with respect to the metric, and to look at the subcategory of objects in the completion which are compactly supported with respect to the…