On the first Chvátal closure of the set covering polyhedron related to circulant matrices

We study the set covering polyhedron related to circulant matrices. In particular, our goal is to characterize the first Chvátal closure of the usual fractional relaxation. We present a family of valid inequalities that generalizes the family of minor inequalities previously reported in the literature. This family includes new facet-defining inequalities for the set covering polyhedron.     

Discrete unbounded sets in a finite dimensional space and beyond

Discrete infinite sets in a finite dimensional space, i.e., infinite sets without finite limit points appear in various branches of analysis (zero and pole sets of meromorphic functions, various models in the mathematical theory of quasicrystals, and so on). Here we introduce some notions and present some new theorems connected with such sets.     

The Largest Left Quotient Ring of a Ring

The left quotient ring (i.e., the left classical ring of fractions) Q_cl(R) of a ring R does not always exist and still, in general, there is no good understanding of the reason why this happens. In this article, existence of the largest left quotient ring Q_l(R) of an arbitrary ring R is proved, i.e., Q_l(R) = S₀(R)^?1R where S₀(R) is the largest left regular denominator set of R. It is proved that Q_l(Q_l(R)) = Q_l(R); the ring Q_l(R) is semisimple iff Q_cl(R) exists and is semisimple; moreover, if the ring Q_l(R) is left Artinian, then Q_cl(R) exists and Q_l(R) = Q_cl(R). The group of units Q_l(R)* of Q_l(R) is equal to the set {s^?1t | s, t ∈ S₀(R)} and S₀(R) = R ∩ Q_l(R)*. If there exists a finitely generated flat left R-module which is not projective, then Q_l(R) is not a semisimple ring. We extend slightly Ore's method of localization to localizable left Ore sets, give a criterion of when a left Ore set is localizable, and prove that all left and right Ore sets of an arbitrary ring are localizable (not just denominator sets as in Ore's method of localization). Applications are given for certain classes of rings (semiprime Goldie rings, Noetherian commutative rings, the algebra of polynomial integro-differential operators).     

Accuracy and complexity evaluation of defuzzification strategies for the discretised interval type-2 fuzzy set

The work reported in this paper addresses the challenge of the efficient and accurate defuzzification of discretised interval type-2 fuzzy sets. The exhaustive method of defuzzification for type-2 fuzzy sets is extremely slow, owing to its enormous computational complexity. Several approximate methods have been devised in response to this bottleneck. In this paper we survey four alternative strategies for defuzzifying an interval type-2 fuzzy set: (1) The Karnik–Mendel Iterative Procedure, (2) the Wu–Mendel Approximation, (3) the Greenfield–Chiclana Collapsing Defuzzifier, and (4) the Nie–Tan Method.We evaluated the different methods experimentally for accuracy, by means of a comparative study using six representative test sets with varied characteristics, using the exhaustive method as the standard. A preliminary ranking of the methods was achieved using a multi-criteria decision making methodology based on the assignment of weights according to performance. The ranking produced, in order of decreasing accuracy, is (1) the Collapsing Defuzzifier, (2) the Nie–Tan Method, (3) the Karnik–Mendel Iterative Procedure, and (4) the Wu–Mendel Approximation.Following that, a more rigorous analysis was undertaken by means of the Wilcoxon Nonparametric Test, in order to validate the preliminary test conclusions. It was found that there was no evidence of a significant difference between the accuracy of the Collapsing and Nie–Tan Methods, and between that of the Karnik–Mendel Iterative Procedure and the Wu–Mendel Approximation. However, there was evidence to suggest that the collapsing and Nie–Tan Methods are more accurate than the Karnik–Mendel Iterative Procedure and the Wu–Mendel Approximation.In relation to efficiency, each method’s computational complexity was analysed, resulting in a ranking (from least computationally complex to most computationally complex) as follows: (1) the Nie–Tan Method, (2) the Karnik–Mendel Iterative Procedure (lowest complexity possible), (3) the Greenfield–Chiclana Collapsing Defuzzifier, (4) the Karnik–Mendel Iterative Procedure (highest complexity possible), and (5) the Wu–Mendel Approximation.     

Residual Julia set for functions with the Ahlfors' Property

We consider two classes of functions studied by Epstein [A.L. Epstein, Towers of finite type complex analytic maps, Ph.D. thesis, City University of New York, 1993] and by Herring [M.E. Herring, An extension of the Julia–Fatou theory of iteration, Ph.D. thesis, Imperial College, London, 1994], which have the Ahlfors' Property. We prove under some conditions on the Fatou and Julia sets that the singleton buried components are dense in the Julia set for these classes of functions.     

Exclusion sets in eigenvalue localization sets for tensors

ABSTRACT

By excluding some proper subsets, which do not include any eigenvalues of tensors, from an existing eigenvalue localization set provided by Zhao and Sang, a new eigenvalue localization set for tensors is given. As an application, a sufficient condition such that the determinant of a tensor is not zero is provided.     

Convergent Power Series for Fields in Positive or Negative High-Contrast Periodic Media

We obtain convergent power series representations for Bloch waves in periodic high-contrast media. The material coefficient in the inclusions can be positive or negative. The small expansion parameter is the ratio of period cell width to wavelength, and the coefficient functions are solutions of the cell problems arising from formal asymptotic expansion. In the case of positive coefficient, the dispersion relation has an infinite sequence of branches, each represented by a convergent even power series whose leading term is a branch of the dispersion relation for the homogenized medium. In the negative case, there is a single branch.     

The busy period of an M/M/1 queue with balking and reneging

It has been shown by (R.O. Al-Seedy, A.A. El-Sherbiny, S.A. El-Shehawy, S.I. Ammar, Transient solution of the M/M/c queue with balking and reneging, Comput. Math. Appl. 57 (2009) 1280–1285) that a generating function technique can be successfully applied to derive the transient solution for an M/M/c queueing system. In this paper, we further illustrate how this technique can be used to obtain the busy period density function of an M/M/1 queue with balking and reneging. Finally, numerical calculations are presented.     

Maximizing the distance between center,centroid and characteristic set of a tree

Consider a tree P_n-g,g , n≥ 2, 1≤ g≤ n-1 on n vertices which is obtained from a path on [1,2,?…?,n-g] vertices by adding g pendant vertices to the pendant vertex n-g. We prove that over all trees on n?≥?5 vertices, the distance between center and characteristic set, centroid and characteristic set, and center and centroid is maximized by trees of the form P_n-g,g , 2?≤?g?≤?n-3. For n≥ 5, we also supply the precise location of the characteristic set of the tree P_n-g,g , 2?≤?g?≤?n-3.