Related papers: On certain spaces of lattice diagram polynomials

The aim of this work is to study some lattice diagram polynomials $\Delta_D(X,Y)$. We recall that $M_D$ denotes the space of all partial derivatives of $\Delta_D$. In this paper, we want to study the space $M^k_{i,j}(X,Y)$ which is the sum…

A lattice diagram is a finite set $L=\{(p_1,q_1),... ,(p_n,q_n)\}$ of lattice cells in the positive quadrant. The corresponding lattice diagram determinant is $\Delta_L(\X;\Y)=\det \| x_i^{p_j}y_i^{q_j} \|$. The space $M_L$ is the space…

A lattice diagram is a finite list L=((p_1,q_1),...,(p_n,q_n) of lattice cells. The corresponding lattice diagram determinant is \Delta_L(X;Y)=\det \| x_i^{p_j}y_i^{q_j} \|. These lattice diagram determinants are crucial in the study of the…

The space $M_{\mu/i,j}$ spanned by all partial derivatives of the lattice polynomial $\Delta_{\mu/i,j}(X;Y)$ is investigated in math.CO/9809126 and many conjectures are given. Here, we prove all these conjectures for the $Y$-free component…

The lattice cell in the ${i+1}^{st}$ row and ${j+1}^{st}$ column of the positive quadrant of the plane is denoted $(i,j)$. If $\mu$ is a partition of $n+1$, we denote by $\mu/ij$ the diagram obtained by removing the cell $(i,j)$ from the…

Let K be a field and let M_n(K) denote the space of n x n matrices with entries in K. Let M be a subspace of M_n(K) of dimension d with the property that there are elements in M with non-zero determinant. Given a basis of M, we define the…

We explicitly describe the Lie algebras $M_L$ of ladder matrices in $M_n$ associate with dominant upper triangular ladders $L$, and completely characterize the derivations of these $M_L$ over a field $F$ with $char(F) \neq 2$. We also…

Let $n$ and $s$ be fixed integers such that $n\geq 2$ and $1\leq s\leq \frac{n}{2}$. Let $M_n(\mathbb{K})$ be the ring of all $n\times n$ matrices over a field $\mathbb{K}$. If a map $\delta:M_n(\mathbb{K})\rightarrow M_n(\mathbb{K})$…

Let \mathbb{F}_q^{n+l} denote the (n+l)-dimensional singular linear space over a finite field \mathbb{F}_q. For a fixed integer m\leq\min\{n,l\}, denote by \mathcal{L}^m_o(\mathbb{F}_q^{n+l}) the set of all subspaces of type (t,t_1), where…

This paper deals with lattices $(L,\Vert~\Vert)$ over polynomial rings, where $L$ is a finitely generated module over $k[t]$, the polynomial ring over the field $k$ in the indeterminate $t$, and $\Vert~\Vert$ is a discrete real-valued…

Let $r$ and $n$ be positive integers such that $r<n$, and $\mathbb{K}$ be an arbitrary field. In a recent work, we have determined the maximal dimension for a linear subspace of $n$ by $n$ symmetric matrices with rank less than or equal to…

Let ${\mathcal D}^{k,l}(m,n)$ be the set of all the integer points in the transportation polytope of $kn\times ln$ matrices with row sums $lm$ and column sums $km$. In this paper we find the sharp lower bound on the tropical determinant…

Young's partition lattice $L(m,n)$ consists of unordered partitions having $m$ parts where each part is at most $n$. Using methods from complex algebraic geometry, R. Stanley proved that $L(m,n)$ is rank-symmetric, unimodal, and strongly…

A convex lattice polygon Delta determines a pair (S,L) of a toric surface together with an ample toric line bundle on S. The Severi degree N^{Delta,delta} is the number of delta-nodal curves in the complete linear system |L| passing through…

The purpose of this work is to present the derivation and an estimate of the degrees of the best approximation based on convex, coconvex and unconstrained polynomials, and discuss some applications. We simplify the term convex and coconvex…

Given a list of $n$ cells $L=[(p_1,q_1),...,(p_n, q_n)]$ where $p_i, q_i\in \textbf{Z}_{\ge 0}$, we let $\Delta_L=\det |{(p_j!)^{-1}(q_j!)^{-1} x^{p_j}_iy^{q_j}_i} |$. The space of diagonally alternating polynomials is spanned by…

The $M$-polynomial of a graph $G$ is defined as $\sum_{i\le j} m_{i,j}(G)x^iy^j$, where $m_{i,j}(G)$, $i,j\ge 1$, is the number of edges $uv$ of $G$ such that $\{d_v(G), d_u(G)\} = \{i,j\}$. Knowing the $M$-polynomial, formulas for bond…

It is shown why the discriminant of a maximal order within a cyclic division algebra must be minimized in order to get the densest possible matrix lattices with a prescribed nonvanishing minimum determinant. Using results from class field…

Let $\mathcal{A}$ be a unital algebra, $\delta$ be a linear mapping from $\mathcal{A}$ into itself and $m$, $n$ be fixed integers. We call $\delta$ an (\textit{m, n})-derivable mapping at $Z$, if…

In this paper we determine, under some mild restrictions, the lattice of submodules $\gL$ of a module $M$ all of whose composition factors have multiplicity one. Such a lattice is distributive, and hence determined by its poset of down-sets…