Semigroups and resolvents of bounded variation,imaginary powers andH ∞ functional calculus

Let −A be a linear, injective operator, on a Banach spaceX. We show that ∃ anH ^∞ functional calculus forA if and only if −A generates a bouned strongly continuous holomorphic semigroup of uniform weak bounded variation, if and only ifA(ζ+A) ⁻¹ is of uniform weak bounded variation. This provides a sufficient condition for the imaginary powers ofA, {A^−is} sεR, to extend to a strongly continuous group of bounded operators; we also give similar necessary conditions.     

Quadratically Hyponormal Recursively Generated Weighted Shifts Need Not Be Positively Quadratically Hyponormal

We study a class of weighted shifts W _α defined by a recursively generated sequence α ≡ α₀, … , α _m−2, (α _m−1, α _m , α _m+1)^∧ and characterize the difference between quadratic hyponormality and positive quadratic hyponormality. We show that a shift in this class is positively quadratically hyponormal if and only if it is quadratically hyponormal and satisfies a finite number of conditions. Using this characterization, we give a new proof of [12, Theorem 4.6], that is, for m = 2, W _α is quadratically hyponormal if and only if it is positively quadratically hyponormal. Also, we give some new conditions for quadratic hyponormality of recursively generated weighted shift W _α (m ≥ 2). Finally, we give an example to show that for m ≥ 3, a quadratically hyponormal recursively generated weighted shift W _α need not be positively quadratically hyponormal.     

Poincaré duality and periodicity,II. James periodicity

Let K be a connected finite complex. This paper studies the problem of whether one can attach a cell to some iterated suspension Σ ^j K so that the resulting space satisfies Poincaré duality. When this is possible, we say that Σ ^j K is a spine. We introduce the notion of quadratic self duality and show that if K is quadratically self dual, then Σ ^j K is a spine whenever j is a suitable power of two.     

A Sufficient Condition for the Existence of Large Empty Convex Polygons

   Abstract. Let P be a set of points in general position in the plane. We say that P is k -convex if no triangle determined by P contains more than k points of P in the interior. We say that a subset A of P in convex position forms an empty polygon (in P ) if no point of P \ A lies in the convex hull of A . We show that for any k,n there is an N=N(k,n) such that any k -convex set of at least N points in general position in the plane contains an empty n -gon. We also prove an analogous statement in R ^d for each odd d≥ 3 .     

Continuity of the straight line path for convex sets

IfA andB are closed nonempty sets in a locally convex space, the straight line path fromA toB is defined by the formulaφ(α)=cl (αA+(1−α)B), 0≦α≦1. IfA andB are convex, then continuity of the path with respect to the Hausdorff uniform topology is necessary for both connectedness and path connectedness ofA toB within the convex sets so topologized. We also produce internal necessary and sufficient conditions for continuity of the path between pairs of convex sets.     

A Helly-Type Theorem for Hyperplane Transversals to Well-Separated Convex Sets

Let S be a finite collection of compact convex sets in \R ^d . Let D(S) be the largest diameter of any member of S . We say that the collection S is ɛ-separated if, for every 0 < k < d , any k of the sets can be separated from any other d-k of the sets by a hyperplane more than ɛ D(S)/2 away from all d of the sets. We prove that if S is an ɛ -separated collection of at least N(ɛ) compact convex sets in \R ^d and every 2d+2 members of S are met by a hyperplane, then there is a hyperplane meeting all the members of S . The number N(ɛ) depends both on the dimension d and on the separation parameter ɛ . This is the first Helly-type theorem known for hyperplane transversals to compact convex sets of arbitrary shape in dimension greater than one. Received August 10, 2000, and in revised form January 24, 2001. Online publication April 6, 2001.     

The Simple Connectedness of a Tame Weakly Shod Algebra

Abstract

We prove that a tame weakly shod algebra A which is not quasi-tilted is simply connected if and only if the orbit graph of its pip-bounded component is a tree, or if and only if its first Hochschild cohomology group H¹(A) with coefficients in _A A _A vanishes. We also show that it is strongly simply connected if and only if the orbit graph of each of its directed components is a tree, or if and only if H¹(A) = 0 and it contains no full convex subcategory which is hereditary of type 𝔸?, or if and only if it is separated and contains no full convex subcategory which is hereditary of type 𝔸?.     

A Sufficient Condition for the Existence of Large Empty Convex Polygons

Abstract. Let P be a set of points in general position in the plane. We say that P is k -convex if no triangle determined by P contains more than k points of P in the interior. We say that a subset A of P in convex position forms an empty polygon (in P ) if no point of P \ A lies in the convex hull of A . We show that for any k,n there is an N=N(k,n) such that any k -convex set of at least N points in general position in the plane contains an empty n -gon. We also prove an analogous statement in R ^d for each odd d≥ 3 .     

Asymptotic behaviour and the moduli space of doubly-periodic instantons

We study doubly-periodic instantons, i.e. instantons on the product of a 1-dimensional complex torus T with a complex line ℂ, with quadratic curvature decay. We determine the asymptotic behaviour of these instantons, constructing new asymptotic invariants. We show that the underlying holomorphic bundle extends to T×ℙ¹. The converse statement is also true, namely a holomorphic bundle on T×ℙ¹ which is flat on the torus at infinity, and satisfies a stability condition, comes from a doubly-periodic instanton. Finally, we study the hyperk?hler geometry of the moduli space of doubly-periodic instantons, and prove that the Nahm transform previously defined by the second author is a hyperk?hler isometry with the moduli space of certain meromorphic Higgs bundles on the dual torus. Received June 8, 2000 / final version received February 1, 2001?Published online April 3, 2001     

Inverses of Generators of Integrated or Regularized Semigroups

It is shown that, for any bounded, injective operator C, the class of injective, densely defined operators with dense range and nonempty resolvent that generate bounded holomorphic C-regularized semigroups is closed under inversion, but, for any n ∈ N, the class of injective, densely defined operators with dense range that generate bounded holomorphic n-times integrated semigroups is very far from being closed under inversion: it is shown that, if both A and A^-1 generate bounded holomorphic n-times integrated semigroups of sufficiently large angle θ, then they both generate strongly continuous bounded holomorphic semigroups of angle θ.     

Eversive maps of bounded convex domains in ℂ n+1

A duality principle, relating the geometry of the Kobayashi metric with the CR geometry of the boundaries of smoothly bounded, strongly convex domains in ℂ ⁿ⁺¹ is established. A characterization of the holomorphic Jacobi vector fields of those domains is also given.     

An analytic center quadratic cut method for the convex quadratic feasibility problem

 We consider a quadratic cut method based on analytic centers for two cases of convex quadratic feasibility problems. In the first case, the convex set is defined by a finite yet large number, N, of convex quadratic inequalities. We extend quadratic cut algorithm of Luo and Sun [3] for solving such problems by placing or translating the quadratic cuts directly through the current approximate center. We show that, in terms of total number of addition and translation of cuts, our algorithm has the same polynomial worst case complexity as theirs [3]. However, the total number of steps, where steps consist of (damped) Newton steps, function evaluations and arithmetic operations, required to update from one approximate center to another is , where ε is the radius of the largest ball contained in the feasible set. In the second case, the convex set is defined by an infinite number of certain strongly convex quadratic inequalities. We adapt the same quadratic cut method for the first case to the second one. We show that in this case the quadratic cut algorithm is a fully polynomial approximation scheme. Furthermore, we show that, at each iteration, k, the total number steps (as described above) required to update from one approximate center to another is at most , with ε as defined above. Received: April 2000 / Accepted: June 2002 Published online: September 5, 2002 Key words. convex quadratic feasibility problem – interior-point methods – analytic center – quadratic cuts – potential function     

Deductive systems of a cone algebra — II: Isomorphism theorem

We prove that there is an isomorphism φ of the lattice of deductive systems of a cone algebra onto the lattice of convex ℓ-subgroups of a lattice ordered group (determined by the cone algebra) such that for any deductive system A of the cone algebra, A is respectively a prime, normal or polar if and only if φ(A) is a prime convex ℓ-subgroup, ℓ-ideal or polar subgroup of the ℓ-group, thus generalizing and extending the result of Rachůnek that the lattice of ideals of a pseudo MV-algebra is isomorphic to the lattice of convex ℓ-subgroups of a unital lattice ordered group.      

Tilt-Critical Algebras of Tame Type

Let A be a finite dimensional k-algebra over an algebraically closed field. Assume A = kQ/I where Q is a quiver without oriented cycles. We say that A is tilt-critical if it is not tilted but every proper convex subcategory of A is tilted. We describe the tilt-critical algebras which are strongly simply connected and tame.     

On directional convexity

Motivated by problems from calculus of variations and partial differential equations, we investigate geometric properties of D-convexity. A function f: R ^d → R is called D-convex, where D is a set of vectors in R ^d, if its restriction to each line parallel to a nonzero v ∈ D is convex. The D-convex hull of a compact set A ⊂ R ^d, denoted by co^D(A), is the intersection of the zero sets of all nonnegative D-convex functions that are zero on A. It also equals the zero set of the D-convex envelope of the distance function of A. We give an example of an n-point set A ⊂ R ² where the D-convex envelope of the distance function is exponentially close to zero at points lying relatively far from co ^D(A), showing that the definition of the D-convex hull can be very nonrobust. For separate convexity in R ³ (where D is the orthonormal basis of R ³), we construct arbitrarily large finite sets A with co ^D(A) ≠ A whose proper subsets are all equal to their D-convex hull. This implies the existence of analogous sets for rank-one convexity and for quasiconvexity on 3 × 3 (or larger) matrices. This research was supported by Charles University Grants No. 158/99 and 159/99.     

Piercing Numbers for Balanced and Unbalanced Families

Given a finite family F\mathcal{F} of convex sets in ℝ ^d , we say that F\mathcal{F} has the (p,q) _r property if for any p convex sets in F\mathcal{F} there are at least r q-tuples that have nonempty intersection. The piercing number of F\mathcal{F} is the minimum number of points we need to intersect all the sets in F\mathcal{F}. In this paper we will find some bounds for the piercing number of families of convex sets with (p,q) _r properties.     

Contraction and Expansion of Convex Sets

Let S{\mathcal{S}} be a set system of convex sets in ℝ ^d . Helly’s theorem states that if all sets in S{\mathcal{S}} have empty intersection, then there is a subset S￠ ì S{\mathcal{S}}'\subset{\mathcal{S}} of size d+1 which also has empty intersection. The conclusion fails, of course, if the sets in S{\mathcal{S}} are not convex or if S{\mathcal{S}} does not have empty intersection. Nevertheless, in this work we present Helly-type theorems relevant to these cases with the aid of a new pair of operations, affine-invariant contraction, and expansion of convex sets. These operations generalize the simple scaling of centrally symmetric sets. The operations are continuous, i.e., for small ε>0, the contraction C ^−ε and the expansion C ^ε are close (in the Hausdorff distance) to C. We obtain two results. The first extends Helly’s theorem to the case of set systems with nonempty intersection:     

Holomorphic Cliffordian functions

The aim of this paper is to put the foundations of a new theory of functions, called holomorphic Cliffordian, which should play an essential role in the generalization of holomorphic functions to higher dimensions. Let ℝ_0,2m+1 be the Clifford algebra of ℝ^2m+1 with a quadratic form of negative signature, be the usual operator for monogenic functions and Δ the ordinary Laplacian. The holomorphic Cliffordian functions are functionsf: ℝ^2m+2 → ℝ_0,2m+1, which are solutions ofDδ ^m f = 0. Here, we will study polynomial and singular solutions of this equation, we will obtain integral representation formulas and deduce the analogous of the Taylor and Laurent expansions for holomorphic Cliffordian functions. In a following paper, we will put the foundations of the Cliffordian elliptic function theory.     

Reduced bodies in normed planes

We say that a convex body R of a d-dimensional real normed linear space M ^d is reduced, if Δ(P) < Δ(R) for every convex body P ⊂ R different from R. The symbol Δ(C) stands here for the thickness (in the sense of the norm) of a convex body C ⊂ M ^d . We establish a number of properties of reduced bodies in M ². They are consequences of our basic Theorem which describes the situation when the width (in the sense of the norm) of a reduced body R ⊂ M ² is larger than Δ(R) for all directions strictly between two fixed directions and equals Δ(R) for these two directions.     

Almost isomorphism of Abelian groups and determinability of Abelian groups by their subgroups

An Abelian group A is called correct if for any Abelian group B isomorphisms A ≅ B′ and B ≅ A′, where A′ and B′ are subgroups of the groups A and B, respectively, imply the isomorphism A ≅ B. We say that a group A is determined by its subgroups (its proper subgroups) if for any group B the existence of a bijection between the sets of all subgroups (all proper subgroups) of groups A and B such that corresponding subgroups are isomorphic implies A ≅ B. In this paper, connections between the correctness of Abelian groups and their determinability by their subgroups (their proper subgroups) are established. Certain criteria of determinability of direct sums of cyclic groups by their subgroups and their proper subgroups, as well as a criterion of correctness of such groups, are obtained. __________ Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 9, No. 3, pp. 21–36, 2003.