中文
相关论文

相关论文: Topology and Factorization of Polynomials

200 篇论文

Many high-dimensional uncertainty quantification problems are solved by polynomial dimensional decomposition (PDD), which represents Fourier-like series expansion in terms of random orthonormal polynomials with increasing dimensions. This…

数值分析 · 数学 2018-04-06 Sharif Rahman

Let $K[x]$ be a polynomial algebra in a variable $x$ over a commutative $\Q$-algebra $K$, and $\G'$ be the monoid of $K$-algebra monomorphisms of $K[x]$ of the type $\s : x\mapsto x+\l_2x^2+... +\l_nx^n$, $\l_i\in K$, $\l_n$ is a unit of…

环与代数 · 数学 2007-05-23 V. V. Bavula

In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials of a given degree and exhibit explicit decompositions into…

符号计算 · 计算机科学 2008-10-29 Laurent Busé , Bernard Mourrain

We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…

交换代数 · 数学 2012-10-09 Joost Berson

A large family of linear, usually overdetermined, systems of partial differential equations that admit a multiplication of solutions, i.e, a bi-linear and commutative mapping on the solution space, is studied. This family of PDE's contains…

偏微分方程分析 · 数学 2008-03-19 Jens Jonasson

In this paper, we consider the existence of a factorization of a monic, bounded motion polynomial. We prove existence of factorizations, possibly after multiplication with a real polynomial and provide algorithms for computing polynomial…

符号计算 · 计算机科学 2015-02-27 Zijia Li , Josef Schicho , Hans-Peter Schröcker

Factorization algebras have been defined using three different topologies on the Ran space. We study these three different topologies on the exponential, which is the union of the Ran space and the empty configuration, and show that an…

代数拓扑 · 数学 2021-07-26 Anna Cepek , Damien Lejay

In this paper we present an equivalent statement to the Jacobian conjecture. For a polynomial map F on an affine space of dimension n, we define recursively n finite sequences of polynomials. We give an equivalent condition to the…

交换代数 · 数学 2016-01-05 Elzbieta Adamus , Pawel Bogdan , Teresa Crespo , Zbigniew Hajto

Let P be a commutative Noetherian ring, K be an ideal of P which is generated by a regular sequence of length four, f be a regular element of P, and Pbar be the hypersurface ring P/(f). Assume that K:f is a grade four Gorenstein ideal of P.…

交换代数 · 数学 2019-05-29 Andrew R. Kustin

We give a lower bound for the degree of an irreducible factor of a given polynomial. This improves and generalizes the results obtained in [4, On the irreducible factors of a polynomial, Proc. Amer. Math. Soc., 148 (2020] 1429 -- 1437].

数论 · 数学 2020-08-03 Anuj Jakhar , Srinivas Koytada

A classification is provided of functors, in particular polynomial ones, from a category with a zero object in which every object is a finite sum of copies of a generating object, into an abelian category. This classification is extended to…

范畴论 · 数学 2015-05-13 Qimh Richey Xantcha

We provide a unified, elementary, topological approach to the classical results stating the continuity of the complex roots of a polynomial with respect to its coefficients, and the continuity of the coefficients with respect to the roots.…

综合数学 · 数学 2012-06-11 Branko Ćurgus , Vania Mascioni

We consider Tuenter polynomials as linear combinations of descending factorials and show that coefficients of these linear combinations are expressed via a Catalan triangle of numbers. We also describe a triangle of coefficients in terms of…

组合数学 · 数学 2016-06-15 Andrei K. Svinin

Expanding on the comprehensive factorization of functors internal to a category C, under fairly mild conditions on a monad T on C we establish that this orthogonal factorization system exists even in Burroni's category Cat(T) of (internal)…

范畴论 · 数学 2020-12-16 Walter Tholen , Leila Yeganeh

We give an infinite family of polynomials that have roots modulo every positive integer but fail to have rational roots. Each polynomial in this family is made up of monic quadratic factors that do not have linear term.

数论 · 数学 2022-07-19 Bhawesh Mishra

In this paper we present an unexpected link between the Factorial Conjecture and Furter's Rigidity Conjecture. The Factorial Conjecture in dimension $m$ asserts that if a polynomial $f$ in $m$ variables $X_i$ over $\C$ is such that ${\cal…

代数几何 · 数学 2013-05-28 Eric Edo , Arno van den Essen

We study the stratification of the space of monic polynomials with real coefficients according to the number and multiplicities of real zeros. In the first part, for each of these strata we provide a purely combinatorial chain complex…

组合数学 · 数学 2016-09-06 Volkmar Welker , Boris Shapiro

A symmetric positive semi-definite matrix A is called completely positive if there exists a matrix B with nonnegative entries such that A=BB^T. If B is such a matrix with a minimal number p of columns, then p is called the cp-rank of A. In…

环与代数 · 数学 2016-04-22 Jan Brandts , Michal Krizek

In the paper, we introduce a matrix method to constructively determine spaces of polynomial solutions (in general, multiplied by exponentials) to a system of constant coefficient linear PDE's with polynomial (multiplied by exponentials)…

经典分析与常微分方程 · 数学 2021-11-16 Victor G. Zakharov

Let a planar algebraic curve $C$ be defined over a valuation field by an equation $F(x,y)=0$. Valuations of the coefficients of $F$ define a subdivision of the Newton polygon $\Delta$ of the curve $C$. If a given point $p$ is of…

代数几何 · 数学 2018-07-11 Nikita Kalinin