• Title/Summary/Keyword: projectivity

Search Result 9, Processing Time 0.023 seconds

Projectivity for 3-Dimensional Compact Nonsingular Toric Varieties

  • Park, Hye Sook
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.6 no.1
    • /
    • pp.95-104
    • /
    • 1993
  • There are some sufficient or necessary conditions about projectivity for toric varieties. We consider one of them and state some conditions about projectivity for a 3-dimensional compact nonsingular case which is obtained from a projective one by nonsingular equivariant blow-down.

  • PDF

NOTES ON FINITELY GENERATED FLAT MODULES

  • Tarizadeh, Abolfazl
    • Bulletin of the Korean Mathematical Society
    • /
    • v.57 no.2
    • /
    • pp.419-427
    • /
    • 2020
  • In this paper, the projectivity of finitely generated flat modules of a commutative ring are studied from a topological point of view. Then various interesting results are obtained. For instance, it is shown that if a ring has either finitely many minimal primes or finitely many maximal ideals then every finitely generated flat module over it is projective. It is also shown that if a particular subset of the prime spectrum of a ring satisfies some certain ascending or descending chain conditions, then every finitely generated flat module over this ring is projective. These results generalize some major results in the literature on the projectivity of finitely generated flat modules.

Correction Method for Korean Dependency Parsing using Projectivity and Re-searching (투사성과 재탐색을 이용한 결정적 한국어 의존구조 분석의 보정기법)

  • Park, Young-Min;Seo, Jung-Yun
    • Korean Journal of Cognitive Science
    • /
    • v.22 no.4
    • /
    • pp.429-447
    • /
    • 2011
  • In this paper, we propose a modified deterministic Korean dependency parser using a projectivity. The modified parser is improved by finding errors, such as cross dependency, from the original parsing results and correcting them according to the projectivity and head-final principles. Our parser also uses parsing history information in addition to rich features, which only a deterministic algorithm can use. Results on the modified parser for ETRI(2005) corpus, that consists of complex sentences, show that our parser outperforms other parsers.

  • PDF

RELATIVE PROJECTIVITY AND RELATED RESULTS

  • Toroghy, H.Ansari
    • Bulletin of the Korean Mathematical Society
    • /
    • v.41 no.3
    • /
    • pp.419-426
    • /
    • 2004
  • Let R be a commutative Noetherian ring and let M be an Artinian R-module. Let M${\subseteq}$M′ be submodules of M. Suppose F is an R-module which is projective relative to M. Then it is shown that $Att_{R}$($Hom_{A}$ (F,M′) :$Hom_{A}$(F,M) $In^n$), n ${\in}$N and $Att_{R}$($Hom_{A}$(F,M′) :$Hom_{A}$(F,M) In$^n$ $Hom_{A}$(F,M") :$Hom_{A}$(F,M) $In^n$),n ${\in}$ N are ultimately constant.

MONOIDS OVER WHICH ALL REGULAR RIGHT S-ACTS ARE WEAKLY INJECTIVE

  • Moon, Eunho L.
    • Korean Journal of Mathematics
    • /
    • v.20 no.4
    • /
    • pp.423-431
    • /
    • 2012
  • There have been some study characterizing monoids by homological classification using the properties around projectivity, injectivity, or regularity of acts. In particular Kilp and Knauer([4]) have analyzed monoids over which all acts with one of the properties around projectivity or injectivity are regular. However Kilp and Knauer left over problems of characterization of monoids over which all regular right S-acts are (weakly) at, (weakly) injective or faithful. Among these open problems, Liu([3]) proved that all regular right S-acts are (weakly) at if and only if es is a von Neumann regular element of S for all $s{\in}S$ and $e^2=e{\in}T$, and that all regular right S-acts are faithful if and only if all right ideals eS, $e^2=e{\in}T$, are faithful. But it still remains an open question to characterize over which all regular right S-acts are weakly injective or injective. Hence the purpose of this study is to investigate the relations between regular right S-acts and weakly injective right S-acts, and then characterize the monoid over which all regular right S-acts are weakly injective.

PURE-DIRECT-PROJECTIVE OBJECTS IN GROTHENDIECK CATEGORIES

  • Batuhan Aydogdu;Sultan Eylem Toksoy
    • Honam Mathematical Journal
    • /
    • v.45 no.2
    • /
    • pp.269-284
    • /
    • 2023
  • In this paper we study generalizations of the concept of pure-direct-projectivity from module categories to Grothendieck categories. We examine for which categories or under what conditions pure-direct-projective objects are direct-projective, quasi-projective, pure-projective, projective and flat. We investigate classes all of whose objects are pure-direct-projective. We give applications of some of the results to comodule categories.

Fδ-SUPPLEMENTED MODULES

  • Turkmen, Burcu Nisanci;Eryilmaz, Figen
    • Honam Mathematical Journal
    • /
    • v.42 no.2
    • /
    • pp.293-300
    • /
    • 2020
  • In this article, we define a (an amply) Fδ-supplemented module in category of R-Mod. The general properties of Fδ-supplemented modules are briefly discussed. Then, concentrating on the Fδ-small submodule, we find the necessary and sufficient condition for Fδ- supplemented modules. Also, we introduce ascending chain condition for Fδ-small submodules of any module and establish a basic theorem for amply Fδ-supplemented modules by using π-projectivity.

Korean Dependency Parsing Using Online Learning (온라인 학습을 이용한 한국어 의존구문분석)

  • Lee, Yong-Hun;Lee, Jong-Hyeok
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2010.06c
    • /
    • pp.299-304
    • /
    • 2010
  • 본 논문에서는 온라인 학습을 이용한 한국어 의존구문분석 방법을 제안한다. CoNLL-X에서 1위를 차지한 그래프 기반 의존구문분석 방법을 한국어에 맞게 변형하고, 한국어의 교착어적 특성을 고려해 한국어에 적합한 자질 집합을 제시하였다. 특히 의존트리의 에지(edge)를 단어와 단어간의 의존관계가 아닌 부분트리(partial tree)와 부분트리의 의존관계로 바라보기 위해 부분트리가 공유하고 있는 기능어 정보를 추가 자질로 사용하였다. 또한 한국어의 지배소 후위(head-final) 언어 특성과 투사성(projectivity)을 이용하여 Eisner(1996) 알고리즘을 사용하지 않고도 O($n^3$)의 CYK알고리즘을 사용할 수 있었고, 이를 이용해 최적의 전역해(global optimum)를 찾을 수 있었다. 각 자질을 위한 최적의 가중치 벡터는 온라인 학습방법 중 하나인 Collins(2002)의 averaged perceptron 알고리즘을 사용함으로써 빠르게 모델을 학습할 수 있었다. 제안 모델을 국어정보베이스(KIBS) 말뭉치에 적용한 결과 어절 단위 정확률 88.42%의 높은 성능을 얻을 수 있었다.

  • PDF