• Journal of the Korean Mathematical Society
• /
• v.55 no.1
• /
• pp.101-129
• /
• 2018

From an analytical perspective, we introduce a sequence of Cartier operators that act on the field of formal Laurent series in one variable with coefficients in a field of positive characteristic p. In this work, we discover the binomial inversion formula between Hasse derivatives and Cartier operators, implying that Cartier operators can play a prominent role in various objects of study in function field arithmetic, as a suitable substitute for higher derivatives. For an applicable object, the Wronskian criteria associated with Cartier operators are introduced. These results stem from a careful study of two types of Cartier operators on the power series ring ${\mathbf{F}}_q$[[T]] in one variable T over a finite field ${\mathbf{F}}_q$ of q elements. Accordingly, we show that two sequences of Cartier operators are an orthonormal basis of the space of continuous ${\mathbf{F}}_q$-linear functions on ${\mathbf{F}}_q$[[T]]. According to the digit principle, every continuous function on ${\mathbf{F}}_q$[[T]] is uniquely written in terms of a q-adic extension of Cartier operators, with a closed-form of expansion coefficients for each of the two cases. Moreover, the p-adic analogues of Cartier operators are discussed as orthonormal bases for the space of continuous functions on ${\mathbf{Z}}_p$.

• Journal of the Korean Mathematical Society
• /
• v.54 no.5
• /
• pp.1605-1621
• /
• 2017

The purpose of this paper is to construct a new family of the special numbers which are related to the Fubini type numbers and the other well-known special numbers such as the Apostol-Bernoulli numbers, the Frobenius-Euler numbers and the Stirling numbers. We investigate some fundamental properties of these numbers and polynomials. By using generating functions and their functional equations, we derive various formulas and relations related to these numbers and polynomials. In order to compute the values of these numbers and polynomials, we give their recurrence relations. We give combinatorial sums including the Fubini type numbers and the others. Moreover, we give remarks and observation on these numbers and polynomials.

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.5
• /
• pp.1079-1095
• /
• 2021

In this paper, we give new congruences with the generalized Catalan numbers and harmonic numbers modulo p². One of our results is as follows: for prime number p > 3, $${\sum\limits_{k=(p+1)/2}^{p-1}}\;k^2B_{p,k}B_{p,k-(p-1)/2}H_k{\equiv}(-1)^{(p-1)/2}\(-{\frac{521}{36}}p-{\frac{1}{p}}-{\frac{41}{12}}+pH^2_{3(p-1)/2}-10pq^2_p(2)+4\({\frac{10}{3}}p+1\)q_p(2)\)\;(mod\;p^2),$$ where q_p(2) is Fermat quotient.

• Korean Journal of Mathematics
• /
• v.29 no.4
• /
• pp.733-740
• /
• 2021

Let (F_n)_n≥0 be the Fibonacci sequence and p be a prime number. For 1≤k≤m, the Fibonomial coefficient is defined as $$\[\array{m\\k}\]_F=\frac{F_{m-k+1}{\ldots}{F_{m-1}F_m}}{{F_1}{\ldots}{F_k}}$$ and $\[\array{m\\k}\]_F=0$ whan k>m. Let a and n be positive integers. In this paper, we find the conditions of prime number p which divides Fibonomial coefficient $\[\array{P^{a+n}\\{p^a}}\]_F$. Furthermore, we also find the conditions of p when $\[\array{P^{a+n}\\{p^a}}\]_F$ is not divisible by p.

• Journal of applied mathematics & informatics
• /
• v.41 no.4
• /
• pp.753-763
• /
• 2023

In this paper, we introduce a fully modified (p, q)-poly tangent polynomials and numbers of the first type. We investigate analytic properties that is related with (p, q)-Gaussian binomial coefficients. We also define (p, q)-Stirling numbers of the second kind and fully modified (p, q)-poly tangent polynomials and numbers of the first type with two variables. Moreover, we derive some identities are concerned with the modified tangent polynomials and the (p, q)-Stirling numbers.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.12
• /
• pp.1343-1352
• /
• 1992

This paper presents a new and easy method to obtain the Fourier transforms of the n-th order cosine-pulses whose maximum amplitudes are uniform. The new method is focused on deriving a formula which is recursively related following their orders and can be well applied to some numerical solutions. On the other hand, this method also offers more compact procedures in view of analytical solutions than the conventional methods because the results are consist of the sum of two functions which are easily calculated. Especially, the formula can be represented as a complete recursion by the separation of coefficients originated by the authors and the resulting difference equation is given by the sum of the original 'sinc' functions shifted by some symmetrical factors and multiplied by some constants. The constants are easily decided from the binomial coefficients and the shifting factors from the corresponding exponential differences in the expansion of $(a+b)^n$.

• The Korean Journal of Applied Statistics
• /
• v.31 no.4
• /
• pp.475-484
• /
• 2018

Gamma generalized linear models are useful for non-negative and skewed responses. However, these models have received less attention than Poisson and binomial generalized linear models. In particular, hypothesis testing for the significance of regression coefficients has not been thoroughly studied. In this paper we assess the performance of various test statistics for gamma generalized linear models based on numerical studies. Our results show that the likelihood ratio test and F-type test are generally recommended and that the partial deviance test should be avoided in practice.

• Journal for History of Mathematics
• /
• v.20 no.4
• /
• pp.61-70
• /
• 2007

Combinatorics, often called the 21 st century mathematics, has turned out a very important subject for the present information era. Modern combinatorics has started from some mathematical works, for example, Pascal's triangle and the binomial coefficients, and Euler's problems on the partitions of integers and Konigsberg's bridge problem, and so on. In this paper, we investigate the origin of combinatorics by looking over some interesting ancient combinatorial problems and some important problems which have started various subfields of combinatorics. We also discuss a little on the role of combinatorics in mathematics and mathematics education.

• Journal for History of Mathematics
• /
• v.27 no.3
• /
• pp.155-164
• /
• 2014

Tianyuanshu and Zengcheng Kaifangfa introduced in the Song-Yuan dynasties and their contribution to the theory of equations are one of the most important achievements in the history of Chinese mathematics. Furthermore, they became the most fundamental subject in the history of East Asian mathematics as well. The operations, or the mathematical structure of polynomials have been overlooked by traditional mathematics books. Investigation of GuIlJib (九一集) of Joseon mathematician Hong JeongHa reveals that Hong's approach to polynomials is highly structural. For the expansion of $\prod_{k=11}^{n}(x+a_k)$, Hong invented a new method which we name Hong JeongHa's synthetic expansion. Using this, he reveals that the processes in Zhengcheng Kaifangfa is not synthetic division but synthetic expansion.

• Communications of Mathematical Education
• /
• v.22 no.4
• /
• pp.515-531
• /
• 2008

The visual cryptography scheme is a simple method which can be decoded directly the secret information in human visual system without performing any cryptographic computations. For some secret of image type, we scatter them to random n images and if any threshold (or more) of them are stacked together then original image is visible. In this paper we consider (2,n) visual cryptography scheme and show a construction method of the sample matrix using the rule of binomial coefficients $_nC_2$. This scheme can contribute interesting and effectiveness to the study of mathematics.