English
Related papers

Related papers: On MacLane-Vaqui\'e key polynomials

200 papers

This semi-expository paper surveys results concerning three classes of orthogonal polynomials: in one non-hermitian variable, in several isometric non-commuting variables, and in several hermitian non-commuting variables. The emphasis is on…

Functional Analysis · Mathematics 2007-05-23 T. Banks , T. Constantinescu , J. L. Johnson

In this paper we introduce and discuss some classes of orthogonal polynomials in several non-commuting variables. The emphasis is on a non-commutative version of the orthogonal polynomials on the real line. We introduce recurrence equations…

Functional Analysis · Mathematics 2007-05-23 T. Constantinescu

In this paper we consider the notions of binomial thinning, binomial mixing, their generalizations, certain interplay between them, associated limit theorems and provide various examples.

Probability · Mathematics 2022-09-02 Offer Kella , Andreas Löpker

Consider the set $\mathcal{K}$ of integers $k$ for which there are infinitely many primes $p$ such that $p+k$ is a power of $2$. The aim of this paper is to show a relationship between $\mathcal{K}$ and the limits points of some set…

Number Theory · Mathematics 2023-05-03 José Manuel Rodríguez Caballero

A criterion is established for the validity of multilinear inequalities of a class considered by Brascamp and Lieb, generalizing well-known inequalities of Holder, Young, and Loomis-Whitney. This is a companion to a recent paper by the same…

Classical Analysis and ODEs · Mathematics 2007-05-23 Jonathan Bennett , Anthony Carbery , Michael Christ , Terence Tao

In the present article, we introduce a $(p,q)$-analogue of the poly-Euler polynomials and numbers by using the $(p,q)$-polylogarithm function. These new sequences are generalizations of the poly-Euler numbers and polynomials. We give…

Number Theory · Mathematics 2016-04-14 Takao Komatsu , José L. Ramírez , Víctor F. Sirvent

The study of $-1$ orthogonal polynomials viewed as $q =-1$ limits of the $q$-orthogonal polynomials is pursued. This paper present the continuous polynomials part of the $-1$ analog of the $q$-Askey scheme. A compendium of the properties of…

Classical Analysis and ODEs · Mathematics 2022-10-27 Jonathan Pelletier , Luc Vinet , Alexei Zhedanov

In this paper, we introduce the notion of Jacobi polynomials with multiple reference vectors of a code, and give the MacWilliams type identity for it. Moreover, we derive a formula to obtain the Jacobi polynomials using the Aronhold…

Combinatorics · Mathematics 2022-12-07 Himadri Shekhar Chakraborty , Tsuyoshi Miezaki , Manabu Oura , Yuuho Tanaka

In previous papers, we discussed the recurrence relations of the multi-indexed orthogonal polynomials of the Laguerre, Jacobi, Wilson and Askey-Wilson types. In this paper we explore those of the Racah and $q$-Racah types. For the…

Mathematical Physics · Physics 2020-06-23 Satoru Odake

To the best of our knowledge this paper is the first attempt to introduce and study polynomial interpolation of the polynomial data given on arbitrary varieties. In the first part of the paper we present results on the solvability of such…

Commutative Algebra · Mathematics 2022-08-29 Tom McKinley , Boris Shekhtman , Brian Tuesink

The work concerns a type of backward multivalued McKean-Vlasov stochastic differential equations. First, we prove the existence and uniqueness of solutions for backward multivalued McKean-Vlasov stochastic differential equations. Then, it…

Probability · Mathematics 2022-12-09 Jun Gong , Huijie Qiao

The paper is mainly devoted to the irreducibility of the polynomial representation of the double affine Hecke algebra for an arbitrary reduced root systems and generic "central charge" q. The technique of intertwiners in the non-semisimple…

Quantum Algebra · Mathematics 2008-11-01 Ivan Cherednik

We present several new and compact formulas for the modified and integral form of the Macdonald polynomials, building on the compact "multiline queue" formula for Macdonald polynomials due to Corteel, Mandelshtam, and Williams. We also…

Combinatorics · Mathematics 2020-04-28 Sylvie Corteel , Jim Haglund , Olya Mandelshtam , Sarah Mason , Lauren Williams

We prove some "power" generalizations of Marcus-Lopes-style (including McLeod and Bullen) concavity inequalities for elementary symmetric polynomials, and convexity inequalities (of McLeod and Baston) for complete homogeneous symmetric…

Optimization and Control · Mathematics 2018-03-28 Suvrit Sra

For a simple, normal and finite extension of a valued field, we prove that we can related the order of the ramification group of the field extension and the set of key polynomials associated to the extension of the valuation. More…

Algebraic Geometry · Mathematics 2016-02-29 Jean-Christophe San Saturnino

We present various constructions of sequences of polynomials satisfying the Binomial Theorem in finite characteristic based on the theory of additive polynomials. Various actions on these constructions are also presented. It is an open…

Number Theory · Mathematics 2014-12-11 David Goss

Consider a logharmonic polynomial; that is, a product of the form $p(z)\overline{q(z)}$, where $p$, $q$ are holomorphic polynomials. Assume $q$ is linear and denote by $n$ the degree of $p$. It was recently shown in arXiv:2302.04339…

Complex Variables · Mathematics 2025-08-15 Kirill Lazebnik , Erik Lundberg

Matrix-valued Cauchy bi-orthogonal polynomials were proposed in this paper, together with its quasideterminant expression. It is shown that the coefficients in four-term recurrence relation for matrix-valued Cauchy bi-orthogonal polynomials…

Mathematical Physics · Physics 2023-01-02 Shi-Hao Li , Ying Shi , Guo-Fu Yu , Jun-Xiao Zhao

In this paper we introduce a new sequence of polynomials, which follow the same recursive rule of the well-known Lucas-Lehmer integer sequence. We show the most important properties of this sequence, relating them to the Chebyshev…

Classical Analysis and ODEs · Mathematics 2017-03-07 Pierluigi Vellucci , Alberto Maria Bersani

The problem of constructing explicit functions which cannot be approximated by low degree polynomials has been extensively studied in computational complexity, motivated by applications in circuit lower bounds, pseudo-randomness,…

Computational Complexity · Computer Science 2014-12-16 Abhishek Bhowmick , Shachar Lovett
‹ Prev 1 4 5 6 7 8 10 Next ›