In this paper, we compute an upper bound for the Dehn function of a finitely presented metabelian group. addition, prove that same works relative generated We also show every wreath product free abelian group finite rank with can be embedded into exponential function.

We reduce the basis construction problem for Hopf algebras generated by skew-primitive semi-invariants to a study of special elements, called “super-letters,” which are defined by Shirshov standard words. In this way we show that above Hopf algebras always have sets of PBW-generators (“hard” super-letters). It is shown also that these Hopf algebras having not more than finitely many “hard” supe...

We present a Haskell library that makes it easy for compiler writers to implement program transformations based on dataflow analyses. The compiler writer must identify (a) a family of logical assertions on which the transformation will be based; (b) an approximate representation of such assertions, which must have a lattice structure such that every assertion can be increased at most finitely m...

The standard Super-Kamiokande analysis uses an estimator for particle identification by which it discriminates e (νe) from μ(νμ). Use of this estimator has led to the claim of a significant deficiency of μ (νμ), suggesting the existence of neutrino oscillations. We investigate three areas of concern for the Super-Kamiokande estimator: the separation of the spatial part from the angular part in ...

We prove constructively that every uniformly continuous convex function f : X → R+ has positive infimum, where X is the convex hull of finitely many vectors. Using this result, we prove that a separating hyperplane theorem, the fundamental theorem of asset pricing, and Markov’s principle are constructively equivalent. This is the first time that important theorems are classified into Markov’s p...