Search results for "Polynomial"
showing 10 items of 566 documents
On complete set of solutions for polynomial matrix equations
1990
Abstract In this paper we introduce the concept of co-solution of a polynomial matrix equation which permits us to obtain necessary and sufficient conditions so that a set of solutions be a complete set.
An elementary proof of Hilbertʼs theorem on ternary quartics
2012
Abstract In 1888, Hilbert proved that every nonnegative quartic form f = f ( x , y , z ) with real coefficients is a sum of three squares of quadratic forms. His proof was ahead of its time and used advanced methods from topology and algebraic geometry. Up to now, no elementary proof is known. Here we present a completely new approach. Although our proof is not easy, it uses only elementary techniques. As a by-product, it gives information on the number of representations f = p 1 2 + p 2 2 + p 3 2 of f up to orthogonal equivalence. We show that this number is 8 for generically chosen f, and that it is 4 when f is chosen generically with a real zero. Although these facts were known, there wa…
Computational Aspects in Spaces of Bivariate Polynomial of w-Degree n
2005
Multivariate ideal interpolation schemes are deeply connected with H-bases. Both the definition of a H-basis and of an ideal interpolation space depend of the notion of degree used in the grading decomposition of the polynomial spaces. We studied, in the case of bivariate polynomials, a generalized degree, introduced by T. Sauer and named w-degree. This article give some theoretical results that allow us to construct algorithms for calculus of the dimension of the homogeneous spaces of bivariate polynomials of w – degree n. We implemented these algorithms in C++ language. The analysis of the results obtained, leads us to another theoretical conjecture which we proved in the end.
An approximate Rolle's theorem for polynomials of degree four in a Hilbert space
2005
We show that the fourth degree polynomials that satisfy Rolle’s Theorem in the unit ball of a real Hilbert space are dense in the space of polynomials that vanish in the unit sphere. As a consequence, we obtain a sort of approximate Rolle’s Theorem for those polynomials.
Symmetric identities in graded algebras
1997
Let P k be the symmetric polynomial of degree k i.e., the full linearization of the polynomial x k . Let G be a cancellation semigroup with 1 and R a G-graded ring with finite support of order n. We prove that if R 1 satisfies $ P_k \equiv 0 $ then R satisfies $ P_{kn} \equiv 0 $ .
Subvarieties of the Varieties Generated by the SuperalgebraM1, 1(E) orM2(𝒦)
2003
Abstract Let 𝒦 be a field of characteristic zero, and let us consider the matrix algebra M 2(𝒦) endowed with the ℤ2-grading (𝒦e 11 ⊕ 𝒦e 22) ⊕ (𝒦e 12 ⊕ 𝒦e 21). We define two superalgebras, ℛ p and 𝒮 q , where p and q are positive integers. We show that if 𝒰 is a proper subvariety of the variety generated by the superalgebra M 2(𝒦), then the even-proper part of the T 2-ideal of graded polynomial identities of 𝒰 asymptotically coincides with the even-proper part of the graded polynomial identities of the variety generated by the superalgebra ℛ p ⊕ 𝒮 q . This description also affords an even-asymptotic desc…
Graphes connexes représentation des entiers et équirépartition
1983
Abstract Let q be an integer ≥2 and Ω a suitable subset of {0,…,q − 1}2; C (q; Ω) denotes the set of natural integers, the pairs of successive q-adic digits of which are in Ω. If P is an irrational polynomial, the sequence (P(n): n ∈ C (q; Ω)) is uniformly distributed modulo one.
Codimension growth of two-dimensional non-associative algebras
2007
Let F be a field of characteristic zero and let A be a two-dimensional non-associative algebra over F. We prove that the sequence c n (A), n =1,2,..., of codimensions of A is either bounded by n + 1 or grows exponentially as 2 n . We also construct a family of two-dimensional algebras indexed by rational numbers with distinct T-ideals of polynomial identities and whose codimension sequence is n + 1, n > 2.
Incremental termination proofs and the length of derivations
1991
Incremental termination proofs, a concept similar to termination proofs by quasi-commuting orderings, are investigated. In particular, we show how an incremental termination proof for a term rewriting system T can be used to derive upper bounds on the length of derivations in T. A number of examples show that our results can be applied to yield (sharp) low-degree polynomial complexity bounds.
Weighted Extrapolation Techniques for Finite Difference Methods on Complex Domains with Cartesian Meshes
2016
The design of numerical boundary conditions in high order schemes is a challenging problem that has been tackled in different ways depending on the nature of the problem and the scheme used to solve it numerically. In this paper we propose a technique to extrapolate the information from the computational domain to ghost cells for schemes with structured Cartesian Meshes on complex domains. This technique is based on the application of Lagrange interpolation with weighted filters for the detection of discontinuities that permits a data dependent extrapolation, with high order at smooth regions and essentially non oscillatory properties near discontinuities. This paper is a sequel of Baeza et…