Strong 3-commutativity preserving maps on standard operator algebras

Let X be a Banach space of dimension ≥ 2 over the real or complex field F and A a standard operator algebra in B(X). A map Φ :A →A is said to be strong 3-commutativity preserving if [Φ(A), Φ(B)]3 = [A,B]3 for all A,B∈ A, where[A,B]3 is the 3-commutator of A,B defined by[A, B]3 = [[[A, B],B],B] with [A,B] = AB-BA. The main result in this paper is shown that.,if Φ is a surjective map on A, then Φ is strong 3-commutativity preserving if and only if there exist a functional h : A →F and a scalar λ∈ F with λ~4 = 1 such that Φ(A)=λ A+h(A)I for all A ∈ A.     

On the fourth power moment of Fourier coefficients of cusp form

Let a(n)be the Fourier coefficients of a holomorphic cusp form of weightκ=2n≥12 for the full modular group and A(x)=∑_(n≤x)a(n).In this paper,we establish an asymptotic formula of the fourth power moment of A(x)and prove that ∫T1A~4(x)dx=3/(64κπ~4)s_4;2()T~(2κ)+O(T~(2κ-δ_4+ε))with δ_4=1/8,which improves the previous result.     

Invariant record processes and applications to best choice modelling

Let X₁, X₂,…be identically distributed random variables from an unknown continuous distribution. Further let I_r(1), I_r(2),…be a sequence of indicator functions defined on X₁, X₂,…by I_r(k) = 0 if k < r, I_r(k) = 1 if X_k is a r-record AND = 0 otherwise. Suppose that we observe X₁, X₂,… at times T₁ < T₂ <… where the T_k's are realisations of some regular counting process (N(τ)) defined on the positive half-line. Having observed [0, τ], say, the problem is to predict the future behaviour of the counting processes (R_r(τ, s))_sτ = # r-records in [τ, s]. More specifically the objective of this paper is to show that these processes can be (inhomogeneous) Poisson processes even if (N(τ))_τ0 has dependent increments.

The strong link between optimal selection and optimal stopping of record sequences or record processes, perhaps not fully recognized so far, is pointed out in this paper. It is shown to lead to a unification of the treatment of problems which, at first sight, are rather different. Moreover the stopping of record processes in continuous time can lead to rigorous and elegant solutions in cases where dynamic programming is bound to fail. Several examples will be given to facilitate a comparison with other methods.     

On the Equation n_1n_2= n_3n_4 Restricted to Factor Closed Sets

We study the number of solutions N(B,F) of the diophantine equation n_1n_2 = n_3 n_4,where 1 ≤ n_1 ≤ B,1 ≤ n_3 ≤ B,n_2,n_4 ∈ F and F[1,B] is a factor closed set.We study more particularly the case when F={m = p_1~(ε1)···p_k~(εk),ε_j∈{0,1},1 ≤ j ≤ k},p_1,...,p_k being distinct prime numbers.     

Cases of equality for the spectral norm submultiplicativity of the hadamard product

In this note, we characterize those pairs of nonzero r-by-d complex matrices that satisfy N₂(A ∘ B) = N₂(A)N₂(B), in which N₂(·) is the spectral norm and · is the Hadamard product.     

The kernels of irreducible representations of the general linear group

A derivation for the kernel of the irreducible representation T_(λ) of the general linear group GL_n(C) is given. This is then applied to the problem of determining necessary and sufficient conditions under which T_(λ)(A) = T_(λ)(B), where A and B are linear transformations, not necessarily invertible. Finally, conditions are obtained under which normality of T_(λ)(A) implies normality of A.     

Ranks of Solutions of the Matrix Equation AXB = C

The purpose of this article is to solve two problems related to solutions of a consistent complex matrix equation AXB = C : (I) the maximal and minimal ranks of solution to AXB = C , and (II) the maximal and minimal ranks of two real matrices X₀ and X₁ in solution X = X₀ + iX₁ to AXB = C . As applications, the maximal and minimal ranks of two real matrices C and D in generalized inverse (A + iB)^- = C + iD of a complex matrix A + iB are also examined.     

Inequalities for M and N0-matrices

In this paper, we study inequalities for two M or N₀-matrices A,B with A≤B. Necessary and sufficient conditions are given for positive linear combination of A and B to be an N₀-matrix.     

Flawless 0-sequences and Hilbert functions of Cohen-Macaulay integral domains

Let A = A₀A₁ be a commutative graded ring such that (i) A₀ = k a field, (ii) A = k[A₁] and (iii) dim_k A₁ < ∞. It is well known that the formal power series ∑^∞_{n = 0} (dim_kA_n)λ ⁿ is of the form (h₀ + h₁λ + + h_sλ^s)/(1 − λ)^dimA with each h_iε . We are interested in the sequence (h₀, h₁,…,h_s), called the h-vector of A, when A is a Cohen–Macaulay integral domain. In this paper, after summarizing fundamental results (Section 1), we study h-vectors of certain Gorenstein domains (Section 2) and find some examples of h-vectors arising from integrally closed level domains (Sections 3 and 4).     

First passage time for some stationary processes

For a 1-dependent stationary sequence {X_n} we first show that if u satisfies p₁=p₁(u)=P(X₁>u)0.025 and n>3 is such that 88np₁³1, then

P{max(X₁,…,X_n)u}=ν·μⁿ+O{p₁³(88n(1+124np₁³)+561)}, n>3,

where

ν=1−p₂+2p₃−3p₄+p₁²+6p₂²−6p₁p₂,μ=(1+p₁−p₂+p₃−p₄+2p₁²+3p₂²−5p₁p₂)⁻¹

with

p_k=p_k(u)=P{min(X₁,…,X_k)>u}, k1

and

|O(x)||x|.

From this result we deduce, for a stationary T-dependent process with a.s. continuous path {Y_s}, a similar, in terms of P{max_0skTY_s<u}, k=1,2 formula for P{max_0stY_su}, t>3T and apply this formula to the process Y_s=W(s+1)−W(s), s0, where {W(s)} is the Wiener process. We then obtain numerical estimations of the above probabilities.     

On Grauert–Riemenschneider Type Criteria

Let(X, ω) be a compact Hermitian manifold of complex dimension n. In this article,we first survey recent progress towards Grauert–Riemenschneider type criteria. Secondly, we give a simplified proof of Boucksom's conjecture given by the author under the assumption that the Hermitian metric ω satisfies ?■ω~l= for all l, i.e., if T is a closed positive current on X such that ∫_XT_(ac)~n 0, then the class {T } is big and X is Kahler. Finally, as an easy observation, we point out that Nguyen's result can be generalized as follows: if ?■ω = 0, and T is a closed positive current with analytic singularities,such that ∫_XT_(ac)~n 0, then the class {T} is big and X is Kahler.     

The consistency of a non-linear least squares estimator from diffusion processes

Consider the following Itô stochastic differential equation dX(t) = ƒ(θ⁰, X(t)) dt + dW(t), where (W(t), t 0), is a standard Wiener process in R^N. On the basis of discrete data 0 = t₀ < t₁ < …<t_n = T; X(t₁),...,X(t_n) we would like to estimate the parameter θ⁰. We shall define the least squares estimator and show that under some regularity conditions, is strongly consistent.     

Complementarity forms of theorems of Lyapunov and Stein, and related results

The well-known Lyapunov's theorem in matrix theory / continuous dynamical systems asserts that a (complex) square matrix A is positive stable (i.e., all eigenvalues lie in the open right-half plane) if and only if there exists a positive definite matrix X such that AX+XA^* is positive definite. In this paper, we prove a complementarity form of this theorem: A is positive stable if and only if for any Hermitian matrix Q, there exists a positive semidefinite matrix X such that AX+XA^*+Q is positive semidefinite and X[AX+XA^*+Q]=0. By considering cone complementarity problems corresponding to linear transformations of the form I−S, we show that a (complex) matrix A has all eigenvalues in the open unit disk of the complex plane if and only if for every Hermitian matrix Q, there exists a positive semidefinite matrix X such that X−AXA^*+Q is positive semidefinite and X[X−AXA^*+Q]=0. By specializing Q (to −I), we deduce the well known Stein's theorem in discrete linear dynamical systems: A has all eigenvalues in the open unit disk if and only if there exists a positive definite matrix X such that X−AXA^* is positive definite.     

On generalized Boolean functions II

This cycle of papers is based on the concept of generalized Bolean functions introduced by the author in the first article of the series. Every generalized Boolean function f:Bⁿ→B can be written in a manner similar to the canonical disjunctive form using some function defined on A×B, where A is a finite subset of B containing 0 and 1. The set of those functions f is denoted by GBF_n[A]. In this paper the following questions are presented: (1) What is the relationship between GBF_n[A₁] and GBF_n[A₂] when A₁A₂. (2) What can be said about GBF_n[A₁∩A₂] and GBF_n[A₁A₂] in comparison with GBF_n[A₁]∩GBF_n[A₂] and GBF_n[A₁]GBF_n[A₂], respectively.     

On matrices stochastically similar to matrices with equal diagonal elements

A necessary and sufficient condition for a matrix to be stochastically similar to a matrix with equal diagonal elements is obtained Aand B are called Stochastically similar if B=SAS^{- 1} where S is quasi-stochastic i.e., all row sums of .S are I. An inverse elementary divisor problem for quasi-stochastic matrices is also considered.     

On the q-analogues of the Zassenhaus formula for disentangling exponential operators

Katriel, Rasetti and Solomon introduced a q-analogue of the Zassenhaus formula written as e_q^(A+B)=e_q^Ae_q^Be_q^c₂e_q^c₃e_q^c₄e_q^c₅… , where A and B are two generally noncommuting operators and e_q^z is the Jackson q-exponential, and derived the expressions for c₂, c₃ and c₄. It is shown that one can also write Explicit expressions for , and are given.     

A characterization on n-critical economical generalized tic-tac-toe games

There is a so called generalized tic-tac-toe game playing on a finite set X with winning sets A₁, A₂,…, A_m. Two players, F and S, take in turn a previous untaken vertex of X, with F going first. The one who takes all the vertices of some winning set first wins the game. Erd s and Selfridge proved that if |A₁|=|A₂|==|A_m|=n and m<2ⁿ⁻¹, then the game is a draw. This result is best possible in the sense that once m=2ⁿ⁻¹, then there is a family A₁, A₂,…, A_m so that F can win. In this paper we characterize all those sets A₁,…, A_2n−1 so that F can win in exactly n moves. We also get similar result in the biased games.     

The L~(p,q)-stability of the Shifts of Finitely Many Functions in Mixed Lebesgue Spaces L~(p,q)(R~(d+1))

The stability is an expected property for functions,which is widely considered in the study of approximation theory and wavelet analysis.In this paper,we consider the Lp,q-stability of the shifts of finitely many functions in mixed Lebesgue spaces L~(p,q)(R~(d+1)).We first show that the shiftsφ(·-k)(k∈Z~(d+1))are Lp,q-stable if and only if for anyξ∈R~(d+1),∑_(k∈Z~(d+1))|φ(ξ+2πk)|~20.Then we give a necessary and sufficient condition for the shifts of finitely many functions in mixed Lebesgue spaces L~(p,q)(R~(d+1))to be Lp,q-stable which improves some known results.