Norms and essential norms of linear combinations of endomorphisms

We compute norms and essential norms of linear combinations of endomorphisms on uniform algebras.

     

Equivalence of one-dimensional second-order linear finite difference operators

The direct, gauge and projective equivalence problems for one-dimensional second-order linear finite difference operators are solved using the method of equivariant moving frames.     

Convex combinations of nilpotent triangular norms

In this paper we deal with the open problem of convex combinations of continuous triangular norms stated by Alsina, Frank, and Schweizer [C. Alsina, M.J. Frank, B. Schweizer, Problems on associative functions, Aequationes Math. 66 (2003) 128-140, Problems 5 and 6]. They pose a question whether a non-trivial convex combination of triangular norms can ever be a triangular norm. The main result of this paper gives a negative answer to the question for any pair of continuous Archimedean triangular norms with different supports. With the help of this result we show that a non-trivial convex combination of nilpotent t-norms is never a t-norm. The main result also gives an alternative proof to the result presented by Ouyang and Fang [Y. Ouyang, J. Fang, Some observations about the convex combination of continuous triangular norms, Nonlinear Anal., 68 (11) (2008) 3382-3387, Theorem 3.1]. In proof of the main theorem we utilize the Reidmeister condition known from the web geometry.     

Equivalence constants for certain matrix norms II

We give an almost complete solution of a problem posed by Klaus and Li [A.-L. Klaus, C.-K. Li, Isometries for the vector (p, q) norm and the induced (p, q) norm, Linear and Multilinear Algebra 38 (1995) 315–332]. Klaus and Li’s problem, which arose during their investigations of isometries, was to relate the Frobenius (or Hilbert–Schmidt) norm of a matrix to various operator norms of that matrix. Our methods are based on earlier work of Feng [B.Q. Feng, Equivalence constants for certain matrix norms, Linear Algebra Appl. 374 (2003) 247–253] and Tonge [A. Tonge, Equivalence constants for matrix norms: a problem of Goldberg, Linear Algebra Appl. 306 (2000) 1–13], but introduce as a new ingredient some techniques developed by Hardy and Littlewood [G.H. Hardy, J.E. Littlewood, Bilinear forms bounded in space [p, q], Quart. J. Math. (Oxford) 5 (1934) 241–254].     

Essential normality for certain finite linear combinations of linear-fractional composition operators on the Hardy space H 2

In 1999 Nina Zorboska and in 2003 P. S.Bourdon, D. Levi, S.K.Narayan and J.H. Shapiro investigated the essentially normal composition operator ${C_\varphi }$ , when φ is a linear-fractional self-map of D. In this paper first, we investigate the essential normality problem for the operator T _w ${C_\varphi }$ on the Hardy space H ², where w is a bounded measurable function on ?D which is continuous at each point of F(φ), φ ∈ S(2), and T _w is the Toeplitz operator with symbol w. Then we use these results and characterize the essentially normal finite linear combinations of certain linear-fractional composition operators on H ².     

Several remarks on the norms of linear polynomial operators

Translated from Matematicheskie Zametki, Vol. 57, No. 5, pp. 712–717, May, 1995.     

Robust linear optimization under general norms

We explicitly characterize the robust counterpart of a linear programming problem with uncertainty set described by an arbitrary norm. Our approach encompasses several approaches from the literature and provides guarantees for constraint violation under probabilistic models that allow arbitrary dependencies in the distribution of the uncertain coefficients.     

Irrationality of linear combinations of eigenvectors

A givenn ×n matrix of rational numbers acts onC ^π and onQ ^π. We assume that its characteristic polynomial is irreducible and compare a basis of eigenvectors forC ^π with the standard basis forQ ^π. Subject to a hypothesis on the Galois group we prove that vectors from these two bases are as independent of each other as possible.     

Equivalence classes of matrices over finite fields

Let F=GF(q) denote the finite field of order q, and F_mn the ring of m×n matrices over F. Let Ω be a group of permutations of F. If A,B∈F_mn, then A is equivalent to B relative to Ω if there exists ?∈Ω such that ?(a_ij) = b_ij. Formulas are given for the number of equivalence classes of a given order and for the total number of classes induced by various permutation groups. In particular, formulas are given if Ω is the symmetric group on q letters, a cyclic group, or a direct sum of cyclic groups.     

Equivalence classes of functions between finite groups

Two types of equivalence relation are used to classify functions between finite groups into classes which preserve combinatorial and algebraic properties important for a wide range of applications. However, it is very difficult to tell when functions equivalent under the coarser (“graph”) equivalence are inequivalent under the finer (“bundle”) equivalence. Here we relate graphs to transversals and splitting relative difference sets (RDSs) and introduce an intermediate relation, canonical equivalence, to aid in distinguishing the classes. We identify very precisely the conditions under which a graph equivalence determines a bundle equivalence, using transversals and extensions. We derive a new and easily computed algebraic measure of nonlinearity for a function f, calculated from the image of its coboundary ∂f. This measure is preserved by bundle equivalence but not by the coarser equivalences. It takes its minimum value if f is a homomorphism, and takes its maximum value if the graph of f contains a splitting RDS.     

Special linear combinations of orthogonal polynomials

The paper lists a number of problems that motivate consideration of special linear combinations of polynomials, orthogonal with the weight p(x) on the interval (a,b). We study properties of the polynomials, as well as the necessary and sufficient conditions for their orthogonality. The special linear combinations of Chebyshev orthogonal polynomials of four kinds with absolutely constant coefficients hold a distinguished place in the class of such linear combinations.     

Equivalence between mixed finite element and multi-point finite volume methods

We consider the lowest-order Raviart–Thomas mixed finite element method for elliptic problems on simplicial meshes in two or three space dimensions. This method produces saddle-point type problems for scalar and flux unknowns. We show how to easily eliminate the flux unknowns, which implies an equivalence between this method and a particular multi-point finite volume scheme, without any approximate numerical integration. We describe the stencil of the final matrix and give sufficient conditions for its symmetry and positive definiteness. We present a numerical example illustrating the performance of the proposed method. To cite this article: M. Vohralík, C. R. Acad. Sci. Paris, Ser. I 339 (2004).     

Product inequalities for norms of linear factors

We give an inequality which bounds the product of the Lp norms of the linear factors of a polynomial by a multiple of the Lp norm of that polynomial. This result generalizes two inequalities of Króo and Pritsker.     

Compact linear operators on functional spaces with two norms

Some principles of the operator theory in a linear space with two norms are established in this paper. The well-known Hilbert-Schmidt theorem on the eigenfunction expansion of sourcewise represented functions, Mercer's theorem and other results can be consider as special cases of the statements presented. The general approach proposed is used to construct the theory of symmetrizable operators and to investigate the asymptotic behaviour of eigenvalues of compact operators.This paper was translated by M. Gorbuchuk and V. GorbachukThis paper was translated by M. Gorbuchuk and V. Gorbachuk.     

Equivalence of norms on operator space tensor products of -algebras

The Haagerup norm on the tensor product of two -algebras and is shown to be Banach space equivalent to either the Banach space projective norm or the operator space projective norm if and only if either or is finite dimensional or and are infinite dimensional and subhomogeneous. The Banach space projective norm and the operator space projective norm are equivalent on if and only if or is subhomogeneous.

     

Order of approximation by linear combinations of positive linear operators

Order of uniform approximation is studied for linear combinations due to May and Rathore of Baskakov-type operators and recent methods of Pethe. The order of approximation is estimated in terms of a higher-order modulus of continuity of the function being approximated.     

幂等矩阵线性组合的可逆性

设T1,T2,T3是三个不同的两两相互可交换的n×n非零的三次幂等矩阵,并且c1,c2,c3是非零数.本文主要给出了线性组合c1T1 c2T2 c3T3可逆性的刻画.