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

검색결과 47건 처리시간 0.021초

A Note on the Semi-Continuity in Topological Space

  • Han, Chun Ho
    • 한국수학교육학회지시리즈A:수학교육
    • /
    • 제22권1호
    • /
    • pp.31-33
    • /
    • 1983
  • 이 논문에서는 Norman Levin의 논문에서 나타난 semi-open의 개념을 사용하여 정의된 semi-continuous의 여러가지 성질을 조사하였고, semi-continuity를 위상공간의 first-axiom공간 pseudo-metric공간과 n-th product공간까지 조사하였으며, semi-continuous함수의 합성과 함수열의 극한과 Proximity공간의 mapping에 대하여 조사하였다. 그리고 정리의 역이 성립하지 않는 경우 반례를 들어 보였다.

  • PDF

CORRIGENDUM TO "A DUAL ITERATIVE SUBSTRUCTURING METHOD WITH A SMALL PENALTY PARAMETER", [J. KOREAN MATH. SOC. 54 (2017), NO. 2, 461-477]

  • Lee, Chang-Ock;Park, Eun-Hee;Park, Jongho
    • 대한수학회지
    • /
    • 제58권3호
    • /
    • pp.791-797
    • /
    • 2021
  • In this corrigendum, we offer a correction to [J. Korean Math. Soc. 54 (2017), No. 2, 461-477]. We construct a counterexample for the strengthened Cauchy-Schwarz inequality used in the original paper. In addition, we provide a new proof for Lemma 5 of the original paper, an estimate for the extremal eigenvalues of the standard unpreconditioned FETI-DP dual operator.

MULTI-JENSEN AND MULTI-EULER-LAGRANGE ADDITIVE MAPPINGS

  • Abasalt Bodaghi;Amir Sahami
    • 대한수학회논문집
    • /
    • 제39권3호
    • /
    • pp.673-692
    • /
    • 2024
  • In this work, an alternative fashion of the multi-Jensen is introduced. The structures of the multi-Jensen and the multi-Euler-Lagrange-Jensen mappings are described. In other words, the system of n equations defining each of the mentioned mappings is unified as a single equation. Furthermore, by applying a fixed point theorem, the Hyers-Ulam stability for the multi-Euler-Lagrange-Jensen mappings in the setting of Banach spaces is established. An appropriate counterexample is supplied to invalidate the results in the case of singularity for multiadditive mappings.

함수 블록 다이어그램으로 구현된 PLC 프로그램에 대한 정형 검증 기법 (A Formal Verification Technique for PLC Programs Implemented with Function Block Diagrams)

  • 지은경;전승재;차성덕
    • 한국정보과학회논문지:컴퓨팅의 실제 및 레터
    • /
    • 제15권3호
    • /
    • pp.211-215
    • /
    • 2009
  • 프로그래머블 로직 콘트롤러(PLC)가 원자력 계측제어 시스템과 같은 안전 필수 시스템 구현에 많이 사용됨에 따라, PLC 프로그램에 대한 정형검증의 필요가 높아지고 있다. 본 연구에서는 함수 블록 다이어램(FBD)으로 구현된 PLC 프로그램에 대한 자동화된 정형검증 기법을 제안한다. FBD 프로그램을 검증하기 위해서 먼저 FBD 프로그램을 검증언어인 Verilog로 변환하고, 변환된 Verilog모델에 대해 SMV 모델체커를 호출해 모델체킹을 수행한다. 자동화를 위해 FBD Verifier 도구를 개발하였다. FBD Verifier는 FBD 프로그램으로부터 Verilog 모델로의 자동변환 기능뿐 아니라 모델체킹 결과 생성된 반례를 직관적이고 효과적으로 분석할 수 있는 기능 또한 제공한다. 제안된 기법과 도구를 사용해 원전계측제어시스템 개발사업단의 원자로 보호시스템에 대한 방대한 양의 FBD 프로그램을 성공적으로 검증하였다.

Some counterexamples of a skew-normal distribution

  • Zhao, Jun;Lee, Sang Kyu;Kim, Hyoung-Moon
    • Communications for Statistical Applications and Methods
    • /
    • 제26권6호
    • /
    • pp.583-589
    • /
    • 2019
  • Counterexamples of a skew-normal distribution are developed to improve our understanding of this distribution. Two examples on bivariate non-skew-normal distribution owning marginal skew-normal distributions are first provided. Sum of dependent skew-normal and normal variables does not follow a skew-normal distribution. Continuous bivariate density with discontinuous marginal density also exists in skew-normal distribution. An example presents that the range of possible correlations for bivariate skew-normal distribution is constrained in a relatively small set. For unified skew-normal variables, an example about converging in law are discussed. Convergence in distribution is involved in two separate examples for skew-normal variables. The point estimation problem, which is not a counterexample, is provided because of its importance in understanding the skew-normal distribution. These materials are useful for undergraduate and/or graduate teaching courses.

릴레이 모델 체킹을 이용한 상태 폭발 문제 해결 (Mitigating the State Explosion Problem using Relay Model Checking)

  • 이태훈;권기현
    • 한국정보과학회논문지:소프트웨어및응용
    • /
    • 제31권11호
    • /
    • pp.1560-1567
    • /
    • 2004
  • 모델 체킹에서 고려해야 할 상태의 수는 모델의 크기에 따라 지수적으로 증가한다. 이것을 상태 폭발 문제라고 부르며 이를 해결하기 위한 방법으로 추상화, 반순서, 대칭성 등이 폭 넓게 사용되고 있다. 이들 방법들은 모델의 구조 정보를 이용하여 모델의 크기를 축소하는 데 목표를 두고 있다. 이와는 달리, 본 논문에서는 논리식을 순서적으로 분할하여 차례대로 모델 체킹을 수행하는 릴레이 모델 체킹을 제안한다. 그리고 기존 모델 체킹 기법으로 해결하지 못했던 상태 폭발 문제를 릴레이 모델 체킹으로 해결한 경험을 기술한다.

A SUFFICIENT CONDITION FOR ACYCLIC 5-CHOOSABILITY OF PLANAR GRAPHS WITHOUT 5-CYCLES

  • Sun, Lin
    • 대한수학회보
    • /
    • 제55권2호
    • /
    • pp.415-430
    • /
    • 2018
  • A proper vertex coloring of a graph G is acyclic if G contains no bicolored cycle. A graph G is acyclically L-list colorable if for a given list assignment $L=\{L(v):v{\in}V(G)\}$, there exists an acyclic coloring ${\phi}$ of G such that ${\phi}(v){\in}L(v)$ for all $v{\in}V(G)$ A graph G is acyclically k-choosable if G is acyclically L-list colorable for any list assignment with $L(v){\geq}k$ for all $v{\in}V(G)$. Let G be a planar graph without 5-cycles and adjacent 4-cycles. In this article, we prove that G is acyclically 5-choosable if every vertex v in G is incident with at most one i-cycle, $i {\in}\{6,7\}$.

A BORSUK-ULAM TYPE THEOREM OVER ITERATED SUSPENSIONS OF REAL PROJECTIVE SPACES

  • Tanaka, Ryuichi
    • 대한수학회지
    • /
    • 제49권2호
    • /
    • pp.251-263
    • /
    • 2012
  • A CW complex B is said to be I-trivial if there does not exist a $\mathbb{Z}_2$-map from $S^{i-1}$ to S(${\alpha}$) for any vector bundle ${\alpha}$ over B a any integer i with i > dim ${\alpha}$. In this paper, we consider the question of determining whether $\Sigma^k\mathbb{R}P^n$ is I-trivial or not, and to this question we give complete answers when k $\neq$ 1, 3, 8 and partial answers when k = 1, 3, 8. A CW complex B is I-trivial if it is "W-trivial", that is, if for every vector bundle over B, all the Stiefel-Whitney classes vanish. We find, as a result, that $\Sigma^k\mathbb{R}P^n$ is a counterexample to the converse of th statement when k = 2, 4 or 8 and n $\geq$ 2k.

ON KRAMER-MESNER MATRIX PARTITIONING CONJECTURE

  • Rho, Yoo-Mi
    • 대한수학회지
    • /
    • 제42권4호
    • /
    • pp.871-881
    • /
    • 2005
  • In 1977, Ganter and Teirlinck proved that any $2t\;\times\;2t$ matrix with 2t nonzero elements can be partitioned into four sub-matrices of order t of which at most two contain nonzero elements. In 1978, Kramer and Mesner conjectured that any $mt{\times}nt$ matrix with kt nonzero elements can be partitioned into mn submatrices of order t of which at most k contain nonzero elements. In 1995, Brualdi et al. showed that this conjecture is true if $m = 2,\;k\;\leq\;3\;or\;k\geq\;mn-2$. They also found a counterexample of this conjecture when m = 4, n = 4, k = 6 and t = 2. When t = 2, we show that this conjecture is true if $k{\leq}5$.

GLOBALLY DETERMINED ALGEBRAS

  • Kang, Young-Yug
    • 대한수학회논문집
    • /
    • 제9권2호
    • /
    • pp.285-291
    • /
    • 1994
  • This paper is a contribution to the study of the isomorphism problems for algebras. Among the isomorphism problems, that of global determination is investigated here. That is, our investigation of the problems is concerned with the question whether two algebras are isomorphic when their globals are isomorphic. The answer is not always affirmative. The counterexample, due to E. M. Mogiljanskaja, is the class of all infinite semigroups. But T. Tamura and J. Shafer [6] proved that the class of all groups is globally determined and announced the same result for the class of rectangular bands. Vazenin [7] proved that for any set X, the transformation semigroup $T_{X}$ must be isomorphic to any semigroup S for any P(S)$\simeq$P($T_{X}/TEX>).(omitted)

  • PDF