Solving problem in Field Extension

Правка en22, от rareone0602, 2019-05-23 18:49:59

Hello Codeforcers!

I'd like to demonstrate an application of Extended Field. Sometimes a problem may be easier to solve if a (hidden or not) polynomial can be decomposed into product of linear terms. (Most of the time it's not the solution of tutorial.) In this case, we can try to extend the field to solve the problem.

Extended Field

The idea

First we should include the idea of splitting field, a splitting field F of a (may assumed) monic polynomial P is the smallest field such that

I use the word "smallest" with the sense that if P split over E, .

In the other word, P decomposes into linear factor under its splitting field.

In most of the problems, we need not to find the exact splitting field... Just a field that P split over it is enough.

Example

  1. P = x2 + 1 does not split over but split over where which is widely used as complex.

  2. Let p = 998244353 = 7 * 17 * 223 + 1, P = x224 - 1 does not split over but split over where . The multiplication order ord(w2) = 223.

  3. Let p = 109 + 7, Fibonacci number can be easily written as . where φ, ψ (the golden ratio and it's conjugate) are both root of x2 - x - 1 = 0. The splitting field is (Remark that x2 = 5 has no root in Zp)

Problem Solving

718C - Sasha and Array

The problem to be demonstrated corresponds to the third example. This may be not the best solution for the problem. I've got several TL on this problem for large constant on module. But I do think that it's a nice try to solve some problems in different way :)

The problem contains several operations:

  • shift all element of a segment to the next x Fibonacci term.
  • query for the sum of an segment

In the problem, we can handle Fibonacci number 1, 1, 2, 3, 5, 8, ... with the formula . Once we have decomposed the Fibonacci into two sequence of number powers. The problem becomes easier:

  • multiply a segment by φx and ψx
  • query for the sum of an segment

It can be easily handled by two segment tree.

Implementation

We can implement Extended Field using C++ class, just like complex:

template<int sq = 5, int MOD = 1000000007>
class EX {
  int re, im;
  static int trim(int a) {
    if (a >= MOD) a -= MOD;
    if (a < 0) a += MOD;
    return a;
  }
  static int inv(const int a) {
    int ans = 1;
    for (int cur = a, p = MOD - 2; p; p >>= 1, cur = 1ll * cur * cur % MOD) {
      if (p&1) ans = 1ll * ans * cur % MOD;
    }
    return ans;
  };
public:
  EX(int re = 0, int im = 0) : re(re), im(im) {}
  EX& operator=(EX oth) { return re = oth.re, im = oth.im, *this; }
  int norm() const { 
    return trim((1ll * re * re - 1ll * sq * im % MOD * im) % MOD);
  }
  EX conj() const { 
    return EX(re, trim(MOD - im)); 
  }
  EX operator*(EX oth) const {
    return EX((1ll * re * oth.re + 1ll * sq * im % MOD * oth.im) % MOD,
              (1ll * re * oth.im + 1ll * im * oth.re) % MOD);
  };
  EX operator/(int n) const { 
    return EX(1ll * re * inv(n) % MOD, 1ll * im * inv(n) % MOD);
  }
  EX operator/(EX oth) const { return *this * oth.conj() / oth.norm(); }
  EX operator+(EX oth) const { return EX(trim(re + oth.re), trim(im + oth.im)); }
  EX operator-(EX oth) const {
    return EX(trim(re - oth.re), trim(im - oth.im));
  }
  EX pow(long long n) const {
    EX ans(1);
    for (EX a = *this; n; n >>= 1, a = a * a) {
      if (n&1) ans = a * ans;
    }
    return ans;
  }
  bool operator==(EX oth) const { return re == oth.re and im == oth.im; }
  bool operator!=(EX oth) const { return not (*this == oth); }
  int real() const& { return re; }
  int imag() const& { return im; }
};

FFT

As the second example, since FFT need a root such that x2n - 1 = 0, the idea may be a nice approach for implementing FFT on arbitrary module. Yet I haven't found an efficient way to construct such an extended field.

Теги #number theory, #math, polynomials

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en26 Английский rareone0602 2019-05-23 19:14:45 1
en25 Английский rareone0602 2019-05-23 19:08:03 0 (published)
en24 Английский rareone0602 2019-05-23 19:06:10 44
en23 Английский rareone0602 2019-05-23 18:51:14 36 Tiny change: ';\n~~~~~\n\n\n\nFFT\' -> ';\n~~~~~\nMy submission: [submission:54522918]\n\n\nFFT\'
en22 Английский rareone0602 2019-05-23 18:49:59 25 Tiny change: 'FFT\n---\nSince FFT n' -> 'FFT\n---\nAs the second example, since FFT n'
en21 Английский rareone0602 2019-05-23 18:46:39 127
en20 Английский rareone0602 2019-05-23 18:35:23 274
en19 Английский rareone0602 2019-05-23 18:18:10 366
en18 Английский rareone0602 2019-05-23 17:55:11 122
en17 Английский rareone0602 2019-05-23 17:51:33 21
en16 Английский rareone0602 2019-05-23 17:49:48 634
en15 Английский rareone0602 2019-05-23 17:34:23 2031
en14 Английский rareone0602 2019-05-23 17:20:18 104
en13 Английский rareone0602 2019-05-23 17:14:46 235
en12 Английский rareone0602 2019-05-23 17:08:27 3
en11 Английский rareone0602 2019-05-23 17:07:40 147
en10 Английский rareone0602 2019-05-23 16:56:31 92
en9 Английский rareone0602 2019-05-23 16:52:53 26
en8 Английский rareone0602 2019-05-23 16:50:39 95
en7 Английский rareone0602 2019-05-23 16:48:39 362
en6 Английский rareone0602 2019-05-23 16:32:08 114
en5 Английский rareone0602 2019-05-23 16:28:30 94
en4 Английский rareone0602 2019-05-23 16:25:27 373
en3 Английский rareone0602 2019-05-23 00:54:58 38
en2 Английский rareone0602 2019-02-03 13:05:57 36
en1 Английский rareone0602 2019-02-03 05:10:44 163 Initial revision (saved to drafts)