Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0704.0542

Hilbert functions of points on Schubert varieties in Orthogonal Grassmannians

K. N. Raghavan·Shyamashree Upadhyay
View original source ↗Read source document ↗Export metadata ↓

Abstract

A solution is given to the following problem: how to compute the multiplicity, or more generally the Hilbert function, at a point on a Schubert variety in an orthogonal Grassmannian. Standard monomial theory is applied to translate the problem from geometry to combinatorics. The solution of the resulting combinatorial problem forms the bulk of the paper. This approach has been followed earlier to solve the same problem for the Grassmannian and the symplectic Grassmannian. As an application, we present an interpretation of the multiplicity as the number of non-intersecting lattice paths of a certain kind. Taking the Schubert variety to be of a special kind and the point to be the "identity coset," our problem specializes to a problem about Pfaffian ideals treatments of which by different methods exist in the literature. Also available in the literature is a geometric solution when the point is a "generic singularity."

Explore related subjects

math.COmath.ACmath.AG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

K. N. Raghavan, Shyamashree Upadhyay. 2007-04-23. Hilbert functions of points on Schubert varieties in Orthogonal Grassmannians. https://arxiv.org/abs/0704.0542

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗