Related papers: Addendum to Uniqueness of certain polynomials cons…

We study the problem of existence of one-parameter, linear families of polynomials of degree n all of whose polynomials have Galois group A_n. The methods we use have a strong geometric flavour.

For the family of polynomials in one variable $P:=x^n+a_1x^{n-1}+\cdots +a_n$ we ask the questions at which points its discriminant set can be considered as the graph of a function of all coefficients $a_j$ but one and how its subset of…

We investigate $k$-superirreducible polynomials, by which we mean irreducible polynomials that remain irreducible under any polynomial substitution of positive degree at most $k$. Let $\mathbb F$ be a finite field of characteristic $p$. We…

We prove that for almost complex structures of H\"older class at least 1/2, any J-holomorphic disc, that is constant on some non empty open set, is constant. This is in striking contrast with well known, trivial, non-uniqueness results. We…

We give a minimal system of 476 generators (resp. 510 generators) for the algebra of SL(2,C)-covariant polynomials on binary forms of degree 9 (resp. degree 10). These results were only known as conjectures so far. The computations rely on…

We present a family of algorithms for computing the Galois group of a polynomial defined over a $p$-adic field. Apart from the "naive" algorithm, these are the first general algorithms for this task. As an application, we compute the Galois…

Let f be a 1-variable complex polynomial such that f has a singularity at the origin. In the present paper, we show that there exists a deformation of f which has only fold singularities and cusps as singularities of a real polynomial map…

This short note is an erratum to arXiv:1306.4304, correcting the proof of one of its main results. It includes some counterexamples regarding infinite-dimensional unipotent groups and affine spaces that may be of independent interest.

A polynomial over a ring is called decomposable if it is a composition of two nonlinear polynomials. In this paper, we obtain sharp lower and upper bounds for the number of decomposable polynomials with integer coefficients of fixed degree…

We prove that arbitrary (nonpolynomial) scalar evolution equations of order $m\ge 7$, that are integrable in the sense of admitting the canonical conserved densities $\ro^{(1)}$, $\ro^{(2)}$, and $\ro^{(3)}$ introduced in [MSS,1991], are…

All codes with minimum distance 8 and codimension up to 14 and all codes with minimum distance 10 and codimension up to 18 are classified. Nonexistence of codes with parameters [33,18,8] and [33,14,10] is proved. This leads to 8 new exact…

The Markov-Bernstein type inequalities between the norms of functions and of their derivatives are analysed for complex exponential polynomials. We establish a relation between the sharp constants in those inequalities and the stability…

For Fano manifolds we define Ap\'ery constants and Ap\'ery class as particular limits of ratios of coefficients of solutions of the quantum differential equation. We do numerical computations in case of homogeneous varieties. These numbers…

We study explicit continued fraction expansions for certain series. Some of these expansions have symmetry that generalizes some remarkable examples discovered independently by Kmosek and Shallit. Furthermore, we prove the following…

This note will study complex polynomial maps of degree $n\ge 2$ with only one critical point.

We provide a multidimensional extension of previous results on the existence of polynomial progressions in dense subsets of the primes. Let $A$ be a subset of the prime lattice - the d-fold direct product of the primes - of positive…

In this short paper we identify special systems of (an arbitrary number) N of first-order Difference Equations with nonlinear homogeneous polynomials of arbitrary degree M in their right-hand sides, which feature very simple explicit…

Chromatic polynomials and related graph invariants are central objects in both graph theory and statistical physics. Computational difficulties, however, have so far restricted studies of such polynomials to graphs that were either very…

We show that, apart from some obvious exceptions, the number of trinomials vanishing at given complex numbers is bounded by an absolute constant. When the numbers are algebraic, we also bound effectively the degrees and the heights of these…

We give a high precision polynomial-time approximation scheme for the supremum of any honest n-variate (n+2)-nomial with a constant term, allowing real exponents as well as real coefficients. Our complexity bounds count field operations and…