Related papers: General non-structure theory and constructing from…
Generalized trees, we call them O-trees, are defined as hierarchical partial orders, i.e., such that the elements larger than any one are linearly ordered. Quasi-trees are, roughly speaking, undirected O-trees. For O-trees and quasi-trees,…
Two structures are said to be equimorphic if each embeds in the other. Such structures cannot be expected to be isomorphic, and in this paper we investigate the special case of linear orders, here also called chains. In particular we…
We explore the possibility of extending Mardare et al. quantitative algebras to the structures which naturally emerge from Combinatory Logic and the lambda-calculus. First of all, we show that the framework is indeed applicable to those…
We prove, in ZFC, that there is an infinite strictly descending chain of classes of theories in Keisler's order. Thus Keisler's order is infinite and not a well order. Moreover, this chain occurs within the simple unstable theories,…
The theory of $N$-complexes is a generalization of both ordinary chain complexes and graded objects. Hence it yields deeper insight in the structure of these and offers a broader range of applications. This work generalizes the tensor…
Motivated by bifurcation of branches of homoclinic orbits of dynamical systems, we consider families of first-order equations on the real line and introduce a generalisation of previous index theorems by Pejsachowicz, and by Hu and…
A new tree model is introduced based on ordered trees, by distinguishing exactly one child of each node that \emph{has} children. The basic enumeration leads to a cubic equation of the generating function. The extraction of its coefficients…
This paper studies the logical properties of a very general class of infinite ranked trees, namely those generated by higher-order recursion schemes. We consider, for both monadic second-order logic and modal mu-calculus, three main…
Consider the poset of partitions of {1,...(n-1)k+1} with block sizes congruent to 1 modulo k. We prove that its order complex is a subdivision of the complex of k-trees, thereby answering a question posed by Feichtner. The result is…
We develop the theory of ``branch algebras'', which are infinite-dimensional associative algebras that are isomorphic, up to taking subrings of finite codimension, to a matrix ring over themselves. The main examples come from groups acting…
Ordered item response models that are in common use can be divided into three groups, cumulative, sequential and adjacent categories model. The derivation and motivation of the models is typically based on the assumed presence of latent…
We introduce a notion of a filtered model structure and use this notion to produce various model structures on pro-categories. This framework generalizes several known examples. We give several examples, including a homotopy theory for…
Comtraces (combined traces) are extensions of Mazurkiewicz traces that can model the "not later than" relationship. In this paper, we first introduce the novel notion of generalized comtraces, extensions of comtraces that can additionally…
We describe arithmetic computations in terms of operations on some well known free algebras (S1S, S2S and ordered rooted binary trees) while emphasizing the common structure present in all them when seen as isomorphic with the set of…
This paper begins by extending the notion of a combinatorial configuration of points and lines to a combinatorial configuration of points and planes that we refer to as configurations of order $2$. We then proceed to investigate a further…
We deal with the existence of universal members in a given cardinality for several classes. First we deal with classes of Abelian groups, specifically with the existence of universal members in cardinalities which are strong limit singular…
We introduce frameworks for constructing global derived moduli stacks associated to a broad range of problems, bridging the gap between the concrete and abstract conceptions of derived moduli. Our three approaches are via differential…
Let $R$ be a ring with unit. Passing to the colimit with respect to the standard inclusions $GL(n,R) \to GL(n+1,R)$ (which add a unit vector as new last row and column) yields, by definition, the stable linear group $GL(R)$; the same result…
We investigate categoricity of abstract elementary classes without any remnants of compactness (like non-definability of well ordering, existence of E.M. models or existence of large cardinals). We prove (assuming a weak version of GCH…
We prove necessary and sufficient conditions on a family of (generalised) gridding matrices to determine when the corresponding permutation classes are partially well-ordered. One direction requires an application of Higman's Theorem and…