We examine the idea of a free partially commutative, partially associative groupoid, and show that there is a linear-time algorithm for the word problem. Our work is an attempt to see how word problem results by Book, Liu, and Wrathall for monoids and groups might be extended to groupoids. Key word
Partially Commutative Moment Problems
β Scribed by H. J. Borchers; Jakob Yngvason
- Publisher
- John Wiley and Sons
- Year
- 1990
- Tongue
- English
- Weight
- 395 KB
- Volume
- 145
- Category
- Article
- ISSN
- 0025-584X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The Landau problem is discussed in two similar but still different non-commutative frameworks. The "standard" one, where the coupling to the gauge field is achieved using Poisson brackets, yields all Landau levels. The "exotic" approach, where the coupling to the gauge field is achieved using the sy
A mean-square helical hydrophobic moment, ( h 2 ) , is defined for polypeptides in analogy to the mean-square dipole moment, ( p 2 ) , for polymer chains. For a freely jointed polymer chain, ( p z ) is given by Zm:, where m, denotes the dipole moment associated with bond i. In the absence of any cor
The following "rational" moment problem is discussed. Given distinct real numbers \(\lambda_{1}, \lambda_{2}, \ldots, \lambda_{p}\) (the "poles" of the problem), real numbers \(c_{0}\) and \(c_{j}^{(i)}\) \((j=1,2,3, \ldots ; i=1,2, \ldots, p)\), and a non-empty compact subset \(K\) of \((-\infty,+\