English
Related papers

Related papers: Factorization of symmetric polynomials

200 papers

The classical theory of symmetric functions has a central position in algebraic combinatorics, bridging aspects of representation theory, combinatorics, and enumerative geometry. More recently, this theory has been fruitfully extended to…

Combinatorics · Mathematics 2022-03-25 Oliver Pechenik , Dominic Searles

By polynomial (or extended binomial) coefficients, we mean the coefficients in the expansion of integral powers, positive and negative, of the polynomial $1+t +\cdots +t^{m}$; $m\geq 1$ being a fixed integer. We will establish several…

Number Theory · Mathematics 2016-07-26 Nour-Eddine Fahssi

We consider the `universal monodrimy operators' for the Baxter Q-operators. They are given as images of the universal R-matrix in oscillator representation. We find related universal factorization formulas in $U_{q}(\hat{sl}(2))$ case.

Mathematical Physics · Physics 2014-05-01 Sergey Khoroshkin , Zengo Tsuboi

In this paper, we establish more properties of generalized poly-Euler polynomials with three parameters and we investigate a kind of symmetrized generalization of poly- Euler polynomials. Moreover, we introduce a more general form of multi…

Number Theory · Mathematics 2015-08-11 Hassan Jolany , Roberto B. Corcino

We give a pattern-avoidance characterization of $w \in S_n$ such that the Schubert polynomial $\mathfrak{S}_w$ is a standard elementary monomial. This characterization tells us which quantum Schubert polynomials are easiest to compute. We…

Combinatorics · Mathematics 2025-03-11 Dora Woodruff

We study the number of ways of factoring elements in the complex reflection groups G(r,s,n) as products of reflections. We prove a result that compares factorization numbers in G(r,s,n) to those in the symmetric group on n letters, and we…

Group Theory · Mathematics 2021-11-30 Elzbieta Polak , Dustin Ross

Factorization of polynomials arises in numerous areas in symbolic computation. It is an important capability in many symbolic and algebraic computation. There are two type of factorization of polynomials. One is convention polynomial…

Algebraic Geometry · Mathematics 2007-05-23 Jingzhong Zhang , Yong Feng

In this paper, we study some symmetric identities of q-Euler numbers and polynomials. From these properties, we derive several identities of q-Euler numbers and polynomials.

Number Theory · Mathematics 2013-10-08 Dae San Kim , Taekyun Kim

In continuation to our recent work on noncommutative polynomial factorization, we consider the factorization problem for matrices of polynomials and show the following results. (1) Given as input a full rank $d\times d$ matrix $M$ whose…

Computational Complexity · Computer Science 2022-04-01 V. Arvind , Pushkar S. Joglekar

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…

Combinatorics · Mathematics 2010-12-14 Peter J. McNamara

This work addresses a full characterization of three new q-polynomials derived from the $q-$oscillator algebra. Related matrix elements and generating functions are deduced. Further, a connection between Hahn factorial and q-Gaussian…

Mathematical Physics · Physics 2013-11-25 Won Sang Chung , Mahouton Norbert Hounkonnou , Sama Arjika

A simple matrix formulation of the Fibonacci, Lucas, Chebyshev, and Dixon polynomials polynomials is presented. It utilizes the powers and the symmetric tensor powers of a certain matrix.

General Mathematics · Mathematics 2021-05-31 Jerzy Kocik

We study characteristic polynomials of symmetric matrices with entries ${i+j\choose i}$ the binomial coefficients, over finite fields.

Number Theory · Mathematics 2007-05-23 Roland Bacher , Robin Chapman

We construct a generalization of the theory of symmetric functions involving functions of commuting and anticommuting (Grassmannian) variables. These new functions, called symmetric functions in superspace, are invariant under the diagonal…

Combinatorics · Mathematics 2007-05-23 P. Desrosiers , L. Lapointe , P. Mathieu

It is known that the elementary symmetric polynomials $e_k(x)$ have the property that if $ x, y \in [0,\infty)^n$ and $e_k(x) \leq e_k(y)$ for all $k$, then $||x||_p \leq ||y||_p$ for all real $0\leq p \leq 1$, and moreover $||x||_p \geq…

Classical Analysis and ODEs · Mathematics 2013-02-20 Ivo Klemes

We study the r-th elementary symmetric polynomial in $n$ variables with 2<r<n. There are two kinds of linear transformations on the parameter space that leave this polynomial invariant: Namely, any permutation of the variables and…

Commutative Algebra · Mathematics 2016-07-29 Jesko Hüttenhain

We provide an operator space version of Maurey's factorization theorem. The main tool is an embedding result of independent interest. Applications for operator spaces and noncommutative Lp spaces are included.

Functional Analysis · Mathematics 2009-10-22 Marius Junge , Javier Parcet

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 define universal factorial Schur $P,Q$-functions and their duals, which specialize to generalized (co)-homology "Schubert basis" for loop spaces of the classical groups. We also investigate some of their properties.

Algebraic Topology · Mathematics 2018-12-11 Masaki Nakagawa , Hiroshi Naruse

We propose asymmetric factorization method for supersymmetry involving complex operators. Model Hamiltonians satisfy supersymmetric energy conditions $E_{n}^{(+)}=E_{n+1}^{(-)}$; $E_{0}^{(-)}=0$.

Quantum Physics · Physics 2024-11-11 Biswanath Rath