Search arXiv⌕ Search

arXiv · math/0111192

Schur function analogs for a filtration of the symmetric function space

Abstract

We consider a filtration of the symmetric function space given by $Λ^{(k)}_t$, the linear span of Hall-Littlewood polynomials indexed by partitions whose first part is not larger than $k$. We introduce symmetric functions called the $k$-Schur functions, providing an analog for the Schur functions in the subspaces $Λ^{(k)}_t$. We prove several properties for the $k$-Schur functions including that they form a basis for these subspaces that reduces to the Schur basis when $k$ is large. We also show that the connection coefficients for the $k$-Schur function basis with the Macdonald polynomials belonging to $Λ^{(k)}_t$ are polynomials in $q$ and $t$ with integral coefficients. In fact, we conjecture that these integral coefficients are actually positive, and give several other conjectures generalizing Schur function theory.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

L. Lapointe, J. Morse. 2001-11-17. Schur function analogs for a filtration of the symmetric function space. https://arxiv.org/abs/math/0111192

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗