Sum rules in multiphoton coincidence rates

We show that sums of carefully chosen coincidence rates in a multiphoton interferometry experiment can be simplified by replacing the original unitary scattering matrix with a coset matrix containing 0s. The number and placement of these 0s reduces the complexity of each term in the sum without affecting the original sum of rates. In particular, the evaluation of sums of modulus squared of permanents is shown to turn in some cases into a sum of modulus squared of determinants. The sums of rates are shown to be equivalent to the removal of some optical elements in the interferometer.     

Parallel and k-out-of-n: G systems with nonidentical components and their mean residual life functions

A system with n independent components which has a k-out-of-n: G structure operates if at least k components operate. Parallel systems are 1-out-of-n: G systems, that is, the system goes out of service when all of its components fail. This paper investigates the mean residual life function of systems with independent and nonidentically distributed components. Some examples related to some lifetime distribution functions are given. We present a numerical example for evaluating the relationship between the mean residual life of the k-out-of-n: G system and that of its components.     

Progressive censoring from heterogeneous distributions with applications to robustness

Progressively censored order statistics from heterogeneous distributions are introduced and their properties are investigated. After deriving the joint density function, some properties are established. In particular, the case of proportional hazards leads to an interesting connection to the model of generalized order statistics. Finally, the special case of exponential distribution is considered and some known results are generalized to this heterogeneous case, and their implications to robustness are highlighted.     

Lower bound inequalities for norms of symmetrized tensor powers

Let V be a complex inner product space of positive dimension m with inner product 〈·,·〉, and let T_n(V) denote the set of all n-linear complex-valued functions defined on V×V×?×V (n-copies). By S_n(V) we mean the set of all symmetric members of T_n(V). We extend the inner product, 〈·,·〉, on V to T_n(V) in the usual way, and we define multiple tensor products A₁⊗A₂⊗?⊗A_n and symmetric products A₁·A₂?A_n, where q₁,q₂,…,q_n are positive integers and A_i∈T_qi(V) for each i, as expected. If A∈S_n(V), then A^k denotes the symmetric product A·A?A where there are k copies of A. We are concerned with producing the best lower bounds for ‖A^k‖², particularly when n=2. In this case we are able to show that ‖A^k‖² is a symmetric polynomial in the eigenvalues of a positive semi-definite Hermitian matrix, M_A, that is closely related to A. From this we are able to obtain many lower bounds for ‖A^k‖². In particular, we are able to show that if ω denotes 1/r where r is the rank of M_A, and , then

     

An algorithm for mean residual life computation of (n − k + 1)-out-of-n systems: An application of exponentiated Weibull distribution

In this paper, we establish an algorithm for the computation of the mean residual life of a (n − k + 1)-out-of-n system in the case of independent but not necessarily identically distributed lifetimes of the components. An application for the exponentiated Weibull distribution is given to study the effect of various parameters on the mean residual life of the system. Also the relationship between the mean residual life for the system and that of its components is investigated.     

On convertible (0,1) matrices

A square matrix A with per A≠0 is called convertible if there exists a (1, -1) matrix H such that per A=det(H o A) where H o A denote the Hadamard product of H and A In this paper, an upper bound of permanents of maximal convertible (0,1) matrices A with π(A)≥4(n-1) is obtained.     

On the number of Sudoku squares

We provide an upper bound on the number of $n^2\times n^2$ Sudoku squares, and explain intuitively why there is reason to believe that the bound is tight up to a multiplicative factor of a much smaller order of magnitude. A similar bound is established for Sudoku squares with rectangular regions.