• 제목/요약/키워드: pairwise

검색결과 726건 처리시간 0.02초

SOME REMARKS ON PAIRWISE FUZZY SEMI VOLTERRA SPACES

  • V. CHANDIRAN;G. THANGARAJ
    • Journal of applied mathematics & informatics
    • /
    • 제42권1호
    • /
    • pp.169-178
    • /
    • 2024
  • The purpose of this paper is to introduce the concept of pairwise fuzzy semi door spaces and study its properties and applications. The conditions for a pairwise fuzzy semi door space to become a pairwise fuzzy semi Volterra space and for a pairwise fuzzy semi Volterra space together with a pairwise fuzzy semi door space to become a pairwise fuzzy semi Baire space are established. Also, the inter-relations between pairwise fuzzy semi Volterra spaces and other fuzzy bitopological spaces such as pairwise fuzzy semi Baire space, pairwise fuzzy semi σ-Baire space, pairwise fuzzy semi D-Baire space, pairwise fuzzy semi GID-space, pairwise fuzzy semi door space are also discussed in this paper.

FUZZY PAIRWISE $\gamma$-IRRESOLUTE HOMEOMORPHISMS

  • Lee, Hyo-Sam;Lee, Joo-Sung;Im, Young-Bin
    • Journal of applied mathematics & informatics
    • /
    • 제26권3_4호
    • /
    • pp.757-766
    • /
    • 2008
  • We define and characterize a fuzzy pairwise $\gamma$-irresolute open mapping (fuzzy pairwise $\gamma$-irresolute closed mapping) on a fuzzy bitopological space. We also characterize a fuzzy pairwise $\gamma$-irresolute homeomorphism on a fuzzy bitopological space.

  • PDF

THE STRONG LAWS OF LARGE NUMBERS FOR WEIGHTED SUMS OF PAIRWISE QUADRANT DEPENDENT RANDOM VARIABLES

  • Kim, Tae-Sung;Baek, Jong-Il
    • 대한수학회지
    • /
    • 제36권1호
    • /
    • pp.37-49
    • /
    • 1999
  • We derive the almost sure convergence for weighted sums of random variables which are either pairwise positive quadrant dependent or pairwise positive quadrant dependent or pairwise negative quadrant dependent and then apply this result to obtain the almost sure convergence of weighted averages. e also extend some results on the strong law of large numbers for pairwise independent identically distributed random variables established in Petrov to the weighted sums of pairwise negative quadrant dependent random variables.

  • PDF

BETWEEN PAIRWISE -α- PERFECT FUNCTIONS AND PAIRWISE -T- α- PERFECT FUNCTIONS

  • ALI A. ATOOM;FERAS BANI-AHMAD
    • Journal of applied mathematics & informatics
    • /
    • 제42권1호
    • /
    • pp.15-29
    • /
    • 2024
  • Many academics employ various structures to expand topological space, including the idea of topology, as a result of the importance of topological space in analysis and some applications. One of the most notable of the generalizations was the definition of perfect functions in bitopological spaces, which was presented by Ali.A.Atoom and H.Z.Hdeib. We propose the notion of α- pairwise perfect functions in bitopological spaces and define different types of this concept in this study. Pairwise -T - α- perfect functions, pairwise -α-irr-perfect functions, and pairwise -T - α- irr-perfect functions, are all characterized in addition to pairwise -α-perfect functions. We go through their primary characteristics and show how they interact. Finally, under these functions, we introduce the images and inverse images of certain bitopological features. About these concepts, some product theorems have been discovered.

ON PAIRWISE GAUSSIAN BASES AND LLL ALGORITHM FOR THREE DIMENSIONAL LATTICES

  • Kim, Kitae;Lee, Hyang-Sook;Lim, Seongan;Park, Jeongeun;Yie, Ikkwon
    • 대한수학회지
    • /
    • 제59권6호
    • /
    • pp.1047-1065
    • /
    • 2022
  • For two dimensional lattices, a Gaussian basis achieves all two successive minima. For dimension larger than two, constructing a pairwise Gaussian basis is useful to compute short vectors of the lattice. For three dimensional lattices, Semaev showed that one can convert a pairwise Gaussian basis to a basis achieving all three successive minima by one simple reduction. A pairwise Gaussian basis can be obtained from a given basis by executing Gauss algorithm for each pair of basis vectors repeatedly until it returns a pairwise Gaussian basis. In this article, we prove a necessary and sufficient condition for a pairwise Gaussian basis to achieve the first k successive minima for three dimensional lattices for each k ∈ {1, 2, 3} by modifying Semaev's condition. Our condition directly checks whether a pairwise Gaussian basis contains the first k shortest independent vectors for three dimensional lattices. LLL is the most basic lattice basis reduction algorithm and we study how to use LLL to compute a pairwise Gaussian basis. For δ ≥ 0.9, we prove that LLL(δ) with an additional simple reduction turns any basis for a three dimensional lattice into a pairwise SV-reduced basis. By using this, we convert an LLL reduced basis to a pairwise Gaussian basis in a few simple reductions. Our result suggests that the LLL algorithm is quite effective to compute a basis with all three successive minima for three dimensional lattices.