English
Related papers

Related papers: Chinese Remainder Theorem for Cyclotomic Polynomia…

200 papers

We prove a low characteristic counterpart to the main result in (Peluse, 2019), establishing power saving bounds for the polynomial Szemer\'{e}di theorem for certain families of polynomials. Namely, we show that if $P_1, \dots, P_m \in…

Number Theory · Mathematics 2023-03-03 Ethan Ackelsberg , Vitaly Bergelson

Elliptic curves with a known number of points over a given prime field with n elements are often needed for use in cryptography. In the context of primality proving, Atkin and Morain suggested the use of the theory of complex multiplication…

Number Theory · Mathematics 2007-07-16 Amod Agashe , Kristin Lauter , Ramarathnam Venkatesan

Let $\Sigma(f)$ be critical points of a polynomial $f \in \mathbb{K}[x,y]$ in the plane $\mathbb{K}^2$, where $\mathbb{K}$ is $\mathbb{R}$ or $\mathbb{C}$. Our goal is to study the critical point map $\mathfrak{S}_d$, by sending polynomials…

Algebraic Geometry · Mathematics 2022-06-14 John A. Arredondo , Jesús Muciño-Raymundo

Let $X\subseteq G\slash B$ be a Schubert variety in a flag manifold and let $\pi: \tilde X \rightarrow X$ be a Bott-Samelson resolution of $X$. In this paper we prove an effective version of the decomposition theorem for the derived…

Algebraic Geometry · Mathematics 2023-08-04 Davide Franco

The author in [7] was proved the generalized remainder and quotient theorems of polynomial in one indeterminate where the divisor is complete factorization to linear factors. In this paper we give the formula for the generalized remainder…

Numerical Analysis · Mathematics 2015-06-23 Wiwat Wanicharpichat

We find a new approach to computing the remainder of a polynomial modulo $x^n-1$; such a computation is called modular enumeration. Given a polynomial with coefficients from a commutative $\mathbb{Q}$-algebra, our first main result…

Combinatorics · Mathematics 2014-03-06 William Kuszmaul

We formulate a nonrecursive combinatorial rule for the expansion of the stable Grothendieck polynomials of [Fomin-Kirillov '94] in the basis of stable Grothendieck polynomials for partitions. This gives a common generalization, as well as…

Combinatorics · Mathematics 2010-02-17 Anders S. Buch , Andrew Kresch , Mark Shimozono , Harry Tamvakis , Alexander Yong

We study a topological generalization of ideal co-maximality in topological rings and present some of its properties, including a generalization of the Chinese remainder theorem. Using the hyperspace uniformity, we prove a stronger version…

General Topology · Mathematics 2016-07-05 Matan Komisarchik

The Qth-power algorithm produces a useful canonical P-module presentation for the integral closures of certain integral extensions of $P:=\mathbf{F}[x_n,...,x_1]$, a polyonomial ring over the finite field $\mathbf{F}:=\mathbf{Z}_q$ of $q$…

Commutative Algebra · Mathematics 2013-01-28 Douglas A. Leonard

We present several approaches on finding necessary and sufficient conditions on $n$ so that $\Phi_k(x^n)$ is irreducible where $\Phi_k$ is the $k$-th cyclotomic polynomial.

Number Theory · Mathematics 2011-08-10 Pantelis A. Damianou

Given a prime $p$, let $P(t)$ be a non-constant monic polynomial in $t$ over the ring $\mathbb{Z}_{p}$ of $p$-adic integers. Let $X_{n}$ be an $n \times n$ random matrix over $\mathbb{Z}_{p}$ with independent entries that lie in any residue…

Number Theory · Mathematics 2023-10-24 Gilyoung Cheong , Myungjun Yu

Given a positive integer $r$ and a prime power $q$, we estimate the probability that the characteristic polynomial $f_{A}(t)$ of a random matrix $A$ in $\mathrm{GL}_{n}(\mathbb{F}_{q})$ is square-free with $r$ (monic) irreducible factors…

Combinatorics · Mathematics 2022-09-09 Gilyoung Cheong , Jungin Lee , Hayan Nam , Myungjun Yu

Motivated by a question of Venkataramana, we consider the greatest common divisor of $\phi(f(n))$ where $f$ is a primitive polynomial with integer coefficients, and $n$ ranges over all natural numbers. Assuming Schinzel's hypothesis, we…

Number Theory · Mathematics 2019-09-25 J. Brüdern , K. Soundararajan

Artin solved Hilbert's 17th problem, proving that a real polynomial in $n$ variables that is positive semidefinite is a sum of squares of rational functions, and Pfister showed that only $2^n$ squares are needed. In this paper, we…

Algebraic Geometry · Mathematics 2017-07-04 Olivier Benoist

Let $\mathbb{F}_q$ denote the finite field of $q$ elements with characteristic $p$. Let $\mathbb{Z}_q$ denote the unramified extension of the $p$-adic integers $\mathbb{Z}_p$ with residue field $\mathbb{F}_q$. In this paper, we investigate…

Number Theory · Mathematics 2022-10-25 Wei Cao , Daqing Wan

Let $p$ be a prime and let $S$ be a non-empty subset of $\mathbb{F}_p$. Generalizing a result of Green and Tao on the equidistribution of high-rank polynomials over finite fields, we show that if $P: \mathbb{F}_p^n \rightarrow \mathbb{F}_p$…

Combinatorics · Mathematics 2022-09-13 W. T. Gowers , Thomas Karam

We generalize the classical theory of periodic continued fractions (PCFs) over ${\mathbf Z}$ to rings ${\mathcal O}$ of $S$-integers in a number field. Let ${\mathcal B}=\{\beta, {\beta^*}\}$ be the multi-set of roots of a quadratic…

Number Theory · Mathematics 2022-12-02 Bradley W. Brock , Noam D. Elkies , Bruce W. Jordan

A cyclotomic polynomial \Phi_n(x) is said to be ternary if n=pqr with p,q and r distinct odd primes. Ternary cyclotomic polynomials are the simplest ones for which the behaviour of the coefficients is not completely understood. Here we…

Number Theory · Mathematics 2012-07-30 Yves Gallot , Pieter Moree , Robert Wilms

Let $q$ be a power of a prime $p$, let $\mathbb F_q$ be the finite field with $q$ elements and, for each nonconstant polynomial $F\in \mathbb F_{q}[X]$ and each integer $n\ge 1$, let $s_F(n)$ be the degree of the splitting field (over…

Number Theory · Mathematics 2025-08-13 Lucas Reis

We show that the proportion of polynomials of degree $n$ over the finite field with $q$ elements, which have a divisor of every degree below $n$, is given by $c_q n^{-1} + O(n^{-2})$. More generally, we give an asymptotic formula for the…

Number Theory · Mathematics 2016-05-25 Andreas Weingartner