 |
|
|
|
|
 |
|
|
Triangulations and N-ary Operations
|
|
|
|
|
|
| Organization: | Universidad Autonoma de Querétaro |
| Department: | Facultad de Informatica |
|
|
|
|
|
|
| Instituto Tecnologico y de Estudios Superiores de Monterrey. Research Report |
|
|
|
|
|
|
The relation among triangulations of n-gons and applications of binary operations is approached through the solution of several problems. A computational implementation generalizing the division of n-gons and application to arbitrary k-fold operations is offered using the language Mathematica. The generation and counting of different self-intersecting n-gons (called n-stars) is also presented. This counting, along with the counting of different triangulations under rotational equivalence is performed using Burnside's theorem to arrive at explicit formulae.
|
|
|
|
|
|
|
|
For the newest resources, visit Wolfram Repositories and Archives »
