Generalised discriminants, deformed Calogero-Moser-Sutherland operators and super-Jack polynomials

It is shown that the deformed Calogero-Moser-Sutherland (CMS) operators can be described as the restrictions on certain affine subvarieties (called generalised discriminants) of the usual CMS operators for infinite number of particles. The ideals of these varieties are shown to be generated by the Jack symmetric functions related to the Young diagrams with special geometry. A general structure of the ideals which are invariant under the action of the quantum CMS integrals is discussed in this context. The shifted super-Jack polynomials are introduced and combinatorial formulas for them and for super-Jack polynomials are given.     

On semibounded restrictions of self-adjoint operators

After the von Neumann's remark [10] about pathologies of unbounded symmetric operators and an abstract theorem about stability domain [9], we develope here a general theory allowing to construct semibounded restrictions of selfadjoint operators in explicit form. We apply this theory to quantum-mechanical momentum (position) operator to describe corresponding stability domains. Generalization to the case of measurable functions of these operators is considered. In conclusion we discuss spectral properties of self-adjoint extensions of constructed self-adjoint restrictions.     

REDUCIBILITY IN SOME CATEGORIES OF PARTIAL RECURSIVE OPERATORS

We consider two categories with one object, namely the set of all partial functions of one variable from the set of natural numbers into itself; the morphisms are the partial recursive operators in one case, and certain continuous partial mappings in the other case. We show that these categories are recursion categories and we characterize the domains and the complete domains. Some observations are made on a notion of reducibility obtained by using the total morphisms of these categories, and, subsequently, the general recursive operators.     

The n �� n KdV hierarchy

We introduce two new soliton hierarchies that are generalizations of the KdV hierarchy. Our hierarchies are restrictions of the AKNS n × n hierarchy coming from two unusual splittings of the loop algebra. These splittings come from automorphisms of the loop algebra instead of automorphisms of sl (n, \mathbbC){sl (n, \mathbb{C})} . The flows in the hierarchy include systems of coupled nonlinear Schr?dinger equations. Since they are constructed from a Lie algebra splitting, the general method gives formal inverse scattering, bi-Hamiltonian structures, commuting flows, and B?cklund transformations for these hierarchies.     

Discrete Dirac Operators in Clifford Analysis

We develop a constructive framework to define difference approximations of Dirac operators which factorize the discrete Laplacian. This resulting notion of discrete monogenic functions is compared with the notion of discrete holomorphic functions on quad-graphs. In the end Dirac operators on quad-graphs are constructed.     

Approximability of operators in constructive metric spaces

The possibility is studied of approximating pointwise defined operators in a broad class of constructive metric spaces. Various ways of representing operators approximately are presented; uniform approximability, approximability, and weak approximability (see Definitions 3.1, 4.2). It is proved that the class of uniformly approximable operators equals the class of uniformly continuous operators. It is also proved that the class of approximable operators equals the class of weakly approximable operators and coincides with the class of operators having the following property: for every natural number n, it is possible to construct a denumerable covering of the domain of the operator by balls such that the operator has oscillation less than 2^–n in each ball.List of abbreviations used NN natural number - RN rational number - CMS constructive metric space - SAS simply approximable CMS - uCa uniformly C-approximates - uOa uniformly O-approximates - Ca C-approximates - Oa O-approximates - wCa weakly C-approximates - wOa weakly O-approximates Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova Akad. Nauk SSSR, Vol. 60, pp. 171–182, 1976. Results announced April 24, 1975.     

The bernsteim polynomial in one variable

The lemma on b-functions is a result due to I.N.Bernstein about the existence of certain differential operators with polynomial coefficients.In this paper we give an elementary and constructive proof of this result that works well in one variable.Our method results in a simple formula for the Bernstein polynomial b(λ)and a recursive definition for a differential operator d(λ)that produces b(λ).As an application we consider two consequences about the poles of certain meromorphic functions defined by the analytic continuation of distributions.     

Convergence for a family of neural network operators in Orlicz spaces

In this paper, we develop the theory for a family of neural network (NN) operators of the Kantorovich type, in the general setting of Orlicz spaces. In particular, a modular convergence theorem is established. In this way, we study the above family of operators in many instances of useful spaces by a unique general approach. The above NN operators provide a constructive approximation process, in which the coefficients, the weights, and the thresholds of the networks needed in order to approximate a given function f , are known. At the end of the paper, several examples of Orlicz spaces, and of sigmoidal activation functions for which the present theory can be applied, are studied in details.     

Computational matrix representation modules for linear operators with explicit constructions for a class of lie operators

A linear mapping from a finite-dimensional linear space to another has a matrix representation. Certain multilinear functions are also matrix-representable. Using these representations, symbolic computations can be done numerically and hence more efficiently. This paper presents an organized procedure for constructing matrix representations for a class of linear operators on finite-dimensional spaces. First we present serial number functions for locating basis monomials in the linear space of homogeneous polynomials of fixed degree, ordered under structured lexicographies. Next basic lemmas describing the modular structure of matrix representations for operators constructed canonically from elementary operators are presented. Using these results, explicit matrix representations are then given for the Lie derivative and Lie-Poisson bracket operators defined on spaces of homogeneous polynomials. In particular, they are comprised of blocks obtained as Kronecker sums of modular components, each corresponding to specific Jordan blocks. At an implementation level, recursive programming is applied to construct these modular components explicitly. The results are also applied to computing power series approximations for the center manifold of a dynamical system. In this setting, the linear operator of interest is parameterized by two matrices, a generalization of the Lie-Poission bracket.     

Filtrations de Radon et fonctions sphériques pour Sn et son q-analogue GL(n,q)

We define a sequence of generalized Radon transforms, which are intertwining operators for natural representations associated to Gel'fand spaces for the symmetric group S_n. This sequence enables us to decompose in a recursive way these natural representations and to compute explicitly the associate spherical functions. We prove analogous results for a sequence of generalized Radon transforms between natural representations for the general linear group GL(n,q), which are a q-analogue of the preceding ones.     

A posteriori estimates of inverse operators for initial value problems in linear ordinary differential equations

We present constructive a posteriori estimates of inverse operators for initial value problems in linear ordinary differential equations (ODEs) on a bounded interval. Here, “constructive” indicates that we can obtain bounds of the operator norm in which all constants are explicitly given or are represented in a numerically computable form. In general, it is difficult to estimate these inverse operators a priori. We, therefore, propose a technique for obtaining a posteriori estimates by using Galerkin approximation of inverse operators. This type of estimation will play an important role in the numerical verification of solutions for initial value problems in nonlinear ODEs as well as for parabolic initial boundary value problems.     

Generalized Bessel functions: Theory and their applications

This paper presents 2 new classes of the Bessel functions on a compact domain [0,T] as generalized‐tempered Bessel functions of the first‐ and second‐kind which are denoted by GTBFs‐1 and GTBFs‐2. Two special cases corresponding to the GTBFs‐1 and GTBFs‐2 are considered. We first prove that these functions are as the solutions of 2 linear differential operators and then show that these operators are self‐adjoint on suitable domains. Some interesting properties of these sets of functions such as orthogonality, completeness, fractional derivatives and integrals, recursive relations, asymptotic formulas, and so on are proved in detail. Finally, these functions are performed to approximate some functions and also to solve 3 practical differential equations of fractionalorders.     

Integrable Chains and Hierarchies of Differential Evolution Equations

A class of integrable differential–difference systems is constructed based on auxiliary linear equations defined on sequences of Zakharov–Shabat formal dressing operators. We show that the auxiliary equations are compatible with the evolution equations for the Kadomtsev–Petviashvili (KP) hierarchy. The investigation results are used to elaborate a modified version of Krichever rational reductions for KP hierarchies.     

The problem of conflicting control with mixed constraints

The control problem for a linear dynamical system is considered at a minimax of the terminal quality index. Feasible controls are simultaneously restricted by geometrical constraints and by integrated momentum constraints, the latter being thought of as a store of control resources. The problem is formalized as a differential game [1–4] using concepts [5–8] developed at Ekaterinburg. Here, because of the geometrical constraints, the momentum formulation and its associated difficulties [2–4] do not appear. On the other hand the presence of the integral restrictions leads to the appearance of additional variables whose evolution describes the dynamics of the expenditure of the control resources. These variables are subject to phase restrictions, which is a peculiarity of the problem. A reasonably informative picture and a class of strategies for which the given game has a value and a saddle point are given. A constructive method for computing the value function of the game and constructing optimal strategies is presented. This method is conceptually related to the construction of a stochastic programming synthesis [5] and is based on the recursive construction of upper-convex envelopes for certain auxiliary functions. The possibility of exchanging the minimum and maximum operations over the resource parameters when calculating the value of the game using these procedure is established.     

On a certain seqence of positive linear operators and tow optimization inequalities

In this Paper the approximation of continuous functions by positive linear operators of Bernstein type is investigated. The consideered operators are constructed using a system of rational functions with prescribed matrix of real poles. A certain general problem of S Bernstein concerning a scheme of construction of a sequence of positive linear operators is discussed. The answer on the Bernstein's hypothesis is given. The optimal limiting relations for the norm of the second central moment of our sequence of operators are established.     

A simple averaging process for approximating the solutions of certain optimal control problems

It is shown that the extremal solutions of fixed duration Mayer control problems with implicit terminal constraints can be interpreted as fixed points of certain function-valued operators F constructed by solving pairs of initial value problems in tandem. A class of simple recursive averaging processes is proposed for approximating the fixed points of F. Results from the theory of monotone Hilbert space operators are used to establish the convergence of the averaging processes for a general linear-quadratic curve follower problem with unbounded control inputs, and for a simple second order bounded control input problem.     

A posteriori estimates of inverse operators for initial value problems in linear ordinary differential equations

We present constructive a posteriori estimates of inverse operators for initial value problems in linear ordinary differential equations (ODEs) on a bounded interval. Here, “constructive” indicates that we can obtain bounds of the operator norm in which all constants are explicitly given or are represented in a numerically computable form. In general, it is difficult to estimate these inverse operators a priori. We, therefore, propose a technique for obtaining a posteriori estimates by using Galerkin approximation of inverse operators. This type of estimation will play an important role in the numerical verification of solutions for initial value problems in nonlinear ODEs as well as for parabolic initial boundary value problems.