Results 131 to 140 of about 58,673 (168)

Quasi-polynomial mappings with constant Jacobian

Izvestiya: Mathematics, 2021
Abstract The famous Jacobian conjecture (JC) remains open even for dimension . In this paper we study it by extending the class of polynomial mappings to quasi-
openaire   +2 more sources

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

Monotone separations for constant degree polynomials

Information Processing Letters, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hrubeš, Pavel, Yehudayoff, Amir
openaire   +1 more source

Polynomial maps with constant Jacobian

Israel Journal of Mathematics, 1979
It has been long conjectured that ifn polynomialsf 1, …,f n inn variables have a (non-zero) constant Jacobian determinant then every polynomial can be expressed as a polynomial inf 1, …,f n. In this paper, various extra assumptions (particularly whenn=2) are shown to imply the conclusion. These conditions are discussed algebraically and geometrically.
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)\).
Bartelt, M. W., Swetits, J. J.
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

Asymptotic constants for multivariate Bernstein polynomials

Studia Scientiarum Mathematicarum Hungarica, 2003
We study the rate of convergence of multivariate Bernstein polynomials on the class of Hölder continuous functions. Using a proper probabilistic representation we are able to derive the asymptotic constant.
openaire   +1 more source

COUNTING HIERARCHIES: POLYNOMIAL TIME AND CONSTANT DEPTH CIRCUITS

1993
\textit{Seinosuke Toda} [\(PP\) is \(\leq^ p_ T\)-hard for the polynomial time hierarchy, Proc. 30th IEEE Symp. on Foundations of Computer Science, 514-519 (1989)] proved that the polynomial hierarchy is contained in \(P^{PP}\) [To-89]. In this month's structural complexity column, we will briefly review Toda's result, and explore how it relates to ...
Allender, Eric W., Wagner, Klaus W.
openaire   +2 more sources

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