Results 321 to 330 of about 3,642,916 (345)

On the Polynomial Derivative Constant for an Ellipse [PDF]

open access: possibleThe American Mathematical Monthly, 1937
Let Pn(z) be a polynomial* of degree n in z = x+iy and let j P (z) j < M on a set E, where M is a constant independent of n and z. The author has shownt that if the set E is bounded by an analytic Jordan curve C then j P ' (z)1 < K(C) MAln, where K(C) is a constant depending only on C. If C is the unit circle we know by a theorem of M. Rieszt that K(C)
openaire   +1 more source

Constant-round interactive proofs for delegating computation

Electron. Colloquium Comput. Complex., 2016
The celebrated IP=PSPACE Theorem of Lund et-al. (J.ACM 1992) and Shamir (J.ACM 1992), allows an all-powerful but untrusted prover to convince a polynomial-time verifier of the validity of extremely complicated statements (as long as they can be evaluated
Omer Reingold   +2 more
semanticscholar   +1 more source

John constants for polynomials

Complex Variables, Theory and Application: An International Journal, 1996
Let g be some set of non-constant analytic functions in the unit disk D, and for f e dg define The quantity where g u is the set of univalent functions in g, is called the John constant of g. We discuss where T k consists of the trinomials In particular, we find We also establish a conjecture of Rahman and Szynal for univalent trinomials in T ...
openaire   +2 more sources

On the optimal Lebesgue constants for polynomial interpolation [PDF]

open access: possibleActa Mathematica Hungarica, 1986
Let \(X=\{x_{kn}\}\), \(k=1,2,...,n\); \(n=1,2,...\), be any triangular matrix with \[ -1=x_{n+1,n}\leq x_{nn}
openaire   +2 more sources

Polynomial Constants Are Decidable

2002
Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs working on integers even if guards are ignored as in non-deterministic flow graphs. We show that polynomial constants are decidable in non-deterministic flow graphs.
Markus Müller-Olm, Helmut Seidl
openaire   +2 more sources

Local Lipschitz constants and Kolushov polynomials

Acta Mathematica Hungarica, 1991
Let \(C[a,b]\) be the space of continuous real-valued functions on \([a,b]\) with uniform norm \(\|\;\|\). For \(f\) in \(C[a,b]\), let \(B_ n(f)\) denote the best uniform approximate from the set of algebraic polynomials of degree \(n\) or less to \(f\). \(E_ n(f)\) is the number of the extremal points of \(f-B_ n(f)\).
J. J. Swetits, M. W. Bartelt
openaire   +2 more sources

The Cramer-Rao lower bound for signals with constant amplitude and polynomial phase

IEEE Transactions on Signal Processing, 1991
The authors derive the Cramer-Rao lower bound (CRLB) for complex signals with constant amplitude and polynomial phase, measured in additive Gaussian white noise. The exact bound requires numerical inversion of an ill-conditioned matrix, while its O(N/sup
S. Peleg, B. Porat
semanticscholar   +1 more source

Comments on "The Cramer-Rao lower bounds for signals with constant amplitude and polynomial phase"

IEEE Transactions on Signal Processing, 1998
For original paper see IEEE Trans. Signal Processing, vol.39, p.749-52 (March 1991). Different expressions for the Cramer-Rao lower bounds (CRLBs) of constant amplitude polynomial phase signals embedded in white Gaussian noise appear in the literature ...
B. Ristic, B. Boashash
semanticscholar   +1 more source

Constant Regression Polynomials and the Wishart Distribution

SIAM Journal on Mathematical Analysis, 1989
Summary: Results are obtained for the problems of constructing and characterizing scalar-valued polynomial statistics having constant regression on the mean of a random sample of Wishart matrices. The construction procedure introduced by \textit{B. Heller} [J. Multivariate Anal.
openaire   +2 more sources

A new post-quantum multivariate polynomial public key encapsulation algorithm

Quantum Information Processing, 2022
Randy Kuang   +2 more
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy