In this paper we use the concept of wavelet sets, as introduced by X. Dai and D. Larson, to decompose the wavelet representation of the discrete group associated to an arbitrary n×n integer dilation matrix as a direct integral of irreducible monomial representations. In so doing we generalize a result of F. Martin and A. Valette in which they show that the wavelet representation is weakly equiv...

We study the complexity of detecting monomials with special properties in the sum-product expansion of a polynomial represented by an arithmetic circuit of size polynomial in the number of input variables and using only multiplication and addition. We focus on monomial properties expressed in terms of the number of distinct variables occurring in a monomial. Our main result is a randomized FPT ...

We give a simple algorithm to decide whether a monomial ideal of nite colength in a polynomial ring is licci, i.e., in the linkage class of a complete intersection. The algorithm proves that whether or not such an ideal is licci does not depend on whether we restrict the linkage by only allowing monomial regular sequences, or homogeneous regular sequences, or arbitrary regular sequences. We app...

We describe a recursive algorithm that produces an integral basis for the centre of the Hecke algebra of type A consisting of linear combinations of monomial symmetric polynomials of Jucys–Murphy elements. We also discuss the existence of integral bases for the centre of the Hecke algebra that consist solely of monomial symmetric polynomials of Jucys–Murphy elements. Finally, for n = 3, we show...

Classically, Gröbner bases are computed by first prescribing a fixed monomial order. Moss Sweedler suggested an alternative in the mid 1980s and developed a framework to perform such computations by using valuation rings in place of monomial orders. We build on these ideas by providing a class of valuations on K(x, y) that are suitable for this framework. We then perform such computations for i...