相关论文: Maximally symmetric trees

The variety of nilpotent groups is Noetherian. That is why two nilpotent class s groups are geometrically equivalent if and only if they have same quasi-identities ([Pl3]). Therefore, we can describe classes of geometrical equivalence of…

One theorem of Nemhauser and Trotter ensures that, under certain conditions, a stable set of a graph G can be enlarged to a maximum stable set of this graph. For example, any stable set consisting of only simplicial vertices is contained in…

In this paper we study the theories of the infinite-branching tree and the $r$-regular tree, and show that both of them are pseudofinite. Moreover, we show that they can be realized by infinite ultraproducts of polynomial exact classes of…

We prove that there is $c>0$ such that for all sufficiently large $n$, if $T_1,\dots,T_n$ are any trees such that $T_i$ has $i$ vertices and maximum degree at most $cn/\log n$, then $\{T_1,\dots,T_n\}$ packs into $K_n$. Our main result…

It is known that PQ-symmetric maps on the boundary characterize the quasi-isometry type of visual hyperbolic spaces, in particular, of geodesically complete \br-trees. We define a map on pairs of PQ-symmetric ultrametric spaces which…

This paper presents a series of general results about the optimal estimation of physical transformations in a given symmetry group. In particular, it is shown how the different symmetries of the problem determine different properties of the…

We generalize Schwenk's result that almost all trees contain any given limb to trees with positive integer vertex weights. The concept of characteristic polynomial is extended to such weighted trees and we prove that the proportion of…

A monoid is said to be special if it admits a presentation in which all defining relations are of the form $w = 1$. Groups are familiar examples of special monoids. This article studies the geometric and structural properties of the Cayley…

In this paper, we define the notion of a virtually symmetric representation of representations of virtual braid groups and prove that many known representations are equivalent to virtually symmetric. Using one such representation, we define…

We give an explicit description of the free objects in the quasivariety of adequate semigroups, as sets of labelled directed trees under a natural combinatorial multiplication. The morphisms of the free adequate semigroup onto the free…

It is known that every torsion-free abelian group of finite rank has a maximal completely decomposable summand that is unique up to isomorphism. We show that groups of infinite rank need not have maximal completely decomposable summands,…

We present some explicit constructions of universal R-trees with applications to the asymptotic geometry of hyperbolic spaces. In particular, we show that any asymptotic cone of a complete simply connected manifold of negative curvature is…

In this paper we study prime, maximal and two--class congruences from the point of view of the relationships between them in various kinds of universal algebras, as well as their direct and inverse images through morphisms. This research…

For any cardinal $\kappa \geq 2$, there is a unique complete real tree whose points all have valence $\kappa$. In this note, we show that, when $\kappa \geq 3$, it is necessary to assume completeness. More precisely, we show that there…

Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…

Trees are partial orderings where every element has a linearly ordered set of smaller elements. We define and study several natural notions of completeness of trees, extending Dedekind completeness of linear orders and Dedekind-MacNeille…

Motivated by mechanical systems with symmetries, we focus on optimal control problems possessing symmetries. Following recent works, which generalized the classical concept of static turnpike to manifold turnpike, we extend the exponential…

We construct rather general random ensembles that yield the optimal (isomorphic) estimate in the Dvoretzky-Milman Theorem. This is the first construction of non gaussian/spherical ensembles that exhibit the optimal behaviour. The ensembles…

We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…

We study isometric actions of tree automorphism groups on the infinite-dimensional hyperbolic spaces. On the one hand, we exhibit a general one-parameter family of such representations and analyse the corresponding equivariant embeddings of…