• Journal of applied mathematics & informatics
• /
• v.30 no.3_4
• /
• pp.455-462
• /
• 2012

The cyclic group $Cn={\langle}(12{\cdots}n){\rangle}$ acts on the set ($^{[n]}_k$) of all $k$-subsets of [$n$]. In this action of $C_n$ the number of orbits of size $d$, for $d|n$, is $$O^{n,k}_d=\frac{1}{d}\sum_{\frac{n}{d}|s|n}{\mu}(\frac{ds}{n})(^{n/s}_{k/s})$$. Stanton and White[7] generalized the above identity to construct the orbit polynomials $$O^{n,k}_d(q)=\frac{1}{[d]_{q^{n/d}}}\sum_{\frac{n}{d}|s|n}{\mu}(\frac{ds}{n})[^{n/s}_{k/s}]{_q}^s$$ and conjectured that $O^{n,k}_d(q)$ have non-negative coefficients. In this paper we give a combinatorial proof for the positivity of coefficients of the orbit polynomial $O^{n,3}_d(q)$.

• Journal of the Korean Mathematical Society
• /
• v.51 no.2
• /
• pp.289-309
• /
• 2014

A combinatorial description of the crystal $\mathcal{B}({\infty})$ for finite-dimensional simple Lie algebras in terms of certain Young tableaux was developed by J. Hong and H. Lee. We establish an explicit bijection between these Young tableaux and canonical bases indexed by Lusztig's parametrization, and obtain a combinatorial rule for expressing the Gindikin-Karpelevich formula as a sum over the set of Young tableaux.

• Journal of Korea Society of Industrial Information Systems
• /
• v.27 no.2
• /
• pp.61-69
• /
• 2022

A multi-agent system is a system that aims at achieving the best-coordinated decision based on each agent's local decision. In this paper, we consider a multi agent-multi task assignment problem. Each agent is assigned to only one task and there is a completion probability for performing. The objective is to determine an assignment that maximizes the sum of the completion probabilities for all tasks. The problem, expressed as a non-linear objective function and combinatorial optimization, is NP-hard. It is necessary to design an effective and efficient solution methodology. This paper presents an approximation algorithm using submodularity, which means a marginal gain diminishing, and demonstrates the scalability and robustness of the algorithm in theoretical and experimental ways.

• 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.

• 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.

• Journal of the Korean Mathematical Society
• /
• v.61 no.1
• /
• pp.109-132
• /
• 2024

The Clifford algebra of a direct sum of real quadratic spaces appears as the superalgebra tensor product of the Clifford algebras of the summands. The purpose of the current paper is to present a purely settheoretical version of the superalgebra tensor product which will be applicable equally to groups or to their non-associative analogues - quasigroups and loops. Our work is part of a project to make supersymmetry an effective tool for the study of combinatorial structures. Starting from group and quasigroup structures on four-element supersets, our superproduct unifies the construction of the eight-element quaternion and dihedral groups, further leading to a loop structure which hybridizes the two groups. All three of these loops share the same character table.

• Kyungpook Mathematical Journal
• /
• v.50 no.2
• /
• pp.177-193
• /
• 2010

Working with the various special functions of mathematical physics and applied mathematics we often encounter inverse relations of the type $F_n(x)=\sum\limits_{k=0}^{n}A^n_kG_k(x)$ and $ G_n(x)=\sum\limits_{k=0}^{n}B_k^nF_k(x)$, where 0, 1, 2,$\cdots$. Here $F_n(x)$, $G_n(x)$ denote special polynomial functions, and $A_k^n$, $B_k^n$ denote coefficients found by use of the orthogonal properties of $F_n(x)$ and $G_n(x)$, or by skillful series manipulations. Typically $G_n(x)=x^n$ and $F_n(x)=P_n(x)$, the n-th Legendre polynomial. We give a collection of inverse series pairs of the type $f(n)=\sum\limits_{k=0}^{n}A_k^ng(k)$ if and only if $g(n)=\sum\limits_{k=0}^{n}B_k^nf(k)$, each pair being based on some reasonably well-known special function. We also state and prove an interesting generalization of a theorem of Rainville in this form.

• Journal of applied mathematics & informatics
• /
• v.36 no.5_6
• /
• pp.475-489
• /
• 2018

In this paper, by using the polylogarithm function, we introduce a generalized poly-Bernoulli numbers and polynomials with variable a. We find several combinatorial identities and properties of the polynomials. We give some properties that is connected with the Stirling numbers of second kind. Symmetric properties can be proved by new configured special functions. We display the zeros of the generalized poly-Bernoulli polynomials with variable a and investigate their structure.

• Journal of Korea Society of Industrial Information Systems
• /
• v.27 no.4
• /
• pp.37-45
• /
• 2022

In this paper, a multi agent-multi task assignment problem, which is a representative problem of combinatorial optimization, is presented. The objective of the problem is to determine the coordinated agent-task assignment that maximizes the sum of the achievement rates of each task. The achievement rate is represented as a concave down increasing function according to the number of agents assigned to the task. The problem is expressed as an NP-hard problem with a non-linear objective function. In this paper, to solve the assignment problem, we propose a hybrid cross-entropy algorithm as an effective and efficient solution methodology. In fact, the general cross-entropy algorithm might have drawbacks (e.g., slow update of parameters and premature convergence) according to problem situations. Compared to the general cross-entropy algorithm, the proposed method is designed to be less likely to have the two drawbacks. We show that the performances of the proposed methods are better than those of the general cross-entropy algorithm through numerical experiments.

• International Journal of Contents
• /
• v.3 no.1
• /
• pp.1-8
• /
• 2007

The distributions of the minimum correlated F-variable arises in many applied statistical problems including simultaneous analysis of variance (SANOVA), equality of variance, selection and ranking populations, and reliability analysis. In this paper, negative binomial sampling technique is employed to derive the distributions of the minimum of chi-square variables and hence the distributions of the minimum correlated F-variables. The work presented in this paper is divided in two parts. The first part is devoted to develop some combinatorial identities arised from the negative binomial sampling. These identities are constructed and justified to serve important purpose, when we deal with these distributions or their characteristics. Other important results including cumulants and moments of these distributions are also given in somewhat simple forms. Second, the distributions of minimum, chisquare variable and hence the distribution of the minimum correlated F-variables are then derived within the negative binomial sampling framework. Although, multinomial theory applied to order statistics and standard transformation techniques can be used to derive these distributions, the negative binomial sampling approach provides more information regarding the nature of the relationship between the sampling vehicle and the probability distributions of these functions of chi-square variables. We also provide an algorithm to compute the percentage points of the distributions. The computation methods we adopted are exact and no interpolations are involved.