Results 261 to 270 of about 1,820,249 (291)

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

Monotone separations for constant degree polynomials

Information Processing Letters, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pavel Hrubes, Amir Yehudayoff
openaire   +2 more sources

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   +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   +1 more source

Polynomial constants of motion in flat space

Journal of Mathematical Physics, 1984
Some general results on commuting integrals for a Hamiltonian system are given. The question of the existence of integrals which are polynomial in the momenta is investigated and the results applied to a variety of mechanical systems.
openaire   +1 more source

On polynomial controllability with polynomial state for linear constant systems

IEEE Transactions on Automatic Control, 1986
Summary: We prove that for linear, reachable, time independent dynamic systems, control at any given time may be achieved with the additional requirements that both the input and the state be polynomial functions of time. The proof is constructive and elementary, and yields a bound on the degree.
Ailon, A., Baratchart, L., Grimm, J., Langholz, G.   +3 more
openaire   +2 more sources

On the Polynomial Derivative Constant for an Ellipse

The 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

MOTION PLANNING BY PIECEWISE CONSTANT OR POLYNOMIAL INPUTS

IFAC Proceedings Volumes, 1992
Abstract In this paper we present an algorithmic solution of the “Exact Motion Planning Problem” for nilpotent systems, by piecewise constant or polynomial inputs. By using an identification process, we improve here the solution earlier given by Lafferiere and Sussmann, for systems without drift. So we obtain a much smaller number of pieces (in case
openaire   +1 more source

Nonzero Constant Wronskians of Polynomials and Laurent Polynomials

The American Mathematical Monthly
Juan Gerardo Alcázar, Carlos Hermoso
openaire   +1 more source

Polynomial Formal Verification exploiting Constant Cutwidth

Proceedings of the 34th International Workshop on Rapid System Prototyping, 2023
Mohamed A. Nadeem, Jan Kleinekathöfer, Rolf Drechsler   +2 more
openaire   +2 more sources