Let be a group generated by a set .The generating system will be called homogeneous if each inner automorphism of preserves and the group of inner automorphisms acts transitively on . In the note the following statement will be proved: if a generating system of a group is homogeneous then for...

The average time of computing Boolean functions by straight-line programs with a conditional stop is considered. A straight-line program consists of operators of two types. Every operator of the first type computes a binary Boolean function whose arguments are either the values computed by...

The complete multigraph λ is said to have a -decomposition if it is the union of edge disjoint subgraphs of each of them isomorphic to a fixed graph . The spectrum problem for -decompositions of λ that have a nesting was first considered in the case = by C.J.Colbourn and M.J.Colbourn [4] and...

In optical networks it is important to make an optimal use of the available bandwidth. Given a set of requests the goal is to satisfy them by using a minimum number of wavelengths. We introduce a variation to this well known problem, by allowing multiple parallel links, in order to be able to...

In optical networks it is important to make an optimal use of the available bandwidth. Given a set of requests the goal is to satisfy them by using a minimum number of wavelengths. We introduce a variation to this well known problem, by allowing multiple parallel links, in order to be able to...

To simulate the mixing and separation philosophy in the chemical engineering process we need to study a three-phase (solid-liquid-gas) flow problem. Different systems can handle different percentages of solid to liquid. There is roughly an equal split between the ‘wet' and ‘dry' technologies...

The marker and cell (MAC) scheme is formulated for the planar linear elasticity problem in which the two components of the displacement and the pressure are defined on different meshes. The optimal rate error estimates that are uniformly valid, independent of the value of the Lamé constant λ...

Let (, )bean -cycle system of order and let . We say that a path design (Ω, ) of order and block size (2 ≤ ≤ — 1) in (, ) if for every ∈ there is an -cycle such that: (1) for some (i.e. the ( – 1)-path occurs in the -cycle ); and (2) . Note that in (1) and (2) all the indices are...

Let (, )bean -cycle system of order and let . We say that a path design (Ω, ) of order and block size (2 ≤ ≤ — 1) in (, ) if for every ∈ there is an -cycle such that: (1) for some (i.e. the ( – 1)-path occurs in the -cycle ); and (2) . Note that in (1) and (2) all the indices are...