English
Related papers

Related papers: Probabilistic Galois Theory -- The Square Discrimi…

200 papers

For real number $\alpha,$ Generalised Laguerre Polynomials (GLP) is a family of polynomials defined by \begin{align*} L_n^{(\alpha)}(x)=(-1)^n\displaystyle\sum_{j=0}^{n}\binom{n+\alpha}{n-j}\frac{(-x)^j}{j!}. \end{align*}These orthogonal…

Number Theory · Mathematics 2019-01-07 Shanta Laishram , Saranya G. Nair , Tarlok Nath Shorey

We propose a conjectural characterization of when the dynamical Galois group associated to a polynomial is abelian, and we prove our conjecture in several cases, including the stable quadratic case over ${\mathbb Q}$. In the postcritically…

Number Theory · Mathematics 2021-10-08 Jesse Andrews , Clayton Petsche

In this paper we produce unconditionally new instances of Galois number field extensions exhibiting strong discrepancies in the distribution of Frobenius elements among conjugacy classes of the Galois group. We first prove an inverse Galois…

Number Theory · Mathematics 2024-04-11 Mounir Hayani

This paper introduces the notion of probabilistic zero bounds for random polynomials. It presents new results regarding the probabilistic bounds of random polynomials whose coefficients are independently and identically distributed as…

Complex Variables · Mathematics 2026-05-27 Sajad A. Sheikh , Mohammad Ibrahim Mir

Although there is an extensive literature on the maxima of Gaussian processes, there are relatively few non-asymptotic bounds on their lower-tail probabilities. The aim of this paper is to develop such a bound, while also allowing for many…

Probability · Mathematics 2021-12-02 Miles E. Lopes , Junwen Yao

This paper is on the inverse parameterized differential Galois problem. We show that surprisingly many groups do not occur as parameterized differential Galois groups over K(x) even when K is algebraically closed. We then combine the method…

Commutative Algebra · Mathematics 2016-03-23 Annette Bachmayr

We compute the Galois group of a polynomial whose roots are determined by the critical points of a scalar potential in type IIB compactifications. We focus our study on certain perturbative models where it is feasible to construct a de…

High Energy Physics - Theory · Physics 2023-08-24 Cesar Damian , Oscar Loaiza-Brito

We develop methods to study $2$-dimensional $2$-adic Galois representations $\rho$ of the absolute Galois group of a number field $K$, unramified outside a known finite set of primes $S$ of $K$, which are presented as Black Box…

Number Theory · Mathematics 2018-06-01 Alejandro Argáez-García , John Cremona

Let $L(x)$ be any $q$-linearized polynomial with coefficients in $\mathbb{F}_q$, of degree $q^n$. We consider the Galois group of $L(x)+tx$ over $\mathbb{F}_q(t)$, where $t$ is transcendental over $\mathbb{F}_q$. We prove that when $n$ is a…

Number Theory · Mathematics 2022-07-29 Rod Gow , Gary McGuire

Let $L(X)$ be a monic $q$-linearized polynomial over $F_q$ of degree $q^n$, where $n$ is an odd prime. Recently Gow and McGuire showed that the Galois group of $L(X)/X-t$ over the field of rational functions $F_q(t)$ is $GL_n(q)$ unless…

Number Theory · Mathematics 2026-05-19 Peter Müller

The problem of analyzing the number of number field extensions $L/K$ with bounded (relative) discriminant has been the subject of renewed interest in recent years, with significant advances made by Schmidt, Ellenberg-Venkatesh, Bhargava,…

Number Theory · Mathematics 2017-04-18 Evan P. Dummit

We introduce a heuristic prediction for the distribution of the isomorphism class of the Galois group of the maximal pro-p extension of Q unramified outside a "random" set of primes. This is guided by reasoning similar to that governing the…

Group Theory · Mathematics 2012-04-20 Nigel Boston , Jordan S. Ellenberg

We provide evidence for this conclusion: given a finite Galois cover $f: X \rightarrow \mathbb{P}^1_\mathbb{Q}$ of group $G$, almost all (in a density sense) realizations of $G$ over $\mathbb{Q}$ do not occur as specializations of $f$. We…

Number Theory · Mathematics 2021-01-20 Joachim König , François Legrand

Form an $n \times n$ matrix by drawing entries independently from $\{\pm1\}$ (or another fixed nontrivial finitely supported distribution in $\mathbf{Z}$) and let $\phi$ be the characteristic polynomial. Conditionally on the extended…

Number Theory · Mathematics 2022-03-16 Sean Eberhard

Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…

Classical Analysis and ODEs · Mathematics 2009-04-20 M. A. M. Alwash

We define a group with local data over a number field $K$ as a group $G$ together with homomorphisms from decomposition groups ${\rm Gal}(\overline{K}_p/K_p)\to G$. Such groups resemble Galois groups, just without global information.…

Number Theory · Mathematics 2023-04-05 Brandon Alberts

The problem of expressing a specific polynomial as the determinant of a square matrix of affine-linear forms arises from algebraic geometry, optimisation, complexity theory, and scientific computing. Motivated by recent developments in this…

Commutative Algebra · Mathematics 2023-09-18 Ada Boralevi , Jasper van Doornmalen , Jan Draisma , Michiel E. Hochstenbach , Bor Plestenjak

Let $M_n$ be an $n$ by $n$ random matrix where each entry is +1 or -1 independently with probability 1/2. Our main result implies that the probability that $M_n$ is singular is at most $(1/\sqrt{2} + o(1))^n$, improving on the previous best…

Combinatorics · Mathematics 2009-05-05 Jean Bourgain , Van Vu , Philip Matchett Wood

We prove a quantitative version of the bound on the smallest singular value of a Bernoulli covariance matrix (due to Bai and Yin). Then we use this bound, together with several recent developments, to show that the distance from a random…

Functional Analysis · Mathematics 2007-08-14 Shiri Artstein-Avidan , Omer Friedland , Vitali Milman , Sasha Sodin

We study the minimum number of constraints needed to formulate random instances of the maximum stable set problem via linear programs (LPs), in two distinct models. In the uniform model, the constraints of the LP are not allowed to depend…

Computational Complexity · Computer Science 2016-10-26 Gábor Braun , Samuel Fiorini , Sebastian Pokutta
‹ Prev 1 3 4 5 6 7 10 Next ›