On Ginzburg's Bivariant Chern Classes, II

For a morphism whose target variety is nonsingular, the Chern–Schwartz–MacPherson class homomorphism followed by capping with the pullback of the Segre class of the target variety is called the Ginzburg–Chern class. In this paper, using the Verdier–Riemann–Roch for Chern Class, we show that the correspondence assigning to a bivariant constructible function on any morphism with nonsingular target variety the Ginzburg–Chern class of it is the unique Grothendieck transformation satisfying the 'normalization condition' that for morphisms to a point it becomes the Chern–Schwartz–MacPherson class homomorphism, except for that the bivariant homology pullback is considered only for a smooth morphism.     

Dynamic Robust Output Min–Max Control for Discrete Uncertain Systems

Min–max control is a robust control, which guarantees stability in the presence of matched uncertainties. The basic min–max control is a static state feedback law. Recently, the applicability conditions of discrete static min–max control through the output have been derived. In this paper, the results for output static min–max control are further extended to a class of output dynamic min–max controllers, and a general parametrization of all such controllers is derived. The dynamic output min–max control is shown to exist in many circumstances under which the output static min–max control does not exist, and usually allows for broader bounds on uncertainties. Another family of robust output min–max controllers, constructed from an asymptotic observer which is insensitive to uncertainties and a state min–max control, is derived. The latter is shown to be a particular case of the dynamic min–max control when the nominal system has no zeros at the origin. In the case where the insensitive observer exists, it is shown that the observer-controller has the same stability properties as those of the full state feedback min–max control.     

An Expansion Formula for the Askey–Wilson Function

The Askey–Wilson function transform is a q-analogue of the Jacobi function transform with kernel given by an explicit non-polynomial eigenfunction of the Askey–Wilson second order q-difference operator. The kernel is called the Askey–Wilson function. In this paper an explicit expansion formula for the Askey–Wilson function in terms of Askey–Wilson polynomials is proven. With this expansion formula at hand, the image under the Askey–Wilson function transform of an Askey–Wilson polynomial multiplied by an analogue of the Gaussian is computed explicitly. As a special case of these formulas a q-analogue (in one variable) of the Macdonald–Mehta integral is obtained, for which also two alternative, direct proofs are presented.     

On left C-wrpp semigroups

It is known that a C–rpp semigroup can be described as a strong semilattice of left cancellative monoids. In this paper, we introduce the class of left C–wrpp semigroups which includes the class of left C–rpp semigroups as a subclass. We shall particularly show that the semi-spined product of a left regular band and a C–wrpp semigroup forms a curler which is a left C–wrpp semigroup and vice versa. Results obtained by Fountain and Tang on C–rpp semigroups are extended and strengthened.     

On the solution of Dirichlet’s problem of the complex Monge–Ampère equation for the Cartan–Hartogs domain of the first type

The complex Monge–Ampère equation is a nonlinear equation with high degree; therefore getting its solution is very difficult. In the present paper how to get the solution of Dirichlet’s problem of the complex Monge–Ampère equation on the Cartan–Hartogs domain of the first type is discussed, using an analytic method. Firstly, the complex Monge–Ampère equation is reduced to a nonlinear ordinary differential equation, then the solution of Dirichlet’s problem of the complex Monge–Ampère equation is reduced to the solution of a two-point boundary value problem for a nonlinear second-order ordinary differential equation. Secondly, the solution of Dirichlet’s problem is given as a semi-explicit formula, and in a special case the exact solution is obtained. These results may be helpful for a numerical method approach to Dirichlet’s problem of the complex Monge–Ampère equation on the Cartan–Hartogs domain of the first type.     

Yang–Mills Theory over Compact Symplectic Manifolds

In this paper, Yang–Mills theory over a compactKähler manifold is naturally extended to a compactsymplectic manifold. The relation betweenthe Yang–Mills equation and symplecticstructure is explicitly clarified, and the moduli spaceof Yang–Mills connections over a compactsymplectic manifold is constructed. Furthermore, theabsolute minima of the Yang–Mills functional arecharacterized, and finite dimensionality ofthe moduli space of the minimizers of the Yang–Millsfunctional is shown.     

On the existence of certain cyclic difference families and difference matrices

A theorem is proved to the effect that if there exists a BIB-schema with parameters (p^m–1,k, k–1), where k¦(p^m–1), p is prime, and m is a natural number, then there exists a BIB-schema (p^mn–1),k, k–1). A consequence is the existnece of a cyclic BIB-schema (p^mn–1, p^m–1, p^m–2) (p^m–1 is prime) that specifies each ordered pair of difference elements at any distance = 1, 2, ..., p^m–2 (cyclically) precisely once. Recursive theorems on the existence of difference matrices and (v, k, k)-difference families in the group Z_v of residue classes mod v are proved, along with a theorem on difference families in an additive abelian group.Translated from Matematicheskie Zametki, Vol. 52, No. 1, pp. 114–119, July, 1992.     

A Family of Semi-Regular Divisible Difference Sets

We give a construction of semi-regular divisible difference sets with parametersm = p2a(r–1)+2b (pr – 1)/(p – 1), n = pr, k = p(2a+1)(r–1)+2b (pr – 1)/(p – 1)1 = p(2a+1)(r–1)+2b (pr–1 – 1)/(p-1), 2 = p2(a+1)(r–1)–r+2b (pr – 1)/(p – 1)where p is a prime and r a + 1.     

Primal–Dual–Infeasible Newton Approach for the Analytic Center Deep-Cutting Plane Method

The convergence and complexity of a primal–dual column generation and cutting plane algorithm from approximate analytic centers for solving convex feasibility problems defined by a deep cut separation oracle is studied. The primal–dual–infeasible Newton method is used to generate a primal–dual updating direction. The number of recentering steps is O(1) for cuts as deep as half way to the deepest cut, where the deepest cut is tangent to the primal–dual variant of Dikin's ellipsoid.     

New Cyclic Difference Sets with Singer Parameters Constructed from d-Homogeneous Functions

In this paper, for a prime power q, new cyclic difference sets with Singer para- meters ((q ⁿ –1/q–1), (q ^n–1–1/q–1), (q ^n–2–1/q–1)) are constructed by using q-ary sequences (d-homogeneous functions) of period q ⁿ –1 and the generalization of GMW difference sets is proposed by combining the generation methods of d-form sequences and extended sequences. When q is a power of 3, new cyclic difference sets with Singer parameters ((q ⁿ –1/q–1), (q ^n–1–1/q–1), (q ^n–2–1/q–1)) are constructed from the ternary sequences of period q ⁿ –1 with ideal autocorrelation introduced by Helleseth, Kumar, and Martinsen.     

Polynomial Fibonacci–Hessenberg matrices

A Fibonacci–Hessenberg matrix with Fibonacci polynomial determinant is referred to as a polynomial Fibonacci–Hessenberg matrix. Several classes of polynomial Fibonacci–Hessenberg matrices are introduced. The notion of two-dimensional Fibonacci polynomial array is introduced and three classes of polynomial Fibonacci–Hessenberg matrices satisfying this property are given.     

Complexity of the min–max (regret) versions of min cut problems

This paper investigates the complexity of the min–max and min–max regret versions of the min s–t cut and min cut problems. Even if the underlying problems are closely related and both polynomial, the complexities of their min–max and min–max regret versions, for a constant number of scenarios, are quite contrasted since they are respectively strongly NP-hard and polynomial. However, for a non-constant number of scenarios, these versions become strongly NP-hard for both problems. In the interval scenario case, min–max versions are trivially polynomial. Moreover, for min–max regret versions, we obtain the same contrasted results as for a constant number of scenarios: min–max regret min s–t cut is strongly NP-hard whereas min–max regret min cut is polynomial.     

Interpolation of characteristic classes of singular hypersurfaces

We show that the Chern–Schwartz–MacPherson class of a hypersurface X in a nonsingular variety M ‘interpolates’ between two other notions of characteristic classes for singular varieties, provided that the singular locus of X is smooth and that certain numerical invariants of X are constant along this locus. This allows us to define a lift of the Chern–Schwartz–MacPherson class of such ‘nice’ hypersurfaces to intersection homology. As another application, the interpolation result leads to an explicit formula for the Chern–Schwartz–MacPherson class of X in terms of its polar classes.     

Generalized z-Distributions and Related Stochastic Processes

The class of generalized z–distributions is defined and their properties are investigated. Ornstein–Uhlenbeck–type and self–similar generalized z–processes are constructed and described. Esscher transforms of the generalized z–processes and the mixed generalized z–processes are characterized. Finally, construction and some properties of generalized z–diffusions are also discussed.     

Mass-spectrometric investigation of solid lubricating coatings subjected to friction in a deep vacuum

The life of solid lubricating coatings of the VNII NP type, based on molybdenum disulfides and various binders, has been experimentally investigated under deep vacuum conditions (10^–8–5 · 10^–9 torr) together with the composition of the gas released in the friction process. It is shown that both under atmospheric conditions and in a deep vacuum the life of the coatings depends on the chemical nature of the film-former. The depth of the vacuum also has an important influence on the life of the coatings, both the mechanism and the end result of this effect depending to a large extent on the physicochemical properties of the bind. On the interval 10^–1–10^–2 torr there is a sudden change in the life of the coating.Physicotechnical Institute of Low Temperatures, Academy of Sciences of the Ukrainian SSR, Khar'kov. Translated from Mekhanika Polimerov, No. 6, pp. 1070–1075, November–December, 1970.     

Optimal investment and reinsurance of an insurer with model uncertainty

We introduce a novel approach to optimal investment–reinsurance problems of an insurance company facing model uncertainty via a game theoretic approach. The insurance company invests in a capital market index whose dynamics follow a geometric Brownian motion. The risk process of the company is governed by either a compound Poisson process or its diffusion approximation. The company can also transfer a certain proportion of the insurance risk to a reinsurance company by purchasing reinsurance. The optimal investment–reinsurance problems with model uncertainty are formulated as two-player, zero-sum, stochastic differential games between the insurance company and the market. We provide verification theorems for the Hamilton–Jacobi–Bellman–Isaacs (HJBI) solutions to the optimal investment–reinsurance problems and derive closed-form solutions to the problems.     

Riemann–Roch for Algebraic Stacks: I

In this paper we establish Riemann–Roch and Lefschtez–Riemann–Roch theorems for arbitrary proper maps of finite cohomological dimension between algebraic stacks in the sense of Artin. The Riemann–Roch theorem is established as a natural transformation between the G-theory of algebraic stacks and topological G-theory for stacks: we define the latter as the localization of G-theory by topological K-homology. The Lefschtez–Riemann–Roch is an extension of this including the action of a torus for Deligne–Mumford stacks. This generalizes the corresponding Riemann–Roch theorem (Lefschetz–Riemann–Roch theorem) for proper maps between schemes (that are also equivariant for the action of a torus, respectively) making use of some fundamental results due to Vistoli and Toen. A key result established here is that topological G-theory (as well as rational G-theory) has cohomological descent on the isovariant étale site of an algebraic stack. This extends cohomological descent for topological G-theory on schemes as proved by Thomason.     

On a Commutative Class of Search Directions for Linear Programming over Symmetric Cones

The commutative class of search directions for semidefinite programming was first proposed by Monteiro and Zhang (Ref. 1). In this paper, we investigate the corresponding class of search directions for linear programming over symmetric cones, which is a class of convex optimization problems including linear programming, second-order cone programming, and semidefinite programming as special cases. Complexity results are established for short-step, semilong-step, and long-step algorithms. Then, we propose a subclass of the commutative class for which we can prove polynomial complexities of the interior-point method using semilong steps and long steps. This subclass still contains the Nesterov–Todd direction and the Helmberg–Rendl–Vanderbei–Wolkowicz/Kojima–Shindoh–Hara/Monteiro direction. An explicit formula to calculate any member of the class is also given.     

Bäcklund autotransformation for the equationu xt=eu−e−2u

The system of differential relations that arises in connection with the Bullough-Dodd-Zhiber-Shabat equationu _xt=e^u–e^–2u is considered. The consistency of this system is established, and it is shown that the system realizes a Bäcklund autotransformation for the equationu _xt=e^u–e^–2u. The associated three-dimensional dynamical systems, which are compatible on a two-dimensional invariant submanifold, are investigated, and a construction of their general solution, which gives the explicit form of the three-parameter soliton for the equationu _xt=e^u–e^–2u, is proposed.Bashkir State University. Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 95, No. 1, pp. 146–159, April, 1993.     

The solution of linear and nonlinear systems of Volterra functional equations using Adomian–Pade technique

The purpose of this study is to implement Adomian–Pade (Modified Adomian–Pade) technique, which is a combination of Adomian decomposition method (Modified Adomian decomposition method) and Pade approximation, for solving linear and nonlinear systems of Volterra functional equations. The results obtained by using Adomian–Pade (Modified Adomian–Pade) technique, are compared to those obtained by using Adomian decomposition method (Modified Adomian decomposition method) alone. The numerical results, demonstrate that ADM–PADE (MADM–PADE) technique, gives the approximate solution with faster convergence rate and higher accuracy than using the standard ADM (MADM).