On the invertibility of Hilbert space idempotents

This note is to present some results on the group invertibility of linear combinations of idempotents when the difference of two idempotents is group invertible.     

Invertibility of linear combinations of two idempotents

Let and be two idempotents on a Hilbert space. In this note, we prove that the invertibility of the linear combination is independent of the choice of , if and

     

左中心rpp半群的半直积

讨论了幂等元都是左中心元的rpp半群的半直积,给出了这种半群半直积的充要条件,推广了一些已知的结果.     

Matrices over a commutative ring as sums of three idempotents or three involutions

Motivated by Hirano-Tominaga’s work on rings for which every element is a sum of two idempotents and by de Seguins Pazzis’s results on decomposing every matrix over a field of positive characteristic as a sum of idempotent matrices, we address decomposing every matrix over a commutative ring as a sum of three idempotent matrices and, respectively, as a sum of three involutive matrices.     

An algebraic invariant for Jordan automorphisms on B(H): The set of idempotents

Let H be an infinite dimensional complex Hilbert space. Denote by B(H)the algebra of all bounded linear operators on H, and by I(H) the set of all idempotents in B(H). Suppose that φ is a surjective map from B(H) onto itself. If for everyλ∈ {-1, 1, 2, 3, 1/2, 1/3} and A, B ∈ B(H), A - λB ∈ I(H) (→)φ(A) - λφ(B) ∈ I(H), then φis a Jordan ring automorphism, i.e. there exists a continuous invertible linear or conjugate linear operator T on H such that φ(A) = TAT-1 for all A ∈ B(H), or φ(A) = TA*T-1 for all A ∈ B(H); if, in addition, A - iB ∈ I(H) (→)φ(A) - iφ(B) ∈ I(H), here i is the imaginary unit, then φ is either an automorphism or an anti-automorphism.     

Primitive idempotents of irreducible cyclic codes and self-dual cyclic codes over Galois rings

Let $R$ be the Galois ring $GR(p^k,s)$ of characteristic $p^k$ and cardinality $p^{sk}$. Firstly, we give all primitive idempotent generators of irreducible cyclic codes of length $n$ over $R$, and a $p$-adic integer ring with $gcd(p,n)=1$. Secondly, we obtain all primitive idempotents of all irreducible cyclic codes of length $r{l}^m$ over $R$, where $r,l,$ and $t$ are three primes with $2?l$, $r|(q^t?1)$, $l^v\parallel (q^t?1)$ and $gcd(rl,q(q?1))=1$. Finally, as applications, weight distributions of all irreducible cyclic codes for $t=2$ and generator polynomials of self-dual cyclic codes of length $l^m$ and $r{l}^m$ over $R$ are given.     

Conditional expectations and weak and strong compactness in spaces of Bochner integrable functions

In [6, theorem IV.8.18], relatively norm compact sets K in L^p(μ) are characterized by means of strong convergence of conditional expectations, E_πf → f in L^p(μ), uniformly for f ∈ K, where (E_π) is the family of conditional expectations corresponding to the net of all finite measurable partitions.In this paper we extend the above result in several ways: we consider nets of not necessarily finite partitions; we consider spaces $\text{L}{}_{\mathrm{E}}{}^{\mathrm{p}}\text{(μ)}$ of vector valued pth power Bochner integrable functions (and spaces M(Σ, E) of vector valued measures with finite variation); we characterize relatively strong compact sets K in $\text{L}{}_{\mathrm{E}}{}^{\mathrm{p}}\text{(μ)}$ by means of uniform strong convergence E_πf → f, as well as relatively weak compact sets K by means of uniform weak convergence E_πf → f. Previously, in [4], uniform strong convergence (together with some other conditions) was proved to be sufficient (but not necessary) for relative weak compactness.     

Strongly convex functions of higher order

The notion of strongly n-convex functions with modulus c>0 is introduced and investigated. Relationships between such functions and n-convex functions in the sense of Popoviciu as well as generalized convex functions in the sense of Beckenbach are given. Characterizations by derivatives are presented. Some results on strongly Jensen n-convex functions are also given.     

Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs

In this paper we collect a substantial number of challenging open problems and conjectures on connectivity, paths, trees and cycles in tournaments and classes of digraphs which contain tournaments as a subclass. The list is by no means exhaustive but is meant to show that the area has a large number of interesting open problems. We also mention problems for general digraphs when they are relevant in the context.     

Rainbow and orthogonal paths in factorizations of Kn

For n even, a factorization of a complete graph K_n is a partition of the edges into n?1 perfect matchings, called the factors of the factorization. With respect to a factorization, a path is called rainbow if its edges are from distinct factors. A rainbow Hamiltonian path takes exactly one edge from each factor and is called orthogonal to the factorization. It is known that not all factorizations have orthogonal paths. Assisted by a simple edge‐switching algorithm, here we show that for n?8, the rotational factorization of K_n, GK_n has orthogonal paths. We prove that this algorithm finds a rainbow path with at least (2n+1)/3 vertices in any factorization of K_n (in fact, in any proper coloring of K_n). We also give some problems and conjectures about the properties of the algorithm. © 2010 Wiley Periodicals, Inc. J Combin Designs 18: 167–176, 2010     

幂等算子线性组合的幂等性

设P与Q是Hilbert空间中的两个不同的幂等算子.本文主要刻画了幂等算子P与Q的线性组合仍是幂等算子的充要条件,从而推广了Baksalary与Baksalary (2000)的结论.值得指出的是,我们通过严密的推理发现,其定理的条件P_1P_2≠P_2P_1是非必要的.     

An iterative method for minimizing a convex nonsmooth function on a convex smooth surface

An iterative algorithm is proposed for the constrained minimization of a convex nonsmooth function on a set given as a convex smooth surface. The convergence of the algorithm in the sense of necessary conditions for a local minimum is proved.     

Minimal cyclic codes of length pq

Explicit expressions for all the 3n+2 primitive idempotents in the ring R_pⁿq=GF(ℓ)[x]/(x^pnq−1), where p,q,ℓ are distinct odd primes, ℓ is a primitive root modulo pⁿ and q both, , are obtained. The dimension, generating polynomials and the minimum distance of the minimal cyclic codes of length pⁿq over GF(ℓ) are also discussed.     

Characterizations based on conditional expectations of the doubled truncated distribution

The expression of the continuous distribution function F(x) is obtained whenever % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaerbhv2BYDwAHbacfiGaa8xBaiaabIcacaWG4bGaaiilaiaadMha% caqGPaGaa8hiaiaab2dacaWFGaGaa8xraiaa-HcacaWFybGaa8hiai% aa-XhacaWFGaGaa8hEaiaa-bcacqGHKjYOcaWFGaGaa8hwaiaa-bca% cqGHKjYOcaWFGaGaa8xEaiaa-Lcaaaa!53EE!\[m{\rm{(}}x,y{\rm{)}} {\rm{ = }} E(X | x \le X \le y)\]is known. Moreover, we obtain the necessary and sufficient conditions so that any function m: ² is the conditional expectation % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaiaadweacaGGOaGaamiwaerbhv2BYDwAHbacfiGaa8hiaiaacYha% caWFGaGaa8hEaiaa-bcacqGHKjYOcaWFGaGaa8hwaiaa-bcacqGHKj% YOcaWFGaGaa8xEaiaacMcaaaa!4D0D!\[E(X | x \le X \le y)\]of a random variable X with continuous distribution function. Furthermore, we relate m(x,y) to order statistics.     

Enumerating disjunctions and conjunctions of paths and cuts in reliability theory

Let G=(V,E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of source-sink pairs of vertices of G, an important problem that arises in the computation of network reliability is the enumeration of minimal subsets of edges (arcs) that connect/disconnect all/at least one of the given source-sink pairs of P. For undirected graphs, we show that the enumeration problems for conjunctions of paths and disjunctions of cuts can be solved in incremental polynomial time. Furthermore, under the assumption that P consists of all pairs within a given vertex set, we also give incremental polynomial time algorithm for enumerating all minimal path disjunctions and cut conjunctions. For directed graphs, the enumeration problem for cut disjunction is known to be NP-complete. We extend this result to path conjunctions and path disjunctions, leaving open the complexity of the enumeration of cut conjunctions. Finally, we give a polynomial delay algorithm for enumerating all minimal sets of arcs connecting two given nodes s₁ and s₂ to, respectively, a given vertex t₁, and each vertex of a given subset of vertices T₂.     

Strongly damped wave problems: Bootstrapping and regularity of solutions

The aim of the article is to present a unified approach to the existence, uniqueness and regularity of solutions to problems belonging to a class of second order in time semilinear partial differential equations in Banach spaces. Our results are applied next to a number of examples appearing in literature, which fall into the class of strongly damped semilinear wave equations. The present work essentially extends the results on the existence and regularity of solutions to such problems. Previously, these problems have been considered mostly within the Hilbert space setting and with the main part operators being selfadjoint. In this article we present a more general approach, involving sectorial operators in reflexive Banach spaces.     

Absolute Valued Strongly Power-Associative Triple Systems

Absolute valued triple system are the natural ternary extension of absolute valued algebras. In this article we classify strongly power-associative absolute valued triple systems.