voidPolynomial::operator+=(constPolynomial & p) {//GBStream << *this << "+=" << p << '\n';if(!p.zero()) {if(zero()) {operator=(p); }else{ Polynomial temp(*this); setToZero();constintsz1 = temp.numberOfTerms();constintsz2 = p.numberOfTerms(); PolynomialIterator w1 ...
Then we propose an upper bound of the number of terms in the generation polynomial of a decimation sequence of a linear sequence whose generation polynomial is trinomial. Finally, we suggest a method to calculate the terms of a decimation polynomial and their number directly, which can be used...
On the number of terms of the square of a polynomial. 来自 AMS 喜欢 0 阅读量: 80 作者: Erdös, P 摘要: Patients operated on for gastric carcinoma in the years 1949-1963 were compared with those treated in 1975-1982. 关键词: Stomach Neoplasms DOI: 10.1136/bmj.2.5156.857 被引量...
Harmonic Analysis of polynomial threshold functions Summary: The analysis of linear threshold Boolean functions has recently attracted the attention of those interested in circuit complexity as well as of th... Bruck,Jehoshua - 《Siam Journal on Discrete Mathematics》 被引量: 429发表: 1990年 Betti ...
Finally, we give a closed form expression for the expected number of maxima (resp. minima) of a random univariate polynomial, in terms of hypergeometric functions. 展开 关键词: Random polynomials Number of minima Number of maxima Critical points ...
Our approach to this study is based on the analytical expressions of eigenvalues under some simple but practical cases. In deriving theoretical results, we use a representation of a polynomial in terms of a remainder sequence. This technique is useful for finding the sign of polynomials under ...
This article is mainly devoted to solving the case in an interval, but some global results are reviewed for understanding. It is shown, with examples, how useful the CDS can be in order to understand the behaviour of the roots of an univariate polynomial in terms of the coefficients. 展开 ...
We obtain necessary and sufficient conditions for Monte Carlo being polynomial in terms of the weights of the spaces. The conditions for Monte Carlo to be (strongly) polynomial are more lenient for periodic Sobolev spaces than for non-periodic Sobolev spaces; in either case, these conditions are...
2.1.251 Part 1 Section 17.7.6.5, tblStyleColBandSize (Number of Columns in Column Band) Article 02/21/2024 1 contributor Feedback For additional notes that apply to this portion of the standard, please see the notes for tblPr, §17.4.58(a); tblPr, §17.4.59(a); tblPr, §17.7....
permutation polynomialpermanentIn order to extend the results of in , where is a prime, to arbitrary finite fields , we find a formula for the number of permutation polynomials of degree over a finite field , which has elements, in terms of the permanent of a matrix. We write down an ...