930 resultados para orthogonal Gram polynomials
Resumo:
This work was partially supported by the Bulgarian National Science Fund under Contract No MM 1405. Part of the results were announced at the Fifth International Workshop on Optimal Codes and Related Topics (OCRT), White Lagoon, June 2007, Bulgaria
Resumo:
We investigate infinite families of integral quadratic polynomials {fk (X)} k∈N and show that, for a fixed k ∈ N and arbitrary X ∈ N, the period length of the simple continued fraction expansion of √fk (X) is constant. Furthermore, we show that the period lengths of √fk (X) go to infinity with k. For each member of the families involved, we show how to determine, in an easy fashion, the fundamental unit of the underlying quadratic field. We also demonstrate how the simple continued fraction ex- pansion of √fk (X) is related to that of √C, where √fk (X) = ak*X^2 +bk*X + C. This continues work in [1]–[4].
Resumo:
∗ Research partially supported by INTAS grant 97-1644
Resumo:
In this paper we survey work on and around the following conjecture, which was first stated about 45 years ago: If all the zeros of an algebraic polynomial p (of degree n ≥ 2) lie in a disk with radius r, then, for each zero z1 of p, the disk with center z1 and radius r contains at least one zero of the derivative p′ . Until now, this conjecture has been proved for n ≤ 8 only. We also put the conjecture in a more general framework involving higher order derivatives and sets defined by the zeros of the polynomials.
Resumo:
* The author was supported by NSF Grant No. DMS 9706883.
Resumo:
In the paper new non-conventional growing neural network is proposed. It coincides with the Cascade- Correlation Learning Architecture structurally, but uses ortho-neurons as basic structure units, which can be adjusted using linear tuning procedures. As compared with conventional approximating neural networks proposed approach allows significantly to reduce time required for weight coefficients adjustment and the training dataset size.
Resumo:
DNA-binding proteins are crucial for various cellular processes and hence have become an important target for both basic research and drug development. With the avalanche of protein sequences generated in the postgenomic age, it is highly desired to establish an automated method for rapidly and accurately identifying DNA-binding proteins based on their sequence information alone. Owing to the fact that all biological species have developed beginning from a very limited number of ancestral species, it is important to take into account the evolutionary information in developing such a high-throughput tool. In view of this, a new predictor was proposed by incorporating the evolutionary information into the general form of pseudo amino acid composition via the top-n-gram approach. It was observed by comparing the new predictor with the existing methods via both jackknife test and independent data-set test that the new predictor outperformed its counterparts. It is anticipated that the new predictor may become a useful vehicle for identifying DNA-binding proteins. It has not escaped our notice that the novel approach to extract evolutionary information into the formulation of statistical samples can be used to identify many other protein attributes as well.
Resumo:
Mathematics Subject Classification: 33C45.
Resumo:
2000 Mathematics Subject Classification: 26A33, 33C45
Resumo:
Let p(z) be an algebraic polynomial of degree n ¸ 2 with real coefficients and p(i) = p(¡i). According to Grace-Heawood Theorem, at least one zero of the derivative p0(z) is on the disk with center in the origin and radius cot(¼=n). In this paper is found the smallest domain containing at leas one zero of the derivative p0(z).
Resumo:
AMS Subject Classification 2010: 11M26, 33C45, 42A38.
Resumo:
2000 Mathematics Subject Classification: 12D10
Resumo:
2000 Mathematics Subject Classification: 12D10.
Resumo:
2000 Mathematics Subject Classification: 11T06, 13P10.
Resumo:
Георги С. Бойчев - В статията се разглежда метод за сумиране на редове, дефиниран чрез полиномите на Ермит. За този метод на сумиране са дадени някои Тауберови теореми.