中文
相关论文

相关论文: Closed polynomials and their applications for comp…

200 篇论文

For any finite field $\mathbb{F}$ and any positive integer $n$ we count the number of monic polynomials of degree $n$ over $\mathbb{F}$ with nonzero constant coefficient and a self-reciprocal factor of any specified degree. An application…

数论 · 数学 2022-10-31 Geoffrey Price , Katherine Thompson

We study connections between orthogonal polynomials, reproducing kernel functions, and polynomials $p$ minimizing Dirichlet-type norms $\|pf-1\|_{\alpha}$ for a given function $f$. For $\alpha\in [0,1]$ (which includes the Hardy and…

Let D be a domain with quotient field K and A a D-algebra. We call a polynomial with coefficients in K that maps every element of A to an element of A "integer-valued on A". For commutative A we also consider integer-valued polynomials in…

环与代数 · 数学 2013-06-11 Sophie Frisch

The paper studies the question of existence of polynomials with given roots over associative non-commutative rings with identity. It is shown that in the case of an associative division ring for arbitrary n elements of this ring there…

环与代数 · 数学 2025-01-07 Alina G. Goutor

We give an algorithm for factoring quadratic polynomials over any UFD, Z in particular. We prove the correctness of this algorithm and give examples over Z and Z[i].

环与代数 · 数学 2009-12-08 Corey Thomas Bruns

Interpolation and approximation of functionals with conditionally positive definite kernels is considered on sets of centers that are not determining for polynomials. It is shown that polynomial consistency is sufficient in order to define…

数值分析 · 数学 2025-08-26 Oleg Davydov

Let $K$ be a field of characteristic zero. We deal with the algebraic closure of the field of fractions of the ring of formal power series $K[[x_1,\ldots,x_r]]$, $r\geq 2$. More precisely, we view the latter as a subfield of an iterated…

交换代数 · 数学 2023-07-11 Michel Hickel , Mickaël Matusinski

We study the structure of the Fourier coefficients of low degree multivariate polynomials over finite fields. We consider three properties: (i) the number of nonzero Fourier coefficients; (ii) the sum of the absolute value of the Fourier…

组合数学 · 数学 2016-03-15 Shachar Lovett

We introduce a concept of a fractional-derivatives series and prove that any linear partial differential equation in two independent variables has a fractional-derivatives series solution with coefficients from a differentially closed field…

偏微分方程分析 · 数学 2008-11-11 D. Grigoriev

Let $D$ be a domain with fraction field $K$, and let $M_n(D)$ be the ring of $n \times n$ matrices with entries in $D$. The ring of integer-valued polynomials on the matrix ring $M_n(D)$, denoted ${\rm Int}_K(M_n(D))$, consists of those…

环与代数 · 数学 2018-09-26 Giulio Peruginelli , Nicholas J. Werner

Let $k[X]{:=} k[x_0,x_1,..., x_n]$ be a polynomial algebra over a field $k$ of characteristic zero. We offer an algorithm for calculation of kernel of Weitzenb\"ok derivation ${d(x_i)=x_{i-1}}, ...,$ ${d(x_0)=0}$, ${i=1... n}$ that is based…

代数几何 · 数学 2010-05-02 L. Bedratyuk

In a sequence of seminal results in the 80's, Kaltofen showed that the complexity class VP is closed under taking factors. A natural question in this context is to understand if other natural classes of multivariate polynomials, for…

计算复杂性 · 计算机科学 2018-03-19 Chi-Ning Chou , Mrinal Kumar , Noam Solomon

In this paper, we address the general fractional integrals and derivatives with the Sonine kernels on the spaces of functions with an integrable singularity at the point zero. First, the Sonine kernels and their important special classes…

经典分析与常微分方程 · 数学 2021-03-12 Yuri Luchko

In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…

数论 · 数学 2024-01-17 Jitender Singh , Rishu Garg

In this paper we study the complexity of factorization of polynomials in the free noncommutative ring $\mathbb{F}\langle x_1,x_2,\dots,x_n\rangle$ of polynomials over the field $\mathbb{F}$ and noncommuting variables $x_1,x_2,\ldots,x_n$.…

计算复杂性 · 计算机科学 2015-01-06 V. Arvind , Pushkar S Joglekar , Gaurav Rattan

We study the existence of polynomial kernels for the problem of deciding feasibility of integer linear programs (ILPs), and for finding good solutions for covering and packing ILPs. Our main results are as follows: First, we show that the…

计算复杂性 · 计算机科学 2013-02-18 Stefan Kratsch

A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…

数论 · 数学 2017-11-16 Jonathan Hickman , James Wright

This paper studies polynomials with core entropy zero. We give several characterizations of polynomials with core entropy zero. In particular, we show that a degree d post-critically finite polynomial f has core entropy zero if and only if…

动力系统 · 数学 2025-09-30 Yusheng Luo , Insung Park

Let $d\nu$ be a measure in $\mathbb{R}^d$ obtained from adding a set of mass points to another measure $d\mu$. Orthogonal polynomials in several variables associated with $d\nu$ can be explicitly expressed in terms of orthogonal polynomials…

经典分析与常微分方程 · 数学 2009-11-17 A. M. Delgado , L. Fernandez , T. E. Perez , M. A. Pinar , Y. Xu

Polynomials whose coefficients, roots, and critical points lie in the ring of rational integers are called nice polynomials. In this paper, we present a general method for investigating such polynomials. We extend our results from the ring…

数论 · 数学 2007-05-23 Jean-Claude Evard