• Title/Summary/Keyword: reduction theorem

Search Result 56, Processing Time 0.025 seconds

AN EXTENSION OF REDUCTION FORMULA FOR LITTLEWOOD-RICHARDSON COEFFICIENTS

  • Cho, Soo-Jin;Jung, Eun-Kyoung;Moon, Dong-Ho
    • Journal of the Korean Mathematical Society
    • /
    • v.47 no.6
    • /
    • pp.1197-1222
    • /
    • 2010
  • There is a well-known classical reduction formula by Griffiths and Harris for Littlewood-Richardson coefficients, which reduces one part from each partition. In this article, we consider an extension of the reduction formula reducing two parts from each partition. This extension is a special case of the factorization theorem of Littlewood-Richardson coefficients by King, Tollu, and Toumazet (the KTT theorem). This case of the KTT factorization theorem is of particular interest, because, in this case, the KTT theorem is simply a reduction formula reducing two parts from each partition. A bijective proof using tableaux of this reduction formula is given in this paper while the KTT theorem is proved using hives.

ELEMENTARY MATRIX REDUCTION OVER ZABAVSKY RINGS

  • Chen, Huanyin;Sheibani, Marjan
    • Bulletin of the Korean Mathematical Society
    • /
    • v.53 no.1
    • /
    • pp.195-204
    • /
    • 2016
  • We prove, in this note, that a Zabavsky ring R is an elementary divisor ring if and only if R is a $B{\acute{e}}zout$ ring. Many known results are thereby generalized to much wider class of rings, e.g. [4, Theorem 14], [7, Theorem 4], [9, Theorem 1.2.14], [11, Theorem 4] and [12, Theorem 7].

CODIMENSION REDUCTION FOR REAL SUBMANIFOLDS OF QUATERNIONIC PROJECTIVE SPACE

  • Kwon, Jung-Hwan;Pak, Jin-Suk
    • Journal of the Korean Mathematical Society
    • /
    • v.36 no.1
    • /
    • pp.109-123
    • /
    • 1999
  • In this paper we prove a reduction theorem of the codimension for real submanifold of quaternionic projective space as a quaternionic analogue corresponding to those in Cecil [4], Erbacher [5] and Okumura [9], and apply the theorem to quaternionic CR- submanifold of quaternionic projective space.

  • PDF

THEORY OF INFINITELY NEAR SINGULAR POINTS

  • Hironaka, Heisuke
    • Journal of the Korean Mathematical Society
    • /
    • v.40 no.5
    • /
    • pp.901-920
    • /
    • 2003
  • The notion of infinitely near singular points, classical in the case of plane curves, has been generalized to higher dimensions in my earlier articles ([5], [6], [7]). There, some basic techniques were developed, notably the three technical theorems which were Differentiation Theorem, Numerical Exponent Theorem and Ambient Reduction Theorem [7]. In this paper, using those results, we will prove the Finite Presentation Theorem, which the auther believes is the first of the most important milestones in the general theory of infinitely near singular points. The presentation is in terms of a finitely generated graded algebra which describes the total aggregate of the trees of infinitely near singular points. The totality is a priori very complex and intricate, including all possible successions of permissible blowing-ups toward the reduction of singularities. The theorem will be proven for singular data on an ambient algebraic shceme, regular and of finite type over any perfect field of any characteristics. Very interesting but not yet apparent connections are expected with many such works as ([1], [8]).

CRITICAL POINT THEORY AND AN ASYMMETRIC BEAM EQUATION WITH TWO JUMPING NONLINEAR TERMS

  • Jung, Tacksun;Choi, Q-Heung
    • Korean Journal of Mathematics
    • /
    • v.17 no.3
    • /
    • pp.299-314
    • /
    • 2009
  • We investigate the multiple nontrivial solutions of the asymmetric beam equation $u_{tt}+u_{xxxx}=b_1[{(u + 2)}^+-2]+b_2[{(u + 3)}^+-3]$ with Dirichlet boundary condition and periodic condition on t. We reduce this problem into a two-dimensional problem by using variational reduction method and apply the Mountain Pass theorem to find the nontrivial solutions of the equation.

  • PDF

TWO JUMPING NONLINEAR TERMS AND A NONLINEAR WAVE EQUATION

  • Jung, Tacksun;Choi, Q-Heung
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.22 no.4
    • /
    • pp.675-687
    • /
    • 2009
  • We find the multiple nontrivial solutions of the equation of the form $u_{tt}-u_{xx}=b_1[(u+1)^{+}-1]+b_2[(u+2)^{+}-2]$ with Dirichlet boundary condition. Here we reduce this problem into a two-dimensional problem by using variational reduction method and apply the Mountain Pass theorem to find the nontrivial solutions.

  • PDF

EXISTENCE OF SIX SOLUTIONS OF THE NONLINEAR HAMILTONIAN SYSTEM

  • Jung, Tack-Sun;Choi, Q-Heung
    • Honam Mathematical Journal
    • /
    • v.30 no.3
    • /
    • pp.443-468
    • /
    • 2008
  • We give a theorem of existence of six nontrivial solutions of the nonlinear Hamiltonian system $\.{z}$ = $J(H_z(t,z))$. For the proof of the theorem we use the critical point theory induced from the limit relative category of the torus with three holes and the finite dimensional reduction method.

Implementation of 2,048-bit RSA Based on RNS(Residue Number Systems) (RNS(Residue Number Systems) 기반의 2,048 비트 RSA 설계)

  • 권택원;최준림
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.41 no.4
    • /
    • pp.57-66
    • /
    • 2004
  • This paper proposes the design of a 2,048-bit RSA based on RNS(residue number systems) Montgomery modular multiplier As the systems that RNS processes a fast parallel modular multiplication for a large word partitioned into small words, we introduce Montgomery reduction method(MRM)[1]based on Wallace tree modular multiplier and 33 RNS bases with 64-bit size for RNS Montgomery modular multiplication in this paper. Also, for fast RNS modular multiplication, a modified method based on Chinese remainder theorem(CRT)[2] is presented. We have verified 2,048-bit RSA based on RNS using Samsung 0.35${\mu}{\textrm}{m}$ technology and the 2,048-bit RSA is performed in 2.54㎳ at 100MHz.

Polygon Reduction Algorithm for Three-dimensional Surface Visualization (3차원 표면 가시화를 위한 다각형 감소 알고리즘)

  • 유선국;이경상;배수현;김남현
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.53 no.5
    • /
    • pp.368-373
    • /
    • 2004
  • Surface visualization can be useful, particularly for internet-based education and simulation system. Since the mesh data size directly affects the downloading and operational performance, the problem that should be solved for efficient surface visualization is to reduce the total number of polygons, constituting the surface geometry as much as Possible. In this paper, an efficient polygon reduction algorithm based on Stokes' theorem, and topology preservation to delete several adjacent vertices simultaneously for past polygon reduction is proposed. The algorithm is irrespective of the shape of polygon, and the number of the polygon. It can also reduce the number of polygons to the minimum number at one time. The performance and the usefulness for medical imaging application was demonstrated using synthesized geometrical objects including plane. cube. cylinder. and sphere. as well as a real human data.

ONE-DIMENSIONAL JUMPING PROBLEM INVOLVING p-LAPLACIAN

  • Jung, Tacksun;Choi, Q-Heing
    • Korean Journal of Mathematics
    • /
    • v.26 no.4
    • /
    • pp.683-700
    • /
    • 2018
  • We get one theorem which shows existence of solutions for one-dimensional jumping problem involving p-Laplacian and Dirichlet boundary condition. This theorem is that there exists at least one solution when nonlinearities crossing finite number of eigenvalues, exactly one solutions and no solution depending on the source term. We obtain these results by the eigenvalues and the corresponding normalized eigenfunctions of the p-Laplacian eigenvalue problem when 1 < p < ${\infty}$, variational reduction method and Leray-Schauder degree theory when $2{\leq}$ p < ${\infty}$.