有限格，闭包系统和闭包算子

本文引进了新的闭包系统,新的闭包算子等概念,研究了它们之间的相互关系,给出了由闭包系统来表示有限原子格的表示定理,证明了分别以这些数学结构为对象,以它们之间的同态映射作为态射,所对应的格范畴和对应的闭包系统范畴是范畴等价的.     

关于湍流理论中的不封闭性的讨论*

有一种观点认为湍流的不封闭性是由于N-S方程的非线性,这是一似是而非的错误说法。因为工程上要求的量并不仅仅限于湍流的平均速度和平均压力,即使方程式是线性的,也无法把工程上要求的这些量逐个求出来。本文论证了湍流的不封闭性来源于目前的湍流理论中缺少了一个与实际情况符合的有关分布函数,并且进一步说明了湍流模式理论的局限性和用N-S方程直接计算机模拟亦是相当困难的原因。     

Quantaloid-enriched 范畴上的闭包算子与闭包系统

In this paper, we introduce the fundamental notions of closure operator and closure system in the framework of quantaloid-enriched category. We mainly discuss the relationship between closure operators and adjunctions and establish the one-to-one correspondence between closure operators and closure systems on quantaloid-enriched categories.     

用广义拟Hadamard卷积定义的广义积分算子的封闭性质

首先利用广义拟-Hadamard卷积引入一个广义积分算子;其次,应用两个经典不等式和系数不等式研究广义积分算子及其特殊殊算子在某些非标准化广义解析函数类上的封闭性质.     

复数域上有限群代数的中心在整数环上的整闭包

本文运用Ｆｏｕｒｉｅｒ反演公式刻划了复数域Ｃ上的一个有限群Ｇ的群代数Ｃ「Ｇ」的中心Ｚ（Ｃ「Ｇ」）中整数环Ｘ的整闭包,给出了群代数Ｃ「Ｇ」的中心元在整数环Ｚ上为整元的充要条件。     

广义次指数密度的两个新的等价条件

得到了广义次指数密度的两个新的等价条件,刻划了它们的卷积封闭性和卷积根封闭性.     

Regular closure

Regular closure is an operation performed on submodules of arbitrary modules over a commutative Noetherian ring. The regular closure contains the tight closure when both are defined, but in general, the regular closure is strictly larger. Regular closure is interesting, in part, because it is defined a priori in all characteristics, including mixed characteristic. We show that one can test regular closure in a Noetherian ring by considering only local maps to regular local rings. In certain cases, it is necessary only to consider maps to certain affine algebras. We also prove the equivalence of two variants of regular closure for a class of rings that includes .

     

The split closure of a strictly convex body

The Chvátal-Gomory closure and the split closure of a rational polyhedron are rational polyhedra. It has been recently shown that the Chvátal-Gomory closure of a strictly convex body is also a rational polytope. In this note, we show that the split closure of a strictly convex body is defined by a finite number of split disjunctions, but is not necessarily polyhedral. We also give a closed form expression in the original variable space of a split cut for full-dimensional ellipsoids.     

A new closure concept preserving graph Hamiltonicity and based on neighborhood equivalence

A graph is Hamiltonian if it contains a cycle which goes through all vertices exactly once. Determining if a graph is Hamiltonian is known as an NP-complete problem, and no satisfactory characterization for these graphs has been found.In 1976, Bondy and Chvàtal introduced a way to get round the Hamiltonicity problem complexity by using a closure of the graph. This closure is a supergraph of G which is Hamiltonian iff G is. In particular, if the closure is the complete graph, then G is Hamiltonian. Since this seminal work, several closure concepts preserving Hamiltonicity have been introduced. In particular, in 1997, Ryjá?ek defined a closure concept for claw-free graphs based on local completion.Following a different approach, in 1974, Goodman and Hedetniemi gave a sufficient condition for Hamiltonicity based on the existence of a clique covering of the graph. This condition was recently generalized using the notion of Eulerian clique covering. In this context, closure concepts based on local completion are interesting since the closure of a graph contains more simplicial vertices than the graph itself, making the search for a clique covering easier.In this article, we introduce a new closure concept based on local completion which preserves the Hamiltonicity for every graph. Note that, moreover, the closure may be claw free even when the graph is not.     

Orientor field equations in Banach spaces

This paper focuses on the interplay between seminormality requirements and convergence hypotheses on trajectories in the lower closure theorems for orientor field equations. With the use of a weak form of seminormality, called the intermediate property (Q*), we obtain lower closure theorems (and thereby closure theorems) for orientor field equations in Banach spaces, under the assumption of strong convergence of some coordinates of the trajectories, while only weak convergence is assumed in the others. In the Euclidean case, this requirement of property (Q*) is further reduced to mere Kuratowski property (K), under the usual growth-type conditions. Finally, in the appendix, property (Q*) is investigated in detail.This research has been partially supported by Research Project AFOSR-71-2122 at the University of Michigan, Ann Arbor, Michigan.     

Balance Theory with Incomplete Awareness

In this paper, we reformulate balance theory by allowing actors to possess incomplete awareness of the evaluations held by other actors, and by adopting balance closure (modified to allow incomplete awareness) as an equilibrium concept. Our treatment highlights psychological mechanisms, maintains a clear distinction between actors and objects, emphasizes the effects of self-awareness and self-evaluations of actors, and permits actors to hold ambivalent (simultaneously positive and negative) evaluations. Our analysis extends previous results linking the imbalance of a signed graph to ambivalence in its balance closure and reveals that an actor's “indirect awareness” of imbalance is necessary but not sufficient for that actor's ambivalence in the balance closure.     

Proper Efficiency in Vector Optimization on Real Linear Spaces

In this paper, we use an algebraic type of closure, which is called vector closure, and through it we introduce some adaptations to the proper efficiency in the sense of Hurwicz, Benson, and Borwein in real linear spaces without any particular topology. Scalarization, multiplier rules, and saddle-point theorems are obtained in order to characterize the proper efficiency in vector optimization with and without constraints. The usual convexlikeness concepts used in such theorems are weakened through the vector closure.     

Fuzzy closure systems on L—ordered sets

In this paper, notions of fuzzy closure system and fuzzy closure L —system on L —ordered sets are introduced from the fuzzy point of view. We first explore the fundamental properties of fuzzy closure systems. Then the correspondence between fuzzy closure systems (fuzzy closure L —systems) and fuzzy closure operators is established. Finally, we study the connections between fuzzy closure systems and fuzzy Galois connections. © 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim     

<Emphasis Type="Italic">F</Emphasis>-Net Convergence with Respect to a Closure Operator

In a category with a closure operator, we introduce the notion of a neighborhood of a point. The neighborhoods are then discussed and used for defining a net convergence structure on the category with respect to the closure operator. The nets considered are obtained as a categorical generalization of the usual nets. We investigate basic properties of the defined convergence. In particular, we study convergence separation and convergence compactness and describe their relationships to the usual closure separation and closure compactness. Mathematics Subject Classifications (2000) 18D35, 54B30, 54A05, 54A20, 54D30.This research was supported by NATO-CNR Outreach Fellowship (No. 219.33) and by Grant Agency of the Czech Republic (No. 201/03/0933).     

The polynomial closure is not topological

We characterize the polynomial closure of a pseudo-convergent sequence in a valuation domain V of arbitrary rank, and then we use this result to show that the polynomial closure is never topological when V has rank at least 2.     

On the Stone and Bishop appoximation theorems

Generalizations of the Stone-Weierstrass and Bishop approximation theorems are presented. Given an algebra, a subspace in a continuous function space coinciding with the closure of this algebra is constructed. Analogs of these results are obtained in the case where the set of functions under consideration is not an algebra, but its closure is related to some algebra.     

离散PH分布的一个封闭性质及其应用

本证明了离散PH分布的一个封闭性质并讨论了它在离散时间排队研究中的应用。     

On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube

Split cuts are prominent general-purpose cutting planes in integer programming. The split closure of a rational polyhedron is what is obtained after intersecting the half-spaces defined by all the split cuts for the polyhedron. In this paper, we prove that deciding whether the split closure of a rational polytope is empty is NP-hard, even when the polytope is contained in the unit hypercube. As a direct corollary, we prove that optimization and separation over the split closure of a rational polytope in the unit hypercube are NP-hard, extending an earlier result of Caprara and Letchford.     

Integral closure of a cubic extension and applications

In this paper, we compute the integral closure of a cubic extension over a Noetherian unique factorization domain. We also present some applications to triple coverings and to rank two reflexive sheaves over an algebraic variety.

     

序半群的Quantale完备化

首先定义了集合上的闭包算子,研究了闭包算子的若干性质;其次给出了序半群的Quantale完备化,证明了序半群的Quantale完备化在同构意义下完全由序半群上的拓扑闭包决定;最后给出了序半群Quantale完备化的一个应用.