Balanced $0,1$-words and the Galois group of $(x+1)^n-\lambda x^p$

Lev Glebsky

Balanced $0,1$-words and the Galois group of $(x+1)^n-\lambda x^p$

Combinatorics 2011-11-15 v1 Commutative Algebra

Authors: Lev Glebsky

Abstract

We study the number of $0,1$ -words where the fraction of 0 is "almost" fixed for any initial subword. It turns out that this study use and reveal the structure of the Galois group (the monodromy group) of the polynomials $(x+1)^n-\lambda x^p$ . ( $p$ is not necessary a prime here.)

Keywords

balanced words Galois group monodromy group polynomials combinatorics

Cite

@article{arxiv.1111.2870,
  title  = {Balanced $0,1$-words and the Galois group of $(x+1)^n-\lambda x^p$},
  author = {Lev Glebsky},
  journal= {arXiv preprint arXiv:1111.2870},
  year   = {2011}
}

Comments

9 pages

Related papers

View all related →