English
Related papers

Related papers: An efficient algorithm for deciding vanishing of S…

200 papers

We establish a Schubert calculus for Bott-Samelson resolutions in the algebraic cobordism ring of a complete flag variety G/B.

Algebraic Geometry · Mathematics 2014-06-06 Jens Hornbostel , Valentina Kiritchenko

Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two polynomials. Although they do have a determinantal definition, we…

Symbolic Computation · Computer Science 2007-05-23 Cyril Brunie , Philippe Saux Picart

We prove that an inclusion-exclusion inspired expression of Schubert polynomials of permutations that avoid the patterns 1432 and 1423 is nonnegative. Our theorem implies a partial affirmative answer to a recent conjecture of Yibo Gao about…

Combinatorics · Mathematics 2021-02-23 Karola Mészáros , Arthur Tanjaya

In this paper we study the cohomological criterion for the splitting of vector bundles on multiprojective spaces $\mathbb{P}^{n_1}\times\ldots\times\mathbb{P}^{n_s}$. We also give a generalization of vanishing cohomological criteria for…

Algebraic Geometry · Mathematics 2025-12-01 Damian Maingi

We show an algorithm for computing the permanent of a random matrix with vanishing mean in quasi-polynomial time. Among special cases are the Gaussian, and biased-Bernoulli random matrices with mean 1/lnln(n)^{1/8}. In addition, we can…

Data Structures and Algorithms · Computer Science 2018-10-11 Lior Eldar , Saeed Mehraban

We show various vanishing theorems for the cohomology groups of compact hermitian manifolds for which the Bismut connection has (restricted) holonomy contained in SU(n) and classify all such manifolds of dimension four. In this way we…

Differential Geometry · Mathematics 2009-10-09 S. Ivanov , G. Papadopoulos

A polynomial-time algorithm for computing the permanent in any field of characteristic 3 is presented in this article. The principal objects utilized for that purpose are the Cauchy and Vandermonde matrices, the discriminant function and…

Computational Complexity · Computer Science 2007-08-28 Vadim Tarin

We present an algorithm for computing Groebner bases of vanishing ideals of points that is optimized for the case when the number of points in the associated variety is less than the number of indeterminates. The algorithm first identifies…

Commutative Algebra · Mathematics 2007-11-26 Winfried Just , Brandilyn Stigler

We propose a method for solving the hidden subgroup problem in nilpotent groups. The main idea is iteratively transforming the hidden subgroup to its images in the quotient groups by the members of a central series, eventually to its image…

Quantum Physics · Physics 2023-04-18 Muhammad Imran , Gabor Ivanyos

The aim of this article is to link Schubert varieties in the flag manifold with hyperplane arrangements. For a permutation, we construct a certain graphical hyperplane arrangement. We show that the generating function for regions of this…

Combinatorics · Mathematics 2007-09-21 Suho Oh , Alexander Postnikov , Hwanchul Yoo

It is well known that if one integrates a Schur function indexed by a partition $\lambda$ over the symplectic (resp. orthogonal) group, the integral vanishes unless all parts of $\lambda$ have even multiplicity (resp. all parts of $\lambda$…

Combinatorics · Mathematics 2012-07-18 Vidya Venkateswaran

We survey the recent study of involution Schubert polynomials and a modest generalization that we call degenerate involution Schubert polynomials. We cite several conditions when (degenerate) involution Schubert polynomials have simple…

Combinatorics · Mathematics 2020-02-04 Michael Joyce

Let $G$ be a bounded open subset of Euclidean space with real algebraic boundary $\Gamma$. Under the assumption that the degree $d$ of $\Gamma$ is given, and the power moments of the Lebesgue measure on $G$ are known up to order $3d$, we…

Optimization and Control · Mathematics 2014-02-07 Jean-Bernard Lasserre , Mihai Putinar

Let $X\subseteq G\slash B$ be a Schubert variety in a flag manifold and let $\pi: \tilde X \rightarrow X$ be a Bott-Samelson resolution of $X$. In this paper we prove an effective version of the decomposition theorem for the derived…

Algebraic Geometry · Mathematics 2023-08-04 Davide Franco

In this work we resolve conjectures of Beecken, Mitmann and Saxena [BMS13] and Gupta [Gup14], by proving an analog of a theorem of Edelstein and Kelly for quadratic polynomials. As immediate corollary we obtain the first deterministic…

Computational Complexity · Computer Science 2020-06-16 Shir Peleg , Amir Shpilka

Period polynomials have long been fruitful tools for the study of values of $L$-functions in the context of major outstanding conjectures. In this paper, we survey some facets of this study from the perspective of Eichler cohomology. We…

Number Theory · Mathematics 2017-07-18 Nikolaos Diamantis , Larry Rolen

The "back-stabilization number" for products of Schubert polynomials is the distance the corresponding permutations must be shifted before the structure constants stabilize. We give an explicit formula for this number and thereby prove a…

Combinatorics · Mathematics 2025-01-27 Andrew Hardt , David Wallach

We consider sparse polynomials in $N$ variables over a finite field, and ask whether they vanish on a set $S^N$, where $S$ is a set of nonzero elements of the field. We see that if for a polynomial $f$, there is $\mathbf{c}\in S^N$ with $f…

Rings and Algebras · Mathematics 2024-06-12 Erhard Aichinger , Simon Grünbacher , Paul Hametner

We give an elementary approach utilizing only the divided difference formalism for obtaining expansions of Schubert polynomials that are manifestly nonnegative, by studying solutions to the equation $\sum Y_i\partial_i=\mathrm{id}$ on…

Combinatorics · Mathematics 2025-07-09 Philippe Nadeau , Hunter Spink , Vasu Tewari

Motivated by a recent conjecture of R. P. Stanley we offer a lower bound for the sum of the coefficients of a Schubert polynomial in terms of $132$-pattern containment.

Combinatorics · Mathematics 2017-05-08 Anna Weigandt
‹ Prev 1 4 5 6 7 8 10 Next ›