格蕴涵代数中的扩张滤子

在格蕴涵代数中提出了扩张滤子的概念,讨论了扩张滤子与滤子,扩张滤子与素滤子,扩张滤子与滤子的根,扩张滤子与准素滤子,扩张滤子与最大滤子之间的关系.得到了扩张滤子的一些性质.最后,证明了在格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.     

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.     

保等价部分变换半群的变种半群上的正则元

在现有的保等价部分变换半群的基础上,引入了一个新的运算,得出保等价部分变换半群的变种半群的概念,利用格林关系及幂等元的正则性,讨论了这类半群中元素的正则性,给出了保等价部分变换半群的变种半群中一个元是正则元的充要条件     

L-Fuzzy拟序集的理想完备化

建立[4]中定义的L-fuzzy拟序集的一种理想完备化,即证明了L-fuzzy拟序集上的所有L-fuzzy理想组成的集合,赋以合适的程度映射构成L-fuzzydomain,任意从L-fuzzy拟序集到L-fuzzydomain的L-fuzzy单调映射都可以扩张成为一个L-fuzzyScott连续映射。     

带对称齐次核的级数算子的范数刻画及其应用

对带对称齐次核K(m,n)的级数算子T:T{an}=Σ_(n=1)~∞ K(m,n)an,{an}∈lω(n),l={{an)| an≥0,Σ_(n=1)~∞ω(n)an<+∞},本文研究了T的范数刻画,并讨论其应用.     

Estimation of the degree of differencing of an ARIMA process

Summary A method of estimating the degree of differencing of an ARIMA process is proposed. This is based on fitting an AR model to the original and to each differenced series and calculating the residual sum of squares. As an application, we suggest an identification method of an ARI (p, d) process combining our method of estimating the degree of differencing with Akaike's Information Criterion.     

任意角可以m等分的条件

设 p是任意奇素数 ,证明了任意角不能通过圆规直尺作图 p等分 .进而证明了任意角可以 m等分的充要条件是 m是 2的方幂     

Optimality of Balanced Proper Orthogonal Decomposition for Data Reconstruction

Proper orthogonal decomposition (POD) finds an orthonormal basis yielding an optimal reconstruction of a given dataset. We consider an optimal data reconstruction problem for two general datasets related to balanced POD, which is an algorithm for balanced truncation model reduction for linear systems. We consider balanced POD outside of the linear systems framework, and prove that it solves the optimal data reconstruction problem. The theoretical result is illustrated with an example.     

One Property of the Renormalization Group Operator

We use an isotropic ferromagnet as an example to show that the renormalization group operator can be interpreted as an evolution operator for a system of spins evolving with an increase of the reduced temperature, i.e., as the order operator of the system.     

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.     

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.     

Remarks on the Uniqueness of a Solution of the Dirichlet Problem for Second-Order Elliptic Equations with Lower-Order Terms

We give an example of an incompressible diffusion equation whose solution is nonunique. It is shown that this equation has an approximation solution as well as another solution that cannot be obtained by approximation. We give sufficient conditions for the uniqueness of a solution as well as for the uniqueness of an approximation solution.     

Optimal boundedness criteria for extended-real-valued functions

The notion of genuinely bounded below function is introduced and characterized by means of the concept of co-equilibrated function. As an application, we state two boundedness criteria for extended-real-valued functions, both optimal in a clearly defined sense. The first one says that an extended-real-valued function minorized by an affine map and coinciding from some value up with a co-equilibrated function is bounded below. The second criterion states that an extended-real-valued function minorized by an affine map is bounded below provided that one of its sub-level sets is co-equilibrated.     

ON THE SPECTRAL PROPERTIES OF M-MATRICES AND ITS APPLICATIONS

1.IntroductionAndPreliminariesThespectralpropertiesofM-matricesplayanimportantroleinnonnegativemainstheory,andhavebeenappliedtostudythenumericalsolutionoflinearsystems.Recentlylmanyarticleshavediscussedwiththistopics(see[l--5]).ThepurposeofthispaperistoestablishthespectralinequalitiesofsingularM-matrices.ByapplyingthesepropertiesweanswerpartiallyanopenproblemandsolveanopenproblemposedbySchneiderin[4,5],somerecelltresultI2'4'6]onsplittingsofanM-matrixarealsoimproved.Allnotationsanddefinitio…     

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.     

Variance optimal hedging for continuous time additive processes and applications

For a large class of vanilla contingent claims, we establish an explicit Föllmer–Schweizer decomposition when the underlying is an exponential of an additive process. This allows to provide an efficient algorithm for solving the mean variance hedging problem. Applications to models derived from the electricity market are performed.     

Reversible and Bijectively Related Posets

Call a poset reversible if every of its order-preserving self-bijections is an automorphism. Call two posets bijectively related if from each of the two posets exists an order-preserving bijection to the other. We present two examples of pairs of non-isomorphic, bijectively related posets and an example of a non-reversible poset that is bijectively related only to itself. Also, three classes of reversible posets are described and a sufficient condition for an order-preserving bijection to be an isomorphism is presented.     

Bounded decomposition in the Brieskorn lattice and Pfaffian Picard-Fuchs systems for Abelian integrals

We suggest an algorithm for derivation of the Picard-Puchs system of Pfaffian equations for Abelian integrals corresponding to semiquasihomogeneous Hamiltonians. It is based on an effective decomposition of polynomial forms in the Brieskorn lattice. The construction allows for an explicit upper bound on the norms of the polynomial coefficients, an important ingredient in studying zeros of these integrals.     

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.