Related papers: Towards a Characterization of Universal Categories
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…
Motivated by potential applications to theoretical computer science, in particular those areas where the Curry-Howard correspondence plays an important role, as well as by the ongoing search in pure mathematics for feasible approaches to…
We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…
We classify the finite connected-homogeneous digraphs, as well as the infinite such digraphs with precisely one end. This completes the classification of all the locally finite connected-homogeneous digraphs.
In this paper we study hypergraphs definable in an algebraically closed field. Our goal is to show, in the spirit of the so-called transference principles in extremal combinatorics, that if a given algebraic hypergraph is "dense" in a…
We introduce the category of finite strings and study its basic properties. The category is closely related to the augmented simplex category, and it models categories of linear representations. Each lattice of non-crossing partitions…
We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…
The purpose of this paper is to show that the dual notions of elements & distinctions are the basic analytical concepts needed to unpack and analyze morphisms, duality, and universal constructions in the Sets, the category of sets and…
This paper is concerned with the taxonomy of finitely complete categories, based on 'matrix properties' - these are a particular type of exactness properties that can be represented by integer matrices. In particular, the main result of the…
Universal algebraic geometry allows considering of geometric properties of every universal algebra. When two algebras have same algebraic geometry? We must consider the categories of algebraic closed sets of these algebras to answer this…
In this article we study homotopes of finite-dimensional algebras (not necessarily, associative). In the case of associative algebras we study homotopes by methods of Category theory and give description of so-called well-tempered elements…
We explain how categories, and groupoids, can be seen as models for a Lawvere ${\mathfrak Gr}$-theory, where ${\mathfrak Gr}$ is the category of graphs, and show that for Lawvere ${\mathfrak Gr}$-theories finitely presentable models are…
In this paper I survey the sources of inspiration for my own and co-authored work in trying to develop a general theory of graph polynomials. I concentrate on meta-theorems, i.e., theorem which depend only on the form infinite classes of…
For a set-endofunctor $F$, we extend the notion of universal $F$-coalgebras to $F$-graphs. These generalized coalgebras are models for various types of graphs, such as (un)directed (hyper)graphs, relational structures or fuzzy graphs. The…
We characterise all vertex-transitive finite connected graphs as essentially 5-connected or on a short list of explicit graph-classes. Our proof heavily uses Tutte-type canonical decompositions.
We give a characterization of the sets of objects of the derived category of a block of a finite group algebra (or other symmetric algebra) that occur as the set of images of simple modules under an equivalence of derived categories. We…
We introduce categories of weak factorization algebras and factorization spaces, and prove that they are equivalent to the categories of ordinary factorization algebras and spaces, respectively. This allows us to define the pullback of a…
We characterize when the elementary diagram of a mutually algebraic structure has a model complete theory, and give an explicit description of a set of existential formulas to which every formula is equivalent. This characterization yields…
We characterize the fundamental group of a locally finite graph G with ends combinatorially, as a group of infinite words. Our characterization gives rise to a canonical embedding of this group in the inverse limit of the (free) fundamental…
In recent work, the authors developed a simple method of constructing topological spaces from certain well-behaved partially ordered sets -- those coming from sequences of relations between finite sets. This method associates a given poset…