Finite-dimensional lattice-subspaces of

Let be linearly independent positive functions in , let be the vector subspace generated by the and let denote the curve of determined by the function , where . We establish that is a vector lattice under the induced ordering from if and only if there exists a convex polygon of with vertices containing the curve and having its vertices in the closure of the range of . We also present an algorithm which determines whether or not is a vector lattice and in case is a vector lattice it constructs a positive basis of . The results are also shown to be valid for general normed vector lattices.

     

Computational methods in lattice-subspaces of with applications in portfolio insurance

In this article, we develop a computational method for an algorithmic process first posed by Polyrakis in 1996 in order to check whether a finite collection of linearly independent positive functions in C[a,b] forms a lattice-subspace. Lattice-subspaces are closely related to a cost minimization problem in the theory of finance that ensures the minimum-cost insured portfolio and this connection is further investigated here. Finally, we propose a computational method in order to solve the minimization problem and to calculate the minimum-cost insured portfolio. All of the numerical work is performed using the Matlab high-level language.     

The Product of Minimal Functions is Minimal

Using Doob's h-processes, a simple proof is given of a resultof Freire: every product of minimal eigenfunctions for Brownianmotions on each one of a product of complete Riemannian manifoldsis itself minimal for the Brownian motion on the product manifold.     

Minimal Frame Operator Norms Via Minimal Theta Functions

We investigate sharp frame bounds of Gabor frames with chirped Gaussians and rectangular lattices or, equivalently, the case of the standard Gaussian and general lattices. We prove that for even redundancy and standard Gaussian window the hexagonal lattice minimizes the upper frame bound using a result by Montgomery on minimal theta functions.     

Minimal Submanifolds

This paper provides a survey of both old and new results aboutminimal surfaces and submanifolds. 2000 Mathematics SubjectClassification 54C40, 14E20 (primary), 46E25, 20C20 (secondary).     

Minimal inequalities

We provide a characterization of minimal inequalities for bounded mixed integer programs, in terms of subadditive functions. The condition on the columns of the integer-constrained variables is analogous to that obtained earlier for the group problem, and we also determine the condition on the columns of the continuous variables.The research reported here was done at Carnegie-Mellon University.The report was prepared as part of the activities of the Management Sciences Research Group, Carnegie-Mellon University, under Contract N00014-67-A-0314-0007 NR 047-048 with U.S. Office of Naval Research. Reproduction in whole or in part is permitted for any purpose of the U.S. Government.     

Minimal Non-FO-Groups

A group G is said to be a “minimal non-FO-group” (an MNFO-group) if all its proper subgroups are FO-groups, but G itself is not. The aim of this article is to study the class of MNFO-groups. The structure of MNFO-groups is completely described, both in nonperfect case and perfect case.     

Minimal graphs

Elementary properties of harmonic maps between Riemannian manifolds are interpreted via their graphs, viewed as nonparametric minimal submanifolds (Proposition 1). Then examples, are given of nonparametric submanifolds of compact Riemannian manifolds which cannot be deformed-through nonparametric submanifolds-to nonparametric minimal submanifolds (Propositions 2 and 4).     

Minimal measures

For a finite composition of exact, area preserving, positive twist diffeomorphisms of the infinite cylinder, we will show that an invariant measure whose support consists of minimal orbits strictly minimizes the average action.     

The Product of Minimal Functions is Minimal: Erratum

Corollary 2.3 is false as stated, but is correct if one assumesthat both generators satisfy the separation property.     

On Minimal Coalgebras

We define an out-degree for F-coalgebras and show that the coalgebras of outdegree at most κ form a covariety. As a subcategory of all F-coalgebras, this class has a terminal object, which for many problems can stand in for the terminal F-coalgebra, which need not exist in general. As examples, we derive structure theoretic results about minimal coalgebras, showing that, for instance minimization of coalgebras is functorial, that products of finitely many minimal coalgebras exist and are given by their largest common subcoalgebra, that minimal subcoalgebras have no inner endomorphisms and show how minimal subcoalgebras can be constructed from Moore-automata. Since the elements of minimal subcoalgebras must correspond uniquely to the formulae of any logic characterizing observational equivalence, we give in the last section a straightforward and self-contained account of the coalgebraic logic of D. Pattinson and L. Schröder, which we believe is simpler and more direct than the original exposition.     

极小非PNN-群

有限群G称作PNN-群,如果G的每一个极小子群X要么正规于G,要么是自正规化的.本文将讨论PNN-群的性质,并给出极小非PNN-群,也就是本身不是PNN-群,每个真子群都是PNN-群的有限群的完全分类.     

Minimal claw-free graphs

A graph G is a minimal claw-free graph (m.c.f. graph) if it contains no K _1,3 (claw) as an induced subgraph and if, for each edge e of G, G ™ e contains an induced claw. We investigate properties of m.c.f. graphs, establish sharp bounds on their orders and the degrees of their vertices, and characterize graphs which have m.c.f. line graphs. Support by the South African National Research Foundation is gratefully acknowledged.     

Minimal paramount matrices

A real symmetric matrix of order n, n ? 2, is said to be paramount if each proper principal minor is not less than the absolute value of any other minor built from the same rows. A paramount matrix is minimal ¹ if reducing any of the diagonal entries removes the matrix from the paramount class. Minimal paramount matrices arise in the n-port realization problem of circuit theory. A condition is found that is equivalent to the minimality of a paramount matrix. Conditions are also found that guarantee that the inverse of an invertible minimal paramount matrix is itself minimal.     

Minimal Bar Tableaux

Motivated by recent results of Stanley, we generalize the rank of a partition λ to the rank of a shifted partition S(λ). We show that the number of bars required in a minimal bar tableau of S(λ) is max(o, e + (ℓ(λ) mod 2)), where o and e are the number of odd and even rows of λ. As a consequence we show that the irreducible projective characters of S_n vanish on certain conjugacy classes. Another corollary is a lower bound on the degree of the terms in the expansion of Schur’s Q_λ symmetric functions in terms of the power sum symmetric functions. Received November 20, 2003     

Exotic Minimal Surfaces

We prove a general fusion theorem for complete orientable minimal surfaces in ?³ with finite total curvature. As a consequence, complete orientable minimal surfaces of weak finite total curvature with exotic geometry are produced. More specifically, universal surfaces (i.e., surfaces from which all minimal surfaces can be recovered) and space-filling surfaces with arbitrary genus and no symmetries.