Results 1 to 10 of about 689,207 (330)
Logarithmic corrected Polynomial $f(R)$ inflation mimicking a cosmological constant [PDF]
, 2016 In this paper, we consider an inflationary model of $f(R)$ gravity with polynomial form plus logarithmic term. We calculate some cosmological parameters and compare our results with the Plank 2015 data.
Kubeka, A. S. +3 more
core +2 more sources
Upper Bound for Lebesgue Constant of Bivariate Lagrange Interpolation Polynomial on the Second Kind Chebyshev Points [PDF]
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 +2 more sources
On Correctness of Cauchy problem for a Polynomial Difference Operator with Constant Coefficients
Известия Иркутского государственного университета: Серия "Математика", 2018 The theory of linear difference equations is applied in various areas of ma\-the\-matics and in the one-dimensional case is quite established. For $n>1$, the situation is much more difficult and even for the constant coefficients a general description of
M. S. Apanovich, E.K. Leinartas
doaj +2 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
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
On a Linear Program for Minimum-Weight Triangulation [PDF]
, 2013 Minimum-weight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of effective polynomial- time heuristics that, for many instances, can find the exact MWT.
Arman Yousefi +15 more
core +3 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
On the generalized Davenport constant and the Noether number [PDF]
, 2013 Known results on the generalized Davenport constant related to zero-sum sequences over a finite abelian group are extended to the generalized Noether number related to the rings of polynomial invariants of an arbitrary finite group.
A Geroldinger +19 more
core +1 more source
Zeros of Fekete polynomials [PDF]
, 1999 The authors study the distribution of zeros of the Fekete polynomial f_p(t) (defined for p prime) as p -> infinity. They show that asymptotically a constant fraction of the zeros lie on the unit circle, and they investigate the constant of ...
Conrey, J. Brian +3 more
core +3 more sources
Hamming distance from irreducible polynomials over $\mathbb {F}_2$ [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 We study the Hamming distance from polynomials to classes of polynomials that share certain properties of irreducible polynomials. The results give insight into whether or not irreducible polynomials can be effectively modeled by these more general ...
Gilbert Lee +2 more
doaj +1 more source