English
Related papers

Related papers: Robust Sylvester-Gallai type theorem for quadratic…

200 papers

Let K be a field of characteristic p>0, and let q be a power of p. We determine all polynomials f in K[t]\K[t^p] of degree q(q-1)/2 such that the Galois group of f(t)-u over K(u) has a transitive normal subgroup isomorphic to PSL_2(q),…

Algebraic Geometry · Mathematics 2013-10-08 Robert M. Guralnick , Michael E. Zieve

There are several variants of the inverse Galois problem which involve restrictions on ramification. In this paper we give sufficient conditions that a given finite group $G$ occurs infinitely often as a Galois group over the rationals…

Number Theory · Mathematics 2017-11-15 Joachim Koenig , Daniel Rabayev , Jack Sonn

Let $\mathbb{F}_q$ be the field with $q$ elements and of characteristic $p$. For $a\in\mathbb{F}_p$ consider the set \begin{equation*} S_a(n)=\{f\in\mathbb{F}_q[x]\mid\operatorname{deg}(f)=n,~f\text{ irreducible, monic and}…

Number Theory · Mathematics 2023-12-29 Max Schulz

Theorem. An irreducible cubic polynomial with rational coefficients has a root in a one step radical extension of Q if and only if the discriminate is a square of a rational number. Theorem. An irreducible polynomial x^4+px^2+qx+s with…

History and Overview · Mathematics 2015-11-16 Danil Akhtyamov , Ilya Bogdanov

We provide a sufficient condition for solvability of a system of real quadratic equations $p_i(x)=y_i$, $i=1, \ldots, m$, where $p_i: {\mathbb R}^n \longrightarrow {\mathbb R}$ are quadratic forms. By solving a positive semidefinite…

Optimization and Control · Mathematics 2021-10-05 Alexander Barvinok , Mark Rudelson

Let $P(T,X)$ be an irreducible polynomial in two variables with rational coefficients. It follows from Hilbert's Irreducibility Theorem that for most rational numbers $t$ the specialized polynomial $P(t,X)$ is irreducible and has the same…

Number Theory · Mathematics 2016-10-13 David Krumm

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…

Commutative Algebra · Mathematics 2009-08-22 Ivan V. Arzhantsev , Anatoliy P. Petravchuk

We consider a polynomial $P\in \mathbb{R}[x_{1},\cdots, x_{d}]$ of degree $ \delta $ that depends non-trivially on each of $x_1,...,x_d$ with $d\geq 2$. For any integer $t$ with $2\leq t\leq d$, any natural number $n \in \mathbb{N}$, and…

Combinatorics · Mathematics 2026-03-09 Yewen Sun

A while ago MLC (the conjecture that the Mandelbrot set is locally connected) was proven for quasi-hyperbolic points by Douady and Hubbard, and for boundaries of hyperbolic components by Yoccoz. More recently Yoccoz proved MLC for all at…

Dynamical Systems · Mathematics 2016-09-06 Mikhail Lyubich

We give a lower bound for the degree of an irreducible factor of a given polynomial. This improves and generalizes the results obtained in [4, On the irreducible factors of a polynomial, Proc. Amer. Math. Soc., 148 (2020] 1429 -- 1437].

Number Theory · Mathematics 2020-08-03 Anuj Jakhar , Srinivas Koytada

In this paper we give a conditional improvement to the Elekes-Szab\'{o} problem over the rationals, assuming the Uniformity Conjecture. Our main result states that for $F\in \mathbb{Q}[x,y,z]$ belonging to a particular family of…

Combinatorics · Mathematics 2020-10-20 Mehdi Makhul , Oliver Roche-Newton , Sophie Stevens , Audie Warren

We consider the equation $P(Q(x_1,\ldots,x_\nu))=Q(P(x_1),\ldots,P(x_\nu))$ in polynomials over the field of complex numbers and prove that if ${\rm deg}(P)>1$, then it is only solvable in polynomials that are affinely conjugate to…

Number Theory · Mathematics 2024-12-17 Arseny Mingajev

Let $P: \F \times \F \to \F$ be a polynomial of bounded degree over a finite field $\F$ of large characteristic. In this paper we establish the following dichotomy: either $P$ is a moderate asymmetric expander in the sense that $|P(A,B)|…

Combinatorics · Mathematics 2013-01-04 Terence Tao

Given any polynomial with real coefficients, the existence of a real quadratic polynomial factor is proven using only basic real analysis. The aim is to provide an approachable proof to anybody who is familiar with the least upper bound…

Classical Analysis and ODEs · Mathematics 2020-09-28 Soham Basu

We study Widom factors for (a) monic orthogonal polynomials in $L^2$ with respect to the equilibrium measure of a compact set $K\subset\mathbb{R}$ and (b) residual polynomials normalized at an exterior point. Using weakly equilibrium Cantor…

Complex Variables · Mathematics 2025-08-22 Gökalp Alpan

Zariski dense collections of quadratic points on curves $X$ are well-understood by results of Harris--Silverman and Vojta, but when $\dim X \geq 2$ there is not an analogous geometric characterization, even conjecturally. In this note we…

Number Theory · Mathematics 2025-11-04 Nathan Chen , Ben Church , Hector Pasten , Isabel Vogt

An irreducible ordinary character of a finite reductive group is called quadratic unipotent if it corresponds under Jordan decomposition to a semisimple element $s$ in a dual group such that $s^2=1$. We prove that there is a bijection…

Representation Theory · Mathematics 2013-04-22 Bhama Srinivasan

For a degree $n$ polynomial $f$ over the rationals, the elements in the fiber $f^{-1}(a)$ are of degree $n$ over $\mathbb Q$ for most rational values $a$ by Hilbert's irreducibility theorem. Determining the set of exceptional $a$'s without…

Number Theory · Mathematics 2022-09-09 Joachim König , Danny Neftin

We establish necessary and sufficient conditions for a quadratic polynomial to be irreducible in the ring $Z[[x]]$ of formal power series with integer coefficients. For $n,m\ge 1$ and $p$ prime, we show that $p^n+p^m\beta x+\alpha x^2$ is…

Commutative Algebra · Mathematics 2023-10-24 Daniel Birmajer , Juan Gil , Michael Weiner

In this paper we characterize real bivariate polynomials which have a small range over large Cartesian products. We show that for every constant-degree bivariate real polynomial $f$, either $|f(A,B)|=\Omega(n^{4/3})$, for every pair of…

Computational Geometry · Computer Science 2014-03-20 Orit E. Raz , Micha Sharir , József Solymosi