格蕴涵代数中的扩张滤子

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

Algebraic geometry over algebraic structures. IV. Equational domains and codomains

We introduce and study equational domains and equational codomains. Informally, an equational domain is an algebra every finite union of algebraic sets over which is an algebraic set; an equational codomain is an algebra every proper finite union of algebraic sets over which is not an algebraic set.     

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.     

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.     

Artin HNN-extensions virtually embed in Artin groups

An Artin HNN-extension is an HNN-extension of an Artin groupin which the stable letter conjugates a pair of suitably chosensubsets of the standard generating set. We show that some finiteindex subgroup of an Artin HNN-extension embeds in an Artingroup. We also obtain an analogous result for Coxeter groups.     

Electromagnetic and thermal modelling of axisymmetric induction furnaces

A numerical method to describe the thermo-electric behavior of an induction heating furnace is introduced. It is obtained by using an enthalpy formulation concerning the thermal model and an integral representation of the electromagnetic potential in an unbounded domain. A BEM-FEM method is used and an iterative algorithm together with numerical results for an industrial heating system are presented. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

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偏序集

借助L-fuzzy关系在L-fuzzy中集中引入L-fuzzy偏序,自然地有了L-fuzzy偏序集,进一步借助水平截集刻画了L-fuzzy偏序集。     

On flatness of acts

We consider monoids $S=G\dot \cup I$ where G is a group and I is an ideal of S and show that if an S-act is principally weakly flat, (weakly) flat, torsion free or satisfies conditions (P) or (P_E) as an I¹-act, then it has these properties as an S-act. We also show that an S-act which is free, projective or strongly flat as an I¹-act may not generally have these properties as an S-act.     

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

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

Optimal estimates for an average of Hurwitz class numbers

The Ramanujan Journal - In this paper, we give an optimal estimate of an average of Hurwitz class numbers. As an application, we give an equidistribution result of the family $$\Big...     

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

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

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.     

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

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

關於Borsuk的絕對同倫擴充性質的討論

<正> 序言.在同倫論中,常常需要考慮滿足這種性質的拓撲空間X設Y為任意的一個正規空間,B為Y的任何一個非空閉集,任何一個由B×(0,1)+Y×(0)到X的映像都可以扩充為一個由Y×(0,1)到X的映像,我們稱這種性質為絕對同倫扩充性質,具有這種性質的空間以及用AHE表示.Borsuk曾經介紹這樣一個重要的定理:     

任意角可以m等分的条件

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

Enforced stability of an eigenvalue in the continuous spectrum of a waveguide with an obstacle

Perturbations of an eigenvalue in the continuous spectrum of the Neumann problem for the Laplacian in a strip waveguide with an obstacle symmetric about the midline are studied. Such an eigenvalue is known to be unstable, and an arbitrarily small perturbation can cause it to leave the spectrum to become a complex resonance point. Conditions on the perturbation of the obstacle boundary are found under which the eigenvalue persists in the continuous spectrum. The result is obtained via the asymptotic analysis of an auxiliary object, namely, an augmented scattering matrix.     

静态条件下SLK交货期完工时间的离差平方和最小问题

本文考察n(n≥2)个独立工件在单台机器上加工的排序问题,工件的交货期按SLK方法设置。目标是求最优加工顺序S~*和最优SLK因子K~*,使完上时间与交货期的离差平方和最小,对此,我们不仅给出了SLK交货期下对任意给定顺序S的最优SLK因子K~*(S)证明了按SPT(Shortest Processing Time)规则排序得到的就是最优顺序S~*而且证明了多个最优加工顺序下最优SLK因子相等。最后,给出了一个示例。     

An Objective Penalty Function of Bilevel Programming

Penalty methods are very efficient in finding an optimal solution to constrained optimization problems. In this paper, we present an objective penalty function with two penalty parameters for inequality constrained bilevel programming under the convexity assumption to the lower level problem. Under some conditions, an optimal solution to a bilevel programming defined by the objective penalty function is proved to be an optimal solution to the original bilevel programming. Moreover, based on the objective penalty function, an algorithm is developed to obtain an optimal solution to the original bilevel programming, with its convergence proved under some conditions.