The solvable radical of Sylow factorizable groups

Let G be a finite group. A complete Sylow product of G is a product of Sylow subgroups of G, one for each prime divisor of |G|. We shall call G a Sylow factorizable group if it is equal to at least one of its complete Sylow products. We prove that if G is a Sylow factorizable group then the intersection of all complete Sylow products of G is equal to the solvable radical of G. We generalize the concepts and the result to Sylow products which involve an arbitrary subset of the prime divisors of |G|. Received: 26 January 2005     

Availability of inspected systems subject to shocks – A matrix algorithmic approach

We examine the limiting average availability of a maintained system that deteriorates due to random shock process and as a response to its usage (wear out). System’s failures are not self-announcing, hence, failures must be detected via inspection. We consider randomly occurring shocks that arrive according to a Poisson process and cumulatively damage the system. Two models are considered: in Model 1 the shock and wear out processes are independent of the external environment and in Model 2, the shocks arrival rate, the shock magnitudes and the wear out rate are governed by a random environment which evolves as a Markov process. We obtain the system’s availability for both models.     

Polling systems in heavy traffic: Exhaustiveness of service policies

We study the expected delay in cyclic polling models with general ‘branching-type’ service disciplines. For this class of models, which contains models with exhaustive and gated service as special cases, we obtain closed-form expressions for the expected delay under standard heavy-traffic scalings. We identify a single parameter associated with the service discipline at each queue, which we call the ‘exhaustiveness’. We show that the scaled expected delay figures depend on the service policies at the queues only through the exhaustiveness of each of the service disciplines. This implies that the influence of different service disciplines, but with the same exhaustiveness, on the expected delays at the queues becomes the same when the system reaches saturation. This observation leads to a new classification of the service disciplines. In addition, we show monotonicity of the scaled expected delays with respect to the exhaustiveness of the service disciplines. This induces a complete ordering in terms of efficiency of the service disciplines. The results also lead to new rules for optimization of the system performance with respect to the service disciplines at the queues. Further, the exact asymptotic results suggest simple expected waiting-time approximations for polling models in heavy traffic. Numerical experiments show that the accuracy of the approximations is excellent for practical heavy-traffic scenarios. This revised version was published online in June 2006 with corrections to the Cover Date.     

Inverse Pattern Matching

Let a textstringTofnsymbols from some alphabet Σ and an integerm < nbe given. A patternPof lengthmover Σ is sought such thatPminimizes (alternatively, maximizes) the total number of pairwise character mismatches generated whenPis compared with allm-character substrings ofT. Two additional variants of the problem are obtained by adding the constraint thatPbe (respectively, not be) a substring ofT. Efficient sequential algorithms are proposed in this paper for the problem and its variants.     

Various solution methods,accompanied by dynamic investigation,for the same problem as a means for enriching the mathematical toolbox

A geometrical task is presented with multiple solutions using different methods, in order to show the connection between various branches of mathematics and to highlight the importance of providing the students with an extensive ‘mathematical toolbox’. Investigation of the property that appears in the task was carried out using a computerized tool.     

Stable Subnorms II

In this paper we continue our study of stability properties of subnorms on subsets of finite-dimensional, power-associative algebras over the real or the complex numbers.