Free sets for nowhere-dense set mappings

We give some consistency results on the existence of uncountable free sets for nowhere-dense set mappings. For example, we prove that it is relatively consistent with ZFC and Martin’s Axiom that any nowhere-dense set mapping defined on the reals has an uncountable free set.     

Algebraic sets in metabelian groups

The research launched in [1] is brought to a close by examining algebraic sets in a metabelian group G in two important cases: (1) G = F_n is a free metabelian group of rank n; (2) G = W_n,k is a wreath product of free Abelian groups of ranks n and k. Supported by RFBR grant No. 05-01-00292. __________ Translated from Algebra i Logika, Vol. 46, No. 4, pp. 503–513, July–August, 2007.     

Between closed sets andg-closed sets

Quite recently, by using semi-open (resp.α-open, preopen,β-open) sets in a topological space, the notions ofsg*-closed (resp.αg*-closed,pg*-closedβg*-closed) sets are indroduced and investigated in [8]. These subsets place between closed sets andg-closed sets due to Levine [5]. In this paper, we introduce the notion ofmg*-closed sets and obtain the unified theory for collections of subsets between closed sets andg-closed sets.     

Test sets of integer programs

This article is a survey about recent developments in the area of test sets of families of linear integer programs. Test sets are finite subsets of the integer lattice that allow to improve any given feasible non-optimal point of an integer program by one element in the set. There are various possible ways of defining test sets depending on the view that one takes: theGraver test set is naturally derived from a study of the integral vectors in cones; theScarf test set (neighbors of the origin) is strongly connected to the study of lattice point free convex bodies; the so-calledreduced Gröbner basis of an integer program is obtained from a study of generators of polynomial ideals. This explains why the study of test sets connects various branches of mathematics. We introduce in this paper these three kinds of test sets and discuss relations between them. We also illustrate on various examples such as the minimum cost flow problem, the knapsack problem and the matroid optimization problem how these test sets may be interpreted combinatorially. From the viewpoint of integer programming a major interest in test sets is their relation to the augmentation problem. This is discussed here in detail. In particular, we derive a complexity result of the augmentation problem, we discuss an algorithm for solving the augmentation problem by computing the Graver test set and show that, in the special case of an integer knapsack problem with 3 coefficients, the augmentation problem can be solved in polynomial time.Supported by a Gerhard-Hess-Forschungsförderpreis of the German Science Foundation (DFG).     

A concept of variety for regular biordered sets

We define a bivariety of regular biordered sets to be a nonempty class of regular biordered sets which is closed under taking direct products, regular bimorphic images and relatively regular biordered subsets. It is then shown that there is a complete lattice morphism mapping the complete lattice of all e-varieties of regular semigroups onto the complete lattice of all bivarieties of regular biordered sets; as a corollary we prove that there is a complete lattice morphism mapping the complete lattice of all e-varieties of E-solid regular semigroups onto the complete lattice of all varieties of solid binary algebras. Examples of bivarieties include the class of all solid regular biordered sets and the class of all local semilattices. For each setX with at least two elements, we show that a bivariety contains a free object onX if and only if it consists entirely of solid regular biordered sets or it consists entirely of local semilattices. The author gratefully acknowledges the financial support of an Australian Postgraduate Research Award.     

Multi-fuzzy sets: An extension of fuzzy sets

In this paper we propose a method to construct more general fuzzy sets using ordinary fuzzy sets as building blocks. We introduce the concept of multi-fuzzy sets in terms of ordered sequences of membership functions. The family of operations T, S, M of multi-fuzzy sets are introduced by coordinate wise t-norms, s-norms and aggregation operations. We define the notion of coordinate wise conjugation of multifuzzy sets, a method for obtaining Atanassov’s intuitionistic fuzzy operations from multi-fuzzy sets. We show that various binary operations in Atanassov’s intuitionistic fuzzy sets are equivalent to some operations in multi-fuzzy sets like M operations, 2-conjugates of the T and S operations. It is concluded that multi-fuzzy set theory is an extension of Zadeh’s fuzzy set theory, Atanassov’s intuitionsitic fuzzy set theory and L-fuzzy set theory.     

Crisp sets as classes of discontinuous fuzzy sets

This paper aims to show how, by using a threshold-based approach, a path from imprecise information to a crisp ‘decision’ can be developed. It deals with the problem of the logical transformation of a fuzzy set into a crisp set. Such threshold arises from the ideas of contradiction and separation, and allows us to prove that crisp sets can be structurally considered as classes of discontinuous fuzzy sets. It is also shown that continuous fuzzy sets are computationally indistinguishable from some kind of discontinuous fuzzy sets.     

向量优化中Free Disposal集的某些对偶性质

在分离局部凸空间中考虑free disposal集的对偶性质,其中free disposal集是指与凸锥的代数和仍是其本身的集合.在E_1或E_2是free disposal集的条件下,证明了(E_1∩E_2)~+=E_1~++E_2~+和E_1~+∩E_2~+=(E_1+E_2)~+等对偶结果.     

Rank-determining sets of metric graphs

A metric graph is a geometric realization of a finite graph by identifying each edge with a real interval. A divisor on a metric graph Γ is an element of the free abelian group on Γ. The rank of a divisor on a metric graph is a concept appearing in the Riemann-Roch theorem for metric graphs (or tropical curves) due to Gathmann and Kerber, and Mikhalkin and Zharkov. We define a rank-determining set of a metric graph Γ to be a subset A of Γ such that the rank of a divisor D on Γ is always equal to the rank of D restricted on A. We show constructively in this paper that there exist finite rank-determining sets. In addition, we investigate the properties of rank-determining sets in general and formulate a criterion for rank-determining sets. Our analysis is based on an algorithm to derive the v₀-reduced divisor from any effective divisor in the same linear system.     

Free sets and the structure of additive ideals

Summary The present paper contains existence theorems for free sets with respect to a set-mapping. Paper done at the ? Istituto Nazionale per la Applicazioni del Calcolo ? of Rome during the stay of Dr.G. Fodor, with a fellowship of the Italian Governement.     

Optimal difference systems of sets and difference sets

Difference systems of sets (DSSs) are combinatorial structures that are generalizations of cyclic difference sets and arise in connection with code synchronization. In this paper, we give a recursive construction of DSSs with smaller redundancy from partition-type DSSs and difference sets. As applications, we obtain some new infinite classes of optimal DSSs from the known difference sets and almost difference sets.     

Trivializable rings of sets

In the present paper, we examine the ways in which rings of sets can be generated by as simple systems as possible. We investigate rings of sets which can be generated by totally ordered subsystems. All totally ordered systems which generate the same ring are, in essence, isomorphic. This fact leads to an order-theoretic classification of rings of sets. Every group-valued mapping defined on a totally ordered system of sets can be uniquely extended to an additive mapping on the ring of sets generated by the system. Two rings of sets are of the same order type if and only if the corresponding spaces of measures are isomorphic.     

On IP* sets and central sets

IP^* sets and central sets are subsets of which are known to have rich combinatorial structure. We establish here that structure is significantly richer that was previously known. We also establish that multiplicatively central sets have rich additive structure. The relationship among IP^* sets, central sets, and corresponding dynamical notions are also investigated.The authors gratefully acknowledge support from the National Science Foundation (USA) via grants DMS-9103056 and DMS-9025025 respectively.     

On non-enlargeable positive sets

The theory of positive sets on SSD spaces and Banach SNL spaces has been introduced by S. Simons. Monotone sets can be considered as a special case of positive sets. The characterizations of enlargement of positive sets in SSD spaces have been studied by Bo? and Csetnek. In this paper, we present characterizations of non-enlargeable positive sets in SSD spaces and Banach SNL spaces.     

Forbidden retracts for finite ordered sets of width at most four

The relationship between the fixed point property and forbidden retracts associated with a forgetful functor is formulated. Finite ordered sets of width at most four with fixed point free automorphisms are described. Linear time algorithms for deciding whether a finite ordered set of width two has the fixed point property and whether a finite ordered set of width at most three has a fixed point free automorphism are presented.     

Levels in the toposes of simplicial sets and cubical sets

The essential subtoposes of a fixed topos form a complete lattice, which gives rise to the notion of a level in a topos. In the familiar example of simplicial sets, levels coincide with dimensions and give rise to the usual notions of n-skeletal and n-coskeletal simplicial sets. In addition to the obvious ordering, the levels provide a stricter means of comparing the complexity of objects, which is determined by the answer to the following question posed by Bill Lawvere: when does n-skeletal imply k-coskeletal? This paper, which subsumes earlier unpublished work of some of the authors, answers this question for several toposes of interest to homotopy theory and higher category theory: simplicial sets, cubical sets, and reflexive globular sets. For the latter, n-skeletal implies (n+1)-coskeletal but for the other two examples the situation is considerably more complicated: n-skeletal implies (2n−1)-coskeletal for simplicial sets and 2n-coskeletal for cubical sets, but nothing stronger. In a discussion of further applications, we prove that n-skeletal cyclic sets are necessarily (2n+1)-coskeletal.     

Substitution-like minimal sets

Substitution-like minimal sets are a class of symbolic minimal sets on two symbols which includes the discrete substitution minimal sets on two symbols. They are almost automorphic extensions of then-adic integers and they are constructed by using special subsets of then-adics from which the almost automorphic points are determined by following orbits in then-adics. Through their study a complete classification is obtained for substitution minimal sets of constant length on two symbols. Moreover, the classification scheme is such that for specific substitutions the existence or non-existence of an isomorphism can be determined in a finite number of steps.     

Dimension spectra of self-affine sets

The dimension spectrumH(δ) is a function characterizing the distribution of dimension of sections. Using the multifractal formula for sofic measures, we show that the dimension spectra of irreducible self-affine sets (McMullen’s Carpet) coincide with the modified Legendre transform of the free energy Ψ_d(β). This variational relation leads to the formula of Hausdorff dimension of self-affine sets, max(δ +H(δ)) = Ψ_d(η), whereη is the logarithmic ratio of the contraction rates of the affine maps.     

Level sets of the Takagi function: local level sets

The Takagi function ??: [0,1] ?? [0, 1] is a continuous non-differentiable function constructed by Takagi in 1903. The level sets L(y)?=?{x : ??(x)?=?y} of the Takagi function ??(x) are studied by introducing a notion of local level set into which level sets are partitioned. Local level sets are simple to analyze, reducing questions to understanding the relation of level sets to local level sets, which is more complicated. It is known that for a ??generic?? full Lebesgue measure set of ordinates y, the level sets are finite sets. In contrast, here it is shown for a ??generic?? full Lebesgue measure set of abscissas x, the level set L(??(x)) is uncountable. An interesting singular monotone function is constructed associated to local level sets, and is used to show the expected number of local level sets at a random level y is exactly ${\frac{3}{2}}$ .