Related papers: Two isomorphism criteria for directed colimits
This article sets out to understand the categories $\QGr A$ where $A$ is either a monomial algebra or a path algebra of finite Gelfand-Kirillov dimension. The principle questions are: 1) What is the structure of the point modules up to…
Combining results from Keller and Buchweitz, we describe the 1-periodic derived category of a finite dimensional algebra $A$ of finite global dimension as the stable category of maximal Cohen-Macaulay modules over some Gorenstein algebra…
The paper establishes an equivalence between directed homotopy categories of (diagrams of) cubical sets and (diagrams of) directed topological spaces. This equivalence both lifts and extends an equivalence between classical homotopy…
In this paper, we investigate the computational complexity of isomorphism testing for finite groups and quasigroups, given by their multiplication tables. We crucially take advantage of their various decompositions to show the following: -…
We define locally wide finitary 2-categories by relaxing the definition of finitary 2-categories to allow infinitely many objects and isomorphism classes of 1-morphisms and infinite dimensional hom-spaces of 2-morphisms. After defining…
Accessible categories admit a purely category-theoretic replacement for cardinality: the internal size. Generalizing results and methods from arXiv:1708.06782, we examine set-theoretic problems related to internal sizes and prove several…
Colimits are a fundamental construction in category theory. They provide a way to construct new objects by gluing together existing objects that are related in some way. We introduce a complementary notion of anticolimits, which provide a…
Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…
We introduce shortcut graphs and groups. Shortcut graphs are graphs in which cycles cannot embed without metric distortion. Shortcut groups are groups which act properly and cocompactly on shortcut graphs. These notions unify a surprisingly…
We classify all finite-dimensional connected Hopf algebras with large abelian primitive spaces. We show that they are Hopf algebra extensions of restricted enveloping algebras of certain restricted Lie algebras. For any abelian matched pair…
A topological group G is profinite if it is compact and totally disconnected. Equivalently, G is the inverse limit of a surjective system of finite groups carrying the discrete topology. We discuss how to represent a countably based…
We introduce and study the Scott adjunction, relating accessible categories with directed colimits to topoi. Our focus is twofold, we study both its applications to formal model theory and its geometric interpretation. From the geometric…
Let G be a graph with undirected and directed edges. Its representation is given by assigning a vector space to each vertex, a bilinear form on the corresponding vector spaces to each directed edge, and a linear map to each directed edge.…
We study the notion of isomorphism for generalized Bratteli diagrams and investigate properties preserved under isomorphism. We show that every generalized Bratteli diagram is isomorphic to an irreducible generalized Bratteli diagram. We…
(Co)bordisms of manifolds and maps are fundamental and important objects in algebraic and differential topology of manifolds and related studies were started by Thom etc.. Cobordisms of Morse functions were introduced and have been studied…
We establish new uniform height inequalities for rational points on higher-dimensional varieties, extending the classical Roth-Schmidt-Subspace paradigm to the Arakelov-theoretic setting. Our main result provides sharp bounds for heights…
A finite group $G$ is called *uniformly generated*, if whenever there is a (strictly ascending) chain of subgroups $1<\langle x_1\rangle<\langle x_1,x_2\rangle <\cdots<\langle x_1,x_2,\dots,x_d\rangle=G$, then $d$ is the minimal number of…
We investigate the isomorphism problem in the setting of definable sets (equivalent to sets with atoms): given two definable relational structures, are they related by a definable isomorphism? Under mild assumptions on the underlying…
Finite subdivision rules in high dimensions can be difficult to visualize and require complex topological structures to be constructed explicitly. In many applications, only the history graph is needed. We characterize the history graph of…
Let $A$ be a finite dimensional algebra and $D^b(A)$ be the bounded derived category of finitely generated left $A$-modules. In this paper we consider lengths of compact exceptional objects in $D^b(A)$, proving a sufficient condition such…