Among approaches to defining the Feynman integral, various sequential methods are probably the most popular ones. Here we consider that one based on product formulae, the original idea of which belongs to Nelson71'. This method is powerful in the sense that it enables to prove the strict version of Feynman's basic dynamical formula for a wide class of poten tials^^/including time-dependent ones/4/in comparison with other known methods (see, eg, refs./5, 6/). 0n the other, hand, the method does not correspond exactly to Feynman's heuristic prescription because it replaces the exact action along poly gonal paths by its Riemannian approximation. Moreover, one can regard as an unsatisfactory feature that it employs the" equidistant" time-interval partitions only. In the present paper we show that the last mentioned sour ce of arbitrariness can be removed: the product formula for perturbations of propagators by

A counterpart of the modular double for quantum superalgebra Uq(osp(1\2)) is constructed by means of supersymmetric quantum mechanics. We also construct the R-matrix operator acting in the corresponding representations, which is expressed via quantum dilogarithm.

No abstract uploaded!

We consider the Laplacian in a strip R(0,d) with the boundary condition which is Dirichlet except at the segment of a length 2a of one of the boundaries where it is switched to Neumann. This operator is known to have a non-empty and simple discrete spectrum for any a>0. There is a sequence 0<a1<a2< of critical values at which new eigenvalues emerge from the continuum when the Neumann window expands. We find the asymptotic behavior of these eigenvalues around the thresholds showing that the gap is in the leading order proportional to (aan)2 with an explicit coefficient expressed in terms of the corresponding threshold-energy resonance eigenfunction.

This paper introduces a new central trapdoor for multivariate quadratic (MQ) public-key cryptosystems that allows for encryption, in contrast to time-tested MQ primitives such as Unbalanced Oil and Vinegar or Hidden Field Equations which only allow for signatures. Our construction is a mixed-field scheme that exploits the commutativity of the extension field to dramatically reduce the complexity of the extension field polynomial implicitly present in the public key. However, this reduction can only be performed by the user who knows concise descriptions of two simple polynomials, which constitute the private key. After applying this transformation, the plaintext can be recovered by solving a linear system. We use the minus and projection modifiers to inoculate our scheme against known attacks. A straightforward C++ implementation confirms the efficient operation of the public key algorithms.