ﻻ يوجد ملخص باللغة العربية
We consider the question of certifying that a polynomial in ${mathbb Z}[x]$ or ${mathbb Q}[x]$ is irreducible. Knowing that a polynomial is irreducible lets us recognise that a quotient ring is actually a field extension (equiv.~that a polynomial ideal is maximal). Checking that a polynomial is irreducible by factorizing it is unsatisfactory because it requires trusting a relatively large and complicated program (whose correctness cannot easily be verified). We present a practical method for generating certificates of irreducibility which can be verified by relatively simple computations; we assume that primes and irreducibles in ${mathbb F}_p[x]$ are self-certifying.
Let $S subset R$ be an arbitrary subset of a unique factorization domain $R$ and $K$ be the field of fractions of $R$. The ring of integer-valued polynomials over $S$ is the set $mathrm{Int}(S,R)= { f in mathbb{K}[x]: f(a) in R forall a in S }.$ This
We introduce a novel approach to Bertini irreducibility theorems over an arbitrary field, based on random hyperplane slicing over a finite field. Extending a result of Benoist, we prove that for a morphism $phi colon X to mathbb{P}^n$ such that $X$ i
Conditional on the extended Riemann hypothesis, we show that with high probability, the characteristic polynomial of a random symmetric ${pm 1}$-matrix is irreducible. This addresses a question raised by Eberhard in recent work. The main innovation i
The ring of classic Witt vectors is a fundamental object in mixed characteristic commutative algebra which has many applications in number theory. There is a significant generalization due to Dress and Siebeneicher which for any profinite group G pro