Results 131 to 140 of about 293,918 (162)
openaire
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Journal of the London Mathematical Society, 2012
We establish various inequalities relating the coefficients of a polynomial with the separation of its roots. Applications are given to oscillatory integrals and sublevel sets in euclidean harmonic analysis as well as exponential sums and polynomial congruences in number theory.
Michael W. Kowalski, James Wright
openaire +1 more source
We establish various inequalities relating the coefficients of a polynomial with the separation of its roots. Applications are given to oscillatory integrals and sublevel sets in euclidean harmonic analysis as well as exponential sums and polynomial congruences in number theory.
Michael W. Kowalski, James Wright
openaire +1 more source
Journal of Composite Materials, 2003
It is shown that the number of required parameters for the Tsai-Wu tensor polynomial strength criterion for fiber composites can be reduced from seven to five for composite materials that do not fail under practical levels of either hydrostatic or transverse pressure.
Steven J. DeTeresa, Gregory J. Larsen
openaire +1 more source
It is shown that the number of required parameters for the Tsai-Wu tensor polynomial strength criterion for fiber composites can be reduced from seven to five for composite materials that do not fail under practical levels of either hydrostatic or transverse pressure.
Steven J. DeTeresa, Gregory J. Larsen
openaire +1 more source
Difference equations in combinatorics, number theory, and orthogonal polynomials
Journal of Difference Equations and Applications, 1999In this paper we give an overview of some recent developments in the asymptotics of difference equations. Applications to combinatorics and orthogonal polynomials are briefly indicated.
openaire +1 more source
Auxiliary Polynomials in Number Theory
2016This unified account of various aspects of a powerful classical method, easy to understand in its simplest forms, is illustrated by applications in several areas of number theory. As well as including diophantine approximation and transcendence, which were mainly responsible for its invention, the author places the method in a broader context by ...
openaire +1 more source
Refutations of Major Open Problems in Number Theoryand ComplexityA Symbolic-Polynomial Approach Using I ...
openaire +1 more source
openaire +1 more source
The principal open problems in number theory and theoretical computer science.Utilizing the symbolic-polynomial framework introduced by the author, in which theindeterminate constantI = 00and a fifth-degree polynomial approximation P (n) to the n-th prime are the centraltools, we demonstrate that each problem fails to hold under this unified ...
openaire +1 more source
openaire +1 more source

