• Title/Summary/Keyword: proof theory

Search Result 175, Processing Time 0.025 seconds

A BIJECTIVE PROOF OF THE SECOND REDUCTION FORMULA FOR LITTLEWOOD-RICHARDSON COEFFICIENTS

  • Cho, Soo-Jin;Jung, Eun-Kyoung;Moon, Dong-Ho
    • Bulletin of the Korean Mathematical Society
    • /
    • v.45 no.3
    • /
    • pp.485-494
    • /
    • 2008
  • There are two well known reduction formulae for structural constants of the cohomology ring of Grassmannians, i.e., Littlewood-Richardson coefficients. Two reduction formulae are a conjugate pair in the sense that indexing partitions of one formula are conjugate to those of the other formula. A nice bijective proof of the first reduction formula is given in the authors' previous paper while a (combinatorial) proof for the second reduction formula in the paper depends on the identity between Littlewood-Richardson coefficients of conjugate shape. In this article, a direct bijective proof for the second reduction formula for Littlewood-Richardson coefficients is given. Our proof is independent of any previously known results (or bijections) on tableaux theory and supplements the arguments on bijective proofs of reduction formulae in the authors' previous paper.

Using Practice Context Models to Knowledge Management in Proof-of-Concept Activities: A Contribution of Knowledge Networks and Percolation Theory

  • Neto, Antonio Jose Rodrigues;Borges, Maria Manuel;Roque, Licinio
    • Journal of Information Science Theory and Practice
    • /
    • v.9 no.1
    • /
    • pp.1-23
    • /
    • 2021
  • This study introduces novel research using Practice Context Models supported by Knowledge Networks and Percolation Theory with the aim to contribute to knowledge management in Proof-of-Concept (PoC) activities. The authors envision this proposal as a potential instrument to identify network structures based on a percolation (propagation) threshold and to analyze the importance of nodes (e.g., practitioners, practices, competencies, movements, and scenarios) during the percolation of knowledge in PoC activities. After thirty months immersed in the natural PoC habitat, acting as observers and practitioners, and supported by an ethnographic exercise and a designer-research mindset, the authors identified the production of meaning in PoC activities occurring in a hermeneutic circle characterized by the presence of several knowledge networks; thus, discovering the 'natural knowledge' in PoC as a spectrum of cognitive development spread throughout its network, as each node could produce and disseminate certain knowledge that flows and influences other nodes. Therefore, this research presents the use of Practice Context Models 'connected' to Knowledge Networks and Percolation Theory as a potential and feasible proposal to be built using the attribution of values (weights) to the nodes (e.g., practitioners, practices, competencies, movements, scenarios, and also knowledge) in the context of PoC with the aim to allow the players (e.g., PoC practitioners) to have more flexibility in building alliances with other players (new nodes); that is, focusing on those nodes with higher value (focus on quality) in collaboration networks, i.e., alliances (connections) with the aim to contribute to knowledge management in the context of PoC.

History of Morse theory (Morse 이론의 역사)

  • Park, Ki-Sung
    • Journal for History of Mathematics
    • /
    • v.19 no.4
    • /
    • pp.107-116
    • /
    • 2006
  • This article reviews the exciting developments in Morse theory by S.Smale, Freedmann and others, including a proof of the generalized Poincare' Conjecture in the handle body theory. We study its relations with handle body theory _and geodesic theory.

  • PDF

Cognitive Psychological Approaches on Analysing Students' Mathematical Errors (인지심리학의 관점에서 수학적 오류의 분석가능성 탐색)

  • 김부미
    • Journal of Educational Research in Mathematics
    • /
    • v.14 no.3
    • /
    • pp.239-266
    • /
    • 2004
  • This article presents new perspectives for analysing and diagnosing students' mathematical errors on the basis of Pascaul-Leone's neo-Piagetian theory. Although Pascaul-Leone's theory is a cognitive developmental theory, its psychological mechanism gives us new insights on mathematical errors. We analyze mathematical errors in the domain of proof problem solving comparing Pascaul-Leone's psychological mechanism with mathematical errors and diagnose misleading factors using Schoenfeld's levels of analysis and structure and fuzzy cognitive map(FCM). FCM can present with cause and effect among preconceptions or misconceptions that students have about prerequisite proof knowledge and problem solving. Conclusions could be summarized as follows: 1) Students' mathematical errors on proof problem solving and LC learning structures have the same nature. 2) Structures in items of students' mathematical errors and misleading factor structures in cognitive tasks affect mental processes with the same activation mechanism. 3) LC learning structures were activated preferentially in knowledge structures by F operator. With the same activation mechanism, the process students' mathematical errors were activated firstly among conceptions could be explained.

  • PDF

TYPE SPACES AND WASSERSTEIN SPACES

  • Song, Shichang
    • Journal of the Korean Mathematical Society
    • /
    • v.55 no.2
    • /
    • pp.447-469
    • /
    • 2018
  • Types (over parameters) in the theory of atomless random variable structures correspond precisely to (conditional) distributions in probability theory. Moreover, the logic (resp. metric) topology on the type space corresponds to the topology of weak (resp. strong) convergence of distributions. In this paper, we study metrics between types. We show that type spaces under $d^{\ast}-metric$ are isometric to Wasserstein spaces. Using optimal transport theory, two formulas for the metrics between types are given. Then, we give a new proof of an integral formula for the Wasserstein distance, and generalize some results in optimal transport theory.

FIXED POINT THEORY FOR PERMISSIBLE MAPS VIA INDEX THEORY

  • Balaj, Mircea;Cho, Yeol-Je;O'Regan, Donal
    • East Asian mathematical journal
    • /
    • v.24 no.1
    • /
    • pp.97-103
    • /
    • 2008
  • New fixed point theorems for permissible maps between $Fr{\acute{e}}chet$ spaces are presented. The proof relies on index theory developed by Dzedzej and on viewing a $Fr{\acute{e}}chet$ space as the projective limit of a sequence of Banach spaces.

  • PDF

NOTE ON THE DECOMPOSITION OF STATES

  • Hyeon, Donghoon;Kim, Jaekwang
    • Bulletin of the Korean Mathematical Society
    • /
    • v.55 no.4
    • /
    • pp.1221-1230
    • /
    • 2018
  • We derive a sharp decomposition formula for the state polytope of the Hilbert point and the Hilbert-Mumford index of reducible varieties by using the decomposition of characters and basic convex geometry. This proof captures the essence of the decomposition of the state polytopes in general, and considerably simplifies an earlier proof by the authors which uses a careful analysis of initial ideals of reducible varieties.

A PROOF OF THE MOST IMPORTANT IDENTITY INVOLVED IN THE BETA FUNCTION

  • Choi, June-Sang
    • The Pure and Applied Mathematics
    • /
    • v.4 no.1
    • /
    • pp.71-76
    • /
    • 1997
  • A new proof of the well-known identity involved in the Beta function B(p, q) is given by using the theory of hypergeometric series and a brief history of Gamma function is also provided. The method here is shown to be able to apply to evaluate some definite integrals.

  • PDF

A NOTE ON THE MAXIMUM ENTROPY WEIGHTING FUNCTION PROBLEM

  • Hong, Dug-Hun;Kim, Kyung-Tae
    • Journal of applied mathematics & informatics
    • /
    • v.23 no.1_2
    • /
    • pp.547-552
    • /
    • 2007
  • In this note, we extends some of the results of Liu [Fuzzy Sets and systems 157 (2006) 869-878]. This extension consists of a simple proof involving weighted functions and their preference index. We also give an elementary simple proof of the maximum entropy weighting function problem with a given preference index value without using any advanced theory like variational principles or without using Lagrangian multiplier methods.

Formalization of the Meta-Theory of a Programming Language with Binders (프로그래밍 언어 메타이론의 정형화 및 변수 묶기)

  • Lee, Gye-Sik
    • Journal of KIISE:Software and Applications
    • /
    • v.35 no.12
    • /
    • pp.800-807
    • /
    • 2008
  • We introduce some well-known approaches to formalization and automatization of the meta-theory of a programming language with binders. They represent the trends in POPLmark Challenge. We demonstrate some characteristics of each approach by showing how to formalize some basic notations and concepts of Lambda-calculus using the proof assistant Coq.