Exploitation of the NP hard, mixed μ problem structure provides a polynomial time algorithm that approximates μ with usually reasonable answers. When the problem is extended to the skew μ problem an extension of the existing method to the skew μ formulation is required. The focus of this paper is to extend the μ upper bound derivation to the skew μ upper bound and show its direct computation by...

By using the (generalized) Goethals-Seidel array, we construct Hadamard matrices of skew type of order 4n for n = 81,103,151,169, and 463. Hadamard matrices of skew type for these orders are constructed here for the first time. Consequently the list of odd integers n < 300 for which no Hadamard matrix of skew type of order 4n is presently known is reduced to 45 numbers (see the comments after t...

Using growth diagrams, we define skew domino Schensted algorithm which is a domino analogue of “Robinson-Schensted algorithm for skew tableaux” due to Sagan and Stanley. The color-to-spin property of Shimozono and White is extended. As an application, we give a simple generating function for a weighted sum of skew domino tableaux whose special case is a generalization of Stanley’s sign-imbalanc...

In this paper, we compute doubly truncated moments for the selection elliptical class of distributions, including some multivariate asymmetric versions well-known such as normal, Student’s t, slash, among others. We address members family, establishing neat formulation high-order and its first two moments. establish sufficient necessary conditions existence these Further, propose optimized meth...

In this work the definition of codes as modules over skew polynomial rings of automorphism type is generalized to skew polynomial rings, whose multiplication is defined using an automorphism and a derivation. This produces a more general class of codes which, in some cases, produce better distance bounds than module skew codes constructed only with an automorphism. Extending the approach of Gab...