Related papers: Finite Inverse Categories as Signatures
These are classified by the direction of approximation (from above or below), the set family types (partition or covering) of simple functions, the coefficient signature (non-negative or signed), and cardinal number of terms of simple…
We define a general class of dependent type theories, encompassing Martin-L\"of's intuitionistic type theories and variants and extensions. The primary aim is pragmatic: to unify and organise their study, allowing results and constructions…
We show that in the category of groups, every singly-generated class which is closed under isomorphisms, direct limits and extensions is also singly-generated under isomorphisms and direct limits, and in particular is co-reflective. We also…
An algebra is said to be \emph{$\tau$-tilting finite} provided it has only a finite number of $\tau$-rigid objects up to isomorphism. We associate a category to each such algebra. The objects are the wide subcategories of its category of…
We give a definition of a class of Dedekind domains which includes the rings of integers of global fields and give a proof that all rings in this class have finite ideal class group. We also prove that this class coincides with the class of…
We use the G-signature theorem to define an invariant of strongly invertible knots analogous to the knot signature.
In this note, finite type epimorphisms of rings are characterized.
Coclass theory can be used to define infinite families of finite p-groups of a fixed coclass. It is conjectured that the groups in one of these infinite families all have isomorphic mod-p cohomology rings. Here we prove that almost all…
We prove that if a Cartesian product of alternating groups is topologically finitely generated, then it is the profinite completion of a finitely generated residually finite group. The same holds for Cartesian producs of other simple groups…
Refinement types turn typechecking into lightweight verification. The classic form of refinement type is the datasort refinement, in which datasorts identify subclasses of inductive datatypes. Existing type systems for datasort refinements…
We describe the additive subgroups of fields which are closed with respect to taking inverses. In particular, in characteristic different from two any such subgroup is either a subfield or the kernel of the trace map of a quadratic…
It has been conjectured that finite tensor categories have finitely generated cohomology. We show that this is equivalent to finitely generated Hochschild cohomology for the endomorphism algebras of the projective generators.
We introduce the notion of residual finiteness for categories. In analogy with the group-theoretic setting, we prove that free categories and finitely generated subcategories of finite-dimensional vector spaces are residually finite.…
We consider deformations of bounded complexes of modules for a profinite group G over a field of positive characteristic. We prove a finiteness theorem which provides some sufficient conditions for the versal deformation of such a complex…
A group is $\textit{finitely axiomatizable}$ (FA) in a class $\mathcal{C}$ if it can be determined up to isomorphism within $\mathcal{C}$ by a sentence in the first-order language of group theory. We show that profinite groups of various…
We present a domain-specific type theory for constructions and proofs in category theory. The type theory axiomatizes notions of category, functor, profunctor and a generalized form of natural transformations. The type theory imposes an…
A new proof of the classification for tensor ideal thick subcategories of the bounded derived category, and the stable category, of modular representations of a finite group is obtained. The arguments apply more generally to yield a…
By showing the compatibility of folding almost positive roots and folding cluster categories, we prove that there is a one-to-one correspondence between seeds and tilting seeds in non-simply-laced finite cases.
A self-similar group of finite type is the profinite group of all automorphisms of a regular rooted tree that locally around every vertex act as elements of a given finite group of allowed actions. We provide criteria for determining when a…
In this note we prove and disprove some chain conditions in type definable and definable groups in dependent, strongly dependent and strongly^{2} dependent theories.