中文
相关论文

相关论文: Polynomial expressions of $p$-ary auction function…

200 篇论文

For a large prime $p$, and a polynomial $f$ over a finite field $F_p$ of $p$ elements, we obtain a lower bound on the size of the multiplicative subgroup of $F_p^*$ containing $H\ge 1$ consecutive values $f(x)$, $x = u+1, \ldots, u+H$,…

数论 · 数学 2014-01-28 Igor E. Shparlinski

The number of linear independent algebraic relations among elementary symmetric polynomial functions over finite fields is computed. An algorithm able to find all such relations is described. It is proved that the basis of the ideal of…

符号计算 · 计算机科学 2023-09-26 Mihai Prunescu

A polynomial $p\in\mathbb{R}[x]$ is a divisor of some polynomial $0\neq f\in\mathbb{R}[x]$ with non-negative coefficients if and only if $p$ does not have a positive real root. The lowest possible degree of such $f$ for a given $p$ is known…

最优化与控制 · 数学 2012-10-26 Tomáš Kepka , Miroslav Korbelář

We consider almost-primes of the form $f(p)$ where $f$ is an irreducible polynomial over $\mathbb Z$ and $p$ runs over primes. We improve a result of Richert for polynomials of degree at least $3$. In particular we show that, when the…

数论 · 数学 2017-05-17 A. J. Irving

Polynomial representations of Boolean functions over various rings such as $\mathbb{Z}$ and $\mathbb{Z}_m$ have been studied since Minsky and Papert (1969). From then on, they have been employed in a large variety of fields including…

计算复杂性 · 计算机科学 2020-05-04 Xiaoming Sun , Yuan Sun , Jiaheng Wang , Kewen Wu , Zhiyu Xia , Yufan Zheng

We obtain a new lower bound on the size of value set f(F_p) of a sparse polynomial f in F_p[X] over a finite field of p elements when p is prime. This bound is uniform with respect of the degree and depends on some natural arithmetic…

数论 · 数学 2020-02-19 Igor E. Shparlinski , Jose Felipe Voloch

When implementing regular enough functions (e.g., elementary or special functions) on a computing system, we frequently use polynomial approximations. In most cases, the polynomial that best approximates (for a given distance and in a given…

数学软件 · 计算机科学 2007-05-23 Nicolas Brisebarre , Jean-Michel Muller

We investigate finite sets of rational functions $\{ f_{1},f_{2}, \dots, f_{r} \}$ defined over some number field $K$ satisfying that any $t_{0} \in K$ is a $K_{p}$-value of one of the functions $f_{i}$ for almost all primes $p$ of $K$. We…

数论 · 数学 2024-08-19 Benjamin Klahn , Joachim König

We consider the problem of defining polynomials over function fields of positive characteristic. Among other results, we show that the following assertions are true. 1. Let $\G_p$ be an algebraic extension of a field of $p$ elements and…

数论 · 数学 2015-02-11 Alexandra Shlapentokh

A degree-$d$ polynomial $p$ in $n$ variables over a field $\F$ is {\em equidistributed} if it takes on each of its $|\F|$ values close to equally often, and {\em biased} otherwise. We say that $p$ has a {\em low rank} if it can be expressed…

组合数学 · 数学 2008-07-02 Tali Kaufman , Shachar Lovett

We establish asymptotic upper bounds on the number of zeros modulo $p$ of certain polynomials with integer coefficients, with $p$ prime numbers arbitrarily large. The polynomials we consider have degree of size $p$ and are obtained by…

数论 · 数学 2022-01-19 Amit Ghosh , Kenneth Ward

Let A and B be arbitrary sets with at least two elements. The arity gap of a function f: A^n \to B is the minimum decrease in its essential arity when essential arguments of f are identified. In this paper we study the arity gap of…

环与代数 · 数学 2016-11-22 Miguel Couceiro , Erkko Lehtonen

Let $p$ be a fixed prime, and let $v(a)$ stand for the exponent of $p$ in the prime factorization of the integer $a$. Let $f$ and $g$ be two monic polynomials with integer coefficients and nonzero resultant $r$. Write $S$ for the maximum of…

数论 · 数学 2018-06-12 Péter E. Frenkel , Gergely Zábrádi

We give a first-order definition of key polynomials, we show the links with previous definitions, that it is relevant to study key degrees, and to use a kind of valuations that we call partially multiplicative. We also prove or reprove…

交换代数 · 数学 2022-05-19 Gérard Leloup

We study the preorder $\le_p$ on the family of subsets of an algebraically closed field of characteristic $0$ defined by letting $A\le_pB $ if there exists a polynomial $P$ such that $A=P^{-1}(B)$.

交换代数 · 数学 2023-01-31 Riccardo Camerlo , Carla Massaza

In this paper we introduce elementary and completely explicit formulas for the derivative of any order of any function of the type 1/p, where p is a polynomial with known zeros.

经典分析与常微分方程 · 数学 2020-02-04 Shahar Nevo , Irina Raichik

It is known that any $n$-variable function on a finite prime field of characteristic $p$ can be expressed as a polynomial over the same field with at most $p^n$ monomials. However, it is not obvious to determine the polynomial for a given…

组合数学 · 数学 2016-02-22 Shizuo Kaji , Toshiaki Maeno , Koji Nuida , Yasuhide Numata

Given a polynomial $f$ with coefficients in a field of prime characteristic $p$, it is known that there exists a differential operator that raises $1/f$ to its $p$th power. We first discuss a relation between the `level' of this…

交换代数 · 数学 2022-10-18 Alberto F. Boix , Marc Paul Noordman , Jaap Top

We study the class of polynomials that map a local field (i.e., the completion of a number field at a non-Archimedean place) into the subset of its $p$-th powers, where $p$ is the residue characteristic of the field in question. We present…

数论 · 数学 2025-11-12 Przemysław Koprowski

A polynomial of the form $x^\alpha - p(x)$, where the degree of $p$ is less than the total degree of $x^\alpha$, is said to be least deviation from zero if it has the smallest uniform norm among all such polynomials. We study polynomials of…

经典分析与常微分方程 · 数学 2007-05-23 Yuan Xu
‹ 上一页 1 2 3 10 下一页 ›