نتایج جستجو برای: homogeneous polynomial
تعداد نتایج: 165622 فیلتر نتایج به سال:
Throughout k stands for a field. For simplicity, we assume that k is algebraically closed and has characteristic 0. However, many of the open problems and conjectures make sense without these assumptions. The polynomial ring S = k[x1, . . . , xn] is graded by deg(xi) = 1 for all i. A polynomial f is homogeneous if f ∈ Si for some i, that is, if all monomial terms of f have the same degree. An i...
a polynomial 1 2 ( , , , ) n f x x x is called multilinear if it is homogeneous and linear in every one of its variables. in the present paper our objective is to prove the following result: let r be a prime k-algebra over a commutative ring k with unity and let 1 2 ( , , , ) n f x x x be a multilinear polynomial over k. suppose that d is a nonzero derivation on r such that ...
1. The main results There is a gradient map associated to any reduced homogeneous polynomial h ∈
Problem statement: A homotopy method has proven to be reliable for computing all of the isolated solutions of a multivariate polynomial system. The multi-homogeneous Bézout number of a polynomial system is the number of paths that one has to trace in order to compute all of its isolated solutions. Each partition of the variables corresponds to a multi-homogeneous Bézout number. It is a crucial ...
Throughout k stands for a field. For simplicity, we assume that k is algebraically closed and has characteristic 0. However, many of the open problems and conjectures make sense without these assumptions. The polynomial ring S = k[x1, . . . , xn] is graded by deg(xi) = 1 for all i. A polynomial f is homogeneous if f ∈ Si for some i, that is, if all monomial terms of f have the same degree. An i...
We consider polynomial eigenvalue problems P(A; ;)x = 0 in which the matrix polynomial is homogeneous in the eigenvalue (;) 2 C 2. In this framework innnite eigenvalues are on the same footing as nite eigenvalues. We view the problem in projective spaces to avoid normalization of the eigenpairs. We show that a polynomial eigenvalue problem is well-posed when its eigenvalues are simple. We deene...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید