The almost chebyshev property in linear semi-infinite programming

We consider a linear semi-infinite programming problem where the index set of the constraints is compact and the constraint functions are continuous on it. The set of all continuous functions on this index set as right hand sides are the parameter set. We investigate how large various unicity sets are.We state a condition on the objective function vector and the “matrix” of the problem which characterizes when the set of a parameters with a non-unique optimal point is a set of the first Baire category in the solvability set. This is the case if and only if the unicity set is a dense subset of the solvability set. Under the same assumptions it is even true that the interior of the strong unicity set is I also dense. If the index set of the constraints contains a dense subset with the property that each point1 is a G ₈-set, then the parameters of the strong unicity set, such that the optimal point satisfies the linear independence constraint qualification, are also dense.

We apply our results to a characterization of a unique continuous selection for the optimal set I mapping and to a one-sided L ₁-approximation problem     

The isolated invariant sets of a flow

Some definitions such as m-chain recurrent set, weakly gradient flow and generalized Morse decomposition for a flow defined on a topological space are introduced in this paper. Some conclusions, include the chain recurrent set contain the m-chain recurrent set; the m-chain recurrent set contain the non-wandering set, are proved. In some flows the non-wandering set is proper subset of the m-chain recurrent set; in the meantime the m-chain recurrent set is proper subset of the chain recurrent set. Moreover some criterions for the existence of trajectories joining singular points and a necessary and sufficient condition of the weakly gradient flow are also given here. At last the generalized Morse decomposition of the invariant set are discussed in the paper.     

Nonadditive Set Functions on a Finite Set and Linear Inequalities

A set function is a function whose domain is the power set of a set, which is assumed to be finite in this paper. We treat a possibly nonadditive set function, i.e., a set function which does not satisfy necessarily additivity, ?(A) + ?(B) = ?(A ∪ B) forA ∩ B = ∅, as an element of the linear space on the power set. Then some of the famous classes of set functions are polyhedral in that linear space, i.e., expressed by a finite number of linear inequalities. We specify the sets of the coefficients of the linear inequalities for some classes of set functions. Then we consider the following three problems: (a) the domain extension problem for nonadditive set functions, (b) the sandwich problem for nonadditive set functions, and (c) the representation problem of a binary relation by a nonadditive set function, i.e., the problem of nonadditive comparative probabilities.     

Geometric Models for Quasicrystals II. Local Rules Under Isometries

The atomic structures of quasicrystalline materials exhibit long range order under translations. It is believed that such materials have atomic structures which approximately obey local rules restricting the location of nearby atoms. These local constraints are typically invariant under rotations, and it is of interest to establish conditions under which such local rules can nevertheless enforce order under translations in any structure that satisfies them. A set of local rules in is a finite collection of discrete sets {Y _i } containing 0, each of which is contained in the ball of radius ρ around 0 in . A set X satisfies the local rules under isometries if the ρ -neighborhood of each is isometric to an element of . This paper gives sufficient conditions on a set of local rules such that if X satisfies under isometries, then X has a weak long-range order under translations, in the sense that X is a Delone set of finite type. A set X is a Delone set of finite type if it is a Delone set whose interpoint distance set X-X is a discrete closed set. We show for each minimal Delone set of finite type X that there exists a set of local rules such that X satisfies under isometries and all other Y that satisfy under isometries are Delone sets of finite type. A set of perfect local rules (under isometries or under translations, respectively) is a set of local rules such that all structures X that satisfy are in the same local isomorphism class (under isometries or under translations, respectively). If a Delone set of finite type has a set of perfect local rules under translations, then it has a set of perfect local rules under isometries, and conversely. Received February 14, 1997, and in revised form February 14, 1998, February 19, 1998, and March 5, 1998.     

On the existence of maximal ω-limit sets for dendrite maps

For interval maps and also for graph maps, every ω-limit set is a subset of a maximal one. In this note we construct a continuous map on a dendrite with no maximal ω-limit set. Moreover, the set of branch points is nowhere dense, every ω-limit set of the map is nowhere dense, the set of periodic points and the set of recurrent points are equal and the set of ω-limit points is not closed (an example with the last property was constructed by the authors already in [Ko?an Z, Kornecká-Kurková V, Málek M. On the centre and the set of omega-limit points of continuous maps on dendrites. Topol Appl 2009;156:2923-2931]).     

Topological properties of definable sets in ordered Abelian groups of burden 2

We obtain some new results on the topology of unary definable sets in expansions of densely ordered Abelian groups of burden 2. In the special case in which the structure has dp-rank 2, we show that the existence of an infinite definable discrete set precludes the definability of a set which is dense and codense in an interval, or of a set which is topologically like the Cantor middle-third set (Theorem 2.9). If it has burden 2 and both an infinite discrete set D and a dense-codense set X are definable, then translates of X must witness the Independence Property (Theorem 2.26). In the last section, an explicit example of an ordered Abelian group of burden 2 is given in which both an infinite discrete set and a dense-codense set are definable.     

Separation of clones of cooperations by cohyperidentities

An n-ary cooperation is a mapping from a nonempty set A to the nth copower of A. A clone of cooperations is a set of cooperations which is closed under superposition and contains all injections. Coalgebras are pairs consisting of a set and a set of cooperations defined on this set. We define terms for coalgebras, coidentities and cohyperidentities. These concepts will be applied to give a new solution of the completeness problem for clones of cooperations defined on a two-element set and to separate clones of cooperations by coidentities.     

Signed degree sets in signed graphs

The set D of distinct signed degrees of the vertices in a signed graph G is called its signed degree set. In this paper, we prove that every non-empty set of positive (negative) integers is the signed degree set of some connected signed graph and determine the smallest possible order for such a signed graph. We also prove that every non-empty set of integers is the signed degree set of some connected signed graph.     

Tight Gabor Sets on Discrete Periodic Sets

This paper addresses Gabor analysis on a discrete periodic set. Such a scenario can potentially find its applications in signal processing where signals may present on a union of disconnected discrete index sets. We focus on the Gabor systems generated by characteristic functions. A sufficient and necessary condition for a set to be a tight Gabor set in discrete periodic sets is obtained; discrete periodic sets admitting a tight Gabor set are also characterized; the perturbation of tight Gabor sets is investigated; an algorithm to determine whether a set is a tight Gabor set is presented. Furthermore, we prove that an arbitrary Gabor frame set can be represented as the union of a tight Gabor set and a Gabor Bessel set.     

Element number of the Platonic solids

Let Σ be a set of polyhedra. A set Ω of polyhedra is said to be an element set for Σ if each polyhedron in Σ is the union of a finite number of polyhedra in Ω. We call each polyhedron of the element set Ω an element for Σ. In this paper, we determine one element set for the set Π of the Platonic solids, and prove that this element set is, in fact, best possible; it achieves the minimum in terms of cardinality among all the element sets for Π. We also introduce the notion of indecomposability of a polyhedron and present a conjecture in Sect. 3.     

Numbers in a given set with (or without) a large prime factor

This survey treats two connected questions in analytic number theory: given a set of natural numbers, one may seek numbers with large prime factors in the set. Alternatively, one searches for smooth numbers in the set. Many examples have been studied: the set of values of a polynomial, the set of integers in a short interval, the set of shifted primes p+a and so on. These are discussed at some length, with references to the literature.     

Structure of stability and asymptotic stability sets of families of linear differential systems with parameter multiplying the derivative: II

We consider families of linear differential systems depending on a real parameter that occurs only as a factor multiplying the matrix of the system. The asymptotic stability set of such a family is defined as the set of all parameter values for which the corresponding systems in the family are asymptotically stable. We prove that a set on the real axis is the asymptotic stability set of such a family if and only if it is an F _σδ -set lying entirely on an open ray with origin at zero. In addition, for any set of this kind, the coefficient matrix of a family whose asymptotic stability set coincides with this set can be chosen to be infinitely differentiable and uniformly bounded on the time half-line.     

On the structure of invariant attracting sets of systems of finite-difference equations generating Hénon-Lozi mappings

For Hénon-Lozi mappings F, we find sufficient conditions under which on the plane there exists a domain U such that its closure is mapped by F strictly inside U. This ensures the existence of a compact invariant set in U. We prove the existence of an open set of parameter values for which this invariant set contains a zero-dimensional locally maximal topologically transitive Markov set such that the restriction of the mapping to this set is topologically conjugate to the shift automorphism in the space of sequences of two symbols. We show that if this Markov set is hyperbolic, then the above-mentioned compact invariant set coincides with the closure of the unstable manifold of F at a fixed point lying in that set and is a topologically indecomposable one-dimensional continuum. We present the parameter values for which these results hold for the Hénon mapping. We thereby prove the existence of a parameter range in which the invariant set of the Hénon mapping is a one-dimensional topologically indecomposable Brauer-Janiszewski continuum that contains a zero-dimensional locally maximal set and lies in the attraction domain of itself.     

The multi-fuzzy soft set and its application in decision making

Molodtsov’s soft set theory was originally proposed as a general mathematical tool for dealing with uncertainty. By combining the multi-fuzzy set and soft set models, the purpose of this paper is to introduce the concept of multi-fuzzy soft sets. Some operations on a multi-fuzzy soft set are defined, such as complement operation, “AND” and “OR” operations, Union and Intersection operations. Then, the DeMorgan’s laws are proved. Finally, by means of level soft set, an algorithm is presented, and a decision problem is analyzed using multi-fuzzy soft set.     

Farthest points and strong convexity of sets

We consider the existence and uniqueness of the farthest point of a given set A in a Banach space E from a given point x in the space E. It is assumed that A is a convex, closed, and bounded set in a uniformly convex Banach space E with Fréchet differentiable norm. It is shown that, for any point x sufficiently far from the set A, the point of the set A which is farthest from x exists, is unique, and depends continuously on the point x if and only if the set A in the Minkowski sum with some other set yields a ball. Moreover, the farthest (from x) point of the set A also depends continuously on the set A in the sense of the Hausdorff metric. If the norm ball of the space E is a generating set, these conditions on the set A are equivalent to its strong convexity.     

Stable sets and mean Li–Yorke chaos in positive entropy systems

It is shown that in a topological dynamical system with positive entropy, there is a measure-theoretically “rather big” set such that a multivariant version of mean Li–Yorke chaos happens on the closure of the stable or unstable set of any point from the set. It is also proved that the intersections of the sets of asymptotic tuples and mean Li–Yorke tuples with the set of topological entropy tuples are dense in the set of topological entropy tuples respectively.     

Subdifferential properties of the minimal time function of linear control systems

We present several formulae for the proximal and Fréchet subdifferentials of the minimal time function defined by a linear control system and a target set. At every point inside the target set, the proximal/Fréchet subdifferential is the intersection of the proximal/Fréchet normal cone of the target set and an upper level set of a so-called Hamiltonian function which depends only on the linear control system. At every point outside the target set, under a mild assumption, proximal/Fréchet subdifferential is the intersection of the proximal/Fréchet normal cone of an enlargement of the target set and a level set of the Hamiltonian function.     

A transfer algorithm for hierarchical clustering

Transfer algorithms are usually used to optimize an objective function that is defined on the set of partitions of a finite set X. In this paper we define an equivalence relation ? on the set of fuzzy equivalence relations on X and establish a bijection from the set of hierarchies on X to the set of equivalence classes with respect to ?. Thus, hierarchies can be identified with fuzzy equivalence relations and the transfer algorithm can be modified in order to optimize an objective function that is defined on the set of hierarchies on X.     

Normal Fans of Polyhedral Convex Sets

The normal fan of a polyhedral convex set in ? ⁿ is the collection of its normal cones. The structure of the normal fan reflects the geometry of that set. This paper reviews and studies properties about the normal fan. In particular, it investigates situations in which the normal fan of a polyhedral convex set refines, or is a subfan of, that of another set. It then applies these techniques in several examples. One of these concerns the face structure and normal manifold of the critical cone of a polyhedral convex set associated with a point in ? ⁿ . Another concerns how perturbation of the right hand side of the linear constraints defining such a set affects the normal fan and the face structure.     

The Potts model representation and a Robinson–Schensted correspondence for the partition algebra

We construct a correspondence between the set of partitions of a finite set M and the set of pairs of walks to the same vertex on a graph giving the Bratteli diagram of the partition algebra on M. This is the precise analogue of the correspondence between the set of permutations of a finite set and the set of pairs of Young tableaux of the same shape, called the Robinson–Schensted correspondence.