Related papers: Trees, linear orders and G\^ateaux smooth norms

We give a dual, separated-tree formulation of Latala's majorizing measure theorem for canonical processes with log-concave tails. Under the same assumptions as in Latala's characterization, we introduce parameterized separation trees and…

In this paper we give an ordinal analysis of the theory of second order arithmetic. We do this by working with proof trees -- that is, "deductions" which may not be well-founded. Working in a suitable theory, we are able to represent…

We consider convex series of molecules in Lipschitz-free spaces, i.e. elements of the form $\mu=\sum_n \lambda_n \frac{\delta_{x_n}-\delta_{y_n}}{d(x_n,y_n)}$ such that $\|\mu\|=\sum_n |\lambda_n |$. We characterise these elements in terms…

We prove an accessibility theorem for finite-index splittings of groups. Given a finitely presented group G there is a number n(G) such that, for every reduced locally finite G-tree T with finitely generated stabilizers, T/G has at most…

Parse trees are fundamental syntactic structures in both computational linguistics and compilers construction. We argue in this paper that, in both fields, there are good incentives for model-checking sets of parse trees for some word…

We establish several sufficient conditions for the strong ellipticity of any fourth-order elasticity tensor in this paper. The first presented sufficient condition is an extension of positive definite matrices, which states that the strong…

This paper introduces derivation trees for general grammars. Within these trees, it defines context-dependent pairs of nodes, corresponding to rewriting two neighboring symbols using a non context-free rule. It proves that the language…

Let $T$ be a tree with induced partial order $\preceq$. We investigate centered Gaussian processes $X=(X_t)_{t\in T}$ represented as $$ X_t=\sigma(t)\sum_{v \preceq t}\alpha(v)\xi_v $$ for given weight functions $\alpha$ and $\sigma$ on $T$…

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}}…

A tree automatic structure is a structure whose domain can be encoded by a regular tree language such that each relation is recognisable by a finite automaton processing tuples of trees synchronously. Words can be regarded as specific…

For a set-valued stochastic sequence $(G_n)_{n=0}^N$ with relatively open convex values $G_n(\omega)$ we give a criterion for the existence of an adapted sequence $(x_n)_{n=0}^N$ of selectors, admitting an equivalent martingale measure.…

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…

We prove a fix point theorem for monoids of self-embeddings of trees. As a corollary, we obtain a result by Laflamme, Pouzet and Sauer that a tree either contains a subdivided binary tree as a subtree or has a vertex, and edge, an end or…

We consider uniformly strongly elliptic systems of the second order with bounded coefficients. First, sufficient conditions for the invariance of convex bodies obtained for linear systems without zero order term in bounded domains and…

The aim of this paper is to to show the admissibility of some class of Frechet spaces (see Definition 2.3). In particular, this generalizes the main results of [3]. As an application, we show the admissibility of a large class modular…

We ask the question, which oriented trees $T$ must be contained as subgraphs in every finite directed graph of sufficiently large minimum out-degree. We formulate the following simple condition: all vertices in $T$ of in-degree at least $2$…

Let S be a Noetherian scheme and f:X -> S a proper morphism. By SGA 4 XIV, for any constructible sheaf F of Z/nZ-modules on X, the sheaves of Z/nZ-modules R^if_*F obtained by direct image (for the etale topology) are also constructible:…

This paper is devoted to a study of mathematical structures arising from choice functions satisfying the path independence property (Plott functions). We broaden the notion of a choice function by allowing of empty choice. This enables us…

We describe those complete linearly ordered topological spaces $X$ which are homogeneous (=CHLOTS). That is, $X$ is order isomorphic with any nonempty open interval in $X$. Using countable tail-like ordinals as indices, we build towers of…

Algorithmic meta-theorems state that problems definable in a fixed logic can be solved efficiently on structures with certain properties. An example is Courcelle's Theorem, which states that all problems expressible in monadic second-order…