Search results for "table"

A note on a result of Guo and Isaacs about p-supersolubility of finite groups

2016

In this note, global information about a finite group is obtained by assuming that certain subgroups of some given order are S-semipermutable. Recall that a subgroup H of a finite group G is said to be S-semipermutable if H permutes with all Sylow subgroups of G of order coprime to . We prove that for a fixed prime p, a given Sylow p-subgroup P of a finite group G, and a power d of p dividing such that , if is S-semipermutable in for all normal subgroups H of P with , then either G is p-supersoluble or else . This extends the main result of Guo and Isaacs in (Arch. Math. 105:215-222 2015). We derive some theorems that extend some known results concerning S-semipermutable subgroups.

On the supersoluble hypercentre of a finite group

2016

[EN] We give some sufficient conditions for a normal p-subgroup P of a finite group G to have every G-chief factor below it cyclic. The S-permutability of some p-subgroups of O^p(G)plays an important role. Some known results can be reproved and some others appear as corollaries of our main theorems.

On self-normalising subgroups of finite groups

2010

[EN] The aim of this paper is to characterise the classes of groups in which every subnormal subgroup is normal, permutable, or S-permutable by the embedding of the subgroups (respectively, subgroups of prime power order) in their normal, permutable, or S-permutable closure, respectively.

Countable recognizability of primitive periodic finitary linear groups

1997

Characterizing extreme points of polyhedra an extension of a result by Wolfgang Bühler

1982

This paper reconsiders the characterization given by Buhler admitting convex polyhedra of probability distributions on a finite or countable set which are given by systems of linear inequalities more complex than those considered before.

Generalized iterated function systems on the spacel∞(X)

2014

Abstract In the last decades there has been a current effort to extend the classical Hutchinson theory of iterated function systems composed by contractions on a metric space X into itself to more general spaces and infinitely many mappings. In this paper we consider the (countable) iterated function systems consisting of some generalized contractions on the product space X I into X , where I is an arbitrary set of natural numbers. Some approximations of the attractors of the respective iterated function systems are given.

Kolmogorov numberings and minimal identification

1995

Identification of programs for computable functions from their graphs by algorithmic devices is a well studied problem in learning theory. Freivalds and Chen consider identification of ‘minimal’ and ‘nearly minimal’ programs for functions from their graphs. To address certain problems in minimal identification for Godel numberings, Freivalds later considered minimal identification in Kolmogorov Numberings. Kolmogorov numberings are in some sense optimal numberings and have some nice properties. We prove certain hierarchy results for minimal identification in every Kolmogorov numbering. In addition we also compare minimal identification in Godel numbering versus minimal identification in Kol…

Asymptotics for the Amitsur's Capelli - Type Polynomials and Verbally Prime PI-Algebras

2006

We consider associativePI-algebras over a field of characteristic zero. The main goal of the paper is to prove that the codimensions of a verbally prime algebra [11] are asymptotically equal to the codimensions of theT-ideal generated by some Amitsur's Capelli-type polynomialsEM,L* [1]. We recall that two sequencesan,bnare asymptotically equal, and we writean≃bn,if and only if limn→∞(an/bn)=1.In this paper we prove that\(c_n \left( {M_k \left( G \right)} \right) \simeq c_n \left( {E_{k^2 ,k^2 }^ * } \right) and c_n \left( {M_{k,l} \left( G \right)} \right) \simeq c_n \left( {E_{k^2 + l^2 ,2kl}^ * } \right) \)% MathType!End!2!1!, whereG is the Grassmann algebra. These results extend to all v…

The Asynchronous Leontief Model

1992

International audience; The traditional dynamic Leontief model is synchronous: every vertex acts simultaneously. A model with delays of action has been proposed, but it still remains synchronous. In this paper we propose an asynchronous version of the model that allows realistic computations. We fiurnish an algorithm and a program.

Parsimony hierarchies for inductive inference

2004

AbstractFreivalds defined an acceptable programming system independent criterion for learning programs for functions in which the final programs were required to be both correct and “nearly” minimal size. i.e.. within a computable function of being purely minimal size. Kinber showed that this parsimony requirement on final programs limits learning power. However, in scientific inference, parsimony is considered highly desirable. Alim-computable functionis (by definition) one calculable by a total procedure allowed to change its mind finitely many times about its output. Investigated is the possibility of assuaging somewhat the limitation on learning power resulting from requiring parsimonio…