Convergence properties of minimal vectors for normal operators and weighted shifts

We study the behaviour of the sequence of minimal vectors corresponding to certain classes of operators on reflexive spaces, including multiplication operators and bilateral weighted shifts. The results proved are based on explicit formulae for the minimal vectors, and provide extensions of results due to Ansari and Enflo, and also Wiesner. In many cases the convergence of sequences associated with the minimal vectors leads to the construction of hyperinvariant subspaces for cyclic operators.

     

Approximation in reflexive Banach spaces and applications to the invariant subspace problem

We formulate a general approximation problem involving reflexive and smooth Banach spaces, and give its explicit solution. Two applications are presented--the first is to the Bounded Completion Problem involving approximation of Hardy class functions, while the second involves the construction of minimal vectors and hyperinvariant subspaces of linear operators, generalizing the Hilbert space technique of Ansari and Enflo.

     

Vectors of minimal norm

We characterize the minimal vectors (or extremal vectors) for the operator of multiplication by on We then give an application to infinite systems of equations.

     

Maximal continuants and the Fine-Wilf theorem

The following problem was posed by C.A. Nicol: given any finite sequence of positive integers, find the permutation for which the continuant (i.e. the continued fraction denominator) having these entries is maximal, resp. minimal. The extremal arrangements are known for the regular continued fraction expansion. For the singular expansion induced by the backward shift ⌈1/x⌉-1/x the problem is still open in the case of maximal continuants. We present the explicit solutions for sequences with pairwise different entries and for sequences made up of any pair of digits occurring with any given (fixed) multiplicities. Here the arrangements are uniquely described by a certain generalized continued fraction. We derive this from a purely combinatorial result concerning the partial order structure of the set of permutations of a linearly ordered vector. This set has unique extremal elements which provide the desired extremal arrangements. We also prove that the palindromic maximal continuants are in a simple one-to-one correspondence with the Fine and Wilf words with two coprime periods which gives a new analytic and combinatorial characterization of this class of words.     

Uniform Families and Count Matroids

Given an r-graph G on [n], we are allowed to add consecutively new edges to it provided that every time a new r-graph with at least l edges and at most m vertices appears. Suppose we have been able to add all edges. What is the minimal number of edges in the original graph? For all values of parameters, we present an example of G which we conjecture to be extremal and establish the validity of our conjecture for a range of parameters. Our proof utilises count matroids which is a new family of matroids naturally extending that of White and Whiteley. We characterise, in certain cases, the extremal graphs. In particular, we answer a question by Erdős, Füredi and Tuza. Received: May 6, 1998 Final version received: September 1, 1999     

On linear forbidden submatrices

In this paper we study the extremal problem of finding how many 1 entries an n by n 0-1 matrix can have if it does not contain certain forbidden patterns as submatrices. We call the number of 1 entries of a 0-1 matrix its weight. The extremal function of a pattern is the maximum weight of an n by n 0-1 matrix that does not contain this pattern as a submatrix. We call a pattern (a 0-1 matrix) linear if its extremal function is O(n). Our main results are modest steps towards the elusive goal of characterizing linear patterns. We find novel ways to generate new linear patterns from known ones and use this to prove the linearity of some patterns. We also find the first minimal non-linear pattern of weight above 4. We also propose an infinite sequence of patterns that we conjecture to be minimal non-linear but have Ω(nlogn) as their extremal function. We prove a weaker statement only, namely that there are infinitely many minimal not quasi-linear patterns among the submatrices of these matrices. For the definition of these terms see below.     

A 40-dimensional extremal Type II lattice with no 4-frames

We construct a 40-dimensional extremal Type II lattice not having any subsets consisting of 40 orthogonal minimal vectors, and determine the automorphism group. This lattice gives an example different from the 16 470 lattices constructed from binary codes by classical constructions.     

Extremal functions as divisors for kernels of Toeplitz operators

In this paper, an extremal function of a Banach space of analytic functions in the unit disk (not all functions vanishing at 0) is a function solving the extremal problem for functions f of norm 1. We study extremal functions of kernels of Toeplitz operators on Hardy spaces H^p, 1<p<∞. Such kernels are special cases of so-called nearly invariant subspaces with respect to the backward shift, for which Hitt proved that when p=2, extremal functions act as isometric divisors. We show that the extremal function is still a contractive divisor when p<2 and an expansive divisor when p>2 (modulo p-dependent multiplicative constants). We give examples showing that the extremal function may fail to be a contractive divisor when p>2 and also fail to be an expansive divisor when p<2. We discuss to what extent these results characterize the Toeplitz operators via invariant subspaces for the backward shift.     

Extremal vectors and invariant subspaces

For a bounded linear operator on Hilbert space we define a sequence of so-called minimal vectors in connection with invariant subspaces and show that this presents a new approach to invariant subspaces. In particular, we show that for any compact operator some weak limit of the sequence of minimal vectors is noncyclic for all operators commuting with and that for any normal operator , the norm limit of the sequence of minimal vectors is noncyclic for all operators commuting with . Thus, we give a new and more constructive proof of existence of invariant subspaces. The sequence of minimal vectors does not seem to converge in norm for an arbitrary bounded linear operator. We will prove that if belongs to a certain class of operators, then the sequence of such vectors converges in norm, and that if belongs to a subclass of , then the norm limit is cyclic.

     

Deficiently extremal Gorenstein algebras

The aim of this article is to study the homological properties of deficiently extremal Gorenstein algebras. We prove that if R/I is an odd deficiently extremal Gorenstein algebra with pure minimal free resolution, then the codimension of R/I must be odd. As an application, the structure of pure minimal free resolution of a nearly extremal Gorenstein algebra is obtained.     

Order isomorphisms in cones and a characterization of duality for ellipsoids

We study order isomorphisms in finite-dimensional ordered vector spaces. We generalize theorems of Alexandrov, Zeeman, and Rothaus (valid for ??non-angular?? cones) to wide classes of cones, including in particular polyhedral cones, using a different and novel geometric method. We arrive at the following result: whenever the cone has more than n generic extremal vectors, an order isomorphism must be affine. In the remaining case, of precisely n extremal rays, the transform has a restricted diagonal form. To this end, we prove and use a new version of the well-known Fundamental theorem of affine geometry. We then apply our results to the cone of positive semi-definite matrices and get a characterization of its order isomorphisms. As a consequence, the polarity mapping is, up to a linear map, the only order-reversing isomorphism for ellipsoids.     

芬斯拉空間極小超曲面的同態變換

<正> 在芬斯拉-嘉當空間裹,正如J.M.Wegener所指出,極小超曲面的確定是和某一定的超曲面參數族的選擇有關的,並且除了A_i=0的芬斯拉空間而外,在幾何學上很難給它以完備的意義.現時A.Deicke證明了在完全正测度之下具有A~i=0的芬期拉空間恰是黎曼空間.這個驚異的結果使得在這樣特     

Some extremal self-dual codes and unimodular lattices in dimension 40

In this paper, binary extremal singly even self-dual codes of length 40 and extremal odd unimodular lattices in dimension 40 are studied. We give a classification of extremal singly even self-dual codes of length 40. We also give a classification of extremal odd unimodular lattices in dimension 40 with shadows having 80 vectors of norm 2 through their relationships with extremal doubly even self-dual codes of length 40.     

Designing approximation minimal parametric surfaces with geodesics

Geodesic is an important curve in practical application, especially in shoe design and garment design. In practical applications, we not only hope the shoe and garment surfaces possess characteristic curves, but also we hope minimal cost of material to build surfaces. In this paper, we combine the geodesic and minimal surface. We study the approximation minimal surface with geodesics by using Dirichlet function. The extremal of such a function can be easily computed as the solutions of linear systems, which avoid the high nonlinearity of the area function. They are not extremal of the area function but they are a fine approximation in some cases.     

A classification of invariant distributions and convergence of imprecise Markov chains

We analyse the structure of imprecise Markov chains and study their convergence by means of accessibility relations. We first identify the sets of states, so-called minimal permanent classes, that are the minimal sets capable of containing and preserving the whole probability mass of the chain. These classes generalise the essential classes known from the classical theory. We then define a class of extremal imprecise invariant distributions and show that they are uniquely determined by the values of the upper probability on minimal permanent classes. Moreover, we give conditions for unique convergence to these extremal invariant distributions.     

Scaled Enflo type is equivalent to Rademacher type

We introduce the notion of the scaled Enflo type of a metricspace, and show that for Banach spaces, scaled Enflo type pis equivalent to Rademacher type p.     

Modelling Dependence Uncertainty in the Extremes of Markov Chains

General theory on the extremes of stationary processes leads only to a limited representation for extreme-state behaviour, usually summarised by the extremal index. In practice this means that other quantities such as the duration of extreme episodes or aggregate of threshold exceedances within a cluster require stronger model assumptions. In this paper we propose a model based on a Markov assumption for the underlying process, with high-level transitions determined by an asymptotically motivated distribution. This idea is not new: Smith et al. (1997) first developed the statistical basis for such a procedure, which was subsequently extended by Bortot and Tawn (1998) to better handle the case of weak extremal temporal dependence for which the extremal index is unity. We adopt similar procedures to each of these earlier works, but suggest a different model for the Markov transitions. The model we use was developed by Coles and Pauli (2002) to enable a Bayesian inference of multivariate extremes that provides a posterior distribution on the status of asymptotic independence. By adopting this model in the Markov framework, we show here that the model has all the flexibility of the model developed by Bortot and Tawn (1998), but with the additional advantage of providing a posterior probability on the extremal index and inferences that take full account of the uncertainty in the extremal index. We demonstrate the methodology on both simulated data and a time series of daily rainfall that exhibit weak temporal dependence at extreme levels.     

On quasinilpotent operators

In this note we modify a new technique of Enflo for producing hyperinvariant subspaces to obtain a much improved version of his ``two sequences' theorem with a somewhat simpler proof. As a corollary we get a proof of the ``best' theorem (due to V. Lomonosov) known about hyperinvariant subspaces for quasinilpotent operators that uses neither the Schauder-Tychonoff fixed point theorem nor the more recent techniques of Lomonosov.

     

Extreme positive operators on minimal and almost minimal cones

Fiedler and Pták called a cone minimal if it is n-dimensional and has n+1 extremal rays. We call a cone almost minimal if it is n-dimensional and has n+2 extremal rays. Duality properties stemming from the use of Gale pairs lead to a general technique for identifying the extreme cone-preserving (positive) operators between polyhedral cones. This technique is most effective for cones with dimension not much smaller than the number of their extreme rays. In particular, the Fiedler-Pták characterization of extreme positive operators between minimal cones is extended to the following cases: (i) operators from a minimal cone to an arbitrary polyhedral cone, (ii) operators from an almost minimal cone to a minimal cone.     

Solutions to Constrained Optimal Control Problems with Linear Systems

This paper is devoted to present solutions to constrained finite-horizon optimal control problems with linear systems, and the cost functional of the problem is in a general form. According to the Pontryagin’s maximum principle, the extremal control of such problem is a function of the costate trajectory, but an implicit function. We here develop the canonical backward differential flows method and then give the extremal control explicitly with the costate trajectory by canonical backward differential flows. Moreover, there exists an optimal control if and only if there exists a unique extremal control. We give the proof of the existence of the optimal solution for this optimal control problem with Green functions.