Considering a commutative unital quantale L as the truth value table and using the tool of L-generalized convergence structures of stratified L-filters, this paper introduces a kind of fuzzy upper topology, called fuzzy S-upper topology, on L-preordered sets. It is shown that every fuzzy join-preserving L-subset is open in this topology. When L is a complete Heyting algebra, for every completel...

the idea of “forcing” has long been used in many research fields, such as colorings, orientations, geodetics and dominating sets in graph theory, as well as latin squares, block designs and steiner systems in combinatorics (see [1] and the references therein). recently, the forcing on perfect matchings has been attracting more researchers attention. a forcing set of m is a subset of m contained...

The spin 1/2 Calogero-Gaudin system and its q-deformation are exactly solved: a complete set of commuting observables is diagonalized, and the corresponding eigenvectors and eigenvalues are explicitly calculated. The method of solution is purely algebraic and relies on the co-algebra symmetry of the model. Running T itle: Spin 1/2 CG System and its q−Deformation P.A.C.S.: 03.65 Fd, 02.20 Sv

The exact scattering solutions of the Klein-Gordon equation in cylindrically symmetric field are constructed as eigenfunctions of a complete set of commuting operators. The matrix elements and the corresponding differential scattering cross-section are calculated. Properties of the pair production at various limits are discussed.

The odderon equation is studied in terms of the variable suggested by the modular invariance of the 3 Reggeon system. Odderon charge is identified with the cross-product of three conformal spins. A complete set of commuting operators: ĥ2 and q̂ is diagonalized and quantization conditions for eigenvalues of the odderon charge q̂ are solved for arbitrary conformal weigth h. PACS: 12.38.Cy; 11.55.Jy.

A graph is unfrozen with respect to k independent set if it has an independent set of size k after the addition of any edge. The problem of recognizing such graphs is known to be NP-complete. A graph is maximal if the addition of one edge means it is no longer unfrozen. We designate the problem of recognizing maximal unfrozen graphs as MAX(U(k-SET)) and show that this problem is CO-NP-complete....

The idea of “forcing” has long been used in many research fields, such as colorings, orientations, geodetics and dominating sets in graph theory, as well as Latin squares, block designs and Steiner systems in combinatorics (see [1] and the references therein). Recently, the forcing on perfect matchings has been attracting more researchers attention. A forcing set of M is a subset of M contained...

In this paper we restrict every set splitting problem to the special case in which every set has just three elements. This restricted version is also NP-complete. Then, we introduce a general conversion from any set splitting problem to 3-set splitting. Then we introduce a randomize algorithm, and we use Markov chain model for run time complexity analysis of this algorithm. In the last section ...