Related papers: Tower tableaux and Schubert polynomials

In this paper, we explore the merits of various algorithms for polynomial optimization problems, focusing on alternatives to sum of squares programming. While we refer to advantages and disadvantages of Quantifier Elimination, Reformulation…

We use geometry to prove a number of new identities among the Littlewood-Richardson coefficients for Schubert polynomials (Schubert classes in a flag manifold). For many of these identities, there is a companion result about the Bruhat…

We show that positivity on $\mathbb{R}_+^n$ and on $\mathbb{R}^n$ of real symmetric polynomials of degree at most $p$ in $n\ge2$ variables is solvable by algorithms running in $\mathrm{poly}(n)$ time. For real symmetric quartics, we find…

The Macdonald symmetric functions are used to define measures on the set of all partitions of all integers. Probabilistic algorithms are given for growing partitions according to these measures. The case of Hall-Littlewood polynomials is…

In recent years we have worked on a project involving poset topology, various analogues of Eulerian polynomials, and a refinement of Richard Stanley's chromatic symmetric function. Here we discuss how Stanley's ideas and results have…

D. Grigoriev-G. Koshevoy recently proved that tropical Schur polynomials have (at worst) polynomial tropical semiring complexity. They also conjectured tropical skew Schur polynomials have at least exponential complexity; we establish a…

We introduce balanced shifted tableaux, as an analogue of balanced tableaux of Edelman and Greene, from the perspective of root systems of type B and C. We show that they are equinumerous to standard Young tableaux of the corresponding…

We develop a formalism to address statistical pattern recognition of graph valued data. Of particular interest is the case of all graphs having the same number of uniquely labeled vertices. When the vertex labels are latent, such graphs are…

Building on the work of the fourth author in math.AG/9904074, we prove the weak factorization conjecture for birational maps in characteristic zero: a birational map between complete nonsingular varieties over an algebraically closed field…

We show that a shift space on a finite alphabet with a non-uniform specification property can be modeled by a strongly positive recurrent countable-state Markov shift to which every equilibrium state lifts. In addition to uniqueness of the…

We estimate the number $|\mathcal{A}_{\boldsymbol\lambda}|$ of elements on a nonlinear family $\mathcal{A}$ of monic polynomials of $\mathbb{F}_q[T]$ of degree $r$ having factorization pattern…

Given a family of parameterized algebraic curves over a strictly semistable pair, we show that the simultaneous tropicalization of the curves in the family forms a family of parameterized tropical curves over the skeleton of the strictly…

We provide two shifted analogues of the tableau switching process due to Benkart, Sottile, and Stroomer, the shifted tableau switching process and the modified shifted tableau switching process. They are performed by applying a sequence of…

Weight-balanced and doubly stochastic digraphs are two classes of digraphs that play an essential role in a variety of cooperative control problems, including formation control, distributed averaging, and optimization. We refer to a digraph…

In this paper, we study Lefschetz properties of Artinian reductions of Stanley-Reisner rings of balanced simplicial $3$-polytopes. A $(d-1)$-dimensional simplicial complex is said to be balanced if its graph is $d$-colorable. If a…

In an open, constantly changing and collaborative environment like the forthcoming Semantic Web, it is reasonable to expect that knowledge sources will contain noise and inaccuracies. It is well known, as the logical foundation of the…

We study numerically stabilized solutions of the two-dimensional Schrodinger equation with a cubic nonlinearity. We discuss in detail the numerical scheme used and explain why choosing the right numerical strategy is very important to avoid…

Motivated by a question on the graded rank of the stalks of the canonical sheaf on a Bruhat graph, we lift some equalities concerning (parabolic) Kazhdan-Lusztig polynomials to this moment graph setting. Our proofs hold also in positive…

We consider the problem of counting the number of possible sets of rankings (called ranking patterns) generated by unfolding models of codimension one. We express the ranking patterns as slices of the braid arrangement and show that all…

The theme of symbolic computation in algebraic categories has become of utmost importance in the last decade since it enables the automatic modeling of modern algebra theories. On this theoretical background, the present paper reveals the…