English
Related papers

Related papers: Galois Groups of Generic Polynomials

200 papers

Let $G = \mathrm{SCl}_n(q)$ be a quasisimple classical group with $n$ large, and let $x_1, \dots, x_k \in G$ random, where $k \geq q^C$. We show that the diameter of the resulting Cayley graph is bounded by $q^2 n^{O(1)}$ with probability…

Group Theory · Mathematics 2021-11-18 Sean Eberhard , Urban Jezernik

The probability that a zero of a random real polynomial of increasing degree is real tends to zero. However, passing from polynomials to Laurent polynomials yields a surprising result: the probability that a root is real tends not to zero,…

Algebraic Geometry · Mathematics 2025-09-03 Boris Kazarnovskii

Consider a graph $G$ with chromatic number $k$ and a collection of complete bipartite graphs, or bicliques, that cover the edges of $G$. We prove the following two results: \medskip \noindent $\bullet$ If the bicliques partition the edges…

Combinatorics · Mathematics 2009-03-19 Dhruv Mubayi , Sundar Vishwanathan

The Krawtchouck polynomials arise naturally in both coding theory and probability theory and have been studied extensively from these points of view. However, very little is known about their irreducibility and Galois properties. Just like…

Number Theory · Mathematics 2022-12-16 John Cullinan

In this paper, we prove that the symmetric group $\mathrm{S}_n$ has $2^{n^2/16+o(n^2)}$ subgroups, settling a conjecture of Pyber from 1993. We also derive asymptotically sharp upper and lower bounds on the number of subgroups of…

Group Theory · Mathematics 2025-03-10 Colva M. Roney-Dougal , Gareth Tracey

In this paper we study admissible polynomials. We establish an estimate for the number of admissible polynomials of degree $n$ with coeffients $a_i$ satisfying $0\leq a_i\leq H$ for a fixed $H$, for $i=0,1,2, \ldots, n-1$. In particular,…

Number Theory · Mathematics 2018-09-19 Theophilus Agama

Nisan and Szegedy (CC 1994) showed that any Boolean function $f:\{0,1\}^n\rightarrow \{0,1\}$ that depends on all its input variables, when represented as a real-valued multivariate polynomial $P(x_1,\ldots,x_n)$, has degree at least $\log…

Computational Complexity · Computer Science 2021-07-08 Srikanth Srinivasan , S. Venkitesh

Suppose that $f(x)=x^4+Ax^3+Bx^2+Ax+1\in {\mathbb Z}[x]$. We say that $f(x)$ is monogenic if $f(x)$ is irreducible over ${\mathbb Q}$ and $\{1,\theta,\theta^2,\theta^3\}$ is a basis for the ring of integers of ${\mathbb Q}(\theta)$, where…

Number Theory · Mathematics 2025-02-26 Lenny Jones

We introduce and develop a structure theory of a new class of noncommutative rings - Galois orders, that generalize classical orders in noncommutative rings. Galois orders realized as certain subrings of invariants in skew semigroup rings.…

Representation Theory · Mathematics 2008-09-16 Vyacheslav Futorny , Serge Ovsienko

Irreducible polynomials play an important role till now, in construction of 8-bit S-Boxes in ciphers. The 8-bit S-Box of Advanced Encryption Standard is a list of decimal equivalents of Multiplicative Inverses (MI) of all the elemental…

Cryptography and Security · Computer Science 2017-11-21 Sankhanil Dey , Ranjan Ghosh

We show that for Gaussian random SU(m+1) polynomials of a large degree N the probability that there are no zeros in the disk of radius r is less than $e^{-c_{1,r} N^{m+1}}$, and is also greater than $e^{-c_{2,r} N^{m+1}}$. Enroute to this…

Complex Variables · Mathematics 2007-05-23 Scott Zrebiec

Let $G, G_1,\dots,G_N$ be independent copies of a standard gaussian random vector in $\mathbb{R}^d$ and denote by $\Gamma = \sum_{i=1}^N \langle G_i,\cdot\rangle e_i$ the standard gaussian ensemble. We show that, for any set $A\subset…

Probability · Mathematics 2026-03-19 Daniel Bartl , Shahar Mendelson

We conjecture that bounded generalised polynomial functions cannot be generated by finite automata, except for the trivial case when they are ultimately periodic. Using methods from ergodic theory, we are able to partially resolve this…

Number Theory · Mathematics 2020-04-01 Jakub Byszewski , Jakub Konieczny

We study the probabilistic degree over reals of the OR function on $n$ variables. For an error parameter $\epsilon$ in (0,1/3), the $\epsilon$-error probabilistic degree of any Boolean function $f$ over reals is the smallest non-negative…

Computational Complexity · Computer Science 2022-11-24 Siddharth Bhandari , Prahladh Harsha , Tulasimohan Molli , Srikanth Srinivasan

Let K be a field admitting a cyclic Galois extension of degree n. The main result of this paper is a decomposition theorem for the space of alternating bilinear forms defined on a vector space of odd dimension n over K. We show that this…

Commutative Algebra · Mathematics 2007-09-07 Rod Gow , Rachel Quinlan

A classic result by Carbery and Wright states that a polynomial of Gaussian random variables exhibits anti-concentration in the following sense: for any degree $d$ polynomial $f$, one has the estimate $P( |f(x)| \leq \varepsilon \cdot…

Probability · Mathematics 2023-01-18 Stephen Tu , Ross Boczar

We explain in detail the definition, construction and generalisation of the Galois group of Chebyshev polynomials of high degree to the Galois group of chaotic chains. The calculations in this paper are performed for Chebyshev polynomials…

Chaotic Dynamics · Physics 2019-02-04 Stefan Groote

Let G be a locally compact Hausdorff group in which every element is of finite order, and let P(G) denote the class of all regular probability measures on G. In this note, it is observed that a characterization of algebraically regular…

Functional Analysis · Mathematics 2026-03-20 M N N Namboodiri

Let $G$ be a transitive normal subgroup of a permutation group $A$ of finite degree $n$. The factor group $A/G$ can be considered as a certain Galois group and one would like to bound its size. One of the results of the paper is that $|A/G|…

Group Theory · Mathematics 2017-01-31 Robert M. Guralnick , Attila Maróti , László Pyber

Let $K$ be an algebraically closed field of characteristic zero and let $f \in K[x]$. The $m$-th {\it cyclic resultant} of $f$ is \[r_m = \text{Res}(f,x^m-1).\] A generic monic polynomial is determined by its full sequence of cyclic…

Algebraic Geometry · Mathematics 2007-05-23 Christopher J. Hillar , Lionel Levine