English
Related papers

Related papers: Mitosis algorithm for Grothendieck polynomials

200 papers

We establish the conjecture of Reiner and Yong for an explicit combinatorial formula for the expansion of a Grothendieck polynomial into the basis of Lascoux polynomials. This expansion is a subtle refinement of its symmetric function…

Combinatorics · Mathematics 2021-06-29 Mark Shimozono , Tianyi Yu

Multiobjective discrete programming is a well-known family of optimization problems with a large spectrum of applications. The linear case has been tackled by many authors during the last years. However, the polynomial case has not been…

Optimization and Control · Mathematics 2011-01-24 Víctor Blanco , Justo Puerto

Based on the multiplicative rule of Schubert classes obtained in [Du3], we present an algorithm computing the product of two arbitrary Schubert classes. As a result, the algorithm gives also a method to compute the integral cohomology ring…

Algebraic Geometry · Mathematics 2014-04-02 Haibao Duan , Xuezhi Zhao

We give a combinatorial expansion of the stable Grothendieck polynomials of skew Young diagrams in terms of skew Schur functions, using a new row insertion algorithm for set-valued semistandard tableaux of skew shape. This expansion unifies…

Combinatorics · Mathematics 2020-09-15 Melody Chan , Nathan Pflueger

In this paper we present a new approach to Grothendieck duality over commutative rings. Our approach is based on the idea of rigid dualizing complexes, which was introduced by Van den Bergh in the context of noncommutative algebraic…

Algebraic Geometry · Mathematics 2007-08-07 Amnon Yekutieli , James J. Zhang

We propose a new analytical method to solve for nonexactly soluble Schrodinger equation via expansions through some existing quantum numbers. Successfully, it is applied to the rational non-polynomial oscillator potential. Moreover, a…

Mathematical Physics · Physics 2007-05-23 Omar Mustafa , Maen Odeh

We prove a formula for the structure sheaf of a quiver variety in the Grothendieck ring of its embedding variety. This formula generalizes and gives new expressions for Grothendieck polynomials. We furthermore conjecture that the…

Algebraic Geometry · Mathematics 2007-05-23 Anders Skovsted Buch

In this paper we study some iterative methods for simultaneous approximation of polynomial zeros. We give new semilocal convergence theorems with error bounds for Ehrlich's and Nourein's iterations. Our theorems generalize and improve…

Numerical Analysis · Mathematics 2007-09-10 Petko D. Proinov

The geodesic Markov chain Monte Carlo method and its variants enable computation of integrals with respect to a posterior supported on a manifold. However, for regular integrals, the convergence rate of the ergodic average will be…

Methodology · Statistics 2018-10-16 Chris. J. Oates , Alessandro Barp , Mark Girolami

We consider the Grothendieck polynomials appearing in the K-theory of Grassmannians, which are analogs of Schur polynomials. This paper aims to establish a version of the Murnaghan-Nakayama rule for Grothendieck polynomials of the…

Combinatorics · Mathematics 2024-05-14 Khanh Nguyen Duc , Dang Tuan Hiep , Tran Ha Son , Do Le Hai Thuy

We give expansions of reproducing kernels of the Christoffel-Darboux type in terms of Schur polynomials. For this, we use evaluations of averages of characteristic polynomials and Schur polynomials in random matrix ensembles. We explicitly…

Mathematical Physics · Physics 2021-10-13 Leonardo Santilli , Miguel Tierz

As a generalization of Hermite interpolation problem, Birkhoff interpolation is an important subject in numerical approximation. This paper generalizes the existing Generalized Recursive Polynomial Interpolation Algorithm (GRPIA) that is…

Numerical Analysis · Mathematics 2026-01-29 Xue Jiang , Yuanhe Li , Zhe Li

A novel polynomial expansion method of symmetric Boolean functions is described. The method is efficient for symmetric Boolean function with small set of valued numbers and has the linear complexity for elementary symmetric Boolean…

Discrete Mathematics · Computer Science 2013-06-25 Danila A. Gorodecky

We establish new results on root separation of integer, irreducible polynomials of degree at least four. These improve earlier bounds of Bugeaud and Mignotte (for even degree) and of Beresnevich, Bernik, and Goetze (for odd degree).

Number Theory · Mathematics 2014-02-26 Yann Bugeaud , Andrej Dujella

We show a method for constructing a polynomial interpolating roots' multiplicities of another polynomial, that does not use companion matrices. This leads to a modification to Guersenzvaig--Szechtman square-free decomposition algorithm that…

Symbolic Computation · Computer Science 2017-03-20 Przemysław Koprowski

We give an explicit formula for the degree of the Grothendieck polynomial of a Grassmannian permutation and a closely related formula for the Castelnuovo-Mumford regularity of the Schubert determinantal ideal of a Grassmannian permutation.…

Combinatorics · Mathematics 2020-07-30 Jenna Rajchgot , Yi Ren , Colleen Robichaux , Avery St. Dizier , Anna Weigandt

We obtain an extension of the Christoffel--Darboux formula for matrix orthogonal polynomials with a generalized Hankel symmetry, including the Adler-van Moerbeke generalized orthogonal polynomials.

Classical Analysis and ODEs · Mathematics 2014-08-26 Carlos Álvarez-Fernández , Manuel Mañas

The aim of this paper is the study of the bisection method in $\mathbb{R}^n$. In this work we propose a multivariate bisection method supported by the Poincar\'e-Miranda theorem in order to solve non-linear system of equations. Given an…

Numerical Analysis · Mathematics 2017-11-28 Manuel López Galván

Buch and Rim\'{a}nyi proved a formula for specializations of double Grothendieck polynomials based on the Yang-Baxter equation related to the degenerate Hecke algebra. A geometric proof was found by Yong and Woo by constructing a…

Combinatorics · Mathematics 2020-02-13 Neil J. Y. Fan , Peter L. Guo

We present an algorithm for computing a Smith form with multipliers of a regular matrix polynomial over a field. This algorithm differs from previous ones in that it computes a local Smith form for each irreducible factor in the determinant…

Symbolic Computation · Computer Science 2015-03-13 Jon Wilkening , Jia Yu