相关论文: Upper bounds of dual flagged Weyl characters

Let $w$ be a permutation of $\{1,2,\ldots,n \}$, and let $D(w)$ be the Rothe diagram of $w$. The Schubert polynomial $\mathfrak{S}_w(x)$ can be realized as the dual character of the flagged Weyl module associated to $D(w)$. This implies a…

We prove a criterion of when the dual character $\chi_{D}(x)$ of the flagged Weyl module associated to a diagram $D$ in the grid $[n]\times [n]$ is zero-one, that is, the coefficients of monomials in $\chi_{D}(x)$ are either 0 or 1. This…

This paper investigates the number of supports of the Schubert polynomial $\mathfrak{S}_w(x)$ indexed by a permutation $w$. This number also equals the number of lattice points in the Newton polytope of $\mathfrak{S}_w(x)$. We establish a…

For $e$ a positive integer, we find restrictions modulo $2^e$ on the coefficients of the characteristic polynomial $\chi_S(x)$ of a Seidel matrix $S$. We show that, for a Seidel matrix of order $n$ even (resp. odd), there are at most…

Schur polynomials are special cases of Schubert polynomials, which in turn are special cases of dual characters of flagged Weyl modules. The principal specialization of Schur and Schubert polynomials has a long history, with Macdonald…

The self-dual spaces of polynomials are related to Bethe vectors in the Gaudin model associated to the Lie algebras of types B and C. In this paper, we give lower bounds for the numbers of real self-dual spaces in intersections of Schubert…

We establish an upper bound on the multiplicity of eigenvalues of the Sch\"odinger-Dirichlet operator in dimension two. We give a proof based on a generalized Morse Lemma due to Cheng \cite{Ch}.

We give a lower bound for the value at q=1 of a Kazhdan-Lustig polynomial in a Weyl group W in terms of "patterns''. This is expressed by a "pattern map" from W to W' for any parabloic subgroup W'. This notion generalizes the concept of…

In this paper we establish explicit lower bounds for pseudodifferential operators with a radial symbol. The proofs use classical Weyl calculus techniques and some useful, if not celebrated, properties of the Laguerre polynomials.

For each infinite series of the classical Lie groups of type B,C or D, we introduce a family of polynomials parametrized by the elements of the corresponding Weyl group of infinite rank. These polynomials represent the Schubert classes in…

We provide sufficient normal curvature conditions on the boundary of a domain $D \subset \BBR^4$ to guarantee unboundedness of the bilinear Fourier multiplier operator $\T_D$ with symbol $\chi_D$ outside the local $L^2$ setting,…

We present a generalization of the classical Schur modules of $GL(N)$ exhibiting the same interplay among algebra, geometry, and combinatorics. A generalized Young diagram $D$ is an arbitrary finite subset of $\NN \times \NN$. For each $D$,…

Feigin and Shoikhet conjectured in math/0610410 that successive quotients $B_m(A_n)$ of the lower central series filtration of a free associative algebra $A_n$ have polynomial growth. In this paper we give a proof of this conjecture, using…

Schur-Weyl duality is a fundamental framework in combinatorial representation theory. It intimately relates the irreducible representations of a group to the irreducible representations of its centralizer algebra. We investigate the analog…

We show that the dual character of the flagged Weyl module of any diagram is a positively weighted integer point transform of a generalized permutahedron. In particular, Schubert and key polynomials are positively weighted integer point…

Let $G$ be a simple graph on $n$ vertices and $m$ edges with chromatic number $\chi$, and let $\lambda_n$ denote the least adjacency eigenvalue. Solving a conjecture of Fan, Yu and Wang~[Electron. J. Combin., 2012], we prove that when $3\le…

Let $\Gamma$ denote a distance-regular graph. The maximum size of codewords with minimum distance at least $d$ is denoted by $A(\Gamma,d)$. Let $\square_n$ denote the folded $n$-cube $H(n,2)$. We give an upper bound on $A(\square_n,d)$…

As part of the graph minor project, Robertson and Seymour showed in 1990 that the class of graphs that can be embedded in a given surface can be characterized by a finite set of minimal excluded minors. However, their proof, because…

Let $\R$ be a real closed field, $\mathcal{P},\mathcal{Q} \subset \R[X_1,...,X_k]$ finite subsets of polynomials, with the degrees of the polynomials in $\mathcal{P}$ (resp. $\mathcal{Q}$) bounded by $d$ (resp. $d_0$). Let $V \subset \R^k$…

Suppose $G$ is a simple graph with $n$ vertices, $m$ edges, and rank $r$. Let $\chi_G(t)=a_0t^n-a_1t^{n-1}+\cdots +(-1)^ra_rt^{n-r}$ be the chromatic polynomial of $G$. For $q,k\in \Bbb{Z}$ and $0\le k\le q+r+1$, we obtain a sharp two-side…