Name
Abstract | ||
|---|---|---|
The positive cones of the left orders on a free group can be described by their finite subsets. An algorithm is given for recognizing when a finite subset of a free group lies in a positive cone. This is used to show how one can construct a sequence of finite subsets of a positive cone whose union is the positive cone. Moreover, the method gives an overview of the positive cones of a free group. It is still an open problem whether there are positive cones which can be generated as a subsemigroup by a finite subset. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1016/j.jsc.2005.05.005 | J. Symb. Comput. |
Keywords | DocType | Volume |
finite subsets,finite subset,positive cone,Computation,open problem,left order,Free groups,free group,20F60 (06F15),free groups,ordere dg roups,Ordered groups,msc: 20f60 06f15 keywords: computation | Journal | 40 |
Issue | ISSN | Citations |
6 | Journal of Symbolic Computation | 0 |
PageRank | References | Authors |
0.34 | 1 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lawrence H. Smith | 1 | 196 | 14.48 |