Results 241 to 250 of about 33,836 (264)

On multivariate minimal polynomials

Mathematical Proceedings of the Cambridge Philosophical Society, 2000
Let \(E\) be a compact subset of \({\mathbb C}^n\) and let \(\alpha \in {\mathbb Z}^n_+\) be a multiindex of length \(d:=|\alpha|\). Consider the classes of polynomials \(\mathbb P (\alpha):= \{p; p(z) = z^{\alpha}+\sum_{|\beta \leq d-1}c_{\beta}z^{\beta}\}\) and \(\mathcal P(\alpha):= \{p; p(z):= z^{\alpha}+\sum_{\beta \prec \alpha} c_{\beta}z^{\beta}\
Bloom, Thomas, Calvi, Jean-Paul
openaire   +2 more sources

FACTORING VARIANTS OF CHEBYSHEV POLYNOMIALS WITH MINIMAL POLYNOMIALS OF

Bulletin of the Australian Mathematical Society, 2022
AbstractWe solve the problem of factoring polynomials $V_n(x) \pm 1$ and $W_n(x) \pm 1$ , where $V_n(x)$ and $W_n(x)$ are Chebyshev polynomials of the third and fourth kinds, in terms of the minimal polynomials of $\cos ({2\pi }{/d})$ . The method of proof is based on earlier work, D. A. Wolfram, [‘Factoring variants of Chebyshev polynomials of
openaire   +1 more source

Minimal Positive Polynomials

IEEE Transactions on Microwave Theory and Techniques, 1960
A proof is given of a purely mathematical theorem on the polynomial of lowest degree with positive coefficients having a prescribed root of unity as a multiple root. H. J. Riblet has conjectured the theorem below. In the preceding paper, he applies his theorem to optimum impedance transformer design.
openaire   +1 more source

Minimal degree solutions of polynomial equations

Kybernetika, 1987
Consider the general Bézout equation of the form \(A_ 1X_ 1+...+A_ rX_ r=C\) where C and the \(A_ i\) are from a polynomial ring R, and we are looking for a solution for the unknowns \(X_ i\) in the same ring. The case where R is the ring of polynomials in two variables over the real or complex field and \(C=1\) arises in multidimensional systems and ...
GENTILI, GRAZIANO, D. STRUPPA
openaire   +3 more sources

The Generic Minimal Polynomial

2000
Let A be a Jordan algebra over \( \mathbb{C} \). We assume that A is finite dimensional (as a vector space) and that A has a unit element e. For x ∈ A and each polynomial \( p \in \mathbb{C}[T] \), $$ p = {a_0} + {a_1}T +...+ {a_n}{T^m} $$ we denote by p(x) the element of A defined by $$ p(x) = {a_0}e + {a_1}x +...{a_m}{x^m} $$ (4.1 ...
openaire   +1 more source

The minimal polynomial over Fq of linear recurring sequence over Fqm

Finite Fields and Their Applications, 2009
Fang-Wei Fu
exaly  

Polynomial Eigenvalue Solutions to Minimal Problems in Computer Vision

IEEE Transactions on Pattern Analysis and Machine Intelligence, 2012
Tomáš Pajdla, Zuzana Kukelova
exaly  

Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference

Theoretical Computer Science, 2002
Stefan Szeider, Oliver Kullmann
exaly  

A Lower Bound for the Norm of the Minimal Residual Polynomial

Constructive Approximation, 2010
Klaus Schiefermayr
exaly  

Explicit form of parametric polynomial minimal surfaces with arbitrary degree

Applied Mathematics and Computation, 2015
Gang Xu, Guozhao Wang, André Galligo
exaly