Related papers: Composition closed premodel structures and the Kre…
Let $\mathcal{C}$ be a finitely bicomplete category and $\mathcal{W}$ a subcategory. We prove that the existence of a model structure on $\mathcal{C}$ with $\mathcal{W}$ as subcategory of weak equivalence is not first order expressible.…
We study a class of combinatorial objects that we call "decorated trees". These consist of vertices, arrows and edges, where each edge is decorated by two integers (one near each of its endpoints), each arrow is decorated by an integer, and…
The class of skew lattices can be seen as an algebraic category. It models an algebraic theory in the category of Sets where the Green's relation D is a congruence describing an adjunction to the category of Lattices. In this paper we will…
We introduce and characterize various gluing constructions for residuated lattices that intersect on a common subreduct, and which are subalgebras, or appropriate subreducts, of the resulting structure. Starting from the 1-sum construction…
We construct counterexamples to the conjecture that every free arrangement is recursively free in characteristic zero. The intersection lattice of our smallest example has a realization over a finite field which is recursively free, thus…
This paper primarily studies monomial ideals by their associated lcm-lattices. It first introduces notions of weak coordinatizations of finite atomic lattices which have weaker hypotheses than coordinatizations and shows the…
We introduce a sequent calculus with a simple restriction of Lambek's product rules that precisely captures the classical Tamari order, i.e., the partial order on fully-bracketed words (equivalently, binary trees) induced by a…
In the present paper we introduce and study a canonical ${\cal E}$-lattice structure on the set of element orders of some finite groups. We show that a finite abelian group is uniquely determined by this canonical ${\cal E}$-lattice.
A class of structures is monadically dependent if one cannot interpret all graphs in colored expansions from the class using a fixed first-order formula. A tree-ordered $\sigma$-structure is the expansion of a $\sigma$-structure with a…
We show that the class of finite rooted binary plane trees is a Ramsey class (with respect to topological embeddings that map leaves to leaves). That is, for all such trees P,H and every natural number k there exists a tree T such that for…
This paper addresses the overwhelming computational resources needed with standard numerical approaches to simulate architected materials. Those multiscale heterogeneous lattice structures gain intensive interest in conjunction with the…
The aim of this paper is to establish a lattice theoretical framework to study the partially ordered set $\operatorname{\mathsf{tors}} A$ of torsion classes over a finite-dimensional algebra $A$. We show that $\operatorname{\mathsf{tors}}…
The theme of the first two sections, is to prepare the framework of how from a ``complicated'' family of so called index models $I \in K_1$ we build many and/or complicated structures in a class $K_2$. The index models are…
One way of studying a relational structure is to investigate functions which are related to that structure and which leave certain aspects of the structure invariant. Examples are the automorphism group, the self-embedding monoid, the…
We give an account of lax orthogonal factorisation systems on order-enriched categories. Among them, we define and characterise the KZ-reflective ones, in a way that mirrors the characterisation of reflective orthogonal factorisation…
We show analogues of the classical Krein-Milman theorem for several ordered algebraic structures, especially in a semilattice (non-linear) framework. In that case, subsemilattices are seen as convex subsets, and for our proofs we use…
In this paper we study maximal chains in certain lattices constructed from powers of chains by iterated lax colimits in the $2$-category of posets. Such a study is motivated by the fact that in lower dimensions, we get some familiar…
We study the structure of the set of all maximal green sequences of a finite-dimensional algebra. There is a natural equivalence relation on this set, which we show can be interpreted in several different ways, underscoring its…
Flow polytopes of acyclic oriented graphs arise naturally in combinatorial optimization, and the study of their volumes and triangulations has revealed intriguing connections across combinatorics, geometry, algebra, and representation…
Each hereditary property can be characterized by its set of minimal obstructions; these sets are often unknown, or known but infinite. By allowing extra structure it is sometimes possible to describe such properties by a finite set of…