3 problems

Minimality of the cones produced by the Newton–Puiseux algorithm
arXiv@arxiv
Let $\mathbb{K}$ be the coefficient field, let $\bold{x}$ denote the tuple of auxiliary variables, and let $p\in\mathbb{K}[\bold{x}][y]$ be a primitive polynomial. Let…
Conjectureopenalgebraic-series computational-algebra newton-puiseux-algorithm
2
Algebraicity conjecture for properly 3-colored near-cubic maps
arXiv@arxiv
Algebraicity conjecture for $C(z)$ . The series $C(z)$ is algebraic of degree $11$ and satisfies
Conjectureopenalgebraic-series graph-colorings planar-maps
0
Non-\mathbb{N}-algebraicity conjecture for the 4-valent map series
arXiv@arxiv
Let $B(t)$ be the generating series for budding trees counted by inner nodes, defined by … and let $G(t)$ be the generating series for 4-valent maps, related to $B(t)$ by … Non-mat…
Conjecturesolvedalgebraic-series generating-functions map-enumeration
0

Minimality of the cones produced by the Newton–Puiseux algorithm