Płonka-Type Sums Over Free Products
✍ Scribed by B. J. Gardner
- Publisher
- John Wiley and Sons
- Year
- 1989
- Tongue
- English
- Weight
- 710 KB
- Volume
- 141
- Category
- Article
- ISSN
- 0025-584X
No coin nor oath required. For personal study only.
✦ Synopsis
A generalization of PLONXA sums is introduced wherein instead of the disjoint union of underlying seta of algebras, the free product of the reducts (of some type) of the algebras is used as underlying set for the new algebra. Preservation of identities is discussed and a number of examples are presented.
📜 SIMILAR VOLUMES
In this paper, we develop efficient deterministic algorithms for globally minimizing the sum and the product of several linear fractional functions over a polytope. We will show that an elaborate implementation of an outer approximation algorithm applied to the master problem generated by a parametr
In this work, the authors present several formulas which compute the following Euler's type and Dilcher's type sums of the products of Bernoulli numbers B n : respectively, where denotes, as usual, the multinomial coefficient.