On the Limits of Lagrange Projectors

This article addresses a question of Carl de Boor (In: Constructive theory of functions, Varna 2005, pp. 51–63, Marin Drinov Academic, Sofia, [2006]): What ideal projectors are the limits of Lagrange projectors? The results of this paper answer the question in the sense that for every ideal projector P, we prescribe finitely many computations that determine whether the projector P is a limit of Lagrange projectors.     

On a Conjecture of Carl de Boor Regarding the Limits of Lagrange Interpolants

The purpose of this paper is to provide a counterexample to a conjecture of Carl de Boor [2], that every ideal projector is a limit of Lagrange projectors. The counterexample is based on a construction of A. Iarrobino [9] pointed to in this context by G. Ellingsrud (as mentioned in de Boor's paper [2]). We also show that the conjecture is true for polynomials in two variables.     

On One class of Hermite projectors

We conjecture that every ideal projector on \({\mathbb {C}}\left[ x_1,\ldots ,x_d\right] \) whose kernel is generated by precisely d polynomials is Hermite (i.e., the limit of Lagrange interpolation projectors). We validate this conjecture in case the d generators of the kernel have no roots at infinity.     

The relation of the d-orthogonal polynomials to the Appell polynomials

We are dealing with the concept of d-dimensional orthogonal (abbreviated d-orthogonal) polynomials, that is to say polynomials verifying one standard recurrence relation of order d + 1. Among the d-orthogonal polynomials one singles out the natural generalizations of certain classical orthogonal polynomials. In particular, we are concerned, in the present paper, with the solution of the following problem (P): Find all polynomial sequences which are at the same time Appell polynomials and d-orthogonal. The resulting polynomials are a natural extension of the Hermite polynomials.

A sequence of these polynomials is obtained. All the elements of its (d + 1)-order recurrence are explicitly determined. A generating function, a (d + 1)-order differential equation satisfied by each polynomial and a characterization of this sequence through a vectorial functional equation are also given. Among such polynomials one singles out the d-symmetrical ones (Definition 1.7) which are the d-orthogonal polynomials analogous to the Hermite classical ones. When d = 1 (ordinary orthogonality), we meet again the classical orthogonal polynomials of Hermite.     

Pointwise versus equal (quasi-normal) convergence via ideals

We prove a characterization showing when the ideal pointwise convergence does not imply the ideal equal (aka quasi-normal) convergence. The characterization is expressed in terms of a cardinal coefficient related to the bounding number b$\mathfrak{b}$. We also prove a characterization showing when the ideal equal limit is unique.     

On classification of von Neumann algebras in a space with conjugation

In this paper for the first time we show that in the complex Hilbert space with the conjugation operator a classification of von Neumann algebras is possible. Similar classification is known for Krein spaces. Projectors (idempotents) often serve as elements of quantum logic. In operator theories projectors play the role of elements from which bounded operators are constructed. For one special case we show that for any projector from von Neumann algebra which acts in a separable Hilbert space one can always find conjugation operator J adjoined to this algebra for which the projector is self-adjoint.     

On the Closure of Translation–Dilation Invariant Linear Spaces of Polynomials

Assume that a linear space of real polynomials in d variables is given which is translation and dilation invariant. We show that if a sequence in this space converges pointwise to a polynomial, then the limit polynomial belongs to the space, too.     

Ideals in the Roe Algebras of Discrete Metric Spaces with Coefficients in B(H)

The notion of an ideal family of weighted subspaces of a discrete metric space X with bounded geometry is introduced.It is shown that,if X has Yu's property A,the ideal structure of the Roe algebra of X with coefficients in B(H) is completely characterized by the ideal families of weighted subspaces of X,where B(H) denotes the C*-algebra of bounded linear operators on a separable Hilbert space H.     

An Example on Operator Ideals

ＡｎＥｘａｍｐｌｅｏｎＯｐｅｒａｔｏｒＩｄｅａｌｓＺｈｏｎｇＨｕａｉｊｉｅ（钟怀杰）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＦｕｊｉａｎＮｏｒｍａｌＵｎｉｖｅｒｓｉｔｙ，Ｆｕｚｈｏｕ，３５０００７）Ａｂｓｔｒａｃｔ：ＬｅｔＸ＝ｌ１＋ｌ２．Ｄ...     

On determining the congruence of point sets in d dimensions

This paper considers the following problem: given two point sets A and B (|A| = |B| = n) in d dimensional Euclidean space, determine whether or not A is congruent to B. This paper presents an O(n^(d−1)/2 log n) time randomized algorithm. The birthday paradox, which is well-known in combinatorics, is used effectively in this algorithm. Although this algorithm is Monte-Carlo type (i.e., it may give a wrong result), this improves a previous O(n^d−2 log n) time deterministic algorithm considerably. This paper also shows that if d is not bounded, the problem is at least as hard as the graph isomorphism problem in the sense of the polynomiality. Several related results are described too.     

Topological algebras of functions of bounded variation I

A concept of generalized bounded variation for functions in s real variables is introduced. It is proved that the space of functions of this kind is a commutative Fréchet algebra with respect to pointwise multiplication. Several properties of this algebra are established.     

On poset similarity

Let P be a poset, and let A be an element of its strict incidence algebra. Saks (SIAM J. Algebraic Discrete Methods 1 (1980) 211–215; Discrete Math. 59 (1986) 135–166) and Gansner (SIAM J. Algebraic Discrete Methods 2 (1981) 429–440) proved that the kth Dilworth number of P is less than or equal to the dimension of the nullspace of A^k, and that there is some member of the strict incidence algebra of P for which equality is attained (for all k simultaneously). In this paper we focus attention on the question of when equality is attained with the strict zeta matrix, and proceed under a particular random poset model. We provide an invariant depending only on two measures of nonunimodality of the level structure for the poset that, with probability tending to 1 as the smallest level tends to infinity, takes on the same value as the inequality gap between the width of P and the dimension of the nullspace of its strict zeta matrix. In particular, we characterize the level structures for which the width of P is, with probability tending to 1, equal to the dimension of the nullspace of its strict zeta matrix. As a consequence, by the Kleitman–Rothschild Theorem 5, almost all posets in the Uniform random poset model have width equal to the dimension of the nullspace of their zeta matrices. We hope this is a first step toward a complete characterization of when equality holds in Saks’ and Gansner's inequality for the strict zeta matrix and for all k. New to this paper are also the canonical representatives of the poset similarity classes (where two posets are said to be similar if their strict zeta matrices are similar in the matrix-theoretic sense), and these form the setting for our work on Saks’ and Gansner's inequalities. (Also new are two functions that measure the nonunimodality of a sequence of real numbers.)     

Subgradient Projectors: Extensions,Theory, and Characterizations

Subgradient projectors play an important role in optimization and for solving convex feasibility problems. For every locally Lipschitz function, we can define a subgradient projector via generalized subgradients even if the function is not convex. The paper consists of three parts. In the first part, we study basic properties of subgradient projectors and give characterizations when a subgradient projector is a cutter, a local cutter, or a quasi-nonexpansive mapping. We present global and local convergence analyses of subgradent projectors. Many examples are provided to illustrate the theory. In the second part, we investigate the relationship between the subgradient projector of a prox-regular function and the subgradient projector of its Moreau envelope. We also characterize when a mapping is the subgradient projector of a convex function. In the third part, we focus on linearity properties of subgradient projectors. We show that, under appropriate conditions, a linear operator is a subgradient projector of a convex function if and only if it is a convex combination of the identity operator and a projection operator onto a subspace. In general, neither a convex combination nor a composition of subgradient projectors of convex functions is a subgradient projector of a convex function.     

A bivariate Markov inequality for Chebyshev polynomials of the second kind

This note presents a Markov-type inequality for polynomials in two variables where the Chebyshev polynomials of the second kind in either one of the variables are extremal. We assume a bound on a polynomial at the set of even or odd Chebyshev nodes with the boundary nodes omitted and obtain bounds on its even or odd order directional derivatives in a critical direction. Previously, the author has given a corresponding inequality for Chebyshev polynomials of the first kind and has obtained the extension of V.A. Markov’s theorem to real normed linear spaces as an easy corollary.To prove our inequality we construct Lagrange polynomials for the new class of nodes we consider and give a corresponding Christoffel–Darboux formula. It is enough to determine the sign of the directional derivatives of the Lagrange polynomials.     

布尔代数的Fuzzy子代数和Fuzzy理想

引入了布尔代数的Fuzzy子代数、Fuzzy理想和Fuzzy商布尔代数的概念,给出了布尔代数的Fuzzy集是Fuzzy子代数(Fuzzy理想)的充要条件,讨论了布尔代数的Fuzzy子代数(Fuzzy理想)在布尔代数同态下的像和逆像,得到了布尔代数的Fuzzy子代数的同态基本定理。     

Drinfeld Iterations and Wagner's Theorem

Abstract

In a previous paper, the author, in collaboration with Abhyankar, has proved that under certain assumptions the Galois groups of Carlitz–Drinfeld iterates of linear polynomials are general linear groups. The proof used Cameron–Kantor's characterization of linear groups. In this paper, we recover the result in very generic case by using a more elementary Wagner's characterization of linear groups. This is done using some commutative algebra.     

Unitary similarity of projectors

Summary We deal with linear operators acting in a finite dimensional complex Hilbert space. We show that there exists a simple canonical form for projectors (not necessarily orthogonal) under unitary similarity. As a consequence we obtain a simple test for unitary similarity of projectors. IfP is a projector we show thatP andP ^* are unitarily similar. We also determine the isomorphism type of the algebra generated by the projectorsP andP ^*.Dedicated to the memory of Alexander M. Ostrowski on the occasion of the 100th anniversary of his birth     

Characterizing switch-setting problems

Algebraic conditions and algorithmic procedures are given to determine whether an m × n rectangular configuration of switches can be transformed so that all switches are in the off position, regardless of initial configuration. However, when any switch is toggled, it and its rectilinearly adjacent neighbors change state. Using linear algebra, a finite field representation of the problem, and an analysis of Fibonacci polynomials, conditions on m and n are given which characterize when the m × n problem can be solved.