English
Related papers

Related papers: The Least Common Multiple of Polynomial Values ove…

200 papers

We prove that functions $f:\f{2^m} \to \f{2^m}$ of the form $f(x)=x^{-1}+g(x)$ where $g$ is any non-affine polynomial are APN on at most a finite number of fields $\f{2^m}$. Furthermore we prove that when the degree of $g$ is less then 7…

Algebraic Geometry · Mathematics 2009-01-28 Gregor Leander , François Rodier

We show that if f is a nonzero, noninvertible function on a smooth complex variety X and J_f is the Jacobian ideal of f, then lct(f, J_f^2)>1 if and only if the hypersurface defined by f has rational singularities. Moreover, if this is not…

Algebraic Geometry · Mathematics 2022-02-23 Raf Cluckers , Mircea Mustata

Let $F$ be a finite field of odd cardinality $q$, $A=F[T]$ the polynomial ring over $F$, $k=F(T)$ the rational function field over $F$ and $\mathcal{H}$ the set of square-free monic polynomials in $A$ of degree odd. If $D\in\mathcal{H}$, we…

Number Theory · Mathematics 2015-04-24 Julio Andrade

Given a field $F$, an integer $n\geq 1$, and a matrix $A\in M_n(F)$, are there polynomials $f,g\in F[X]$, with $f$ monic of degree $n$, such that $A$ is similar to $g(C_f)$, where $C_f$ is the companion matrix of $f$? For infinite fields…

Rings and Algebras · Mathematics 2013-04-08 Natalio H. Guersenzvaig , Fernando Szechtman

Let $K$ be a field of positive characteristic with no algebraically closed subfield. Let $F$ be a function field over $K$ and $t \in F$ transcendental over $K$. Refining a result of Eisentr{\"a}ger and Shlapentokh, we show that there is no…

Number Theory · Mathematics 2025-12-05 Nicolas Daans

We show that for multivariate Freud-type weights $W_\alpha(x)=\exp(-|x|^\alpha)$, $\alpha>1$, any convex function $f$ on $R^d$ satisfying $fW_\alpha\in L_p(R^d)$ if $1\le p<\infty$, or $\lim_{|x|\to\infty}f(x)W_\alpha(x)=0$ if $p=\infty$,…

Classical Analysis and ODEs · Mathematics 2014-11-14 Oleksandr Maizlish , Andriy Prymak

The ring of dual numbers over a ring $R$ is $R[\alpha] = R[x]/(x^2)$, where $\alpha$ denotes $x+(x^2)$. For any finite commutative ring $R$, we characterize null polynomials and permutation polynomials on $R[\alpha]$ in terms of the…

Commutative Algebra · Mathematics 2021-10-07 H. Al-Ezeh , A. A. Al-Maktry , S. Frisch

Let $q\geqslant 2$ be a fixed prime power. We prove an asymptotic formula for counting the number of monic polynomials that are of degree $n$ and have exactly $k$ irreducible factors over the finite field $\mathbb{F}_q$. We also compare our…

Number Theory · Mathematics 2022-09-12 Arghya Datta

Let $P: \F \times \F \to \F$ be a polynomial of bounded degree over a finite field $\F$ of large characteristic. In this paper we establish the following dichotomy: either $P$ is a moderate asymmetric expander in the sense that $|P(A,B)|…

Combinatorics · Mathematics 2013-01-04 Terence Tao

We prove superpolynomial length lower bounds for the semantic tree-like Frege refutation system with bounded line size. Concretely, for any function $n^{2-\varepsilon} \leq s(n) \leq 2^{n^{1-\varepsilon}}$ we exhibit an explicit family…

Computational Complexity · Computer Science 2026-05-01 Susanna F. de Rezende , David Engström , Yassine Ghannane , Kilian Risse

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…

Commutative Algebra · Mathematics 2009-08-22 Ivan V. Arzhantsev , Anatoliy P. Petravchuk

Let $l$ be a finite field of cardinality $q$ and let $n$ be in $\mathbb{Z}_{\geq 1}$. Let $f_1,\ldots,f_n \in l[x_1,\ldots,x_n]$ not all constant and consider the evaluation map $f=(f_1,\ldots,f_n) \colon l^n \to l^n$. Set…

Number Theory · Mathematics 2015-09-08 Michiel Kosters

Let $\mathbb{F}_p$ be the finite field of prime order $p$. For any function $f \colon \mathbb{F}_p{}^n \to \mathbb{F}_p$, there exists a unique polynomial over $\mathbb{F}_p$ having degree at most $p-1$ with respect to each variable which…

Combinatorics · Mathematics 2017-03-24 Shizuo Kaji , Toshiaki Maeno , Koji Nuida , Yasuhide Numata

We give the first non-trivial upper bounds on the average sensitivity and noise sensitivity of polynomial threshold functions. More specifically, for a Boolean function f on n variables equal to the sign of a real, multivariate polynomial…

Computational Complexity · Computer Science 2014-03-28 Prahladh Harsha , Adam Klivans , Raghu Meka

We study the number of irreducible polynomials over $\mathbf{F}_{q}$ with some coefficients prescribed. Using the technique developed by Bourgain, we show that there is an irreducible polynomial of degree $n$ with $r$ coefficients…

Number Theory · Mathematics 2016-01-27 Junsoo Ha

Let $f$ be a polynomial of degree $d>1$ in $n$ variables over $\mathbb{Z}$. Let $f_d$ be the homogeneous part of degree $d$ of $f$ and $s$ be the dimension of the critical locus of $f_d$. In this paper, we prove Igusa's conjecture for…

Number Theory · Mathematics 2021-11-24 Kien Huu Nguyen

The (weak) Nullstellensatz over finite fields says that if $P_1,\ldots,P_m$ are $n$-variate degree-$d$ polynomials with no common zero over a finite field $\mathbb{F}$ then there are polynomials $R_1,\ldots,R_m$ such that…

Combinatorics · Mathematics 2022-09-14 Guy Moshkovitz , Jeffery Yu

Dallard, Milani\v{c}, and \v{S}torgel conjectured that for a hereditary graph class $\mathcal{G}$, if there is some function $f:\mathbb{N}\to\mathbb{N}$ such that every graph $G\in \mathcal{G}$ with clique number $\omega(G)$ has treewidth…

Combinatorics · Mathematics 2025-10-27 Sepehr Hajebi

To each weakly holomorphic modular function $f\not \equiv 0$ for $\mathrm{SL}(2,\mathbb{Z})$, which is non-negative on the geodesic arc $\{e^{it} : \pi/3\leq t\leq 2\pi/3\}$, we attach a $\mathrm{GL}(2,\mathbb{Z})$-invariant map…

Number Theory · Mathematics 2025-03-21 Paloma Bengoechea , Sebastián Herrero , Özlem Imamoglu

Constructing $r$-th nonresidue over a finite field is a fundamental computational problem. A related problem is to construct an irreducible polynomial of degree $r^e$ (where $r$ is a prime) over a given finite field $\mathbb{F}_q$ of…

Computational Complexity · Computer Science 2017-02-03 Vishwas Bhargava , Gábor Ivanyos , Rajat Mittal , Nitin Saxena