• Title/Summary/Keyword: Coincidence set

Search Result 34, Processing Time 0.021 seconds

VARIATION OF ORBIT-COINCIDENCE SETS

  • Srivastava, Anjali
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.15 no.1
    • /
    • pp.1-6
    • /
    • 2002
  • David Gavid [3] proved that in many familiar cases the upper semi-finite topology on the set of closed subsets of a space is the largest topology making the coincidence function continuous, when the collection of functions is given the graph topology. Considering G-spaces and taking the coincidence set to consist of points where orbits coincidence, we obtain G-version of many of his results.

  • PDF

SELECTION THEOREMS WITH n-CONNECTDENESS

  • In-Sook Kim
    • Journal of the Korean Mathematical Society
    • /
    • v.35 no.1
    • /
    • pp.165-175
    • /
    • 1998
  • We give a generalization of the selection theorem of Ben-El-Mechaiekh and Oudadess to complete LD-metric spaces with the aid of the notion of n-connectedness. Our new selection theorem is used to obtain new results of fixed points and coincidence points for compact lower semicontinuous set-valued maps with closed values consisting of D-sets in a complete LD-metric space.

  • PDF

COUPLED COINCIDENCE POINT RESULTS WITH MAPPINGS SATISFYING RATIONAL INEQUALITY IN PARTIALLY ORDERED METRIC SPACES

  • CHOUDHURY, BINAYAK S.;KONAR, PULAK;METIYA, NIKHILESH
    • Journal of applied mathematics & informatics
    • /
    • v.37 no.1_2
    • /
    • pp.1-11
    • /
    • 2019
  • In this paper we prove certain coupled coincidence point and coupled common fixed point results in partially ordered metric spaces for a pair of compatible mappings which satisfy certain rational inequality. The results are supported with two examples.

On the fixed-point theorems on the infrasolvmanifolds

  • Chun, Dae-Shik;Jang, Chan-Gyu;Lee, Sik
    • Communications of the Korean Mathematical Society
    • /
    • v.10 no.3
    • /
    • pp.681-688
    • /
    • 1995
  • Fixed-point theory has an extension to coincidences. For a pair of maps $f,g:X_1 \to X_2$, a coincidence of f and g is a point $x \in X_1$ such that $f(x) = g(x)$, and $Coin(f,g) = {x \in X_1 $\mid$ f(x) = g(x)}$ is the coincidence set of f and g. The Nielsen coincidence number N(f,g) and the Lefschetz coincidence number L(f,g) are used to estimate the cardinality of Coin(f,g). The aspherical manifolds whose fundamental group has a normal solvable subgroup of finite index is called infrasolvmanifolds. We show that if $M_1,M_2$ are compact connected orientable infrasolvmanifolds, then $N(f,g) \geq $\mid$L(f,g)$\mid$$ for every $f,g : M_1 \to M_2$.

  • PDF

GENERALIZED ANTI FUZZY SUBGROUPS

  • Jun, Young-Bae;Song, Seok-Zun
    • East Asian mathematical journal
    • /
    • v.22 no.2
    • /
    • pp.195-205
    • /
    • 2006
  • Using the notion of anti fuzzy points and its besideness to and non-quasi-coincidence with a fuzzy set, new concepts of an anti fuzzy subgroup are introduced and their inter-relations are investigated.

  • PDF

COINCIDENCE THEOREMS ON A PRODUCT OF GENERALIZED CONVEX SPACES AND APPLICATIONS TO EQUILIBRIA

  • Park, Se-Hie;Kim, Hoon-Joo
    • Journal of the Korean Mathematical Society
    • /
    • v.36 no.4
    • /
    • pp.813-828
    • /
    • 1999
  • In this paper, we give a Peleg type KKM theorem on G-convex spaces and using this, we obtain a coincidence theorem. First, these results are applied to a whole intersection property, a section property, and an analytic alternative for multimaps. Secondly, these are used to proved existence theorems of equilibrium points in qualitative games with preference correspondences and in n-person games with constraint and preference correspondences for non-paracompact wetting of commodity spaces.

  • PDF

Development and Application of the GIS-based Global Cadastral Non-coincidence Surveying Method for the Cadastral Re-survey (지적재조사를 위한 GIS 기반의 광역 지적불부합지 조사 기법의 개발과 적용)

  • Hong Sung Eon;Yi Seong Kyu;Park Soohong
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.23 no.1
    • /
    • pp.19-30
    • /
    • 2005
  • Korean government has constructed a nationwide cadastral map database through the cadastral map computerization project and also produced a variety of spatial data through the NGIS (National Geographic Information Systems) project. Under this circumstance, it is needed to set up the new automatic methodology that effectively solve cadastral non-coincidence problems by using various digital map data instead of expensive field survey methods. This study proposed a new automatic methodology for cadastral non-coincidence surveying and developed a prototype system as a proof of concept. Validation of this proposed method was done with some test areas. Results showed that this methodology could easily detect and assess both regional non-coincidence levels and cadastral map quadrangle non-coincidence levels. We expect that this new methodology can provide many benefits in planning and determining work priority of the forthcoming nationwide cadastral re-surveying project.

Short and Efficient Frequency Hopping Codes (짧고 효과적인 주파수 도약 수열 생성)

  • Kim Young-Joon;Kim Dae-Son;Song Hong-Yeop
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.4C
    • /
    • pp.318-323
    • /
    • 2006
  • In this paper we propose three methods to generate short hopping sequences for the frequency hopping system. First, we explain the one coincidence set of sequences and the polyphase power residue seqences which have been known previously, and we suggest a method by modifying the one coincidence sequence and two methods by using the power residue sequences. We verify that the optimal position deleted-power residue sequences have the best Hamming autocorrelation property and the first position deleted-power residue sequences and the modified one coincidence sequences follows with respect to Hamming autocorrelation. We also explain that these sequences have the good balance property and can be implemented with low complexity.