Abstract:
The Schrodinger and Heisenberg evolution operators are represented in quantum phase space by their Weyl symbols. Their semiclassical approximations are constructed in the short and long time regimes. For both evolution problems, the WKB representation is purely geometrical: the amplitudes are functions of a Poisson bracket and the phase is the symplectic area of a region in phase space bounded by trajectories and chords. A unified approach to the Schrodinger and Heisenberg semiclassical evolutions is developed by introducing an extended phase space. In this setting Maslov's pseudodifferential operator version of WKB analysis applies and represents these two problems via a common higher dimensional Schrodinger evolution, but with different extended Hamiltonians. The evolution of a Lagrangian manifold in the extended phase space, defined by initial data, controls the phase, amplitude and caustic behavior. The symplectic area phases arise as a solution of a boundary condition problem. Various applications and examples are considered.

Abstract:
Classical chaos refers to the property of trajectories to diverge exponentially as time tends to infinity. It is characterized by a positive Lyapunov exponent. There are many different descriptions of quantum chaos. The one related to the notion of generalized (quantum) Lyapunov exponent is based either on qualitative physical considerations or on the so-called symplectic tomography map. The purpose of this note is to show how the definition of quantum Lyapunov exponent naturally arises in the framework of the Moyal phase space formulation of quantum mechanics and is based on the notions of quantum trajectories and the family of quantizers. The role of the Heisenberg uncertainty principle in the statement of the criteria for quantum chaos is made explicit.

Abstract:
For a Hamiltonian system in R^{2n}, its two-system is defined in the phase space R^{2n} x sp(2n,R). In a sense, it is a combination of the original system and its system in variations with feedback. We study the Hamiltonian forms of the two-system and its analogs. In particular, we show a relation between the Poisson-Lie bracket on the (dual space to) Lie algebra sp(2n,R) and the canonical bracket.

Abstract:
Following Ehrenfest's approach, the problem of quantum-classical correspondence can be treated in the class of trajectory-coherent functions that approximate as $\h\to 0$ a quantum-mechanical state. This idea leads to a family of systems of ordinary differential equations, called Ehrenfest M-systems (M=0,1,2,...), formally equivalent to the semiclassical approximation for the linear Schroedinger equation. In this paper a similar approach is undertaken for a nonlinear Hartree-type equation with a smooth integral kernel. It is demonstrated how quantum characteristics can be retrieved directly from the corresponding Ehrenfest systems, without solving the quantum equation: the semiclassical asymptotics for the spectrum are obtained from the rest point solution. One of the key steps is derivation of a modified nonlinear superposition principle valid in the class of trajectory-coherent quantum states.

Abstract:
We put forward a conjecture about an universal asymptotical behaviour of the symbol of the Dirichlet-to-Neumann operator (considered as a pseudodifferential operator) in the 2D exterior problem for the Hemholtz equation. The conjecture is motivated by simple explicit examples and backed by numerical calculations, even in the case of a non-convex obstacle. It implies (at a physical level of rigor) Kirhhoff's approximation.

Abstract:
A high-frequency asymptotics of the symbol of the Dirichlet-to-Neumann map, treated as a periodic pseudodifferential operator, in 2D diffraction problems is discussed. Numerical results support a conjecture on a universal limit shape of the symbol.

Abstract:
In this paper we study the problem of computing a Kolchin characteristic set of a radical differential ideal. The central part of the article is the presentation of algorithms solving this problem in two principal cases: for ordinary differential polynomials and in the partial differential case. Our computations are mainly performed with respect to orderly rankings. We also discuss the usefulness of regular and characteristic decompositions of radical differential ideals. In the partial differential case we give an algorithm for computing characteristic sets in the special case of radical differential ideals satisfying the property of consistency. For this class of ideals we show how to deal with arbitrary differential rankings.

Abstract:
In a well forgotten memoir of 1890, Andrei Markov devised a convergence acceleration technique based on a series transformation which is very similar to what is now known as the Wilf-Zeilberger (WZ) method. We review Markov's work, put it in the context of modern computer-aided WZ machinery, and speculate about possible reasons of the memoir being shelved for so long.

Abstract:
The Ritt problem asks if there is an algorithm that tells whether one prime differential ideal is contained in another one if both are given by their characteristic sets. We give several equivalent formulations of this problem. In particular, we show that it is equivalent to testing if a differential polynomial is a zero divisor modulo a radical differential ideal. The technique used in the proof of equivalence yields algorithms for computing a canonical decomposition of a radical differential ideal into prime components and a canonical generating set of a radical differential ideal. Both proposed representations of a radical differential ideal are independent of the given set of generators and can be made independent of the ranking.

Abstract:
We study the concept of canonical characteristic set of a characterizable differential ideal. We propose an efficient algorithm that transforms any characteristic set into the canonical one. We prove the basic properties of canonical characteristic sets. In particular, we show that in the ordinary case for any ranking the order of each element of the canonical characteristic set of a characterizable differential ideal is bounded by the order of the ideal. Finally, we propose a factorization-free algorithm for computing the canonical characteristic set of a characterizable differential ideal represented as a radical ideal by a set of generators. The algorithm is not restricted to the ordinary case and is applicable for an arbitrary ranking.