Related papers: Uniform n-place functions on T\subseteq ds(\alpha)

Suppose L is a relational language and P in L is a unary predicate. If M is an L-structure then P(M) is the L-structure formed as the substructure of M with domain {a: M models P(a)}. Now suppose T is a complete first order theory in L with…

Given a discrete and countable inverse semigroup $S$ one can study, in analogy to the group case, its geometric aspects. In particular, we can equip $S$ with a natural metric, given by the path metric in the disjoint union of its…

For each $n\geq 2$, we show that the class of all finite $n$-dimensional partial orders, when expanded with $n$ linear orders which realize the partial order, forms a Fra\"iss\'e class and identify its Fra\"iss\'e limit…

An analytic uniformisation of the varieties of Laumon, Rapoport and Stuhler at the infinite place is presented. This can be seen as the function field analog to the uniformisation of Shimura varieties classifying Abelian varieties with…

This is a companion paper to the paper "Hyperstability in the Erdos-Sos Conjecture". In that paper the following rough structure theorem was proved for graphs G containing no copy of a bounded degree tree T: from any such G, one can delete…

Let $\mathcal{M}$ be a semifinite von Neumann algebra and let $E$ be a symmetric function space on $(0,\infty)$. Denote by $E(\mathcal{M})$ the non-commutative symmetric space of measurable operators affiliated with $\mathcal{M}$ and…

There are at least two ways to approach the homotopy theory of spaces `at chromatic height $n$': one may localize with respect to $T(n)$-homology or with respect to $v_n$-periodic homotopy groups. It was already observed by Bousfield that…

We introduce the concept of finitely coloured equivalence for unital *-homomorphisms between C*-algebras, for which unitary equivalence is the 1-coloured case. We use this notion to classify *-homomorphisms from separable, unital, nuclear…

For an ordinal $\lambda>0$, we use the Erd\H{o}s--Rado partition theorem to prove the failure of strong completeness of $\mathsf{GL}$ for modal languages of cardinality $(2^{|\lambda|+\aleph_0})^{+}$ with respect to models on ordinals…

lambda-good frame is for us a parallel of the class of models of a superstable theory. Our main line is to start with lambda-good^+ frame s, categorical in lambda, n-successful for n large enough and try to have parallel of stability theory…

We introduce the relation ${\rho}_{\lambda}$-orthogonality in the setting of normed spaces as an extension of some orthogonality relations based on norm derivatives, and present some of its essential properties. Among other things, we give…

Ramsey's theorem states that for all finite colorings of an infinite set, there exists an infinite homogeneous subset. What if we seek a homogeneous subset that is also order-equivalent to the original set? Let $S$ be a linearly ordered set…

We prove that some natural "outside" property is equivalent (for a first order class) to being stable. For a model, being resplendent is a strengthening of being kappa-saturated. Restricting ourselves to the case kappa > |T| for…

Let kappa be an uncountable cardinal and the edges of a complete graph with kappa vertices be colored with aleph_0 colors. For kappa >2^{aleph_0} the Erd\H{o}s-Rado theorem implies that there is an infinite monochromatic subgraph. However,…

We consider injective first-order interpretations that input and output trees of bounded height. The corresponding functions have polynomial output size, since a first-order interpretation can use a k-tuple of input nodes to represent a…

One of the major outstanding conjectures in the study of chromatic symmetric functions (CSF's) states that trees are uniquely determined by their CSF's. Though verified on graphs of order up to twenty-nine, this result has been proved only…

We consider a class of foliations on the complex projective plane that are determined by a quadratic vector field in a fixed affine neighborhood. Such foliations, as a rule, have an invariant line at infinity. Two foliations with…

Completing partial latin squares is NP-complete. Motivated by Ryser's theorem for latin rectangles, in 1974, Cruse found conditions that ensure a partial symmetric latin square of order $m$ can be embedded in a symmetric latin square of…

The celebrated canonical Ramsey theorem of Erd\H{o}s and Rado implies that for $2\leq k\in \mathbb{N}$, any colouring of the edges of $K_n$ with $n$ sufficiently large gives a copy of $C_{2k}$ which has one of three canonical colour…

A proper $s$-coloring of an $n$-vertex graph is \emph{equitable} if every color class has size $\lfloor{n/s}\rfloor$ or $\lceil{n/s}\rceil$. A necessary condition to have an equitable $s$-coloring is that every vertex $v$ appears in an…