Widths of function classes on sets with tree-like structure

Digraphs with Tree-like Descendant Sets

We give certain properties which are satisfied by the descendant set of a vertex in a primitive distance-transitive digraph of finite out-valency and provide a strong structure theory for digraphs satisfying these properties. In particular, we show that there are only countably many possibilities for the isomorphism type of such a descendant set, thereby confirming a conjecture of the first Aut...

On Pre-θ-Open Sets and Two Classes of Functions

the structure of lie derivations on c*-algebras

نشان می دهیم که هر اشتقاق لی روی یک c^*-جبر به شکل استاندارد است، یعنی می تواند به طور یکتا به مجموع یک اشتقاق لی و یک اثر مرکز مقدار تجزیه شود. کلمات کلیدی: اشتقاق، اشتقاق لی، c^*-جبر.

Detailed Scheduling of Tree-like Pipeline Networks with Multiple Refineries

In the oil supply chain, the refined petroleum products are transported by various transportation modes, such as rail, road, vessel and pipeline. The latter provides one of the safest and cheapest ways to connect production areas to local markets. This paper addresses the operational scheduling of a multi-product tree-like pipeline connecting several refineries to multiple distribution centers ...

Analyzing priority queues with 3 classes using tree-like processes

In this paper we demonstrate how tree-like processes can be used to analyze a general class of priority queues with three service classes, creating a new methodology to study priority queues. The key result is that the operation of a 3-class priority queue can be mimicked by means of an alternate system that is composed of a single stack and queue. The evolution of this alternate system is redu...