中文
相关论文

相关论文: Galois groups of random integer polynomials and va…

200 篇论文

We utilize harmonic analytic tools to count the number of elements of the Galois cohomology group $f\in H^1(K,T)$ with discriminant-like invariant ${\rm inv}(f)\le X$ as $X\to\infty$. Specifically, Poisson summation produces a canonical…

数论 · 数学 2023-07-12 Brandon Alberts , Evan O'Dorney

Algorithms working with linear algebraic groups often represent them via defining polynomial equations. One can always choose defining equations for an algebraic group to be of the degree at most the degree of the group as an algebraic…

代数几何 · 数学 2021-08-31 Eli Amzallag , Andrei Minchenko , Gleb Pogudin

We compute the first explicit polynomials with Galois groups $G=P\Gamma L_3(4)$, $PGL_3(4)$, $PSL_3(4)$ and $PSL_5(2)$ over $\mathbb{Q}(t)$. Furthermore we compute the first examples of totally real polynomials with Galois groups…

数论 · 数学 2015-12-18 Joachim König

In this work we compute the families of classical Hamiltonians in two degrees of freedom in which the Normal Variational Equation around an invariant plane falls in Schroedinger type with polynomial or trigonometrical potential. We analyze…

数学物理 · 物理学 2007-05-23 Primitivo Acosta-Humanez , David Blazquez-Sanz

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

交换代数 · 数学 2014-07-14 Joachim von zur Gathen , Konstantin Ziegler

We present new theoretical results on the existence of intersective polynomials with certain prescribed Galois groups, namely the projective and affine linear groups $PGL_2(\ell)$ and $AGL_2(\ell)$ as well as the affine symplectic groups…

数论 · 数学 2023-12-15 Joachim König

In his previous paper (Math. Res. Letters 7(2000), 123--132) the author proved that in characteristic zero the jacobian $J(C)$ of a hyperelliptic curve $C: y^2=f(x)$ has only trivial endomorphisms over an algebraic closure of the ground…

代数几何 · 数学 2007-05-23 Yuri G. Zarhin

We study the expected number of real zeros for random linear combinations of orthogonal polynomials. It is well known that Kac polynomials, spanned by monomials with i.i.d. Gaussian coefficients, have only $(2/\pi + o(1))\log{n}$ expected…

概率论 · 数学 2015-03-24 D. S. Lubinsky , I. E. Pritsker , X. Xie

Cilleruelo conjectured that for an irreducible polynomial $f \in \mathbb{Z}[X]$ of degree $d \geq 2$, denoting $$L_f(N)=\mathrm{lcm}(f(1),f(2),\ldots f(N))$$ one has $$\log L_f(n)\sim(d-1)N\log N.$$ He proved it in the case $d=2$ but it…

数论 · 数学 2025-09-18 Alexei Entin

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…

数论 · 数学 2016-10-13 David Krumm

In the 80's Aschbacher classified the maximal subgroups of almost all of the finite almost simple classical groups. Essentially, this classification divide these subgroups into two types. The first of these consist roughly of subgroups that…

数论 · 数学 2019-10-28 Adrian Zenteno

Extremal problems involving the enumeration of graph substructures have a long history in graph theory. For example, the number of independent sets in a $d$-regular graph on $n$ vertices is at most $(2^{d+1}-1)^{n/2d}$ by the Kahn-Zhao…

组合数学 · 数学 2013-06-10 Jonathan Cutler , A. J. Radcliffe

A collection of graphs is \textit{nearly disjoint} if every pair of them intersects in at most one vertex. We prove that if $G_1, \dots, G_m$ are nearly disjoint graphs of maximum degree at most $D$, then the following holds. For every…

组合数学 · 数学 2023-10-31 Tom Kelly , Daniela Kühn , Deryk Osthus

We develop a computational framework for classifying Galois groups of irreducible degree-7 polynomials over~$\mathbb{Q}$, combining explicit resolvent methods with machine learning techniques. A database of over one million normalized…

交换代数 · 数学 2025-11-21 Jurgen Mezinaj

We study the computational limits of the following general hypothesis testing problem. Let H=H_n be an \emph{arbitrary} undirected graph on n vertices. We study the detection task between a ``null'' Erd\H{o}s-R\'{e}nyi random graph G(n,p)…

统计理论 · 数学 2024-03-27 Xifan Yu , Ilias Zadik , Peiyuan Zhang

Using Serre's proposed complement to Shih's Theorem, we obtain PSL_2(F_p) as a Galois group over Q for at least 614 new primes p. Under the assumption that rational elliptic curves with odd analytic rank have positive rank, we obtain Galois…

数论 · 数学 2007-05-23 Pete L. Clark

Let $d>k$ be positive integers. Motivated by an earlier result of Bugeaud and Nguyen, we let $E_{k,d}$ be the set of $(c_1,\ldots,c_k)\in\mathbb{R}_{\geq 0}^k$ such that…

数论 · 数学 2024-08-02 Seda Albayrak , Samprit Ghosh , Greg Knapp , Khoa D. Nguyen

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…

数论 · 数学 2017-11-15 Joachim Koenig , Daniel Rabayev , Jack Sonn

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…

数论 · 数学 2022-10-04 Artūras Dubickas , Min Sha

A conjecture of Amitsur states that two Severi-Brauer varieties are birationally isomorphic if and only if the underlying algebras are the same degree and generate the same cyclic subgroup of the Brauer group. It is known that generating…

环与代数 · 数学 2007-05-23 Daniel Krashen