Related papers: Reverse Engineering of Irreducible Polynomials in …

We study the irreducibility and Galois group of random polynomials over function fields. We prove that a random polynomial $f=y^n+\sum_{i=0}^{n-1}a_i(x)y^i\in\mathbb F_q[x][y]$ with i.i.d coefficients $a_i$ taking values in the set…

We consider N-fold 4-block decomposable integer programs, which simultaneously generalize N-fold integer programs and two-stage stochastic integer programs with N scenarios. In previous work [R. Hemmecke, M. Koeppe, R. Weismantel, A…

Fourier phase retrieval (FPR) is an inverse problem that recovers the signal from its Fourier magnitude measurement, it's ill-posed especially when the sampling rates are low. In this paper, an untrained generative prior is introduced to…

Let $p$ be a prime number. Irreducible cyclic codes of length $p^2-1$ and dimension $2$ over the integers modulo $p^h$ are shown to have exactly two nonzero Hamming weights. The construction uses the Galois ring of characteristic $p^h$ and…

We establish non-unirational versions of Hilbert Irreducibility for all Hilbert modular surfaces which are of K3 type. As an application we prove new instances of the regular Inverse Galois Problem for the simple groups…

A polynomial-time algorithm for computing the permanent in any field of characteristic 3 is presented in this article. The principal objects utilized for that purpose are the Cauchy and Vandermonde matrices, the discriminant function and…

Let $n>1$, $e\geq 0$ and a prime number $p\geq 2^{n+2+2e}+3$, such that the index of regularity of $p$ is $\leq e$. We show that there are infinitely many irreducible Galois representations $\rho: Gal(\bar{\mathbb{Q}}/\mathbb{Q})\rightarrow…

We propose an algorithm for determining the irreducible polynomials over finite fields, based on the use of the companion matrix of polynomials and the generalized Jordan normal form of square matrices.

We solve the inverse differential Galois problem over the fraction field of $k[[t,x]]$ and use this to solve split differential embedding problems over $k((t))(x)$ that are induced from $k(x)$. The proofs use patching as well as prior…

In this article new cases of the Inverse Galois Problem are established. The main result is that for a fixed integer n, there is a positive density set of primes p such that PSL_2(F_{p^n}) occurs as the Galois group of some finite extension…

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

We extend Theorem 1 of R. Reams, A Galois approach to m-th roots of matrices with rational entries, LAA 258 (1997), 187-194. Let $p(\lambda)$ be any polynomial over $\mathbb{Q}$ and let $A\in M_n(\mathbb{Q})$ have irreducible characteristic…

In this paper we discuss the problem of performing elementary finite field arithmetic on a quantum computer. Of particular interest, is the controlled-multiplication operation, which is the only group-specific operation in Shor's algorithms…

A key property of an algebraic variety is whether it is absolutely irreducible, meaning that it remains irreducible over the algebraic closure of its defining field, and determining absolute irreducibility is important in algebraic geometry…

Let $n \geq 2$ and $p$ be a prime. Let $K$ be a number field and consider two Galois representations $\rho_1, \rho_2 : \operatorname{Gal}(\overline{K} / K) \to \operatorname{GL}_n(\mathbb{Z}_p)$ having residual image a $p$-group. We explain…

A polynomial threshold function (PTF) $f:\mathbb{R}^n \rightarrow \mathbb{R}$ is a function of the form $f(x) = \mathsf{sign}(p(x))$ where $p$ is a polynomial of degree at most $d$. PTFs are a classical and well-studied complexity class…

In this article we combine two developments in polynomial optimization. On the one hand, we consider nonnegativity certificates based on sums of nonnegative circuit polynomials, which were recently introduced by the second and the third…

We describe a method for counting the number of extensions of $\mathbb{Q}_p$ with a given Galois group $G$, founded upon the description of the absolute Galois group of $\mathbb{Q}_p$ due to Jannsen and Wingberg. Because this description is…

We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…

The Galois group of a parameterized polynomial system of equations encodes the structure of the solutions. This monodromy group acts on the set of solutions for a general set of parameters, that is, on the fiber of a projection from the…