A notion of t-designs in the symmetric group on n letters was introduced by Godsil 1988. In particular, t-transitive sets permutations form a t-design. We derive upper bounds covering radius these designs, as function and t terms largest zeros Charlier polynomials.

This paper studies capacitated single-allocation hub covering location problem with fuzzy cover radius and travel time. Objective of hub covering problem is to find the minimum number of hubs considering the maximum allowable travel time. Computational results show that due to uncertainty, number of hubs and the allocation of non-hub nodes to hub nodes are changed. This paper proposes heuristic...

In this two-part paper we introduce the notion of a stable code and give a new upper bound on the normalized covering radius ofa code. The main results are that, for fixed k and large n, the minimal covering radius t[n, k] is realized by a normal code in which all but one of the columns have multiplicity l; hence tin + 2, k] t[n, k] + for sufficiently large n. We also show that codes with n _-<...

Recently, a new parameter of a code, referred to as the remoteness, has been introduced.This parameter can be viewed as a dual to the covering radius. It is exactly determined for the cyclic and dihedral groups. In this paper, we consider the group $U_{6n}$ as a subgroup of $S_{2n+3}$ and obtain its remoteness.  We show that the remoteness of the permutation code $U_{6n}$ is $2n+2$.  Moreover, ...

A‎s we know, developing mathematical models and numerical procedures that would appropriately treat and solve systems of linear equations where some of the system's parameters are proposed as fuzzy numbers is very important in fuzzy set theory. For this reason, many researchers have used various numerical methods to solve fuzzy linear systems. In this paper, we define the concepts of midpoint a...