In this work infinitely divisible cylindrical probability measures on arbitrary Banach spaces are introduced. The class of infinitely divisible cylindrical probability measures is described in terms of their characteristics, a characterisation which is not known in general for infinitely divisible Radon measures on Banach spaces. Furthermore, continuity properties and the relation to infinitely...

Abstract In this paper we study the relativized Lascar Galois group of a strong type. The is quasi-compact connected topological group, and if in addition underlying theory T G -compact, then compact. We apply compact to obtain model theoretic results note. For example, use divisibility type show that, simple theory, such types have certain property that call divisible amalgamation. main result...

Note that the intersection property in Theorem A is equivalent to saying that NL(P ) is a p-group. Also, since this property is clearly independent of the choice of P in Sylp(G), it is clear that L is characteristic in G. Our interest in this characteristic subgroup was motivated by the following. Theorem B. Suppose that G is p-solvable and let L be the largest normal subgroup of G such that L∩...

ABSTRAC"T A construction method for semiregular group divisible designs is given. This method can be applied to yield many classes of (in general, non-symmetric) semiregular group divisible designs whose duals are semiregular group divisible. In particular, the method can be used to construct many classes of transversal designs whose duals are serniregular group divisible designs, but not trans...

In this paper we analyze MapReduce distributed computations as divisible load scheduling problem. The two operations of mapping and reducing can be understood as two divisible applications with precedence constraints. A divisible load model is proposed, and schedule dominance properties are analyzed. We investigate dominant schedule structures for MapReduce computations. To our best knowledge t...

let $g$ be a finite group‎. ‎a subgroup‎ ‎$h$ of $g$ is called an $mathcal h $ -subgroup in‎ ‎$g$ if $n_g (h)cap h^gleq h$ for all $gin‎ ‎g$. a subgroup $h$ of $g$ is called a weakly‎ $mathcal h^ast $-subgroup in $g$ if there exists a‎ ‎subgroup $k$ of $g$ such that $g=hk$ and $hcap‎ ‎k$ is an $mathcal h$-subgroup in $g$. we‎ ‎investigate the structure of the finite group $g$ under the‎ ‎assump...

In the nineties, A.G. Spera introduced a construction principle for divisible designs. Using this method, we get series of divisible designs from finite Laguerre geometries. We show a close connection between some of these divisible designs and divisible designs whose construction was based on a conic in a plane of a 3-dimensional projective space.

A divisible design graph is a graph whose adjacency matrix is the incidence matrix of a divisible design. Divisible design graphs are a natural generalization of (v, k, λ)-graphs, and like (v, k, λ)-graphs they make a link between combinatorial design theory and algebraic graph theory. The study of divisible design graphs benefits from, and contributes to, both parts. Using information of the e...

Let S(RG) be a normed Sylow p-subgroup in a group ring RG of an abelian group G with p-component Gp and a p-basic subgroup B over a commutative unitary ring R with prime characteristic p. The first central result is that 1 + I(RG;Bp) + I(R(p)G;G) is basic in S(RG) and B[1 + I(RG;Bp) + I(R(p )G;G)] is p-basic in V (RG), and [1 + I(RG;Bp) + I(R(p )G;G)]Gp/Gp is basic in S(RG)/Gp and [1 + I(RG;Bp)...