Strict majority functions on graphs

An opinion function on a graph G = (V, E) is a function f: V → {−1, +1}. The vote of a vertex v is the sum of these function values over the closed neighborhood of v. A strict majority function on a graph G is an opinion function for which more than half of the vertices have a positive vote. The strict majority number of G is the minimum sum of the values in a strict majority function of G. We prove the conjecture of Cockayne and Mynhardt (Ars. Combin. 43 (1996), 235–245) that every tree has strict majority number at most 2. We also prove that every graph has strict majority number at most 4. Both bounds are sharp. © 1998 John Wiley & Sons, Inc. J Graph Theory 28: 49–56, 1998     

A theory of cobordism for non-spherical links

We define an equivalence relation, called algebraic cobordism, on the set of bilinear forms over the integers. When , we prove that two 2n - 1 dimensional, simple fibered links are cobordant if and only if they have algebraically cobordant Seifert forms. As an algebraic link is a simple fibered link, our criterion for cobordism allows us to study isolated singularities of complex hypersurfaces up to cobordism. Received: August 24, 1995     

Strict feasibility of pseudomonotone set-valued variational inequalities

In this article, we use degree theory developed in Kien et al. [B.T. Kien, M.-M. Wong, N.C. Wong, and J.C. Yao, Degree theory for generalized variational inequalities and applications, Eur. J. Oper. Res. 193 (2009), pp. 12–22.] to prove a result on the existence of solutions to set-valued variational inequality under a weak coercivity condition, provided that the set-valued mapping is upper semicontinuous with nonempty compact convex values. If the set-valued mapping is pseudomonotone in the sense of Karamardian and upper semicontinuous with nonempty compact convex values, it is shown that the set-valued variational inequality is strictly feasible if and only if its solution set is nonempty and bounded.     

Some noninvertible links

We construct for each infinitely many -component oriented links that are neither amphicheiral nor invertible; among these examples, infinitely many are Brunnian links.

     

Diagrams of divide links

Recently N. A'Campo suggested a construction of a link from a generic immersion of a curve into a 2-disk. It is tightly related to the singularity theory. In this paper, we give a simple procedure to draw a diagram of the link from a picture of the curve.

     

AHP中增加一组元素的严格保序性条件

给出了左主特征向量法（LEM）下增加一组元素严格保序的充要条件,通过研究在右主特征向量法（REM）,左主特征向量法（LEM）,几何平均特征向量法（GMEM）下增加一组元素严格保序的条件之间的关系,从而给出GMEM下增加一组元素严格保序的充分条件。     

Strongly invertible links and divides

To a proper generic immersion of a finite number of copies of the unit interval in a 2-disc, called a divide, A’Campo associates a link in S³. From the more general notion of ordered Morse signed divides, one obtains a braid presentation of links of divides. In this paper, we prove that every strongly invertible link is isotopic to the link of an ordered Morse signed divide. We give fundamental moves for ordered Morse signed divides and show that strongly invertible links are equivalent if and only if we can pass from one ordered Morse signed divide to the other by a sequence of such moves. Then we associate a polynomial to an ordered Morse signed divide, invariant for these moves. So this polynomial is invariant for the equivalence of strongly invertible links.     

一般Lyness方程的周期性与严格振动性

研究了一般的Lyness方程 其中a、b∈[0,∞)且a+b>0,初值x_-1、x₀为任意正数。得到了一些新的结果;方程(*)解的周期性的一个必要充分条件;方程(*)的所有解严格振动的充分条件。作为应用,解决了G.Ladas提出的一个公开问题。     

Strict Topologies as Topological Algebras

Let X be a completely regular Hausdorff space, C_b(X) the space of all scalar-valued bounded continuous functions on X with strict topologies. We prove that these are locally convex topological algebras with jointly continuous multiplication. Also we find the necessary and sufficient conditions for these algebras to be locally m-convex.     

Criteria of prime links in terms of pseudo-characters

Pseudo-characters of groups have recently found applications in the theory of classical knots and links in ℝ³. More precisely, there is a connection between pseudo-characters of Artin’s braid groups and properties of links represented by braids. In the present work, this connection is investigated and the notion of kernel pseudo-characters of braid groups is introduced. It is proved that a kernel pseudo-character ϕ and a braid β satisfy Ιϕ(β)І > C _ϕ, where C _ϕ is the defect of ϕ, then β represents a prime link (i.e., a link that is noncomposite, nonsplit, and nontrivial). Furthermore, the space of braid group pseudo-characters is studied and a way to obtain nontrivial kernel pseudo-characters from an arbitrary braid group pseudo-character that is not a homomorphisrn is described. This allows one to use an arbitrary nontrivial braid group pseudo-character for recognition of prime knots and links. Bibliography: 17 titles.     

集值向量变分不等式的严格可行性与可解性

本文研究集值向量变分不等式的严格可行性与可解性之间的关系．证明了如下结果:在一定条件下,只要集值向量变分不等式是严格可行的,那么其一定可解．     

近严格凸与最佳逼近

本文研究近严格凸与最佳逼近的关系．证明了Ｂａｎａｃｈ空间Ｘ是近严格凸的当且仅当Ｘ的每个子空间是紧－半－切比晓夫空间．     

Maximal Bennequin numbers and Kauffman polynomials of positive links

By using results of Yamada and of Yokota, concerning link diagrams and link polynomials, we give some relationships between maximal Bennequin numbers and Kauffman polynomials of positive links.

     

On a Boolean-valued Model of the Strict Implication System(Continuous)

The reference [4] proved the consistency of S1 and S2 among Lewis' five strict implication systems in the modal logic by using the method of the Boolean-valued model. But, in this method, the consistency of S3, S4 and S5 in Lewis' five strict implication systems is not decided. This paper makes use of the properties: (1) the equivalence of the modal systems S3 and P3, S4 and P4; (2) the modal systems P3 and P4 all contained the modal axiom T(□p → p); (3) the modal axiom T is correspondence to the reflexive property in VB. Hence, the paper proves: (a) ‖As31‖ = 1; (b) ‖AS41‖ = 1; (c) ‖AS5l‖ = 1 in the model (where B is a complete Boolean algebra, R is reflexive property in VB). Therefore, the paper finally proves that the Boolean-valued model VB of the ZFC axiom system in set theory is also a Boolean-valued model of Lewis' the strict implication system S3, S4 and S5.     

Flabby Strict Deformation Quantizations and K-Groups

We construct examples of flabby strict deformation quantizations not preserving K-groups. This answers a question of Rieffel negatively.     

非对称稳定幂GARCH的严平稳性与解的唯一性

平稳性是研究时间序列的重要条件，本讨论一个扰动项为非对称稳定幂GARCH过程的模型的严平稳性与解的唯一性，并给出严平稳性与解存在的充要条件。     

时间尺度上泛函微分方程的严格Ф_0稳定性

利用李雅普诺夫函数和比较原理讨论了时间尺度上泛函微分方程的严格Ф0稳定性问题.     

Three-bridge links with infinitely many three-bridge spheres

We construct infinitely many three-bridge links each of which admits infinitely many three-bridge spheres up to isotopy.     

On Strict Extensions of Nearness Spaces

Strict extensions of nearness spaces are constructed as spaces of round Cauchy filters. Morita's simple extension is identified as the strict extension generated by Morita-generated filters. Carlson's B-completeness is compared with Herrlich completeness and completeness of Morita T-uniformities. The three completeness concepts are shown to be equivalent in regular nearness spaces.     

Strict Minimality Conditions in Nondifferentiable Multiobjective Programming

In this paper, sufficient conditions for superstrict minima of order m to nondifferentiable multiobjective optimization problems with an arbitrary feasible set are provided. These conditions are expressed through the Studniarski derivative of higher order. If the objective function is Hadamard differentiable, a characterization for strict minimality of order 1 (which coincides with superstrict minimality in this case) is obtained.