Results 21 to 30 of about 79,817 (224)
Experimental Mathematics, 1994 The title refers to the fact, noted by Chebyshev in 1853, that primes congruent to 3 modulo 4 seem to predominate over those congruent to 1. We study this phenomenon and its generalizations. Assuming the Generalized Riemann Hypothesis and the Grand Simplicity Hypothesis (about the zeros of the Dirichlet L-function), we can characterize exactly those ...
Rubinstein, Michael, Sarnak, Peter
openaire +2 more sources
Chebyshev-Vandermonde Systems [PDF]
Mathematics of Computation, 1991 A Chebyshev-Vandermonde matrix \[ V = [ p j ( z k ) ] j , k = 0 n ∈
Reichel, Lothar, Opfer, Gerhard
openaire +1 more source
Formalized Mathematics, 2016 Summary In [21], Marco Riccardi formalized that ℝN-basis n is a basis (in the algebraic sense defined in [26]) of ℰ T
openaire +2 more sources
Chebyshev series: Derivation and evaluation
PLoS ONE, 2023 In this paper we use a contour integral method to derive a bilateral generating function in the form of a double series involving Chebyshev polynomials expressed in terms of the incomplete gamma function. Generating functions for the Chebyshev polynomial
Robert Reynolds, Allan Stauffer
doaj +2 more sources
A Comparison of Papoulis and Chebyshev Filters in the Continuous Time Domain [PDF]
Radioengineering, 2021 The subject of this paper is the revisit of the Chebyshev (equiripple) and Papoulis (monotonic or staircase) low-pass filter in order to compare. It can be stated the fair comparison of Papoulis and Chebyshev filters cannot be found in the available ...
N. Stamenkovic +3 more
doaj
Quantifying non-monotonicity of functions and the lack of positivity in signed measures
Modern Stochastics: Theory and Applications, 2017 In various research areas related to decision making, problems and their solutions frequently rely on certain functions being monotonic. In the case of non-monotonic functions, one would then wish to quantify their lack of monotonicity.
Youri Davydov, Ričardas Zitikis
doaj +1 more source
An efficient scheme for numerical simulations of the spin-bath decoherence [PDF]
, 2003 We demonstrate that the Chebyshev expansion method is a very efficient numerical tool for studying spin-bath decoherence of quantum systems. We consider two typical problems arising in studying decoherence of quantum systems consisting of few coupled ...
A. J. Leggett +26 more
core +4 more sources
Chebyshev polynomials and the Frohman-Gelca formula [PDF]
, 2014 Using Chebyshev polynomials, C. Frohman and R. Gelca introduce a basis of the Kauffman bracket skein module of the torus. This basis is especially useful because the Jones-Kauffman product can be described via a very simple Product-to-Sum formula ...
Queffelec, Hoel, Russell, Heather M.
core +5 more sources
Chebyshev Interpolation Using Almost Equally Spaced Points and Applications in Emission Tomography
Mathematics, 2023 Since their introduction, Chebyshev polynomials of the first kind have been extensively investigated, especially in the context of approximation and interpolation.
Vangelis Marinakis +3 more
doaj +1 more source
Alternating Chebyshev Approximation [PDF]
Transactions of the American Mathematical Society, 1973 An approximating family is called alternating if a best Chebyshev approximation is characterized by its error curve having a certain number of alternations. The convergence properties of such families are studied. A sufficient condition for the limit of best approximation on subsets to converge uniformly to the best approximation is given: it is shown ...
openaire +2 more sources