Epigraphical and Uniform Convergence of Convex Functions

We examine when a sequence of lsc convex functions on a Banach space converges uniformly on bounded sets (resp. compact sets) provided it converges Attouch-Wets (resp. Painlevé-Kuratowski). We also obtain related results for pointwise convergence and uniform convergence on weakly compact sets. Some known results concerning the convergence of sequences of linear functionals are shown to also hold for lsc convex functions. For example, a sequence of lsc convex functions converges uniformly on bounded sets to a continuous affine function provided that the convergence is uniform on weakly compact sets and the space does not contain an isomorphic copy of .

     

Weakly continuous holomorphic functions on Banach spaces with a shrinking and unconditional basis

Let E and F be complex Banach spaces, and let U be an open ball in E. We show that if E has a shrinking and unconditional basis, then every holomorphic function that is weakly continuous on U-bounded sets is weakly uniformly continuous on U-bounded sets.     

Almost limited sets in Banach lattices

We introduce and study the class of almost limited sets in Banach lattices, that is, sets on which every disjoint weak^?${\mathrm{weak}}^{?}$ null sequence of functionals converges uniformly to zero. It is established that a Banach lattice has order continuous norm if and only if almost limited sets and L  -weakly compact sets coincide. In particular, in terms of almost Dunford–Pettis operators into _c0$c_0$, we give an operator characterization of those σ-Dedekind complete Banach lattices whose relatively weakly compact sets are almost limited, that is, for a σ-Dedekind Banach lattice E, every relatively weakly compact set in E   is almost limited if and only if every continuous linear operator T:E→_c0$T:E\to c_0$ is an almost Dunford–Pettis operator.     

On the connectivity of the Julia set of a finitely generated rational semigroup

In this paper we show that the Julia set of a finitely generated rational semigroup is connected if the union of the Julia sets of generators is contained in a subcontinuum of . Under a nonseparating condition, we prove that the Julia set of a finitely generated polynomial semigroup is connected if its postcritical set is bounded.

     

A direct integral decomposition of the wavelet representation

In this paper we use the concept of wavelet sets, as introduced by X. Dai and D. Larson, to decompose the wavelet representation of the discrete group associated to an arbitrary integer dilation matrix as a direct integral of irreducible monomial representations. In so doing we generalize a result of F. Martin and A. Valette in which they show that the wavelet representation is weakly equivalent to the regular representation for the Baumslag-Solitar groups.

     

On the number of pairwise non-isomorphic minimal blocking sets in PG(2, q)

In this paper we examine whether the number of pairwise non-isomorphic minimal blocking sets in PG(2, q) of a certain size is larger than polynomial. Our main result is that there are more than polynomial pairwise non-isomorphic minimal blocking sets for any size in the intervals [2q−1, 3q−4] for q odd and for q square. We can also prove a similar result for certain values of the intervals and .      

Rigid cantor sets in with simply connected complement

We prove that there exist uncountably many inequivalent rigid wild Cantor sets in with simply connected complement. Previous constructions of wild Cantor sets in with simply connected complement, in particular the Bing- Whitehead Cantor sets, had strong homogeneity properties. This suggested it might not be possible to construct such sets that were rigid. The examples in this paper are constructed using a generalization of a construction of Skora together with a careful analysis of the local genus of points in the Cantor 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).     

Ultrafilters and non-Cantor minimal sets in linearly ordered dynamical systems

It is well known that infinite minimal sets for continuous functions on the interval are Cantor sets; that is, compact zero dimensional metrizable sets without isolated points. On the other hand, it was proved in Alcaraz and Sanchis (Bifurcat Chaos 13:1665–1671, 2003) that infinite minimal sets for continuous functions on connected linearly ordered spaces enjoy the same properties as Cantor sets except that they can fail to be metrizable. However, no examples of such subsets have been known. In this note we construct, in ZFC, non-metrizable infinite pairwise non-homeomorphic minimal sets on compact connected linearly ordered spaces.      

Reflexivity and sets of Fréchet subdifferentiability

We show that the sets of Fréchet subdifferentiability of Lipschitz functions on a Banach space are Borel if and only if is reflexive. This answers a question of L. Zajíček.

     

Determinacy and weakly Ramsey sets in Banach spaces

We give a sufficient condition for a set of block subspaces in an infinite-dimensional Banach space to be weakly Ramsey. Using this condition we prove that in the Levy-collapse of a Mahlo cardinal, every projective set is weakly Ramsey. This, together with a construction of W. H. Woodin, is used to show that the Axiom of Projective Determinacy implies that every projective set is weakly Ramsey. In the case of we prove similar results for a stronger Ramsey property. And for hereditarily indecomposable spaces we show that the Axiom of Determinacy plus the Axiom of Dependent Choices imply that every set is weakly Ramsey. These results are the generalizations to the class of projective sets of some theorems from W. T. Gowers, and our paper ``Weakly Ramsey sets in Banach spaces.'

     

Not every -set is perfectly meager in the transitive sense

We prove the following theorems:

1.

It is consistent with ZFC that there exists a - set which is not perfectly meager in the transitive sense.

2.

Every set which is perfectly meager in the transitive sense has the property.

3.

The product of two sets perfectly meager in the transitive sense has also that property.

     

Pseudozeros of multivariate polynomials

The pseudozero set of a system of polynomials in complex variables is the subset of which is the union of the zero-sets of all polynomial systems that are near to in a suitable sense. This concept is made precise, and general properties of pseudozero sets are established. In particular it is shown that in many cases of natural interest, the pseudozero set is a semialgebraic set. Also, estimates are given for the size of the projections of pseudozero sets in coordinate directions. Several examples are presented illustrating some of the general theory developed here. Finally, algorithmic ideas are proposed for solving multivariate polynomials.

     

On holomorphic functions attaining their norms

We show that on a complex Banach space X, the functions uniformly continuous on the closed unit ball and holomorphic on the open unit ball that attain their norms are dense provided that X has the Radon-Nikodym property. We also show that the same result holds for Banach spaces having a strengthened version of the approximation property but considering just functions which are also weakly uniformly continuous on the unit ball. We prove that there exists a polynomial such that for any fixed positive integer k, it cannot be approximated by norm attaining polynomials with degree less than k. For , a predual of a Lorentz sequence space, we prove that the product of two polynomials with degree less than or equal two attains its norm if, and only if, each polynomial attains its norm.     

Sampling sets and sufficient sets for A

We give new characterizations of the subsets S of the unit disc of the complex plane such that the topology of the space A^−∞ of holomorphic functions of polynomial growth on coincides with the topology of space of the restrictions of the functions to the set S. These sets are called weakly sufficient sets for A^−∞. Our approach is based on a study of the so-called (p,q)-sampling sets which generalize the A^−p-sampling sets of Seip. A characterization of (p,q)-sampling and weakly sufficient rotation invariant sets is included. It permits us to obtain new examples and to solve an open question of Khôi and Thomas.     

Every three-point set is zero dimensional

This paper answers a question of Jan J. Dijkstra by giving a proof that all three-point sets are zero dimensional. It is known that all two-point sets are zero dimensional, and it is known that for all 3$">, there are -point sets which are not zero dimensional, so this paper answers the question for the last remaining case.

     

Exact formulae and matrix-less eigensolvers for block banded symmetric Toeplitz matrices

Precise asymptotic expansions for the eigenvalues of a Toeplitz matrix \(T_n(f)\), as the matrix size n tends to infinity, have recently been obtained, under suitable assumptions on the associated generating function f. A restriction is that f has to be polynomial, monotone, and scalar-valued. In this paper we focus on the case where \(\mathbf {f}\) is an \(s\times s\) matrix-valued trigonometric polynomial with \(s\ge 1\), and \(T_n(\mathbf {f})\) is the block Toeplitz matrix generated by \(\mathbf {f}\), whose size is \(N(n,s)=sn\). The case \(s=1\) corresponds to that already treated in the literature. We numerically derive conditions which ensure the existence of an asymptotic expansion for the eigenvalues. Such conditions generalize those known for the scalar-valued setting. Furthermore, following a proposal in the scalar-valued case by the first author, Garoni, and the third author, we devise an extrapolation algorithm for computing the eigenvalues of banded symmetric block Toeplitz matrices with a high level of accuracy and a low computational cost. The resulting algorithm is an eigensolver that does not need to store the original matrix, does not need to perform matrix-vector products, and for this reason is called matrix-less. We use the asymptotic expansion for the efficient computation of the spectrum of special block Toeplitz structures and we provide exact formulae for the eigenvalues of the matrices coming from the \(\mathbb {Q}_p\) Lagrangian Finite Element approximation of a second order elliptic differential problem. Numerical results are presented and critically discussed.     

Mycielski ideal and the perfect set theorem

We make several observations on the Mycielski ideal and prove a version of the perfect set theorem concerning this ideal for analytic sets: If is an analytic set all projections of which are uncountable, then there is a perfect set a projection of which is the whole space. We also prove that (a modification of) an infinite game of Mycielski is determined for analytic sets.

     

Algebras of fuzzy sets

In this paper we investigate two kinds of algebras of fuzzy sets, which are obtained by using Zadeh's extension principle. We give conditions under which a homomorphism between two algebras induces a homomorphism between corresponding algebras of fuzzy sets. We prove that if the structure of truth values is a complete residuated lattice, the induced algebra of a subalgebra of an algebra can be embedded into the induced algebra of fuzzy sets of . For direct products we give conditions under which the direct product of algebras of fuzzy sets could be embedded into the algebra of fuzzy sets of the direct product. In the case of homomorphisms and direct products, the two kinds of algebras of fuzzy sets behave in different ways.