English
Related papers

Related papers: The universal homogeneous binary tree

200 papers

A structure is called homogeneous if every isomorphism between finitely induced substructures of the structure extends to an automorphism of the structure. Recently, P. J. Cameron and J. Ne\v{s}et\v{r}il introduced a relaxed version of…

Combinatorics · Mathematics 2009-12-31 Dragan Mašulović , Rajko Nenadov , Nemanja Škorić

We investigate the partial orderings of the form (P(X),\subset), where X is a relational structure and P(X) the set of the domains of its isomorphic substructures. A rough classification of countable binary structures corresponding to the…

Logic · Mathematics 2017-09-26 Milos S. Kurilic

A unitary representation of a, possibly infinite dimensional, Lie group $G$ is called semibounded if the corresponding operators $i\dd\pi(x)$ from the derived representation are uniformly bounded from above on some non-empty open subset of…

Representation Theory · Mathematics 2012-05-24 Karl-Hermann Neeb

The ternary relation $B(x,y,z)$ of betweenness states that an element $y$ is between the elements $x$ and $z$, in some sense depending on the considered structure. In a partially ordered set $(N,\leq)$, $B(x,y,z):\Longleftrightarrow…

Logic in Computer Science · Computer Science 2021-12-01 Bruno Courcelle

We define a class of algebras describing links of binary semi-isolating formulas on a set of realizations for a family of 1-types of a complete theory. These algebras include algebras of isolating formulas considered before. We prove that a…

Logic · Mathematics 2012-10-16 Sergey V. Sudoplatov

An algebraic linear ordering is a component of the initial solution of a first-order recursion scheme over the continuous categorical algebra of countable linear orderings equipped with the sum operation and the constant 1. Due to a general…

Formal Languages and Automata Theory · Computer Science 2010-02-10 Stephen L. Bloom , Zoltan Esik

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

Logic in Computer Science · Computer Science 2025-03-05 Bruno Courcelle

An orthogonality space is a set equipped with a symmetric and irreflexive binary relation. We consider orthogonality spaces with the additional property that any collection of mutually orthogonal elements gives rise to the structure of a…

Rings and Algebras · Mathematics 2020-03-19 Jan Paseka , Thomas Vetterlein

We continue our study of topological partial *-algebras, focusing our attention to *-semisimple partial *-algebras, that is, those that possess a {multiplication core} and sufficiently many *-representations. We discuss the respective roles…

Rings and Algebras · Mathematics 2012-10-12 J-P. Antoine , G. Bellomonte , C. Trapani

All exactly integrable systems connected with the semisimple algebras of the second rank with an arbitrary choice of the grading in them are presented in explicit form. General solution of such systems are expressed in terms of the matrix…

Mathematical Physics · Physics 2007-05-23 A. N. Leznov

Let A be a finitely generated commutative algebra over a field K with a presentation A=K < X_{1}, ..., X_{n} | R >, where R is a set of monomial relations in the generators X_{1}, ..., X_{n}. So A = K[S], the semigroup algebra of the monoid…

Rings and Algebras · Mathematics 2009-04-05 Isabel Goffa , Eric Jespers , Jan Okninski

We provide a unified framework for the treatment of special integrable systems which we propose to call "generalized mean field systems". Thereby previous results on integrable classical and quantum systems are generalized. Following…

Mathematical Physics · Physics 2015-03-13 Bjoern Erbe , Heinz-Juergen Schmidt

We study linear orderings expanded by functions for successor and predecessor. The successor and predecessor on linear orderings capture the relatively intrinsically computably enumerable information about orderings in much the same way…

Full binary trees naturally represent commutative non-associative products. There are many important examples of these products: finite-precision floating-point addition and NAND gates, among others. Balance in such a tree is highly…

Discrete Mathematics · Computer Science 2021-08-27 Laura Monroe

We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…

Combinatorics · Mathematics 2010-09-06 Jan Hubicka

In this paper we investigate undirected discrete graphical tree models when all the variables in the system are binary, where leaves represent the observable variables and where all the inner nodes are unobserved. A novel approach based on…

Statistics Theory · Mathematics 2012-03-06 Piotr Zwiernik , Jim Q. Smith

The complement of a complex hyperplane arrangement is known to be homotopic to a minimal CW complex. There are several approaches to the minimality. In this paper, we restrict our attention to real two dimensional cases, and introduce the…

Algebraic Geometry · Mathematics 2011-05-18 Masahiko Yoshinaga

The class of finitely presented algebras over a field $K$ with a set of generators $a_{1},..., a_{n}$ and defined by homogeneous relations of the form $a_{1}a_{2}... a_{n} =a_{\sigma (a)} a_{\sigma (2)} ... a_{\sigma (n)}$, where $\sigma$…

Rings and Algebras · Mathematics 2008-10-03 F. Cedo , E. Jespers , J. Okninksi

We describe the set of maximal orders in a 2-by-2 matrix algebra over a non-commutative local division algebra B containing a given suborder, for certain important families of such suborders, including rings of integers of division…

Number Theory · Mathematics 2017-12-12 Manuel Arenas , Luis Arenas-Carmona

Ehresmann semigroups may be viewed as biunary semigroups equipped with domain and range operations satisfying some equational laws. Motivated by some of the main examples, we here define ordered Ehresmann semigroups, and consider their…

Group Theory · Mathematics 2021-12-17 Tim Stokes