相关论文: Thom polynomials and Schur functions I

Thom polynomial describes the cohomology class Poincar\'e dual to the locus of particular singularity of a generic holomorphic map. In this paper we derive a closed formula for the generating function of its coefficients. The method is…

A singular polynomial is one which is annihilated by all Dunkl operators for a certain parameter value. These polynomials were first studied by Dunkl, de Jeu and Opdam, (Trans. Amer. Math. Soc. 346 (1994), 237-256). This paper constructs a…

We describe the positivity of Thom polynomials of singularities of maps, Lagrangian Thom polynomials and Legendrian Thom polynomials. We show that these positivities come from Schubert calculus.

We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.

We study correlation functions of the characteristic polynomials in coupled matrix models based on the Schur polynomial expansion, which manifests their determinantal structure.

We study the space, $R_m$, of $m$-symmetric functions consisting of polynomials that are symmetric in the variables $x_{m+1},x_{m+2},x_{m+3},\dots$ but have no special symmetry in the variables $x_1,\dots,x_m$. We obtain $m$-symmetric…

Schur superpolynomials have been introduced recently as limiting cases of the Macdonald superpolynomials. It turns out that there are two natural super-extensions of the Schur polynomials: in the limit $q=t=0$ and $q=t\rightarrow\infty$,…

In the present paper, we prove the existence of universal polynomials which express multi-singularity loci classes of prescribed types for proper morphisms between smooth schemes over an algebraically closed field of characteristic zero --…

Grothendieck polynomials were introduced by Lascoux and Sch\"utzenberger, and they play an important role in K-theoretic Schubert calculus. In this paper, we give a new definition of double stable Grothendieck polynomials based on an…

Stable Grothendieck polynomials can be viewed as a K-theory analog of Schur polynomials. We extend stable Grothendieck polynomials to a two-parameter version, which we call canonical stable Grothendieck functions. These functions have the…

Define a ``truncation'' $r_{t}(p)$ of a polynomial $p$ in $\{x_1,x_2,x_3,...\}$ as the polynomial with all but the first $t$ variables set to zero. In certain good cases, the truncation of a Schubert or Grothendieck polynomial may again be…

When implementing regular enough functions (e.g., elementary or special functions) on a computing system, we frequently use polynomial approximations. In most cases, the polynomial that best approximates (for a given distance and in a given…

Given a finite subset S in F_p^d, let a(S) be the number of distinct r-tuples (x_1,...,x_r) in S such that x_1+...+x_r = 0. We consider the "moments" F(m,n) = sum_|S|=n a(S)^m. Specifically, we present an explicit formula for F(m,n) as a…

We analyze the Charlier polynomials C(n,x)and their zeros asymptotically for large n. We obtain asymptotic approximations, using the limit relation between the Krawtchouk and Charlier polynomials, involving some special functions. We give…

At finite N the number of restricted Schur polynomials is greater than or equal to the number of generalized restricted Schur polynomials. In this note we study this discrepancy and explain its origin. We conclude that, for quiver gauge…

In this paper, we study Grothendieck polynomials from a combinatorial viewpoint. We introduce the factorial Grothendieck polynomials, analogues of the factorial Schur functions and present some of their properties, and use them to produce a…

Jacobi-Trudy formula for a generalisation of Schur polynomials related to any sequence of orthogonal polynomials in one variable is given. As a corollary we have Giambelli formula for generalised Schur polynomials.

The authors' previous results on the arity gap of functions of several variables are refined by considering polynomial functions over arbitrary fields. We explicitly describe the polynomial functions with arity gap at least 3, as well as…

We study the computational power of polynomial threshold functions, that is, threshold functions of real polynomials over the boolean cube. We provide two new results bounding the computational power of this model. Our first result shows…

In this paper, exact rate of approximation of functions by linear means of Fourier series and Fourier integrals and corresponding $K$-functionals are expressed via special moduli of smoothness. . Introduction is given in $\S 1$. In $\S2$…