Related papers: Reducibility of Matrix Weights

Consider the following parameterized counting variation of the classic subset sum problem, which arises notably in the context of higher homotopy groups of topological spaces: Let $\mathbf{v} \in \mathbb{Q}^d$ be a rational vector, $(T_{1},…

We prove that any unitary highest weight module over a universal minimal quantum affine $W$-algebra at non-critical level descends to its simple quotient. We find the defining relations of the unitary simple minimal quantum affine…

Define the weight of a matrix to be the number of non-zero entries. One would like to count $m$ by $n$ matrices over a finite field by their weight and rank. This is equivalent to determining the probability distribution of the weight while…

We show that if every module W for a vertex operator algebra V satisfies the condition that the dimension of W/C_1(W) is less than infinity, where C_1(W) is the subspace of W spanned by elements of the form u_{-1}w for u in V of positive…

In this note we relate the valuations of the algebras appearing in the non-commutative geometry of quantized algebras to properties of sub-lattices in some vector spaces. We consider the case of algebras with $PBW$-bases and prove that…

Let $s\in{\mathbb R}$, $q\in (0,\infty]$, and $\tau\in[0,\infty)$. It is well known that Besov-type spaces $\dot B^{s,\tau}_{p,q}$ with $p\in (0,\infty]$ and Triebel--Lizorkin-type spaces $\dot F^{s,\tau}_{p,q}$ with $p\in (0,\infty)$ when…

We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…

We answer a question by Judith Packer about the irreducibility of the wavelet representation associated to the Cantor set. We prove that if the QMF filter does not have constant absolute value, then the wavelet representations is reducible.

We propose a unified theory of generalized weights for linear codes endowed with an arbitrary distance. Instead of relying on supports or anticodes, the weights of a code are defined via the intersections of the code with a chosen family of…

Associated to any finite metric space are a large number of objects and quantities which provide some degree of structural or geometric information about the space. In this paper we show that in the setting of subsets of weighted Hamming…

Schur decompositions and the corresponding Schur forms of a single matrix, a pair of matrices, or a collection of matrices associated with the periodic eigenvalue problem are frequently used and studied. These forms are upper-triangular…

We study a sequence of polynomials orthogonal with respect to a one parameter family of weights $$ w(x):=w(x,t)=\rex^{-t/x}\:x^{\al}(1-x)^{\bt},\quad t\geq 0, $$ defined for $x\in[0,1].$ If $t=0,$ this reduces to a shifted Jacobi weight.…

We study the irreducibility of Wronskian Hermite polynomials labelled by partitions. It is known that these polynomials factor as a power of x times a remainder polynomial. We show that the remainder polynomial is irreducible for the…

We define analogues of Verma modules for finite W-algebras. By the usual ideas of highest weight theory, this is a first step towards the classification of finite dimensional irreducible modules. Motivated by known results in type A, we…

For a matrix $W \in \mathbb{Z}^{m \times n}$, $m \leq n$, and a convex function $g: \mathbb{R}^m \rightarrow \mathbb{R}$, we are interested in minimizing $f(x) = g(Wx)$ over the set $\{0,1\}^n$. We will study separable convex functions and…

By combining well-known techniques from both noncommutative algebra and computational commutative algebra, we observe that an algorithmic approach can be applied to the study of irreducible representations of finitely presented algebras. In…

The main purpose of this paper is to obtain an explicit expression of a family of matrix valued orthogonal polynomials {P_n}_n, with respect to a weight W, that are eigenfunctions of a second order differential operator D. The weight W and…

The generalized Hamming weight (GHW) $d_r(C)$ of linear codes $C$ is a natural generalization of the minimum Hamming distance $d(C)(=d_1(C))$ and has become one of important research objects in coding theory since Wei's originary work [23]…

In an earlier paper we showed that we can improve results by Emmy Noether and Alexander Ostrowski concerning the reducibility modulo p of absolutely irreducible polynomials with integer coefficients by giving the problem a geometric turn…

In this work we show how to get advantage from the Riemann--Hilbert analysis in order to obtain information about the matrix orthogonal polynomials and functions of second kind associated with a weight matrix. We deduce properties for the…