Some remarks on Euclidean tight designs

In this paper we present a new 4-dimensional tight Euclidean 5-design on 3 concentric spheres, together with a list of all known tight Euclidean designs which has been updated since the last survey paper by Bannai and Bannai (2009) [6]. We also examine whether each of all known tight Euclidean designs has the structure of a coherent configuration.     

Some permutation problems

Put Z_n = {1, 2,…, n} and let π denote an arbitrary permutation of Z_n. Problem I. Let π = (π(1), π(2), …, π(n)). π has an up, down, or fixed point at a according as a < π(a), a > π(a), or a = π(a). Let $\text{A}\text{(r, s, t)}$ be the number of π ∈ Z_n with r ups, s downs, and t fixed points. Problem II. Consider the triple π^?1(a), a, π(a). Let R denote an up and F a down of π and let B(n, r, s) denote the number of π ∈ Z_n with r occurrences of π^?1(a)RaRπ(a) and s occurrences of π^?1(a)FaFπ(a). Generating functions are obtained for each enumerant as well as for a refinement of the second. In each case use is made of the cycle structure of permutations.     

Two remarks on affine designs with classical parameters

Simple proofs are given for Dembowski's theorem characterizing the classical affine designs and for the existence of affine designs with classical parameters but not isomorphic to any affine space.     

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 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 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 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 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.