منابع مشابه
Compatible associative products and trees
We compute dimensions and characters of the components of the operad of two compatible associative products, and give an explicit combinatorial construction of the corresponding free algebras in terms of planar rooted trees.
متن کاملCompatible Trees ∗
Two plane geometric graphs are said to be compatible when their union is a plane geometric graph. Let S be a set of n points in the Euclidean plane in general position and let T be any given plane geometric tree whose vertex set is S. The main problem we consider in this work consists of finding a second plane geometric tree T ′ on S, such that T ′ is compatible with T and shares with T a minim...
متن کاملOn Associative Omega-Products
In recent years, a number of classical results connecting rational languages with finite semigroups have been extended to infinite-word languages using the notion of an ω-semigroup: a semigroup augmented with an associative infinite product. This paper takes a closer look at the associative infinite product itself. It suggests some improvements and presents a couple of new facts.
متن کاملBroadcast and Associative Operations on Fat-Trees
This paper analyzes the cost of performing broadcast, product and prefix computation on the ideal fat-tree, a model proposed here to capture distance and bandwidth properties common to a variety of fat-tree networks. Algorithms are developed and analyzed in terms of the capacity of channels at different levels of the fat-tree. Non trivial lower bounds are derived establishing the optimality of ...
متن کاملAssociative Omega-products of Traces
The notion of associative infinite product is applied to traces, resulting in an alternative approach to introducing infinite traces. Four different versions of product are explored, two of them identical to known definitions of infinite trace.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algebra & Number Theory
سال: 2009
ISSN: 1937-0652
DOI: 10.2140/ant.2009.3.567