• Title/Summary/Keyword: counterexample

Search Result 47, Processing Time 0.031 seconds

ON CONTINUOUS MODULE HOMOMORPHISMS BETWEEN RANDOM LOCALLY CONVEX MODULES

  • Zhang, Xia
    • Journal of the Korean Mathematical Society
    • /
    • v.50 no.5
    • /
    • pp.933-944
    • /
    • 2013
  • Based on the four kinds of theoretical definitions of the continuous module homomorphism between random locally convex modules, we first show that among them there are only two essentially. Further, we prove that such two are identical if the family of $L^0$-seminorms for the former random locally convex module has the countable concatenation property, meantime we also provide a counterexample which shows that it is necessary to require the countable concatenation property.

ON THE TRANSFINITE POWERS OF THE JACOBSON RADICAL OF A DICC RING

  • Albu, Toma;Teply, Mark L.
    • Journal of the Korean Mathematical Society
    • /
    • v.38 no.6
    • /
    • pp.1117-1123
    • /
    • 2001
  • A ring is a DICC ring if every chain of right ideals in-dexed by the integers stabilizes to the left or to the right or to both sides. A counterexample is given to an assertion of karamzadeh and Motamedi that a transfinite power of the Jacobson radical of a right DICC ring is zero. we determine the behavior of the transfinite powers of the Jacobson radical relative to a torsion theory and consequently can obtain their correct behavior in the classical setting.

  • PDF

A Note on Statistically Monotonic and Bounded Sequences of Fuzzy Numbers

  • Hong, Dug-Hun;Kim, Kyung-Tae
    • Journal of the Korean Data and Information Science Society
    • /
    • v.17 no.2
    • /
    • pp.657-659
    • /
    • 2006
  • This note gives a counterexample showing that a main theorem of Aytal and Pehliven's (Information Sciences 176 (2006) 734-744) result on statically monotonic and bounded sequences of fuzzy numbers is not valid.

  • PDF

일반화된 Feistel 구조와 Nyberg의 가설

  • 지성택;박춘식;임종인;성수학
    • Proceedings of the Korea Institutes of Information Security and Cryptology Conference
    • /
    • 1998.12a
    • /
    • pp.335-343
    • /
    • 1998
  • In Asiacrypt'96, Nyberg obtained an upper bound of the maximum average of differential probability for a generalized Feistel network. In this paper, we prove a counterexample to Nyberg's result is given.

  • PDF

ELASTIC SPACES AND MONOTONICALLY NORMAL SPACES

  • Bae, Chulkon
    • The Mathematical Education
    • /
    • v.13 no.2
    • /
    • pp.29-31
    • /
    • 1974
  • P.Zenor에 의해서 Monotonically Normal space가 정의되었으며 그후 R. Health와 D. Lutzer에 의해서 Linearly ordered topological space가 Monotonically Normal 임을 증명했다. 한편 Zenor는 Monotonically Normal Space의 hereditary에 관한 것을 question으로 남겼는데 Health와 Lutzer가 증명했고 또 그 증명보다 더 간단한 증명을 Calos R. Boyers가 증명했다[3]. 뿐만 아니라 그 결과로서 Linearly ordered topological space와 Elastic space 가 Monotonically Normal space임을 밝혔다. 또 [4]에서 Gary Gruenhage가 Monotonically Normal space가 Elastic space가 안됨을 counterexample을 들어서 증명했다. 결론적으로 Monotonically Normal spare와 Elastic space는 완전히 분리되었다. 또 Elastic space의 closed continuous image는 paracompact이고 Monotonically Normal 임을 증명했다. 이 논문에서는 본인이 밝힌 것은 Monotonically Normal space의 closed continuous image가 Mono tonically Normal임을 밝혔다.

  • PDF

OPTIMALITY CONDITIONS AND DUALITY RESULTS OF THE NONLINEAR PROGRAMMING PROBLEMS UNDER ρ-(p, r)-INVEXITY ON DIFFERENTIABLE MANIFOLDS

  • Jana, Shreyasi;Nahak, Chandal
    • Journal of applied mathematics & informatics
    • /
    • v.32 no.3_4
    • /
    • pp.491-502
    • /
    • 2014
  • In this paper, by using the notion of ${\rho}$-(p,r)-invexity assumptions on the functions involved, optimality conditions and duality results (Mond-Weir, Wolfe and mixed type) are established on differentiable manifolds. Counterexample is constructed to justify that our investigations are more general than the existing work available in the literature.

The revised quickest path algorithm (수정된 최속경로 알고리즘)

  • 이상욱;박찬규;박순달
    • Journal of the military operations research society of Korea
    • /
    • v.26 no.2
    • /
    • pp.1-7
    • /
    • 2000
  • A quickest path in a network is a path that takes the shortest time to send the amount of data from the source node to the sink node. Martin and Santos presented a theorem on the quickest path by which a quickest path for the amount of data is determined. However, we find a counterexample to Martins and Santos' theorem. In this paper, we present the corrected theorem and give a revised algorithm for finding quickest paths.

  • PDF

TOPOLOGICAL METHOD DOES NOT WORK FOR FRANKEL-MCDUFF CONJECTURE

  • Kim, Min Kyu
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.20 no.1
    • /
    • pp.31-35
    • /
    • 2007
  • In dealing with transformation group, topological approach is very natural. But, it is not sufficient to investigate geometric properties of transformation group and we need geometric method. Frankel-McDuff Conjecture is very interesting in the point that it shows struggling between topological method and geometric method. In this paper, the author suggest generalized Frankel-McDuff conjecture as a topological version of the conjecture and construct a counterexample for the generalized version, and from this we assert that topological method does not work for Frankel-McDuff Conjecture.

  • PDF