中文
相关论文

相关论文: On the Irreducibility of the Krawtchouck Polynomia…

200 篇论文

Krawtchouk's polynomials occur classically as orthogonal polynomials with respect to the binomial distribution. They may be also expressed in the form of matrices, that emerge as arrays of the values that the polynomials take. The algebraic…

量子物理 · 物理学 2011-02-11 Philip Feinsilver , Jerzy Kocik

A Leonard pair is a pair of diagonalizable linear transformations of a finite-dimensional vector space, each of which acts in an irreducible tridiagonal fashion on an eigenbasis for the other one. In the present paper we give an elementary…

表示论 · 数学 2012-01-10 Kazumasa Nomura , Paul Terwilliger

Exceptional orthogonal polynomials are families of orthogonal polynomials that arise as solutions of Sturm-Liouville eigenvalue problems. They generalize the classical families of Hermite, Laguerre, and Jacobi polynomials by allowing for…

经典分析与常微分方程 · 数学 2021-02-23 María Ángeles García-Ferrero , David Gómez-Ullate , Robert Milson

Krawtchouk polynomials play an important role in coding theory and are also useful in graph theory and number theory. Although the basic properties of these polynomials are to some extent known, there is, to my knowledge, no detailed…

经典分析与常微分方程 · 数学 2011-01-12 Rodney Coleman

In Lett. Math. Phys. 114, 54 (2024) and 115, 70 (2025), the author introduces what is presented as a novel method for determining whether a sequence of orthogonal polynomials is "classical", based solely on its initial recurrence…

综合数学 · 数学 2025-07-29 K. Castillo , G. Gordillo-Núñez

Conditionally on the Riemann hypothesis for certain Dedekind zeta functions, we show that the characteristic polynomial of a class of random tridiagonal matrices of large dimension is irreducible, with probability exponentially close to…

数论 · 数学 2025-11-18 Lior Bary-Soroker , Daniele Garzoni , Sasha Sodin

We study the Galois groups of polynomials arising from a compatible family of representations with big orthogonal monodromy. We show that the Galois groups are usually as large as possible given the constraints imposed on them by a…

数论 · 数学 2020-01-22 David Zywina

This article studies the Galois groups that arise from division points of the lemniscate. We compute these Galois groups two ways: first, by class field theory, and second, by proving the irreducibility of lemnatomic polynomials, which are…

数论 · 数学 2012-08-22 David A. Cox , Trevor Hyde

We derive lower und upper bounds for the degree of regularity of an overdetermined, zero-dimensional and homogeneous quadratic semi-regular system of polynomial equations. The analysis is based on the interpretation of the associated…

组合数学 · 数学 2020-11-25 Stavros Kousidis

We call Krawtchouk-Griffiths systems, or KG-systems, systems of multivariate polynomials orthogonal with respect to corresponding multinomial distributions. The original Krawtchouk polynomials are orthogonal with respect to a binomial…

表示论 · 数学 2016-11-24 Philip Feinsilver

The Darboux transformations of Krawtchouk polynomials are investigated and all possible exceptional Krawtchouk polynomials obtainable from a single-step Darboux transformation are considered. The properties of these exceptional Krawtchouk…

经典分析与常微分方程 · 数学 2022-02-01 Hiroshi Miki , Satoshi Tsujimoto , Luc Vinet

We consider random polynomials with independent identically distributed coefficients with a fixed law. Assuming the Riemann hypothesis for Dedekind zeta functions, we prove that such polynomials are irreducible and their Galois groups…

数论 · 数学 2022-08-25 Emmanuel Breuillard , Péter P. Varjú

Multivariate extensions of the Krawtchouk polynomials have been studied by numerous authors in recent decades by exploring new connections to probability, representation theory and quantum integrability. We develop a theory of multivariate…

表示论 · 数学 2026-05-07 Plamen Iliev , Songhao Zhu

The problem of computing \emph{the exponent lattice} which consists of all the multiplicative relations between the roots of a univariate polynomial has drawn much attention in the field of computer algebra. As is known, almost all…

符号计算 · 计算机科学 2020-05-06 Tao Zheng

We study the recurrence coefficients of the orthogonal polynomials with respect to a semi-classical extension of the Krawtchouk weight. We derive a coupled discrete system for these coefficients and show that they satisfy the fifth…

经典分析与常微分方程 · 数学 2012-12-03 Lies Boelen , Galina Filipuk , Christophe Smet , Walter Van Assche , Lun Zhang

We estimate several probability distributions arising from the study of random, monic polynomials of degree $n$ with coefficients in the integers of a general $p$-adic field $K_{\mathfrak{p}}$ having residue field with $q= p^f$ elements. We…

数论 · 数学 2014-09-03 Benjamin L. Weiss

We produce a new family of polynomials f(x) over fields K of characteristic 2 which are exceptional, in the sense that f(x)-f(y) has no absolutely irreducible factors in K[x,y] besides the scalar multiples of x-y; when K is finite, this…

数论 · 数学 2013-10-08 Robert M. Guralnick , Joel E. Rosenberg , Michael E. Zieve

Clifford-Legendre and Clifford-Gegenbauer polynomials are eigenfunctions of certain differential operators acting on functions defined on $m$-dimensional euclidean space ${\mathbb R}^m$ and taking values in the associated Clifford algebra…

经典分析与常微分方程 · 数学 2020-12-11 Hamed Baghal Ghaffari , Jeffrey A. Hogan , Joseph D. Lakey

Let $n\ge 3$ be an odd natural number. In 1738, Abraham de Moivre introduced a family of polynomials of degree $n$ with rational coefficients, all of which are solvable. So far, the Galois groups of these polynomials have been investigated…

数论 · 数学 2020-09-08 Kurt Girstmair

The goal of this paper is to prove that a random polynomial with i.i.d. random coefficients taking values uniformly in $\{1,\ldots, 210\}$ is irreducible with probability tending to $1$ as the degree tends to infinity. Moreover, we prove…

数论 · 数学 2020-03-18 Lior Bary-Soroker , Gady Kozma
‹ 上一页 1 2 3 10 下一页 ›