格蕴涵代数中的扩张滤子

在格蕴涵代数中提出了扩张滤子的概念,讨论了扩张滤子与滤子,扩张滤子与素滤子,扩张滤子与滤子的根,扩张滤子与准素滤子,扩张滤子与最大滤子之间的关系.得到了扩张滤子的一些性质.最后,证明了在格H蕴涵代数中,扩张滤子与扩张滤子的根相等.     

Archimedean ordered semigroups as ideal extensions

The main result of the paper is a structure theorem concerning the ideal extensions of archimedean ordered semigroups. We prove that an archimedean ordered semigroup which contains an idempotent is an ideal extension of a simple ordered semigroup containing an idempotent by a nil ordered semigroup. Conversely, if an ordered semigroup S is an ideal extension of a simple ordered semigroup by a nil ordered semigroup, then S is archimedean. As a consequence, an ordered semigroup is archimedean and contains an idempotent if and only if it is an ideal extension of a simple ordered semigroup containing an idempotent by a nil ordered semigroup.     

Associative identities of octonions

We work to find a basis of identities for an octonion algebra modulo an associator ideal of a free alternative algebra, or, in other words, a basis for an associative replica of an ideal of identities of an octonion algebra.     

B-Construction and C-Construction

B-construction is a way of obtaining a graded algebra from the triple consisting of an additive category, an object, and an autoequivalence, while C-construction is a way of obtaining an algebra (without unity) from the pair consisting of an additive category and a set of objects. In this article, we study and compare three important classes of algebras in noncommutative algebraic geometry and representation theory of finite dimensional algebras, namely, quantum polynomial algebras, preprojetive algebras and trivial extensions, via these constructions.     

On evolution of an information dynamic system and its generating operator

States of a dynamical information system can be represented by points on a statistical manifold—a subset of a vector space endowed with an information topology. An evolution of such a system is considered here with respect to changes in information rather than changes in time, because differences between states are represented by an information distance. Here we consider an optimal system maximizing a utility of an abstract information resource, and then analyze properties of information such that an optimal system is described by an evolution operator or a semigroup. The latter is generated by an operator that can be interpreted as a utility, payoff or a fitness function. We discuss the advantages and applications of the proposed approach.     

On the Existence of a Classical Optimal Solution and of an Almost Strongly Optimal Solution for an Infinite-Horizon Control Problem

We consider an infinite-horizon optimal control problem with the cost functional described either by an integral over an unbounded interval (a Lebesgue integral) or by a limit of integrals (an improper Lebesgue integral). We prove some theorems on the existence of solutions to such problems. The proofs are based on appropriate lower closure theorems and some extensions of Olech’s theorem on the lower semicontinuity of an integral functional; these extensions cover the cases of functionals described by an integral over an unbounded interval and by a limit of integrals.     

Optimal control in a macroeconomic problem

The Pontryagin maximum principle is used to develop an original algorithm for finding an optimal control in a macroeconomic problem. Numerical results are presented for the optimal control and optimal trajectory of the development of a regional economic system. For an optimal control satisfying a certain constraint, an invariant of a macroeconomic system is derived.     

An inner approximation method incorporating a branch and bound procedure for optimization over the weakly efficient set

In this paper, we consider an optimization problem which aims to minimize a convex function over the weakly efficient set of a multiobjective programming problem. From a computational viewpoint, we may compromise our aim by getting an approximate solution of such a problem. To find an approximate solution, we propose an inner approximation method for such a problem. Furthermore, in order to enhance the efficiency of the solution method, we propose an inner approximation algorithm incorporating a branch and bound procedure.     

INVERSE MONOIDS OF GRAPHS

. IntroductionGraph endomorphism and its regularity property have been investigated in some literatures (of. [1--41 for examples). The invertibility is a stronger algebraic property thanregUlarity in semigroup theory. It is commonly agreed that inverse semigroups are the mostpromising class of semigroups for study. In this paper we first present a combinatorial characterization of an inverse monoid of a graph (Theorem 2.3). Then using this we prove thata bipartite graph with an inverse monoi…     

On the distribution tail of an integrated risk model: A numerical approach

We consider an insurance risk process with the possibility to invest the capital reserve into a portfolio consisting of a risky asset and a riskless asset. The stock price is modelled by an exponential Lévy process and the riskless interest rate is assumed to be constant. We aim at the risk assessment of the integrated risk process in terms of a high quantile or the far out distribution tail. We indicate an application to an optimal investment strategy of an insurer.     

$p$-双调和算子的第一特征值的等周上界和 Reilly 型不等式

在本文中,我们给出了嵌入到欧氏空间中的$n$维闭超曲面上$p$-双调和算子的第一特征值的一些等周上界.我们也给出了浸入到高维流形如欧氏空间,球面和射影空间中的闭子流形上$p$-双调和算子的第一特征值的一些Reilly-型不等式.     

Distributions on almost contact manifolds

It is known that any hypersurface in an almost complex space admits an almost contact manifold [11, 14]. In this article we show that a hyperplane in an almost contact manifold has an almost complex structure. Along with this result, we explain how to determine when an almost contact structure induces a contact structure, followed by examples of a manifold with a closed G₂-structure.     

Regular expression transformations to extend regular languages (with application to a Datalog XML schema validator)

An XML schema is a set of rules for defining the allowed sub-elements of any element in an XML document. These rules use regular expressions to define the language of the element's children. Updates to an XML schema are updates to the regular expressions defined by the schema rules. We consider an interactive, data administration tool for XML databases. In this tool, changes on an XML schema are activated by updates that violate the validity of an XML document. Our schema validator is a Datalog program, resulting from the translation of a given XML schema. Changing the schema implies changing the validator.The main contribution of this paper is an algorithm allowing the evolution of XML schemas. This algorithm is based on the computation of new regular expressions to extend a given regular language in a conservative way, trying to foresee the needs of an application. A translation function from schema constraints to Datalog programs is introduced. The validation of an XML tree corresponds to the evaluation of the Datalog program over the tree. Our method allows the maintenance of the Datalog program in an incremental way, i.e., without redoing the entire translation.     

Nonlocal diffusion,a Mittag-Leffler function and a two-dimensional Volterra integral equation

In this paper we consider a particular class of two-dimensional singular Volterra integral equations. Firstly we show that these integral equations can indeed arise in practice by considering a diffusion problem with an output flux which is nonlocal in time; this problem is shown to admit an analytic solution in the form of an integral. More crucially, the problem can be re-characterized as an integral equation of this particular class. This example then provides motivation for a more general study: an analytic solution is obtained for the case when the kernel and the forcing function are both unity. This analytic solution, in the form of a series solution, is a variant of the Mittag-Leffler function. As a consequence it is an entire function. A Gronwall lemma is obtained. This then permits a general existence and uniqueness theorem to be proved.     

pth Power Lagrangian Method for Integer Programming

When does there exist an optimal generating Lagrangian multiplier vector (that generates an optimal solution of an integer programming problem in a Lagrangian relaxation formulation), and in cases of nonexistence, can we produce the existence in some other equivalent representation space? Under what conditions does there exist an optimal primal-dual pair in integer programming? This paper considers both questions. A theoretical characterization of the perturbation function in integer programming yields a new insight on the existence of an optimal generating Lagrangian multiplier vector, the existence of an optimal primal-dual pair, and the duality gap. The proposed pth power Lagrangian method convexifies the perturbation function and guarantees the existence of an optimal generating Lagrangian multiplier vector. A condition for the existence of an optimal primal-dual pair is given for the Lagrangian relaxation method to be successful in identifying an optimal solution of the primal problem via the maximization of the Lagrangian dual. The existence of an optimal primal-dual pair is assured for cases with a single Lagrangian constraint, while adopting the pth power Lagrangian method. This paper then shows that an integer programming problem with multiple constraints can be always converted into an equivalent form with a single surrogate constraint. Therefore, success of a dual search is guaranteed for a general class of finite integer programming problems with a prominent feature of a one-dimensional dual search.     

A Newton-type univariate optimization algorithm for locating the nearest extremum

This paper introduces an algorithm for univariate optimization using linear lower bounding functions (LLBF's). An LLBF over an interval is a linear function which lies below the given function over an interval and matches the given function at one end point of the interval. We first present an algorithm using LLBF's for finding the nearest root of a function in a search direction. When the root-finding method is applied to the derivative of an objective function, it is an optimization algorithm which guarantees to locate the nearest extremum along a search direction. For univariate optimization, we show that this approach is a Newton-type method, which is globally convergent with superlinear convergence rate. The applications of this algorithm to global optimization and other optimization problems are also discussed.     

Isoperimetric inequalities and conjugate points on Lorentzian surfaces

Recently, an isoperimetric inequality for a sector on the Minkowski 2-spacetime has been derived by the method of parallels and the relativistic Gauss-Bonnet formula. In the present paper, we derive an isoperimetric inequality for a sector on a Lorentzian surface with curvatureK ≤ C. As a sector can be modeled by a geodesic variation of a timelike geodesic, our isoperimetric inequality gives an upper bound for the spacelike boundary of a sector. As an application of our results, we give an elementary proof of the existence of conjugate points on a Lorentzian surface with curvatureK ≤ C < 0 and we obtain an upper bound for the (timelike) diameter of a globally hyperbolic Lorentzian surface withK ≤ C < 0 by comparison of sectors.     

Autoregulated Impulse Point Heating of a Finite Medium

We consider a finite heat conducting medium whose boundary is maintained at zero temperature and, moreover, to which the same amount of heat is supplied at a certain point at the instant when the temperature at this point decreases to a given level. Up to an arbitrary shift in time, we prove the existence and uniqueness of a periodic regime with a unique heat pulse during each period. We present an efficient algorithm for constructing this regime if the medium is either an n-dimensional ball heated at the center or an interval heated at an arbitrary point.     

An automorphism group of an ω‐stable structure that is not locally (OB)

We observe that there is an example of an automorphism group of a model of an ω‐stable theory—in fact, the prime model of an uncountably categorical theory—that is not locally (OB), answering a question of Rosendal.     

Étale endomorphisms of algebraic surfaces with $G_m$-actions

Let X be an algebraic surface defined over the complex field and endowed with an -fibration. As such a surface we have a Platonic -fiber space, a weighted hypersurface with its singular point deleted off and, more generally, an affine algebraic surface with an unmixed -action and its fixpoint deleted off. We consider an étale endomorphism and show that is an automorphism in most cases. Of particular interest is the case of a Platonic -fiber space, for which being an automorphism is closely related to the Jacobian Problem for the affine plane . We also investigate the automorphism group of such surfaces. Received January 7, 1999 / Published online October 30, 2000