Related papers: On better-quasi-ordering classes of partial orders

Capretta's delay monad can be used to model partial computations, but it has the "wrong" notion of built-in equality, strong bisimilarity. An alternative is to quotient the delay monad by the "right" notion of equality, weak bisimilarity.…

By considering the parity of the degrees and levels of nodes in increasing trees, a new combinatorial interpretation for the coefficients of the Taylor expansions of the Jacobi elliptic functions is found. As one application of this new…

A finite poset (partially ordered set) $P$ with ${\hat 0}$ is called of distributive type if every interval $[{\hat 0}, a]$, $a \in P$, of $P$ is a distributive lattice. From a viewpoint of ASL's (algebras with straightening laws), the…

Let $p$ be a prime number, $V$ a discrete valuation ring of unequal caracteristics $(0,p)$, $G$ a smooth affine algebraic group over $Spec \,V$. Using partial divided powers techniques of Berthelot, we construct arithmetic distribution…

We describe families of nonassociative finite unital rings that occur as quotients of natural nonassociative orders in generalized nonassociative cyclic division algebras over number fields. These natural orders have already been used to…

Given a group G, we construct, in a canonical way, an inverse semigroup S(G) associated to G. The actions of S(G) are shown to be in one-to-one correspondence with the partial actions of G, both in the case of actions on a set, and that of…

We employ the notions of `sequential function' and `interrogation' (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley's preorder-enriched category of…

In arXiv:1104.4441 it was shown that any 1-quasi-hereditary algebra affords a particular basis which is related to a given partial order on the set of simple modules. We show that the modules generated by these basis-elements are also…

Applying (enriched) categorical structures we define the notion of ordered sheaf on a quantaloid Q, which we call `Q-order'. This requires a theory of semicategories enriched in the quantaloid Q, that admit a suitable Cauchy completion.…

We generalize Hrushovski's Group Configuration Theorem to quasiminimal classes. As an application, we present Zariski-like structures, a generalization of Zariski geometries, and show that a group can be found there if the pregeometry…

The elements of a finite nonempty partially ordered set are exposed at independent uniform times in $[0,1]$ to a selector who, at any given time, can see the structure of the induced partial order on the exposed elements. The selector's…

To a tree of semi-simple algebras we associate a qurve (or formally smooth algebra) S. We introduce a Zariski- and etale quiver describing the finite dimensional representations of S. In particular, we show that all quotient varieties of…

We show that many principles of first-order arithmetic, previously only known to lie strictly between $\Sigma_1$-induction and $\Sigma_2$-induction, are equivalent to the well-foundedness of $\omega^\omega$. Among these principles are the…

We extend (scheme-theoretic) Bruhat-Tits theory to quasi-reductive groups i.e. with trivial split unipotent radical over discretely valued henselian non-archimedean fields $K$, whose ring of integers is excellent and residue field is…

We give necessary and sufficient conditions under which a quasi-action of any group on an arbitrary metric space can be reduced to a cobounded isometric action on some bounded valence tree, following a result of Mosher, Sageev and Whyte.…

Inspired by natural classes of examples, we define generalized directed semi-tree and construct weighted shifts on the generalized directed semi-trees. Given an $n$-tuple of directed directed semi-trees with certain properties, we associate…

We study stratification, that is the classification of localizing tensor ideal subcategories by geometric means, in the context of Kasparov's equivariant KK-theory of C*-algebras. We introduce a straightforward countable analog of the…

We study notions of generic and coarse computability in the context of computable structure theory. Our notions are stratified by the $\Sigma_\beta$ hierarchy. We focus on linear orderings. We show that at the $\Sigma_1$ level all linear…

We prove collective versions of semi-duality theorems for sets of almost (limitedly, order) L-weakly compact operators.

We consider systems of recursively defined combinatorial structures. We give algorithms checking that these systems are well founded, computing generating series and providing numerical values. Our framework is an articulation of the…