Related papers: The universal homogeneous binary tree

Let V be a normal affine variety over the real numbers R, and let S be a semi-algebraic subset of V(R). We study the subring B(S) of the coordinate ring of V consisting of the polynomials that are bounded on S. We introduce the notion of…

The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on…

A natural way to obtain a system of partial differential equations on a manifold is to vary a suitably defined sesquilinear form. The sesquilinear forms we study are Hermitian forms acting on sections of the trivial $\mathbb{C}^n$-bundle…

Let $G$ be a group which admits the structure of an iterated semidirect product of finitely generated free groups. We construct a finite, free resolution of the integers over the group ring of $G$. This resolution is used to define…

We prove a tangle-tree theorem and a tangle duality theorem for abstract separation systems $\vec S$ that are submodular in the structural sense that, for every pair of oriented separations, $\vec S$ contains either their meet or their join…

We develop axiomatics of highest weight categories and quasi-hereditary algebras in order to incorporate two semi-infinite situations which are in Ringel duality with each other; the underlying posets are either upper finite or lower…

We classify strongly homotopy Lie algebras - also called L-infinity algebras - of one even and two odd dimensions, which are related to $2|1$-dimensional $Z_2$-graded Lie algebras. What makes this case interesting is that there are many…

We compute the continuous bounded cohomology of the full automorphism groups of regular trees in all positive degrees, with coefficients arising from any irreducible continuous unitary representations. To the author's knowledge, this seems…

Equations over linearly ordered semilattices are studied. For any equation $t(X)=s(X)$ we find irreducible components of its solution set and compute the average number of irreducible components of all equations in $n$ variables.

We look at a family of meta-Fibonacci sequences which arise in studying the number of leaves at the largest level in certain infinite sequences of binary trees, restricted compositions of an integer, and binary compact codes. For this…

This paper is devoted to a systematic study of a class of binary trees encoding the structure of rational numbers both from arithmetic and dynamical point of view. The paper is divided into two parts. The first one is a critical review of…

In this expository article, we describe the classification of the subalgebras of the rank 2 semisimple Lie algebras. Their semisimple subalgebras are well-known, and in a recent series of papers, we completed the classification of the…

An inverse semigroup $S$ is a semigroup in which every element has a unique inverse in the sense of semigroup theory, that is, if $a \in S$ then there exists a unique $b\in S$ such that $a = aba$ and $b = bab$. We say that an inverse…

Here we characterize regular and completely regular ordered semigroups by their minimal bi-ideals. A minimal bi-ideal is expressed as a product of a minimal right ideal and a minimal left ideal. Furthermore, we show that every bi-ideal in a…

A subset $U$ of a set $S$ with a binary operation is called {\it avoidable} if $S$ can be partitioned into two subsets $A$ and $B$ such that no element of $U$ can be written as a product of two distinct elements of $A$ or as the product of…

A central limit theorem for binary tree is numerically examined. Two types of central limit theorem for higher-order branches are formulated. A topological structure of a binary tree is expressed by a binary sequence, and the…

We offer a criterion for showing that the automorphism group of an ultrahomogeneous structure is topologically 2-generated and even has a cyclically dense conjugacy class. We then show how finite topological rank of the automorphism group…

A characterization is provided for each natural number except one (1) by means of an ordered pair of elements. The first element is a natural number called the type of the natural number characterized, and the second is a natural number…

A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto pairs of congruent elements. We show that on the algebra of complete binary trees whose leaves are labeled by letters of an…

For a finite field k and a triple of integers g \ge r \ge s \ge 0, we count the number of semilinear endomorphisms of a g-dimensional k-vector space which have rank r and stable rank s. Such endomorphisms show up naturally in the…