The 3-dimensional planar assignment problem and the number of Latin squares related to an autotopism

Details The 3-dimensional planar assignment problem and the number of Latin squares related to an autotopism The 3-dimensional planar assignment problem and the number of Latin squares related to an autotopism

2011-05-05

arxiv.org/abs/1105.1067v1

Proceedings of XI Spanish Meeting on Computational Algebra and Applications EACA 2008 (2008), pp. 89-92

Mathematics

Combinatorics

4 pages, 1 table

Scientific paper

There exists a bijection between the set of Latin squares of order $n$ and the set of feasible solutions of the 3-dimensional planar assignment problem ($3PAP_n$). In this paper, we prove that, given a Latin square isotopism $\Theta$, we can add some linear constraints to the $3PAP_n$ in order to obtain a 1-1 correspondence between the new set of feasible solutions and the set of Latin squares of order $n$ having $\Theta$ in their autotopism group. Moreover, we use Gr\"obner bases in order to describe an algorithm that allows one to obtain the cardinal of both sets.

Affiliated with

Also associated with

No associations

Rating

The 3-dimensional planar assignment problem and the number of Latin squares related to an autotopism does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The 3-dimensional planar assignment problem and the number of Latin squares related to an autotopism, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The 3-dimensional planar assignment problem and the number of Latin squares related to an autotopism will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-690806