Some remarks on interval graphs

Using simplicial decompositions a new and simple proof of Lekkerkerker-Boland’s criterion for interval graphs is given. Also the infinite case is considered, and the problem is tackled to what extent the representation of a graph as an interval graph is unique. Dedicated to Tibor Gallai on his seventieth birthday     

Some remarks on greedy algorithms

Estimates are given for the rate of approximation of a function by means of greedy algorithms. The estimates apply to approximation from an arbitrary dictionary of functions. Three greedy algorithms are discussed: the Pure Greedy Algorithm, an Orthogonal Greedy Algorithm, and a Relaxed Greedy Algorithm.This research was supported by the Office of Naval Research Contract N0014-91-J1343.     

Some remarks on conditional entropy

Summary Using a definition of conditional entropy given by Hanen and Neveu [5, 10, 11] we discuss in this paper some properties of conditional entropy and mean entropy, in particular an integral representation of conditional entropy (§ 2), and the decomposition theorem of the KolmogorovSina¯i invariant (§ 3) (see also [6–8] and [12]).There is an essential difference between Jacob's proof of the last called theorem [6] and the proof given below. The definition of a Lebesgue space, given by Rokhlin [7–9] and [12], is not used in this paper.     

Some remarks on universal graphs

LetΓ be a class of countable graphs, and let ℱ(Γ) denote the class of all countable graphs that do not contain any subgraph isomorphic to a member ofΓ. Furthermore, letTΓ andHΓ denote the class of all subdivisions of graphs inΓ and the class of all graphs contracting to a member ofΓ, respectively. As the main result of this paper it is decided which of the classes ℱ(TK ⁿ ) and ℱ(HK ⁿ ),n≦ℵ₀, contain a universal element. In fact, for ℱ(TK ⁴)=ℱ(HK ⁴) a strongly universal graph is constructed, whereas for 5≦n≦ℵ₀ the classes ℱ(TK ⁿ ) and ℱ(HK ⁿ ) have no universal elements. Dedicated to Klaus Wagner on his 75^th birthday     

Some remarks on trigonometric interpolation

The object of this paper is to consider the problem of (0, 1, 2, 4) trigonometric interpolation when nodes are taken to bex _kn=(2kπ/n),k=0, 1 …,n−1. Here the interpolatory polynomials are explicitly constructed and the corresponding convergence theorem is proved, which is shown to be best possible in a certain sense. It is interesting to compare these results with those of Saxena [6], where the convergence theorem requires the existence off ^m (x). I take this opportunity to express my thanks to Professor P. Turán for some valuable conversation which led to this work. The author is at present a member of the faculty of the Dept. of Mathematics, University of Florida, Gainesville, U.S.A.     

Some remarks on one-sided regularity

A ring is said to be right (resp., left) regular-duo if every right (resp., left) regular element is regular. The structure of one-sided regular elements is studied in various kinds of rings, especially, upper triangular matrix rings over one-sided Ore domains. We study the structure of (one-sided) regular-duo rings, and the relations between one-sided regular-duo rings and related ring theoretic properties.     

Some remarks on permutation designs

A definition of isomorphism of two permutation designs is proposed, which differs from the definition in Bandt [J. Combinatorial Theory Ser. A21 (1976), 384–392]. The proposed definition has the (generally required) property that the allowed permutations always transform a permutation design into a permutation design. It is shown that the n permutation designs coming from the partitioning of S_n into permutation designs, as constructed in Bandt [J. Combinatorial Theory Ser. A21 (1976), 384–392] are all isomorphic. Further we find that this modified definition does not increase the number of nonisomorphic (6, 4) permutation designs. The same investigation showed that one of the designs, claimed to be a (6, 4) permutation design in [J. Combinatorial Theory Ser. A21 (1976), 384–392], is actually not a (6, 4) permutation design.     

Some remarks on generalized roundness

By using the links between generalized roundness, negative type inequalities and equivariant Hilbert space compressions, we obtain that the generalized roundness of the usual Cayley graph of finitely generated free groups and free abelian groups of rank  ≥ 2 equals 1. This answers a question of J-F. Lafont and S. Prassidis.      

Some remarks on almost l-groups

The divisibility group of every Bézout domain is an abelian l-group. Conversely, Jaffard, Kaplansky, and Ohm proved that each abelian l-group can be obtained in this way, which generalizes Krull’s theorem for abelian linearly ordered groups. Dumitrescu, Lequain, Mott, and Zafrullah [3] proved that an integral domain is almost GCD if and only if its divisibility group is an almost l-group. Then they asked whether the Krull-Jaffard-Kaplansky-Ohm theorem on l-groups can be extended to the framework of almost l-groups, and asked under what conditions an almost l-group is lattice-ordered [3, Questions 1 and 2]. This note answers the two questions. Received: 29 April 2008