English
Related papers

Related papers: Thom polynomials and Schur functions: towards the …

200 papers

Every polynomial of the form $P=(x+1)(x^{n-1}+c_1x^{n-2}+\cdots +c_{n-1})$ is representable as Schur-Szeg\H{o} composition of $n-1$ polynomials of the form $(x+1)^{n-1}(x+a_i)$, where the numbers $a_i$ are unique up to permutation. We give…

Classical Analysis and ODEs · Mathematics 2015-04-08 Vladimir Petrov Kostov

We give a description of the factorization homology and $E_n$ topological Hochschild cohomology of Thom spectra arising from $n$-fold loop maps $f: A \to BO$, where $A = \Omega^n X$ is an $n$-fold loop space. We describe the factorization…

Algebraic Topology · Mathematics 2018-08-29 Inbar Klang

It is a classical fundamental result that Schur-positive specializations of the ring of symmetric functions are characterized via totally positive functions whose parametrization describes the Edrei-Thoma theorem. In this paper we study…

Combinatorics · Mathematics 2020-02-24 Damir Yeliussizov

We introduce and study the notion of the $G$-Tutte polynomial for a list $\mathcal{A}$ of elements in a finitely generated abelian group $\Gamma$ and an abelian group $G$, which is defined by counting the number of homomorphisms from…

Combinatorics · Mathematics 2021-09-03 Ye Liu , Tan Nhat Tran , Masahiko Yoshinaga

We generalize certain totient functions using elementary symmetric polynomials and derive explicit product forms for the totient functions involving the second elementary symmetric sum. This work follows from the work of Toth [The Ramanujan…

Number Theory · Mathematics 2026-05-21 Udvas Acharjee , N. Uday Kiran

We apply a theorem of Geronimus to derive some new formulas connecting Schur functions with orthogonal polynomials on the unit circle. The applications include the description of the associated measures and a short proof of Boyd's result…

Classical Analysis and ODEs · Mathematics 2009-09-25 Feruenc Pinteŕ , Paul G. Nevai

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

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…

Mathematical Software · Computer Science 2007-05-23 Nicolas Brisebarre , Jean-Michel Muller

We give a representation of the classical theory of multiplicative arithmetic functions (MF)in the ring of symmetric polynomials. The basis of the ring of symmetric polynomials that we use is the isobaric basis, a basis especially sensitive…

Number Theory · Mathematics 2007-11-26 Trueman MacHenry , Kieh Wong

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…

Combinatorics · Mathematics 2025-01-10 Luc Lapointe

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.

Representation Theory · Mathematics 2009-06-10 A. N. Sergeev , A. P. Veselov

Aichinger's equation is used to give simple proofs of several well-known characterizations of polynomial functions as solutions of certain functional equations. Concretely, we use that Aichinger's equation characterizes polynomial functions…

Classical Analysis and ODEs · Mathematics 2022-11-22 J. M. Almira

Function approximation is a generic process in a variety of computational problems, from data interpolation to the solution of differential equations and inverse problems. In this work, a unified approach for such techniques is…

Numerical Analysis · Mathematics 2019-10-01 Nikolaos P. Bakas

We introduce the new combinatorial approach of plethystic type of tableaux, as a method to understand coefficients of Schur functions appearing in plethysms $s_\nu[h_\lambda]$ and $s_{\nu}[e_{\lambda}]$, for any partitions $\lambda$ and…

Combinatorics · Mathematics 2022-09-30 Florence Maas-Gariépy , Étienne Tétreault

We establish the existence of a finite-dimensional unitary realization for every matrix-valued rational inner function from the Schur--Agler class on a unit square-matrix polyball. In the scalar-valued case, we characterize the denominators…

A set of functions is introduced which generalizes the famous Schur polynomials and their connection to Grasmannian manifolds. These functions are shown to provide a new method of constructing solutions to the KP hierarchy of nonlinear…

Mathematical Physics · Physics 2007-05-23 Alex Kasman

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…

Combinatorics · Mathematics 2016-09-13 Damir Yeliussizov

A remarkable feature of Schur functions -- the common eigenfunctions of cut-and-join operators from $W_\infty$ -- is that they factorize at the peculiar two-parametric topological locus in the space of time-variables, what is known as the…

High Energy Physics - Theory · Physics 2016-09-12 Ya. Kononov , A. Morozov

Fourier series multiscale method, a concise and efficient analytical approach for multiscale computation, will be developed out of this series of papers. The second paper is concerned with simultaneous approximation to functions and their…

Numerical Analysis · Mathematics 2022-08-09 Weiming Sun , Zimao Zhang

We prove that a Schur function of rectangular shape $(M^n)$ whose variables are specialized to $x_1,x_1^{-1},...,x_n,x_n^{-1}$ factorizes into a product of two odd orthogonal characters of rectangular shape, one of which is evaluated at…

Combinatorics · Mathematics 2010-01-18 Mihai Ciucu , Christian Krattenthaler