In this paper we give a combinatorial interpretation for the coefficient of sν in the Kronecker product s(n−p,p) ∗ sλ, where λ = (λ1, . . . , λ`(λ)) ` n, if `(λ) ≥ 2p − 1 or λ1 ≥ 2p − 1; that is, if λ is not a partition inside the 2(p − 1) × 2(p − 1) square. For λ inside the square our combinatorial interpretation provides an upper bound for the coefficients. In general, we are able to combinat...

In this paper we give a combinatorial interpretation for the coefficient of sν in the Kronecker product s(n−p,p) ∗ sλ, where λ = (λ1, . . . , λl(λ)) ⊢ n, if l(λ) ≥ 2p − 1 or λ1 ≥ 2p − 1; that is, if λ is not a partition inside the 2(p − 1) × 2(p − 1) square. For λ inside the square our combinatorial interpretation provides an upper bound for the coefficients. In general, we are able to combinat...

This paper presents a solution procedure for production lines, based on a Markovian formulation with a Kronecker structured representation (sum of tensor products). Production lines with phase-type distributions for the processing and machine repair times and Erlang distribution times to failures of multiple machines in parallel at each workstation are traditionally modeled as Markovian continu...

Abstract In this paper, we consider the k -Fibonacci and k -Lucas sequences {Fk,n}n∈N and {Lk,n}n∈N . Let A = Cr(Fk,0, Fk,1, · · · , Fk,n−1) and B = Cr(Lk,0, Lk,1, · · · , Lk,n−1) be r -circulant matrices. Afterwards, we give upper and lower bounds for the spectral norms of matrices A and B. In addition, we obtain some bounds for the spectral norms of Hadamard and Kronecker products of these ma...

Leopardi introduced the notion of a Kronecker quotient in [Paul Leopardi. A generalized FFT for Clifford algebras. Bulletin of the Belgian Mathematical Society, 11:663–688, 2005.]. This article considers the basic properties that a Kronecker quotient should satisfy and additional properties which may be satisfied. A class of Kronecker quotients for which these properties have a natural descript...

In this paper, we investigate isomorphic factorizations of the Kronecker product graphs. Using these relations, it is shown that (1) the Kronecker product of the d-out-regular digraph and the complete symmetric digraph is factorized into the line digraph, (2) the Kronecker product of the Kautz digraph and the de Bruijn digraph is factorized into the Kautz digraph, (3) the Kronecker product of b...

The properties and applications of kronecker product in quantum theory is studied thoroughly. The use of kronecker product in quantum information theory to get the exact spin Hamiltonian is given. The proof of non-commutativity of matrices, when kronecker product is used between them is given. It is shown that the non-commutative matrices after kronecker product are similar or they are similar ...

The displacement structure is extended to a Kronecker matrix W ⊗ Z. A new class of Kronecker-like matrices with the displacement rank r, r < n will be formulated and presented. The computational complexity of multiplication with vectors for Kronecker-like matrices has been accelerated. Applying the displacement, which was originally discovered by Kailath, Kung and Morf [15], a new superfast alg...