In the present paper, using discrete analogue of differential operator \( \frac{d^{2m}}{dx^{2m}} \), optimal interpolation formulas are constructed in {L}_2^{(4)} \) (0, 1) space. The explicit for coefficients obtained.

Let F be a union-closed family of subsets of an m-element set A. Let n = |F| ≥ 2. For b ∈ A let w(b) denote the number of sets in F containing b minus the number of sets in F not containing b. Frankl’s conjecture from 1979, also known as the union-closed sets conjecture, states that there exists an element b ∈ A with w(b) ≥ 0. The present paper deals with the average of the w(b), computed over ...

We provide a process to extend any bipartite diametrical graph of diameter 4 to an S-graph of the same diameter and partite sets. For a bipartite diametrical graph of diameter 4 and partite sets U and W , where 2m |U| ≤ |W |, we prove that 2 is a sharp upper bound of |W | and construct an S-graph G 2m, 2 in which this upper bound is attained, this graph can be viewed as a generalization of the ...

Ninety five patients receiving chronic haemodialysis (CHD) were surveyed to determine the prevalence of rheumatic disease and, where possible, its aetiology. At least three distinct rheumatic syndromes were identified--a group of patients with a syndrome consisting of large and medium joint synovial swelling, restricted hips and shoulders, tenosynovitis, carpal tunnel syndrome, and bone cysts d...

Best and Brouwer [Discrete Math. 17 (1977), 235– 245] proved that triply-shortened and doubly-shortened binary Hamming codes (which have length 2m − 4 and 2m − 3, respectively) are optimal. Properties of such codes are here studied, determining among other things parameters of certain subcodes. A utilization of these properties makes a computeraided classification of the optimal binary one-erro...

For each v, k and m such that v ≥ k ≥ 2m + 2 ≥ 8, we construct a periodically-cyclic Gale 2m-polytope with v vertices and the period k. For such a polytope, there is a complete description of each of its facets based upon a labelling (total ordering) of the vertices so that every subset of k successive vertices generates a cyclic 2m-polytope. MSC 2000: 52B11, 52B05