Related papers: Model structures on finite total orders

We present a matrix-theoretic approach for studying and enumerating finite posets through their incidence representations, referred to as poset matrices. Naturally labelled posets are encoded as Boolean lower triangular matrices, allowing a…

We apply the theory of finite-type invariants of homology 3-spheres to investigate the structure of the Torelli group. We construct natural cocycles in the Torelli group and show that the lower central series quotients of the Torelli group…

We provide a new combinatorial approach to studying the collection of N-infinity-operads in G-equivariant homotopy theory for G a finite cyclic group. In particular, we show that for G the cyclic group of order p^n the natural order on the…

The stable category of modules over the algebra of a finite group with coefficients in a field is a compactly generated tensor triangulated category, that has been studied extensively in representation theory. In this paper, we provide a…

We give a combinatorial classification for the class of postcritically fixed Newton maps of polynomials and indicate potential for extensions. As our main tool, we show that for a large class of Newton maps that includes all hyperbolic…

This paper is a continuation of our work on the functional-analytic core of the classical Furstenberg-Zimmer theory. We introduce and study (in the framework of lattice-ordered spaces) the notions of total order-boundedness and uniform…

This is a survey, intended both for group theorists and model theorists, concerning the structure of pseudofinite groups, that is, infinite models of the first order theory of finite groups. The focus is on concepts from stability theory…

Let $G$ be a discrete group. We prove that the category of $G$-posets admits a model structure that is Quillen equivalent to the standard model structure on $G$-spaces. As is already true nonequivariantly, the three classes of maps defining…

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

We introduce a new class of structured symmetric matrices by extending the notion of perfect elimination ordering from graphs to weighted graphs or matrices. This offers a common framework capturing common vertex elimination orderings of…

We use a classical result of McCord and reduction methods of finite spaces to prove a generalization of Thomason's theorem on homotopy colimits over posets. In particular this allows us to characterize the homotopy colimits of diagrams of…

Let $\Lambda$ be a finite-dimensional algebra over a field $K$. We describe how Buan and Marsh's $\tau$-exceptional sequences can be used to give a "brick labeling" of a certain poset of wide subcategories of finitely-generated…

Motivated by representation theory we exhibit an interior structure to Catalan sequences and many generalisations thereof. Certain of these coincide with well known (but heretofore isolated) structures. The remainder are new.

We define and study structural properties of hypergraphs of models of a theory including lattice ones. Characterizations for the lattice properties of hypergraphs of models of a theory, as well as for structures on sets of isomorphism types…

We show that on an arbitrary collection of objects there is a wide variety of higher order architectures governed by hyperstructures. Higher order gluing, local to global processes, fusion of collections, bridges and higher order types are…

A structure of a complete lattice (in the sense of a poset) is defined on the underlying set of the orhtogonal group of a real Euclidean space, by a construction analogous to that of the weak order of a Coxeter system in terms of its root…

A lattice-ordered group (an $\ell$-group) $G(\oplus, \vee, \wedge)$ can be naturally viewed as a semiring $G(\vee,\oplus)$. We give a full classification of (abelian) $\ell$-groups which are finitely generated as semirings, by first showing…

The study of many problems in additive combinatorics, such as Szemer\'edi's theorem on arithmetic progressions, is made easier by first studying models for the problem in F_p^n for some fixed small prime p. We give a number of examples of…

For all classical groups (and for their analogs in infinite dimension or over general base fields or rings) we construct certain contractions, called "homotopes". The construction is geometric, using as ingredient involutions of associative…

For all classical groups (and for their analogs in infinite dimension or over general base fields or rings) we construct certain contractions, called "homotopes". The construction is geometric, using as ingredient involutions of associative…