Pruning method for optimal solutions of int–int decision making scheme

This paper aims to find a faster method for optimal solutions of Feng et al.’s int^m–intⁿ decision making scheme. We first give theoretical characterizations of optimal decision sets. Then we develop a pruning method which filters out those objects that cannot be elements of any optimal decision sets in the beginning. Experimental results have shown that our method has higher efficiency in computing the optimal solutions of this scheme, particularly when we are processing soft sets with a great quantity of data.     

Proximinality in Banach spaces

In this paper, we study approximatively τ-compact and τ-strongly Chebyshev sets, where τ is the norm or the weak topology. We show that the metric projection onto τ-strongly Chebyshev sets are norm-τ continuous. We characterize approximatively τ-compact and τ-strongly Chebyshev hyperplanes and use them to characterize factor reflexive proximinal subspaces in τ-almost locally uniformly rotund spaces. We also prove some stability results on approximatively τ-compact and τ-strongly Chebyshev subspaces.     

Soft set theory and uni–int decision making

We firstly redefine the operations of Molodtsov’s soft sets to make them more functional for improving several new results. We also define products of soft sets and uni–int decision function. By using these new definitions we then construct an uni–int decision making method which selects a set of optimum elements from the alternatives. We finally present an example which shows that the method can be successfully applied to many problems that contain uncertainties.     

Improvement sets and vector optimization

In this paper we focus on minimal points in linear spaces and minimal solutions of vector optimization problems, where the preference relation is defined via an improvement set E. To be precise, we extend the notion of E-optimal point due to Chicco et al. in [4] to a general (non-necessarily Pareto) quasi ordered linear space and we study its properties. In particular, we relate the notion of improvement set with other similar concepts of the literature and we characterize it by means of sublevel sets of scalar functions. Moreover, we obtain necessary and sufficient conditions for E-optimal solutions of vector optimization problems through scalarization processes by assuming convexity assumptions and also in the general (nonconvex) case. By applying the obtained results to certain improvement sets we generalize well-known results of the literature referred to efficient, weak efficient and approximate efficient solutions of vector optimization problems.     

Is Lebesgue measure the only σ-finite invariant Borel measure?

S. Saks and recently R.D. Mauldin asked if every translation invariant σ-finite Borel measure on Rd is a constant multiple of Lebesgue measure. The aim of this paper is to investigate the versions of this question, since surprisingly the answer is “yes and no,” depending on what we mean by Borel measure and by constant. According to a folklore result, if the measure is only defined for Borel sets, then the answer is affirmative. We show that if the measure is defined on a σ-algebra containing the Borel sets, then the answer is negative. However, if we allow the multiplicative constant to be infinity, then the answer is affirmative in this case as well. Moreover, our construction also shows that an isometry invariant σ-finite Borel measure (in the wider sense) on Rd can be non-σ-finite when we restrict it to the Borel sets.     

Nonlinear programming with E-preinvex and local E-preinvex functions

In this paper, we extend the class of E-convex sets, E-convex and E-quasiconvex functions introduced by [Youness, E.A., 1999. E-convex sets, E-convex functions and E-convex programming. Journal of Optimization Theory and Applications 102, 439–450], respectively by [Syau, Yu-Ru, Lee, E. Stanley, 2005. Some properties of E-convex functions. Applied Mathematics Letters 18, 1074–1080] to E-invex set, E-preinvex, E-prequasiinvex and corresponding local concepts. Some properties of these classes are studied. As an application of our results, we consider the nonlinear programming problem for which, we establish that, under mild conditions, a local minimum is a global minimum.     

Sign-changing solutions for p-biharmonic equations with Hardy potential

In this paper, by using the method of invariant sets of descending flow, we obtain the existence of sign-changing solutions of p-biharmonic equations with Hardy potential.     

Extremal double hexagonal chains with respect to k-matchings and k-independent sets

“Double hexagonal chains” can be considered as benzenoids constructed by successive fusions of successive naphthalenes along a zig-zag sequence of triples of edges as appear on opposite sides of each naphthalene unit. In this paper, we discuss the numbers of k-matchings and k-independent sets of double hexagonal chains, as well as Hosoya indices and Merrifield-Simmons indices, and obtain some extremal results: among all the double hexagonal chains with the same number of naphthalene units, (a) the double linear hexagonal chain has minimal k-matching number and maximal k-independent set number and (b) the double zig-zag hexagonal chain has maximal k-matching number and minimal k-independent set number, which are extensions to hexagonal chains [L. Zhang and F. Zhang, Extremal hexagonal chains concerning k-matchings and k-independent sets, J. Math. Chem. 27 (2000) 319-329].     

Kernel systems on L-ordered sets

This paper presents fuzzy versions of kernel operators and kernel systems on L-ordered sets and establishes a one-to-one correspondence between them.     

On some new generalized sequence spaces

In this paper we define the sequence sets ?_∞(u,Δ²,p), c(u,Δ²,p) and c₀(u,Δ²,p), and give α- and β-duals of these sets. Further we investigate matrix transformations in the spaces and give a characterization of the class (?_∞(u,Δ²,p),?_∞).     

Lagrangean duals and exact solution to the capacitated p-center problem

In this work, we address the capacitated p-center problem (CpCP). We study two auxiliary problems, discuss their relation to CpCP, and analyze the lower bounds obtained with two different Lagrangean duals based on each of these auxiliary problems. We also compare two different strategies for solving exactly CpCP, based on binary search and sequential search, respectively. Various data sets from the literature have been used for evaluating the performance of the proposed algorithms.     

Matrix transformations on some sequence spaces related to strong Cesàro summability and boundedness

The spaces and introduced by Ayd?n and Ba?ar [C. Ayd?n, F. Ba?ar, Some new difference sequence spaces, Appl. Math. Comput. 157 (3) (2004) 677-693] can be considered as the matrix domains of a triangle in the sets of all sequences that are summable to zero, summable, and bounded by the Cesàro method of order 1. Here we define the sets of sequences which are the matrix domains of that triangle in the sets of all sequences that are summable, summable to zero, or bounded by the strong Cesàro method of order 1 with index p?1. We determine the β-duals of the new spaces and characterize matrix transformations on them into the sets of bounded, convergent and null sequences.     

Some generalized hypergeometric d-orthogonal polynomial sets

In this paper, we characterize the d-orthogonal polynomial sets given by their explicit expressions in a specific basis. As application, we consider the generalized hypergeometric case to characterize d-orthogonal polynomial sets of Laguerre type, Meixner type, Meixner-Pollaczek type, Krawtchouk type, continuous dual Hahn type, and dual Hahn type. For d=1, we obtain a unification of some characterization theorems in the orthogonal polynomials theory.     

Linking systems in nonelementary abelian groups

Linked systems of symmetric designs are equivalent to 3-class Q-antipodal association schemes. Only one infinite family of examples is known, and this family has interesting origins and is connected to important applications. In this paper, we define linking systems, collections of difference sets that correspond to systems of linked designs, and we construct linking systems in a variety of nonelementary abelian groups using Galois rings, partial difference sets, and a product construction. We include some partial results in the final section.     

Tight sets and m-ovoids of finite polar spaces

An intriguing set of points of a generalised quadrangle was introduced in [J. Bamberg, M. Law, T. Penttila, Tight sets and m-ovoids of generalised quadrangles, Combinatorica, in press] as a unification of the pre-existing notions of tight set and m-ovoid. It was shown in [J. Bamberg, M. Law, T. Penttila, Tight sets and m-ovoids of generalised quadrangles, Combinatorica, in press] that every intriguing set of points in a finite generalised quadrangle is a tight set or an m-ovoid (for some m). Moreover, it was shown that an m-ovoid and an i-tight set of a common generalised quadrangle intersect in mi points. These results yielded new proofs of old results, and in this paper, we study the natural analogue of intriguing sets in finite polar spaces of higher rank. In particular, we use the techniques developed in this paper to give an alternative proof of a result of Thas [J.A. Thas, Ovoids and spreads of finite classical polar spaces, Geom. Dedicata 10 (1-4) (1981) 135-143] that there are no ovoids of H(2r,q²), Q⁻(2r+1,q), and W(2r−1,q) for r>2. We also strengthen a result of Drudge on the non-existence of tight sets in W(2r−1,q), H(2r+1,q²), and Q⁺(2r+1,q), and we give a new proof of a result of De Winter, Luyckx, and Thas [S. De Winter, J.A. Thas, SPG-reguli satisfying the polar property and a new semipartial geometry, Des. Codes Cryptogr. 32 (1-3) (2004) 153-166; D. Luyckx, m-Systems of finite classical polar spaces, PhD thesis, The University of Ghent, 2002] that an m-system of W(4m+3,q) or Q⁻(4m+3,q) is a pseudo-ovoid of the ambient projective space.     

Chaotic and topological properties of β-transformations

In this paper, we prove that the β-transformations are chaotic in the sense of both Li-Yorke and Devaney. The topological and metric properties of the sets of points with dense or non-dense orbits are investigated. We also prove the result that the set of points with non-dense orbits under the β-transformation is of full Hausdorff dimension for any β>1.     

Polypotentials on a Riemannian manifold

Polyharmonic functions are considered on open sets in a Riemannian manifold R and their potential-theoretic properties are studied using the notion of complete m-potentials. Also one obtains here some characterizations of domains in R on which such complete m-potentials exist.     

Nondiscrete P-groups can be reflexive

We present the first examples of nondiscrete reflexive P-groups (topological groups in which countable intersections of open sets are open) as well as of noncompact reflexive ω-bounded groups (precompact groups in which the closure of every countable set is compact). Our main result implies that every product of discrete Abelian groups equipped with the P-modified topology is reflexive. Taking uncountably many nontrivial factors, we thus answer a question posed by P. Nickolas and solve a problem raised by Ardanza-Trevijano, Chasco, Domínguez, and Tkachenko.New examples of non-reflexive P-groups are also given which are based on a further development of Leptin's technique going back to 1955.     

Preordered sets valued in a GL-monoid

Let M=(L,*) be a GL-monoid. An M-valued preordered set is an L-subset endowed with a reflexive and M-transitive L-relation, it is essentially a category enriched in a quantaloid generated by M. This paper presents a study of M-valued preordered sets with emphasis on symmetrization and the Cauchy completion. The main result states that symmetrization and the Cauchy completion of M-valued preordered sets commute up to a natural isomorphism.