Row and Column Removal Theorems for Homomorphisms of Specht Modules and Weyl Modules

We prove a q-analogue of the row and column removal theorems for homomorphisms between Specht modules proved by Fayers and the first author [16]. These results can be considered as complements to James and Donkin’s row and column removal theorems for decomposition numbers of the symmetric and general linear groups. In this paper we consider homomorphisms between the Specht modules of the Hecke algebras of type A and between the Weyl modules of the q-Schur algebra.This research was supported by ARC grant DP0343023. The first author was also supported by a Sesqui Research Fellowship at the University of Sydney.     

Equimatchable claw-free graphs

A graph is equimatchable if all of its maximal matchings have the same size. A graph is claw-free if it does not have a claw as an induced subgraph. In this paper, we provide the first characterization of claw-free equimatchable graphs by identifying the equimatchable claw-free graph families. This characterization implies an efficient recognition algorithm.     

Positive semidefinite indicator property for norm-numerical range

In this paper, using an elementary method, we prove that if norm-numerical range related to an absolute norm \(\Vert .\Vert \) on \(\mathbb {C}^n\) satisfies the positive semidefinite indicator property, then \(\Vert .\Vert \) will be a multiple of Euclidian norm.     

Shape-Constrained Estimation Using Nonnegative Splines

We consider the problem of nonparametric estimation of unknown smooth functions in the presence of restrictions on the shape of the estimator and on its support using polynomial splines. We provide a general computational framework that treats these estimation problems in a unified manner, without the limitations of the existing methods. Applications of our approach include computing optimal spline estimators for regression, density estimation, and arrival rate estimation problems in the presence of various shape constraints. Our approach can also handle multiple simultaneous shape constraints. The approach is based on a characterization of nonnegative polynomials that leads to semidefinite programming (SDP) and second-order cone programming (SOCP) formulations of the problems. These formulations extend and generalize a number of previous approaches in the literature, including those with piecewise linear and B-spline estimators. We also consider a simpler approach in which nonnegative splines are approximated by splines whose pieces are polynomials with nonnegative coefficients in a nonnegative basis. A condition is presented to test whether a given nonnegative basis gives rise to a spline cone that is dense in the space of nonnegative continuous functions. The optimization models formulated in the article are solvable with minimal running time using off-the-shelf software. We provide numerical illustrations for density estimation and regression problems. These examples show that the proposed approach requires minimal computational time, and that the estimators obtained using our approach often match and frequently outperform kernel methods and spline smoothing without shape constraints. Supplementary materials for this article are provided online.     

Some Results Obtained by Application of the LLT Algorithm

We determine the v-decomposition numbers d _μλ(v) for μ a partition with at most three parts. We use this information to compute the composition factors of the Specht modules of the Hecke algebra ?₀ = ?_{?, ω}( _n ) which correspond to partitions with at most three parts.     

Numerical analysis of the internal flow and the mixing chamber length effects on the liquid film thickness exiting from the effervescent atomizer

Journal of Thermal Analysis and Calorimetry - Two-phase flow was simulated within the effervescent atomizer by the volume of fluid interface tracing model. Different gas-to-liquid mass ratios...