• Bulletin of the Korean Mathematical Society
• /
• v.44 no.4
• /
• pp.677-682
• /
• 2007

The unique positive zero of $F_m(z):=z^{2m}-z^{m+1}-z^{m-1}-1$ leads to analogues of $2(\array{2n\\k}\)$(k even) by using hypergeometric functions. The minimal polynomials of these analogues are related to Chebyshev polynomials, and the minimal polynomial of an analogue of $2(\array{2n\\k}\)$(k even>2) can be computed by using an analogue of $2(\array{2n\\k}\)$. In this paper we show that the analogue of $2(\array{2n\\2}\)$. In this paper we show that the analygue $2(\array{2n\\2}\)$ is the only real zero of its minimal polynomial, and has a different representation, by using a polynomial of smaller degree than $F_m$(z).

• The Pure and Applied Mathematics
• /
• v.8 no.2
• /
• pp.127-135
• /
• 2001

The main object of this paper is to present a transformation formula for a finite series involving $_3F_2$ and some identities associated with the binomial coefficients by making use of the theory of Legendre polynomials $P_{n}$(x) and some summation theorems for hypergeometric functions $_pF_q$. Some integral formulas are also considered.

• The Pure and Applied Mathematics
• /
• v.30 no.2
• /
• pp.131-138
• /
• 2023

The aim of this note is to provide two new and interesting closed-form evaluations of the generalized hypergeometric function ₅F₄ with argument $\frac{1}{256}$. This is achieved by means of separating a generalized hypergeometric function into even and odd components together with the use of two known sums (one each) involving reciprocals of binomial coefficients obtained earlier by Trif and Sprugnoli. In the end, the results are written in terms of two interesting combinatorial identities.

• East Asian mathematical journal
• /
• v.17 no.2
• /
• pp.309-318
• /
• 2001

• Journal of the Korean Society of Safety
• /
• v.30 no.2
• /
• pp.70-76
• /
• 2015

This study deals with the traffic accident of circular intersections. The purpose of the study is to develop the accident models by traffic violation type. In pursuing the above, this study gives particular attention to analyzing various factors that influence traffic accident and developing such the optimal models as Poisson and Negative binomial regression models. The main results are the followings. First, 4 negative binomial models which were statistically significant were developed. This was because the over-dispersion coefficients had a value greater than 1.96. Second, the common variables in these models were not adopted. The specific variables by model were analyzed to be traffic volume, conflicting ratio, number of circulatory lane, width of circulatory lane, number of traffic island by access road, number of reduction facility, feature of central island and crosswalk.

• Bulletin of the Korean Mathematical Society
• /
• v.42 no.4
• /
• pp.851-853
• /
• 2005

It is well known that the general term of a sequence can be represented by a linear combination of binomial coefficients. In this paper we give a simple proof for this fact.

• Journal of the Chungcheong Mathematical Society
• /
• v.37 no.2
• /
• pp.57-66
• /
• 2024

In this paper, we study how the Hilbert polynomial, associated with a reduced closed subscheme X of codimension 2 in ℙ^N, reveals geometric information about X. Although it is known that the Hilbert polynomial can tell us about the scheme's degree and arithmetic genus, we find additional geometric information it can provide for smooth varieties of codimension 2. To do this, we introduce the concept of Gotzmann coefficients, which helps to extract more information from the Hilbert polynomial. These coefficients are based on the binomial expansion of values of the Hilbert function. Our method involves combining techniques from initial ideals and partial elimination ideals in a novel way. We show how these coefficients can determine the degree of certain geometric features, such as the singular locus appearing in a generic projection, for smooth varieties of codimension 2.

• Bulletin of the Korean Mathematical Society
• /
• v.60 no.4
• /
• pp.863-872
• /
• 2023

Let n ⩾ 2 be an integer, we denote the smallest integer b such that gcd {(ⁿ_k) : b < k < n - b} > 1 as b(n). For any prime p, we denote the highest exponent α such that p^α | n as v_p(n). In this paper, we partially answer a question asked by Hong in 2016. For a composite number n and a prime number p with p | n, let n = a_mp^m + r, 0 ⩽ r < p^m, 0 < a_m < p. Then we have $$v_p\(\text{gcd}\{\(n\\k\)\;:\;b(n)1\}\)=\{\array{1,&&a_m=1\text{ and }r=b(n),\\0,&&\text{otherwise.}}$$

• Bulletin of the Korean Mathematical Society
• /
• v.60 no.4
• /
• pp.1017-1024
• /
• 2023

A celebrated result in the study of integer partitions is the identity due to Lehmer whereby the number of partitions of n with an even number of even parts minus the number of partitions of n with an odd number of even parts equals the number of partitions of n into distinct odd parts. Inspired by Lehmer's identity, we prove explicit formulas for evaluating generating functions for sequences that enumerate integer partitions of fixed width with an even/odd number of even parts. We introduce a technique for decomposing the even entries of a partition in such a way so as to evaluate, using a finite sum over q-binomial coefficients, the generating function for the sequence of partitions with an even number of even parts of fixed, odd width, and similarly for the other families of fixed-width partitions that we introduce.

• Honam Mathematical Journal
• /
• v.35 no.3
• /
• pp.373-379
• /
• 2013

In contrast with numerous identities involving the binomial coefficients and the Stirling numbers of the first and second kinds, a few identities involving the Eulerian numbers have been known. The objective of this note is to present certain interesting and (presumably) new identities involving the Eulerian numbers by mainly making use of Worpitzky's identity.