The problem of predicting a sequence x, x, … generated by a discrete source with unknown statistics is considered. Each letter x is predicted using the information on the word xx … x only. Such prediction is a classical problem which history can be traced back to Laplace. The problem where...

The problem of post-stall behavior of compression systems is studied through numerous investigations during three last decades. Moore-Greitzer model is of special interest due to its nice applicability to these problems. Bifurcation theory is one of the new trends of these studies and is used to...

We succeeded to isolate a special class of concave Young-functions enjoying the so-called , which proves to be dense in the set of concave Young-functions. In this class there is a proper subset whose members have each the so-called degree of contraction (cf. ) denoted by , and map bijectively...

The question of whether the class of decision problems that can be solved by deterministic polynomial-time algorithms, P , is equal to the class of decision problems that can be solved by nondeterministic polynomial-time algorithms, NP , has been open since it was first formulated by Cook,...

We propose a new determinacy hypothesis for transfinite games. Then we use the hypothesis to extend the perfect set theorem, prove relationships between various determinacy hypotheses, expose inconsistent versions of determinacy, and provide a philosophical justification for determinacy

We generalise [2, lemma 6(iii)] and prove that for a quasi local ring R of dimension zero given two R- algebras A and B dimesion of tesor product of A and B is bigger than equal to the sum of dimensions of A and B

The Beltrametti-Blasi formula that gives the number N (g) of functional independent invariants for the coadjoint representation of a finite dimensional Lie algebra g admits a natural reformulation by means of the Maurer-Cartan equations associated to the algebra. This functional approach to N...

The class of all complementary pairs of propositions of Classical Logic is partitioned as {{U}, {K}, {N}}, where both {U} and {K} are recursively-enumerable. This leaves {N} as non r.e. and hence necessarily the "home" of the class of all "True-but-Unprovable" propositions B [together with their...

To a depth two extension ⊇ there are associated ring and coring constructs called bialgebroids in a duality-for-actions set-up which coalesce into a Jones tower when the extension is Frobenius [12, Kadison-Szlachányi]. A number of the ring and module constructs are perfectly well-defined for...