scholarly journals Kinematics and Statics of Manipulation Using the Theory of Polyhedral Convex Cones and Their Application to the Plannning of Manipulative Operations.

1999 ◽  
Vol 17 (1) ◽  
pp. 68-83 ◽  
Author(s):  
Shinichi Hirai
Keyword(s):  
Convex Cones ◽  
Polyhedral Convex

scholarly journals Polyhedral convex cones and the equational theory of the bicyclic semigroup

2006 ◽  
Vol 81 (1) ◽  
pp. 63-96 ◽  
Author(s):  
F. Pastijn
Keyword(s):  
Simple Semigroup ◽  
Equational Theory ◽  
Semigroup Variety ◽  
Convex Cones ◽  
Semigroup Identity ◽  
Bicyclic Semigroup ◽  
Polyhedral Convex ◽  
The Given ◽  
Completely Simple

AbstractTo any given balanced semigroup identity U ≈ W a number of polyhedral convex cones are associated. In this setting an algorithm is proposed which determines whether the given identity is satisfied in the bicylic semigroup or in the semigroup . The semigroups BC and E deserve our attention because a semigroup variety contains a simple semigroup which is not completely simple (respectively, which is idempotent free) if and only if this variety contains BC (respectively, E). Therefore, for a given identity U ≈ W it is decidable whether or not the variety determined by U ≈ W contains a simple semigroup which is not completely simple (respectively, which is idempotent free).

Sign in / Sign up

Export Citation Format

Share Document