English
Related papers

Related papers: Monomiality principle, Sheffer-type polynomials an…

200 papers

We treat the problem of normally ordering expressions involving the standard boson operators a, a* where [a,a*]=1. We show that a simple product formula for formal power series - essentially an extension of the Taylor expansion - leads to a…

Quantum Physics · Physics 2007-05-23 A. Horzela , P. Blasiak , G. H. E. Duchamp , K. A. Penson , A. I. Solomon

We study the computability of the operator norm of a matrix with respect to norms induced by linear operators. Our findings reveal that this problem can be solved exactly in polynomial time in certain situations, and we discuss how it can…

Numerical Analysis · Mathematics 2025-10-23 Adrian Kulmburg

We investigate the asymptotic behavior of a family of multiple orthogonal polynomials that is naturally linked with the normal matrix model with a monomial potential of arbitrary degree $d+1$. The polynomials that we investigate are…

Classical Analysis and ODEs · Mathematics 2015-06-18 Arno B. J. Kuijlaars , Abey López-García

We make a generalization of the type C monomial space of a single variable, which was introduced in the construction of type C N-fold supersymmetry, to several variables. Then, we construct the most general quasi-solvable second-order…

High Energy Physics - Theory · Physics 2007-05-23 Toshiaki Tanaka

We give a general expression for the normally ordered form of a function F(w(a,a*)) where w is a function of boson annihilation and creation operators satisfying [a,a*]=1. The expectation value of this expression in a coherent state becomes…

Quantum Physics · Physics 2015-06-26 P. Blasiak , K. A. Penson , A. I. Solomon , A. Horzela , G. E. H. Duchamp

We introduce a majorization order on monomials. With the help of this order, we derive a necessary condition on the positive termination of a general successive difference substitution algorithm (KSDS) for an input form $f$.

Symbolic Computation · Computer Science 2014-05-19 Jia Xu , Yong Yao

Assume that there is a set of monic polynomials $P_n(z)$ satisfying the second-order difference equation $$ A(s) P_n(z(s+1)) + B(s) P_n(z(s)) + C(s) P_n(z(s-1)) = \lambda_n P_n(z(s)), n=0,1,2,..., N$$ where $z(s), A(s), B(s), C(s)$ are some…

Classical Analysis and ODEs · Mathematics 2007-12-04 Luc Vinet , Alexei Zhedanov

A generalization of the Macdonald polynomials depending upon both commuting and anticommuting variables has been introduced recently. The construction relies on certain orthogonality and triangularity relations. Although many…

Mathematical Physics · Physics 2013-07-04 O. Blondeau-Fournier , P. Desrosiers , L. Lapointe , P. Mathieu

Given the monomial ideal I=(x_1^{{\alpha}_1},...,x_{n}^{{\alpha}_{n}})\subset K[x_1,...,x_{n}] where {\alpha}_{i} are positive integers and K a field and let J be the integral closure of I . It is a challenging problem to translate the…

Commutative Algebra · Mathematics 2010-09-07 Ibrahim Al-Ayyoub

The numerical construction of polynomials in the product representation (as used for instance in variants of the multiboson technique) can become problematic if rounding errors induce an imprecise or even unstable evaluation of the…

High Energy Physics - Lattice · Physics 2009-10-31 B. Bunk , S. Elser , R. Frezzotti , K. Jansen

In this article we go deeply into the formulation and meaning of the monomiality principle and employ it to study the properties of a set of polynomials, which, asymptotically, reduce to the ordinary two variable Kampe de Feriet family. We…

Classical Analysis and ODEs · Mathematics 2022-05-25 Giuseppe Dattoli , Silvia Licciardi

The efficiency of Gr\"obner basis computation, the standard engine for solving systems of polynomial equations, depends on the choice of monomial ordering. Despite a near-continuum of possible monomial orders, most implementations rely on…

Symbolic Computation · Computer Science 2026-02-04 R. Caleb Bunch , Alperen A. Ergür , Melika Golestani , Jessie Tong , Malia Walewski , Yunus E. Zeytuncu

$q$-Analogues of the coefficients of $x^a$ in the expansion of $\prod_{j=1}^N (1+x+...+x^j)^{L_j}$ are proposed. Useful properties, such as recursion relations, symmetries and limiting theorems of the ``$q$-supernomial coefficients'' are…

q-alg · Mathematics 2008-02-03 Anne Schilling , S. Ole Warnaar

It is known that computing the permanent of the matrix $1+A$, where $A$ is a finite-rank matrix, requires a number of operations polynomial in the matrix size. Motivated by the boson-sampling proposal of restricted quantum computation, I…

Quantum Physics · Physics 2023-05-31 Dmitri A. Ivanov

It was recently conjectured that every system of exceptional orthogonal polynomials is related to classical orthogonal polynomials by a sequence of Darboux transformations. In this paper we prove this conjecture, which paves the road to a…

Classical Analysis and ODEs · Mathematics 2017-02-07 M. Ángeles García-Ferrero , David Gómez-Ullate , Robert Milson

The normal ordering formulae for powers of the boson number operator $\hat{n}$ are extended to deformed bosons. It is found that for the `M-type' deformed bosons, which satisfy $a a^{\dagger} - q a^{\dagger} a = 1$, the extension involves a…

Mathematical Physics · Physics 2009-10-31 Jacob Katriel , Maurice Kibler

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

Given an arrangement of hyperplanes in $\P^n$, possibly with non-normal crossings, we give a vanishing lemma for the cohomology of the sheaf of $q$-forms with logarithmic poles along our arrangement. We give a basis for the ideal $\cal J$…

alg-geom · Mathematics 2008-02-03 Herbert Kanarek

We investigate the algebra generated by the operators $x$ and $\mathrm{I} = \int_0^x$, which satisfy the commutation relation \[ [\mathrm{I},x] = \mathrm{I}x - x\mathrm{I} = - \mathrm{I}^2. \] We develop a combinatorial framework for the…

Combinatorics · Mathematics 2025-12-02 Abdelhay Benmoussa

We say that the polynomial sequence $(Q^{(\lambda)}_n)$ is a semiclassical Sobolev polynomial sequence when it is orthogonal with respect to the inner product $$ <p, r>_S=<{{\bf u}} ,{p\, r}> +\lambda <{{\bf u}}, {{\mathscr D}p \,{\mathscr…

Classical Analysis and ODEs · Mathematics 2011-09-06 R. S. Costas-Santos , J. J. Moreno-Balcázar