File: cyclic_quotient.rules

package info (click to toggle)
polymake 4.15-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 35,892 kB
  • sloc: cpp: 168,945; perl: 43,410; javascript: 31,575; ansic: 3,007; java: 2,654; python: 632; sh: 268; xml: 117; makefile: 61
file content (99 lines) | stat: -rw-r--r-- 3,069 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
#  Copyright (c) 1997-2024
#  Ewgenij Gawrilow, Michael Joswig, and the polymake team
#  Technische Universität Berlin, Germany
#  https://polymake.org
#
#  This program is free software; you can redistribute it and/or modify it
#  under the terms of the GNU General Public License as published by the
#  Free Software Foundation; either version 2, or (at your option) any
#  later version: http://www.gnu.org/licenses/gpl.txt.
#
#  This program is distributed in the hope that it will be useful,
#  but WITHOUT ANY WARRANTY; without even the implied warranty of
#  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
#  GNU General Public License for more details.
#-------------------------------------------------------------------------------

###################################################
###################################################
###
###  CyclicQuotient rules
###
###################################################
###################################################
object CyclicQuotient {

   rule N, Q : DUAL_CONTINUED_FRACTION {
      my $check = cf2rational($this->DUAL_CONTINUED_FRACTION);
      $this->N = new Integer(numerator($check));
      $this->Q = new Integer(numerator($check) - denominator($check));
   }

   rule DUAL_CONTINUED_FRACTION : N, Q {
      my $check = new Rational($this->N, ($this->N)-($this->Q));
      $this->DUAL_CONTINUED_FRACTION = rational2cf($check);
   }

   rule RAYS : N, Q {
      $this->RAYS = new Matrix([1,0],[-$this->Q, $this->N]);
   }

   rule MAXIMAL_CONES : {
      $this->MAXIMAL_CONES = [[0, 1]];
   }

   rule CONTINUED_FRACTION : N, Q {
      my $check = new Rational($this->N, $this->Q);
      # print $check."\n";
      $this->CONTINUED_FRACTION = rational2cf($check);
   }

   rule N, Q : CONTINUED_FRACTION {
      my $check = cf2rational($this->CONTINUED_FRACTION);
      $this->N = new Integer(numerator($check));
      $this->Q = new Integer(denominator($check));
   }
}


###################################################
###################################################
###
###  User functions
###
###################################################
###################################################


# @category Continued fractions
# Compute the continued fraction corresponding to a rational number //r//.
# @param Rational r
# @return Vector<Integer>
user_function rational2cf(Rational) {
   my ($check) = @_;
   my @result = ();
   while ($check != 0) {
      push @result, new Integer(ceil($check));
      $check = ceil($check)- $check;
      $check = $check !=0 ? 1/$check : 0;
      # print $check."\n";
   }
   return new Vector<Integer>(\@result);
}

# @category Continued fractions
# Compute the rational number corresponding to a continued fraction.
# @param Vector<Integer> v
# @return Rational
user_function cf2rational(Vector<Integer>) {
   my($v) = @_;
   my @chain = @$v;
   my $check = new Rational(pop @chain);
   my $s = @chain;
   while($s > 0){
      $check = (new Rational(pop @chain)) - 1/$check;
      $s = @chain;
   }
   return $check;
}