Pre—Separation Axioms in Fuzzifying Topology

1　 IntroductionYing[5,6 ] introduced and elementally developed so called fuzzifying topology with the semanticmethod of continuous valued L ogic.Shen[7] introduced and studied T0 -,T1-,T2 (Hausdorff) -,T3(regularity) -,T4 (normality) -separation axioms in fuzzifying topology.In [3 ]the concepts of thefamily of fuzzifying pre-open sets,fuzzifying pre-neighbourhood structure of a point and fuzzifyingpre-closure are introduced and studied.It is worth to mention that pre-separation axioms are …     

Low-level Separation Axioms in Topological Molecular Lattices

Compactness,one of the most important notions in topological molecular lattices(TMLs for short)(see [1]), has not yet been defined reasonably in TMLs. Fuzzytopology, the blue-print on which the theory of TML was established,presages that asatisfactory solution to the problem of compactness is always associated with the studyof points, support points and separation axioms. In[2], the concept of component of     

Almost αg-Closed Functions and Separation Axioms

We introduce a new class of functions called almost g-closed and use the functions to improve several preservation theorems of normality and regularity and also their generalizations. The main result of the paper is that normality and weak normality are preserved under almost g-closed continuous surjections.     

New Results on Global Rank Axioms of Poset Matroids

An excellent introduction to the topic of poset matroids is due to M. Barnabei, G. Nicoletti and L. Pezzoli. On the basis of their work, we have obtained the global rank axioms for poset matroids.In this paper, we study the special integral function f and obtain a new class of poset matroids from the old ones, and then we generalize this result according to the properties of f. Almost all of these results can be regarded as the application of global rank axioms for poset matroids. The main results in our paper have, indeed, investigated the restriction of the basis of the poset matroid, and we give them the corresponding geometric interpretation.     

On Axioms Contituting the Foundation of Hypergraph Theory

Hypergraphs are systems of finite sets, being the most general structures in discrete mathematics and powerful tools in dealing with discrete systems. In general, a branch of mathematics is built on some axioms. Informational scientists introduced the acyclic axiom for hypergraphs. In this paper, we first list several results concerning acyclic hypergraphs, in order to show that Acyclic-Axioms constitute the foundation of acyclic hypergraph theory. Then we give the basic theorem which shows that the Cycle-Axiom covers the Acyclic-Axioms and constitutes the foundation of hypergraph theory.     

Matroid Shellability, β-Systems,and Affine Hyperplane Arrangements

The broken-circuit complex is fundamental to the shellability and homology of matroids, geometric lattices, and linear hyperplane arrangements. This paper introduces and studies the -system of a matroid, nbc(M), whose cardinality is Crapo's -invariant. In studying the shellability and homology of base-pointed matroids, geometric semilattices, and afflne hyperplane arrangements, it is found that the -system acts as the afflne counterpart to the broken-circuit complex. In particular, it is shown that the -system indexes the homology facets for the lexicographic shelling of the reduced broken-circuit complex , and the basic cycles are explicitly constructed. Similarly, an EL-shelling for the geometric semilattice associated with M is produced,_and it is shown that the -system labels its decreasing chains.Basic cycles can be carried over from The intersection poset of any (real or complex) afflnehyperplane arrangement is a geometric semilattice. Thus the construction yields a set of basic cycles, indexed by nbc(M), for the union of such an arrangement.     

Verallgemeinerung des Verbandsbegriffs durch Abschwächung des Axioms der Idempotenz

Ohne Zusammenfassung     

Separation Properties of Bitopological Space

ＳｅｐａｒａｔｉｏｎＰｒｏｐｅｒｔｉｅｓｏｆＢｉｔｏｐｏｌｏｇｉｃａｌＳｐａｃｅ￥ＴｉａｎＬｉｑｉｎ（ＬｕｏｙａｎｇＡｇｒｉｃｕｌｔｒａｌＣｏｌｌｅｇｅ）Ａｂｓｔｒａｃｔ：Ｉｎｔｈｉｓｐａｐｅｒｗｅｓｔｕｄｙａｂｉｔｏｐｏｌｏｇｉｃａｌｓｐａｃｅｗｉ...     

Strong Minkowski Separation and Co-Drop Property

In the framework of topological vector spaces, we give a characterization of strong Minkowski separation, introduced by Cheng, et al., in terms of convex body separation. From this, several results on strong Minkowski separation are deduced. Using the results, we prove a drop theorem involving weakly countably compact sets in locally convex spaces. Moreover, we introduce the notion of the co-drop property and show that every weakly countably compact set has the co-drop property. If the underlying locally convex space is quasi-complete, then a bounded weakly closed set has the co-drop property if and only if it is weakly countably compact.     

GPU Parallelization Computation of High-Dimensional Multi-Phase Separation in Complex Domains Based on the Corrected FPM北大核心CSCD

Based on the corrected finite pointset method (CFPM) with CPU-GPU heteroid parallelization (CFPM-GPU), a high-efficiency, accurate and fast parallel algorithm was developed for the high-dimensional phase separation phenomena governed by the multi-component Cahn-Hilliard (C-H) equation in complex domains. The proposed parallel algorithm with the CFPM-GPU was built in a process like: ① introduce the Wendland weight function into the discretization of the finite pointset method (FPM) scheme for the 1st/2nd spatial derivatives, based on the Taylor series and the weighted least square concept; ② use the above FPM scheme twice to approximate the 4th spatial derivative in the C-H equation, which is called the CFPM method; ③ for the first time establish an accelerating parallel algorithm for the CFPM with local matrices by means of a single GPU card based on the CUDA programming. Two benchmark problems of 2D radially and 3D spherically symmetric C-H equations were first solved to test the accuracy and high-efficiency of the proposed CFPM-GPU, and the acceleration ratio of the GPU parallelization to the single CPU computation is about 160. Subsequently, the proposed CFPM-GPU was used to predict the 2D/3D multi-phase separation phenomena in complex domains, and the prediction was compared with other numerical results. The numerical results show that, the proposed CFPM-GPU is valid and high-efficiency to simulate the 2D/3D multi-phase separation cases in complex domains. © 2023 Editorial Office of Applied Mathematics and Mechanics. All rights reserved.     

Ein einfaches Beispiel für die Unabhängigkeit des Hilbertschen Axioms III 5

Ohne Zusammenfassung Vorgelegt von O. Varga     

Über die Separation komplexer Wurzeln algebraischer Gleichungen

Ohne Zusammenfassung     

A Jordan–Brouwer Separation Theorem for Polyhedral Pseudomanifolds

The Jordan Curve Theorem referring to a simple closed curve in the plane has a particularly simple proof in the case that the curve is polygonal, called the “raindrop proof”. We generalize the notion of a simple closed polygon to that of a polyhedral (d−1)-pseudomanifold (d≥2) and prove a Jordan–Brouwer Separation Theorem for such a manifold embedded in ℝ ^d . As a by-product, we get bounds on the polygonal diameter of the interior and exterior of such a manifold which are almost tight. This puts the result within the frame of computational geometry. The research of Y.S. Kupitz was partially supported by the Landau Center at the Mathematics Institute of the Hebrew University of Jerusalem (supported by Minerva Foundation, Germany), and by Deutsche Forschungsgemeinschaft.     

Phase Separation in the Advective Cahn–Hilliard Equation

The Cahn–Hilliard equation is a classic model of phase separation in binary mixtures that exhibits spontaneous coarsening of the phases. We study the Cahn–Hilliard equation with an imposed advection term in order to model the stirring and eventual mixing of the phases. The main result is that if the imposed advection is sufficiently mixing, then no phase separation occurs, and the solution instead converges exponentially to a homogeneous mixed state. The mixing effectiveness of the imposed drift is quantified in terms of the dissipation time of the associated advection–hyperdiffusion equation, and we produce examples of velocity fields with a small dissipation time. We also study the relationship between this quantity and the dissipation time of the standard advection–diffusion equation.

     

Separation Approach for Augmented Lagrangians in Constrained Nonconvex Optimization

This paper aims at showing that the class of augmented Lagrangian functions, introduced by Rockafellar and Wets, can be derived, as a particular case, from a nonlinear separation scheme in the image space associated with the given problem; hence, it is part of a more general theory. By means of the image space analysis, local and global saddle-point conditions for the augmented Lagrangian function are investigated. It is shown that the existence of a saddle point is equivalent to a nonlinear separation of two suitable subsets of the image space. Under second-order sufficiency conditions in the image space, it is proved that the augmented Lagrangian admits a local saddle point. The existence of a global saddle point is then obtained under additional assumptions that do not require the compactness of the feasible set.     

Estimation of the Separation of Two Matrices (Ⅱ)

In this paper we give a lower bound of the separation $sep_F(A,B)$ of two diagonalizable matrices A and B. The key to finding the lower bound of $sep_F(A,B)$ is to find an upper bound for the condition number of a transformation matrix Q which transforms a diagonalizable matrix A to a diagonal form. The obtained lower bound of $sep_F(A,B)$ involves the eigenvalues of A and B as well as the departures form the normality $\delta_F(A)$ and $\delta_F(B)$.     

On Selecting k Balls from an N-circle Without Unit Separation

Ｏｎ　Ｓｅｌｅｃｔｉｎｇ　ｋ　Ｂａｌｌｓ　ｆｒｏｍ　ａｎ　Ｎ－ｃｉｒｃｌｅ　Ｗｉｔｈｏｕｔ　Ｕｎｉｔ　ＳｅｐａｒａｔｉｏｎＣａｉＴｉａｎｘｉｎ（蔡天新）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｃｍａｔｉｃｓ，ＨａｎｇｚｈｏｎＵｎｉｖｅｒｓｉｔｙ，Ｈａｎｇｚ...