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.     

Maximum and minimum between fuzzy symbols in non-interactive and weakly non-interactive situations

We define fuzzy symbols as particular fuzzy sets whose membership functions operate between two linearly ordered spaces, and study the operations of maximum and of minimum between two fuzzy symbols. We consider the membership functions of the fuzzy symbols as possibility distributions. We study those of the maximum and the minimum of two non-interactive and weakly non-interactive variables.     

Star product,discrete Wigner functions,and spin-system tomograms

We develop the star-product formalism for spin states and consider different methods for constructing operator systems forming sets of dequantizers and quantizers, establishing a relation between them. We study the physical meaning of the operator symbols related to them. Quantum tomograms can also serve as operator symbols. We show that the possibility to express discrete Wigner functions in terms of measurable quantities follows because these functions can be related to quantum tomograms. We investigate the physical meaning of tomograms and spin-system tomogram symbols, which they acquire in the framework of the star-product formalism. We study the structure of the sum kernels, which can be used to express the operator symbols, calculated using different sets of dequantizers and also arising in calculating the star product of operator symbols, in terms of one another.     

Homogeneous sets from several ultrafilters

We consider Ramsey-style partition theorems in which homogeneity is asserted not for subsets of a single infinite homogeneous set but for subsets whose elements are chosen, in a specified pattern, from several sets in prescribed ultrafilters. We completely characterize the sequences of ultrafilters satisfying such partition theorems. (Non-isomorphic selective ultrafilters always work, but, depending on the specified pattern, weaker hypotheses on the ultrafilters may suffice.) We also obtain similar results for analytic partitions of the infinite sets of natural numbers. Finally, we show that the two P-points obtained by applying the maximum and minimum functions to a union ultrafilter are never nearly coherent.     

The Smale horseshoes in a class of non-invertible maps in with two-direction instability

We study the existence of Smale horseshoes of new type and the uniformly hyperbolic invariant sets for a class of non-invertible maps in three-dimensional Euclidean spaces with the dimension of instability equal to two. Parameter regions are given, for which the map has a horseshoe and a uniformly hyperbolic invariant set on which the map is topologically conjugate to the two-sided fullshift on four symbols.     

On the additive energy of the distance set in finite fields

We use character sums to derive new bounds on the additive energy of the set of distances (counted with multiplicities) between two subsets of a vector space over a given finite field. We also give applications to sumsets of distance sets.     

Minimizing submodular functions over families of sets

We consider the problem of characterizing the minimum of a submodular function when the minimization is restricted to a family of subsets. We show that, for many interesting cases, there exist two elementsa andb of the groundset such that the problem is equivalent to the problem of minimizing the submodular function over the sets containinga but notb. This leads to a polynomial-time algorithm for minimizing a submodular function over these families of sets. Our results apply, for example, to the families of odd cardinality subsets or even cardinality subsets separating two given vertices, or to the complement of a lattice family of subsets. We also derive that the second smallest value of a submodular function over a lattice family can be computed in polynomial-time. These results generalize and unify several known results.Research partially supported by NSF contract 9302476-CCR, Air Force contract F49620-92-J-0125 and DARPA contract N00014-92-J-1799.     

On minimal non-potentially closed subsets of the plane

We study the Borel subsets of the plane that can be made closed by refining the Polish topology on the real line. These sets are called potentially closed. We first compare Borel subsets of the plane using products of continuous functions. We show the existence of a perfect antichain made of minimal sets among non-potentially closed sets. We apply this result to graphs, quasi-orders and partial orders. We also give a non-potentially closed set minimum for another notion of comparison. Finally, we show that we cannot have injectivity in the Kechris-Solecki-Todor?evi? dichotomy about analytic graphs.     

The fundamental duality of partially ordered sets

The representation of partially ordered sets by subsets of some set such that specified joins (meets) are taken to unions (intersections) suggests two categories, that of partially ordered sets with specified joins and meets, and that of sets equipped with suitable collections of subsets, and adjoint contravariant functors between them. This, in turn, induces a duality including, among several others, the two Stone Dualities and that between spatial locales and sober spaces.     

The $${\textit{SU}}(2)$$-character variety of the closed surface of genus 2

We study the symplectic geometry of the \({\text {SU}}(2)\)-representation variety of the compact oriented surface of genus 2. We use the Goldman flows to identify subsets of the moduli space with corresponding subsets of \({\mathbb {P}}^3(\mathbb {C})\). We also define and study two antisymplectic involutions on the moduli space and their fixed point sets.     

Combinatorics on partial word correlations

Partial words are strings over a finite alphabet that may contain a number of “do not know” symbols. In this paper, we consider the period and weak period sets of partial words of length n over a finite alphabet, and study the combinatorics of specific representations of them, called correlations, which are binary and ternary vectors of length n indicating the periods and weak periods. We characterize precisely which vectors represent the period and weak period sets of partial words and prove that all valid correlations may be taken over the binary alphabet. We show that the sets of all such vectors of a given length form distributive lattices under suitably defined partial orderings. We show that there is a well-defined minimal set of generators for any binary correlation of length n and demonstrate that these generating sets are the primitive subsets of {1,2,…,n−1}. We also investigate the number of partial word correlations of length n. Finally, we compute the population size, that is, the number of partial words sharing a given correlation, and obtain recurrences to compute it. Our results generalize those of Guibas, Odlyzko, Rivals and Rahmann.     

Equidistant sets on Alexandrov surfaces

We examine properties of equidistant sets determined by nonempty disjoint compact subsets of a compact 2-dimensional Alexandrov space (of curvature bounded below). The work here generalizes many of the known results for equidistant sets determined by two distinct points on a compact Riemannian 2-manifold. Notably, we find that the equidistant set is always a finite simplicial 1-complex. These results are applied to answer an open question concerning the Hausdorff dimension of equidistant sets in the Euclidean plane.     

Approximate decidability in euclidean spaces

We study concepts of decidability (recursivity) for subsets of Euclidean spaces ?^k within the framework of approximate computability (type two theory of effectivity). A new notion of approximate decidability is proposed and discussed in some detail. It is an effective variant of F. Hausdorff's concept of resolvable sets, and it modifies and generalizes notions of recursivity known from computable analysis, formerly used for open or closed sets only, to more general types of sets. Approximate decidability of sets can equivalently be expressed by computability of the characteristic functions by means of appropriately working oracle Turing machines. The notion fulfills some natural requirements and is hereditary under canonical embeddings of sets into spaces of higher dimensions. However, it is not closed under binary union or intersection of sets. We also show how the framework of resolvability and approximate decidability can be applied to investigate concepts of reducibility for subsets of Euclidean spaces.     

A self-dual poset on objects counted by the Catalan numbers and a type-B analogue

We introduce two partially ordered sets, P_n^A and P_n^B, of the same cardinalities as the type-A and type-B noncrossing partition lattices. The ground sets of P_n^A and P_n^B are subsets of the symmetric and the hyperoctahedral groups, consisting of permutations which avoid certain patterns. The order relation is given by (strict) containment of the descent sets. In each case, by means of an explicit order-preserving bijection, we show that the poset of restricted permutations is an extension of the refinement order on noncrossing partitions. Several structural properties of these permutation posets follow, including self-duality and the strong Sperner property. We also discuss posets Q_n^A and Q_n^B similarly associated with noncrossing partitions, defined by means of the excedance sets of suitable pattern-avoiding subsets of the symmetric and hyperoctahedral groups.     

On (n,m)-Convex Sets

We investigate the class of generalized convex sets on Grassmann manifolds, which includes known generalizations of convex sets for Euclidean spaces. We extend duality theorems (of polarity type) to a broad class of subsets of the Euclidean space. We establish that the invariance of a mapping on generalized convex sets is equivalent to its affinity.     

Characterizing phylogenetically decisive taxon coverage

Increasingly, biologists are constructing evolutionary trees on large numbers of overlapping sets of taxa, and then combining them into a ‘supertree’ that classifies all the taxa. In this paper, we ask how much coverage of the total set of taxa is required by these subsets in order to ensure that we have enough information to reconstruct the supertree uniquely. We describe two results — a combinatorial characterization of the covering subsets to ensure that at most one supertree can be constructed from the smaller trees (whichever trees these may be) and a more liberal analysis that asks only that the supertree is highly likely to be uniquely specified by the tree structure on the covering subsets.     

The Dyck and the Preiss separation uniformly

We are concerned with two separation theorems about analytic sets by Dyck and Preiss, the former involves the positively-defined subsets of the Cantor space and the latter the Borel-convex subsets of finite dimensional Banach spaces. We show by introducing the corresponding separation trees that both of these results admit a constructive proof. This enables us to give the uniform version of these separation theorems, and to derive as corollaries the results, which are analogous to the fundamental fact “HYP is effectively bi-analytic” provided by the Suslin–Kleene Theorem.     

On the number of equivalence classes arising from partition involutions II

In this paper, we consider the pseudo-conjugation and its variations on the sets of partitions with restricted cranks and involutions on Frobenius symbols. We give several partition identities revealing relations between the number of equivalence classes in the set of partitions arising from an involution and the number of partitions satisfying a certain parity condition.     

Holomorphic germs on certain locally convex spaces

Summary We study the bounded sets in the space of holomorphic germs defined on compact subsets of non-metrizable locally convex spaces. We relate this problem to the problem of existence of uniform Cauchy estimates for the bounded subsets. We show that the space of holomorphic germs defined on a compact subset of a reflexive dual Fréchet space is regular if the bounded subsets of the space of holomorphic germs defined at the origin have uniform Cauchy estimates.     

Fixed point theorems for fuzzy numbers

In this paper we study the problem of the existence of fixed points for fuzzy maps. We first define uniform structures on sets of fuzzy subsets and describe the ‘closed convergence’ and ‘myope convergence’ structures which have properties close to the corresponding traditional ones. We then give two ways in order to obtain fixed point results. We finally give applications of these results, particularly to fuzzy Markov processes.