中文
相关论文

相关论文: Quadratic Packing Polynomials on Sectors of $\math…

200 篇论文

We present two different proofs that positive polynomials on closed boxes of $\mathbb{R}^2$ can be written as bivariate Bernstein polynomials with strictly positive coefficients. Both strategies can be extended to prove the analogous result…

经典分析与常微分方程 · 数学 2020-06-16 Marcio Alves Diniz , Luis Ernesto Salasar , Rafael Bassi Stern

We present an efficient solution to the following problem, of relevance in a numerical optimization scheme: calculation of integrals of the type \[\iint_{T \cap \{f\ge0\}} \phi_1\phi_2 \, dx\,dy\] for quadratic polynomials $f,\phi_1,\phi_2$…

符号计算 · 计算机科学 2010-05-07 David Sevilla , Daniel Wachsmuth

Already for bivariate tropical polynomials, factorization is an NP-Complete problem. In this paper, we give an efficient algorithm for factorization and rational factorization of a rich class of tropical polynomials in $n$ variables.…

组合数学 · 数学 2019-12-10 Bo Lin , Ngoc Mai Tran

For a set $S$ of quadratic polynomials over a finite field, let $C$ be the (infinite) set of arbitrary compositions of elements in $S$. In this paper we show that there are examples with arbitrarily large $S$ such that every polynomial in…

数论 · 数学 2017-01-30 D. R. Heath-Brown , Giacomo Micheli

The paper defines polynomials in a bicategory $\mathscr{M}$. Polynomials in bicategories $\mathrm{Spn}\mathscr{C} \ $ of spans in a finitely complete category $\mathscr{C} \ $ agree with polynomials in $\mathscr{C} \ $ as defined by Nicola…

范畴论 · 数学 2020-02-18 Ross Street

Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulations (whose edges can be partitioned into two trees). Our…

组合数学 · 数学 2020-07-21 Stefan Felsner , Clemens Huemer , Sarah Kappes , David Orden

We study solutions of a homogeneous quadratic equation $q(x_0,\dots, x_n)=0$, defined over a field $K$, where the $x_i$ are themselves homogeneous polynomials of some degree $d$ in $r+1$ variables. Equivalently, we are looking at rational…

代数几何 · 数学 2016-07-06 János Kollár

We consider a natural variation of the concept of stabbing a segment by a simple polygon: a segment is stabbed by a simple polygon $\mathcal{P}$ if at least one of its two endpoints is contained in $\mathcal{P}$. A segment set $S$ is…

In different areas of discrete mathematics, a certain type of polynomials, having coefficients in a field K of finite characteristic, has been considered. The form and the degree of these polynomials, here called projective, are simply…

数论 · 数学 2019-10-08 Alain Lasjaunias

We show that the following variant of labeling rotating maps is NP-hard, and present a polynomial approximation scheme for solving it. The input is a set of feature points on a map, to each of which a vertical bar of zero width is assigned.…

计算几何 · 计算机科学 2019-07-31 Ali Gholami Rudi

We consider polynomials of bi-degree $(n,1)$ over the skew field of quaternions where the indeterminates commute with each other and with all coefficients. Polynomials of this type do not generally admit factorizations. We recall a…

Any homogeneous polynomial $P(x, y, z)$ of degree $d$, being restricted to a unit sphere $S^2$, admits essentially a unique representation of the form $\lambda_0 + \sum_{k = 1}^d \lambda_k [\prod_{j = 1}^k L_{kj}]$, where $L_{kj}$'s are…

复变函数 · 数学 2007-05-23 Gabriel Katz

We present a few factorizations of polynomials over finite fields. These factorizations are related to traces, compositions of polynomials and binomial coefficients. As a corollary we obtain a description of all irreducible polynomials…

数论 · 数学 2007-05-23 Roland Bacher

A class P_{n,m,p}(x) of polynomials is defined. The combinatorial meaning of its coefficients is given. Chebyshev polynomials are the special cases of P_{n,m,p}(x). It is first shown that P_{n,m,p}(x) may be expressed in terms of…

复变函数 · 数学 2008-04-15 Milan Janjic

We complete the complexity classification by degree of minimizing a polynomial over the integer points in a polyhedron in $\mathbb{R}^2$. Previous work shows that optimizing a quadratic polynomial over the integer points in a polyhedral…

最优化与控制 · 数学 2015-05-07 Alberto Del Pia , Robert Hildebrand , Robert Weismantel , Kevin Zemmer

We treat the following "polynomial moment problem": for a complex polynomial P(z) and distinct complex numbers a,b such that P(a)=P(b) to describe polynomials q(z)=Q'(z) orthogonal to all degrees of P(z) on the segment [a,b]. We show that…

复变函数 · 数学 2007-05-23 F. Pakovich

We study orthogonal polynomials for a weight function defined over a domain of revolution, where the domain is formed from rotating a two-dimensional region and goes beyond the quadratic domains. Explicit constructions of orthogonal bases…

经典分析与常微分方程 · 数学 2023-11-28 Yuan Xu

We prove a quantitative Roth-type theorem for polynomial corners in $\mathbb{R}^2$. Let $P_1$ and $P_2$ be two linearly independent polynomials with zero constant term. We show that any measurable subset of $[0,1]^2$ with positive measure…

经典分析与常微分方程 · 数学 2023-07-04 Xuezhi Chen , Jingwei Guo

We consider cubic polynomials f(z)=z^3+az+b defined over the function field C(L), with a marked point of period N and multiplier L. In the case N=1, there are infinitely many such objects, and in the case N>2, only finitely many. The case…

动力系统 · 数学 2019-08-15 Patrick Ingram

Let $S=\{x^2+c_1, x^2+c_2,\dots, x^2+c_s\}$ be a set of quadratic polynomials with rational coefficients, and let $P$ be a rational basepoint. We classify the pairs $(S,P)$ for which $P$ has finite orbit for $S$, assuming that the maximum…

数论 · 数学 2018-10-12 Wade Hindes