Results 1 to 10 of about 60,620 (168)
Relating polynomial time to constant depth
Theoretical Computer Science, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Heribert Vollmer
exaly +3 more sources
Is Catalan’s Constant Rational?
Mathematics, 2022 This paper employs a contour integral method to derive and evaluate the infinite sum of the Euler polynomial expressed in terms of the Hurwitz Zeta function. We provide formulae for several classes of infinite sums of the Euler polynomial in terms of the
Robert Reynolds, Allan Stauffer
doaj +1 more source
Estimates of the asymptotic Nikolskii constants for spherical polynomials [PDF]
Journal of Complexity, 2021 Let $Π_n^d$ denote the space of spherical polynomials of degree at most $n$ on the unit sphere $\mathbb{S}^d\subset \mathbb{R}^{d+1}$ that is equipped with the surface Lebesgue measure $dσ$ normalized by $\int_{\mathbb{S}^d} \, dσ(x)=1$. This paper establishes a close connection between the asymptotic Nikolskii constant, $$ \mathcal{L}^\ast(d):=\lim_{n\
Feng Dai +2 more
openaire +3 more sources
Journal of Mathematics, 2022 In the paper, we study the upper bound estimation of the Lebesgue constant of the bivariate Lagrange interpolation polynomial based on the common zeros of product Chebyshev polynomials of the second kind on the square −1,12. And, we prove that the growth
Juan Liu, Laiyi Zhu
doaj +1 more source
Morgan-Voyce Polynomial Approach for Quaternionic Space Curves of Constant Width
Foundations of Computing and Decision Sciences, 2021 The curves of constant width are special curves used in engineering, architecture and technology. In the literature, these curves are considered according to different roofs in different spaces and some integral characterizations of these curves are ...
Aydin Tuba Ağirman +2 more
doaj +1 more source
Asymptotics of Polynomial Interpolation and the Bernstein Constants [PDF]
Results in Mathematics, 2021 AbstractIt is well known that the interpolation error for $$\left| x\right| ^{\alpha },\alpha >0$$ x α , α > 0
openaire +3 more sources
Learning Read-Constant Polynomials of Constant Degree Modulo Composites [PDF]
Theory of Computing Systems, 2011 Peer ...
Arkadev Chattopadhyay +3 more
openaire +4 more sources
Decomposition of differential polynomials with constant coefficients [PDF]
Proceedings of the 2004 international symposium on Symbolic and algebraic computation, 2004 In this paper, we present an algorithm to decompose differential polynomials in one variable and with rational number as coefficients. Besides arithmetic operations, the algorithm needs only factorization of multi-variable polynomials and solution of linear equation systems. Experimental results show that our method is quite efficient.
Xiao-Shan Gao, Mingbo Zhang
openaire +1 more source
Constant term identities and Poincaré polynomials [PDF]
Transactions of the American Mathematical Society, 2015 In 1982 Macdonald published his now famous constant term conjectures for classical root systems. This paper begins with the almost trivial observation that Macdonald’s constant term identities admit an extra set of free parameters, thereby linking them to Poincaré polynomials.
Károlyi, Gyula +2 more
openaire +6 more sources
Computing a Solution of Feigenbaum's Functional Equation in Polynomial Time [PDF]
Logical Methods in Computer Science, 2014 Lanford has shown that Feigenbaum's functional equation has an analytic solution. We show that this solution is a polynomial time computable function. This implies in particular that the so-called first Feigenbaum constant is a polynomial time computable
Peter Hertling, Christoph Spandl
doaj +1 more source