• Title/Summary/Keyword: reduction theorem

Search Result 57, Processing Time 0.019 seconds

Some Notes on the Temporal Single-System Interpretation of Marxian Value Theory (마르크스 가치론의 이시적 단일체계 해석에 대한 몇 가지 비판적 논점)

  • Park, Hyun Woong
    • 사회경제평론
    • /
    • v.31 no.2
    • /
    • pp.105-126
    • /
    • 2018
  • In this paper, I makes some critical comments on the temporal single-system interpretation (TSSI) of Marxian value theory. The first concerns the claim that the Fundamental Marxian Theorem (FMT) holds within the TSSI under completely general conditions. Based on the idea that the nominal profit does not well fit the FMT, the TSSI proponents suggest that more relevant for proving the TSSI FMT is the real profit, defined by deflating the output prices. In contrast, I propose a more general approach where three possible concepts of profit are all considered, in which case the result is that whether the FMT holds within the TSSI is indeterminate. Second, the refutation of the Okishio theorem presented in Kliman (1996) is critically examined, focusing on the criticism raised in the literature that the Kliman model ignores the cost-reduction criterion as for the technical change and therefore cannot be considered as an internal refutation of the Okishio theorem. Drawing upon the criticism, I explicitly incorporate the cost-reduction criterion into the Kliman model and show that the continuous labor-saving technical change of the Kliman model is not necessarily cost-reducing and under certain conditions is cost-neutral or cost-raising.

A BIJECTIVE PROOF OF r = 1 REDUCTION FORMULA FOR LITTLEWOOD-RICHARDSON COEFFICIENTS

  • Moon, Dong-Ho
    • Honam Mathematical Journal
    • /
    • v.32 no.2
    • /
    • pp.271-281
    • /
    • 2010
  • Inspired by the reduction formulae between intersection numbers on Grassmannians obtained by Griffiths-Harris and the factorization theorem of Littlewood-Richardson coefficients by King, Tollu and Toumazet, eight reduction formulae has been discovered by the author and others. In this paper, we prove r = 1 reduction formula by constructing a bijective map between suitable sets of Littlewood-Richardson tableaux.

REDUCTION METHOD APPLIED TO THE NONLINEAR BIHARMONIC PROBLEM

  • Jung, Tacksun;Choi, Q-Heung
    • Korean Journal of Mathematics
    • /
    • v.18 no.1
    • /
    • pp.87-96
    • /
    • 2010
  • We consider the semilinear biharmonic equation with Dirichlet boundary condition. We give a theorem that there exist at least three nontrivial solutions for the semilinear biharmonic boundary value problem. We show this result by using the critical point theory, the finite dimensional reduction method and the shape of the graph of the corresponding functional on the finite reduction subspace.

Asymptotic Properties of Variance Change-point in the Long-memory Process

  • Chu Minjeong;Cho Sinsup
    • Proceedings of the Korean Statistical Society Conference
    • /
    • 2000.11a
    • /
    • pp.23-26
    • /
    • 2000
  • It is noted that many econometric time series have long-memory properties. A long-memory process, or strongly dependent process, is characterized by hyperbolic decaying autocorrelations and unbounded spectral density at the origin. Since the long-memory property can be observed by data obtained from rather a long period, there is some possibility of parameter change in the process. In this paper, we consider the estimation of change-point when there is a change in the variance of a long-memory process. The estimator is based on some reasonable statistic and the consistency is shown using Taqqu's strong reduction theorem

  • PDF

Reduction Method of Computational Complexity for Image Filtering Utilizing the Factorization Theorem (인수분해 공식을 이용한 영상 필터링 연산량 저감 방법)

  • Jung, Chan-sung;Lee, Jaesung
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2013.05a
    • /
    • pp.354-357
    • /
    • 2013
  • The filtering algorithm is used very frequently in the preprocessing stage of many image processing algorithms in computer vision processing. Because video signals are two-dimensional signals, computaional complexity is very high. To reduce the complexity, separable filters and the factorization theorem is applied to the filtering operation. As a result, it is shown that a significant reduction in computational complexity is achieved, although the experimental results could be slightly different depending on the condition of the image.

  • PDF

ASYMPTOTICALLY LINEAR BEAM EQUATION AND REDUCTION METHOD

  • Choi, Q-Heung;Jung, Tacksun
    • Korean Journal of Mathematics
    • /
    • v.19 no.4
    • /
    • pp.481-493
    • /
    • 2011
  • We prove a theorem which shows the existence of at least three ${\pi}$-periodic solutions of the wave equation with asymptotical linearity. We obtain this result by the finite dimensional reduction method which reduces the critical point results of the infinite dimensional space to those of the finite dimensional subspace. We also use the critical point theory and the variational method.

NUMBER OF THE NONTRIVIAL SOLUTIONS OF THE NONLINEAR BIHARMONIC PROBLEM

  • Jung, Tacksun;Choi, Q-Heung
    • Korean Journal of Mathematics
    • /
    • v.18 no.2
    • /
    • pp.201-211
    • /
    • 2010
  • We investigate the number of the nontrivial solutions of the nonlinear biharmonic equation with Dirichlet boundary condition. We give a theorem that there exist at least three nontrivial solutions for the nonlinear biharmonic problem. We prove this result by the finite dimensional reduction method and the shape of the graph of the corresponding functional on the finite reduction subspace.

Expert System On Advanced load shedding (개선된 부하차단에 관한 전문가 시스템)

  • Kim, Jae-Chul;Kim, Eung-Sang;You, Mi-Bog
    • Proceedings of the KIEE Conference
    • /
    • 1991.07a
    • /
    • pp.354-357
    • /
    • 1991
  • In the case of system operation, a line overload cause damage to spread an whole range of power system. Of the theorems on load shedding, this study applied power distribution theorem and load reduction theorem which are local load shedding method, which are not affected by the magnitude of the power system and need not a large memory capacity and computation time. In this paper, we treat the problem of overload when power system occurred to fatal fault. Especially, there is the special case that local load shedding theorem is not always solved. Therefore, we introduce a solved device of the problem and construct the expert system of expanded local load shedding. Because proposed method uses the merits of expert system, in the case of system operation, the system operator don't embarrass to fatal fault and promptly deals with.

  • PDF

An Edge Removal Algorithm for the Reliability Evaluation of Directed Communication Networks (방향성 통신망의 신뢰도 계정에 관한 에지제거 알고리즘)

  • 임윤구;오영환
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.13 no.1
    • /
    • pp.63-73
    • /
    • 1988
  • In this paper, an algorithm is proposed to evaluate the source-to-terminal reliability, the probability that a source node can communicate with a terminal node, in a probabilistic derected graph. By using Satyanaratana's factoring $theorem^{(7)}$, the original graph can be partitioned into two reduced graphs obtained by contracting and deleting the edge connected to the source node in the probabilistic directed graph. The edge removal proposed in this paper and the general series-parallel reduction can then be applied to the reduced graph. This edge reduction can be applied recursively to the reduced graphs until a source node can be connected to a terminal node by one edge. A computer program which can be applied to evaluating the source-to-terminal reliability in a complex and large network has also been developed.

  • PDF