• Korean Journal of Mathematics
• /
• v.28 no.4
• /
• pp.791-802
• /
• 2020

We obtain a two variable generating function for the number of triangular partitions. Using this generating function, we study arithmetic properties of a certain weighted count of triangular partitions. Finally, we introduce a rank-type function for triangular partitions, which gives a combinatorial explanation for a triangular partition congruence.

• Communications of the Korean Mathematical Society
• /
• v.32 no.3
• /
• pp.745-763
• /
• 2017

The Borel-Serre partial compactification gives cofinite models for the proper classifying space for arithmetic lattices. Non-arithmetic lattices arise only in semisimple Lie groups of ${\mathbb{R}}$-rank one. The author generalizes the Borel-Serre partial compactification to construct cofinite models for the proper classifying space for lattices in semisimple Lie groups of ${\mathbb{R}}$-rank one by using the reduction theory of Garland and Raghunathan.

• Journal of the Korean Mathematical Society
• /
• v.56 no.5
• /
• pp.1355-1370
• /
• 2019

A curve $X{\subset}\mathbb{P}^r$ has maximal rank if for each $t{\in}\mathbb{N}$ the restriction map $H^0(\mathcal{O}_{\mathbb{P}r}(t)){\rightarrow}H^0(\mathcal{O}_X(t))$ is either injective or surjective. We show that for all integers $d{\geq}r+1$ there are maximal rank, but not arithmetically Cohen-Macaulay, smooth curves $X{\subset}\mathbb{P}^r$ with degree d and genus roughly $d^2/2r$, contrary to the case r = 3, where it was proved that their genus growths at most like $d^{3/2}$ (A. Dolcetti). Nevertheless there is a sector of large genera g, roughly between $d^2/(2r+2)$ and $d^2/2r$, where we prove the existence of smooth curves (even aCM ones) with degree d and genus g, but the only integral and non-degenerate maximal rank curves with degree d and arithmetic genus g are the aCM ones. For some (d, g, r) with high g we prove the existence of reducible non-degenerate maximal rank and non aCM curves $X{\subset}\mathbb{P}^r$ with degree d and arithmetic genus g, while (d, g, r) is not realized by non-degenerate maximal rank and non aCM integral curves.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.54 no.8
• /
• pp.501-503
• /
• 2005

In this paper, using ranks of co-occurrence frequency about indices in pairs of neighboring pixels, we introduce a new re-indexing algorithm for efficiency of index color image lossless compression. The proposed algorithm is suitable for arithmetic coding because it has concentrated distributions of small variance. Experimental results proved that the proposed algorithm reduces the bit rates than other coding schemes, more specifically $15\%$, $54\%$ and $12\%$ for LZW algorithm of GIF, the plain arithmetic coding method and Zeng's scheme, respectively.

• Korean Journal of Mathematics
• /
• v.10 no.1
• /
• pp.67-74
• /
• 2002

Suppose linear forms whose coefficients are arithmetic progressions are given. In this paper, we will find the upper and lower bounds of the minimal ranks of subforms of these forms which left the Frobenius numbers invariant. This is an improvement of Ritter's bounds.

• Communications for Statistical Applications and Methods
• /
• v.19 no.3
• /
• pp.367-379
• /
• 2012

In baseball rankings, prediction has been a subject of interest for baseball fans. To predict these rankings, (based on 2011 data from Korea Professional Baseball records) the arithmetic mean method, the weighted average method, principal component analysis, and principal component regression analysis is presented. By standardizing the arithmetic average, the correlation coefficient using the weighted average method, using principal components analysis to predict rankings, the final model was selected as a principal component regression model. By practicing regression analysis with a reduced variable by principal component analysis, we propose a rank predictability model of a pitcher part, a batter part and a pitcher batter part. We can estimate a 2011 rank of pro-baseball by a predicted regression model. By principal component regression analysis, the pitcher part, the other part, the pitcher and the batter part of the ranking prediction model is proposed. The regression model predicts the rankings for 2012.

• Proceedings of the KIEE Conference
• /
• 2005.05a
• /
• pp.164-166
• /
• 2005

In this paper, using ranks of co-occurrence frequency about indices in neighboring pixels, we introduce a new re-indexing scheme for efficiency of index color image lossless compression. The proposed method is suitable for arithmetic coding because it has skewed distributions of small variance. Experimental results proved that the proposed method reduces the bit rates than other coding schemes, more specifically 15%, 54% and 12% for LZW algorithm of GIF, the plain arithmetic coding method and Zeng's scheme.

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.5
• /
• pp.1219-1233
• /
• 2019

Let $E{\rightarrow}M$ be an arbitrary vector bundle of rank k over a Riemannian manifold M equipped with a fiber metric and a compatible connection $D^E$. R. Albuquerque constructed a general class of (two-weights) spherically symmetric metrics on E. In this paper, we give a characterization of locally symmetric spherically symmetric metrics on E in the case when $D^E$ is flat. We study also the Einstein property on E proving, among other results, that if $k{\geq}2$ and the base manifold is Einstein with positive constant scalar curvature, then there is a 1-parameter family of Einstein spherically symmetric metrics on E, which are not Ricci-flat.

• Bulletin of the Korean Mathematical Society
• /
• v.32 no.2
• /
• pp.337-342
• /
• 1995

A semiring is a binary system $(S, +, \times)$ such that (S, +) is an Abelian monoid (identity 0), (S,x) is a monoid (identity 1), $\times$ distributes over +, 0 $\times s s \times 0 = 0$ for all s in S, and $1 \neq 0$. Usually S denotes the system and $\times$ is denoted by juxtaposition. If $(S,\times)$ is Abelian, then S is commutative. Thus all rings are semirings. Some examples of semirings which occur in combinatorics are Boolean algebra of subsets of a finite set (with addition being union and multiplication being intersection) and the nonnegative integers (with usual arithmetic). The concepts of matrix theory are defined over a semiring as over a field. Recently a number of authors have studied various problems of semiring matrix theory. In particular, Minc [4] has written an encyclopedic work on nonnegative matrices.

• East Asian mathematical journal
• /
• v.35 no.1
• /
• pp.9-15
• /
• 2019

Kaavya introduce an involution on the set of partitions with crank 0 and studied the number of partitions of n which are invariant under Kaavya's involution. If a partition ${\lambda}$ with crank 0 is invariant under her involution, we say ${\lambda}$ is a self-conjugate partition with crank 0. We prove that the number of such partitions of n is equal to the number of partitions with rank 0 which are invariant under the usual partition conjugation. We also study arithmetic properties of such partitions and their q-theoretic implication.