Family Of Polynomials Research Articles

On a Class of Generalized Multivariate Hermite–Humbert Polynomials via Generalized Fibonacci Polynomials

This paper offers a thorough examination of a unified class of Humbert’s polynomials in two variables, extending beyond well-known polynomial families such as Gegenbauer, Humbert, Legendre, Chebyshev, Pincherle, Horadam, Kinnsy, Horadam–Pethe, Djordjević, Gould, Milovanović, Djordjević, Pathan, and Khan polynomials. This study’s motivation stems from exploring polynomials that lack traditional nomenclature. This work presents various expansions for Humbert–Hermite polynomials, including those involving Hermite–Gegenbauer (or ultraspherical) polynomials and Hermite–Chebyshev polynomials. The proofs enhanced our understanding of the properties and interrelationships within this extended class of polynomials, offering valuable insights into their mathematical structure. This research consolidates existing knowledge while expanding the scope of Humbert’s polynomials, laying the groundwork for further investigation and applications in diverse mathematical fields.

Statistical and computational efficiency for smooth tensor estimation with unknown permutations

We consider the problem of structured tensor denoising in the presence of unknown permutations. Such data problems arise commonly in recommendation systems, neuroimaging, community detection, and multiway comparison applications. Here, we develop a general family of smooth tensor models up to arbitrary index permutations; the model incorporates the popular tensor block models and Lipschitz hypergraphon models as special cases. We show that a constrained least-squares estimator in the block-wise polynomial family achieves the minimax error bound. A phase transition phenomenon is revealed with respect to the smoothness threshold needed for optimal recovery. In particular, we find that a polynomial of degree up to ( m − 2 ) ( m + 1 ) / 2 is sufficient for accurate recovery of order-m tensors, whereas higher degrees exhibit no further benefits. This phenomenon reveals the intrinsic distinction for smooth tensor estimation problems with and without unknown permutations. Furthermore, we provide an efficient polynomial-time Borda count algorithm that provably achieves the optimal rate under monotonicity assumptions. The efficacy of our procedure is demonstrated through both simulations and Chicago crime data analysis.

A Family of Fractal-Based Irreducible Polynomials

Summary We provide some fractal-based irreducibility criteria for integer polynomials. The results are obtained using the self-similar pattern of Pascal’s triangle modulo two and by applying a restatement of the Schönemann–Eisenstein’s irreducibility criterion.

Bivariate q-Laguerre–Appell polynomials and their applications

ABSTRACT Recently, the monomiality principle has been extended to q-polynomials, namely, the q-monomiality principle of q-Appell polynomials has been considered. Also, certain results including the monomiality properties of the q-Gould-Hopper polynomials are derived and applications of monomiality are explored for a few members of the q-Appell polynomial families. In this paper, the primary purpose of this paper is to define 2-variable q-Laguerre–Appell polynomials by applying the q-monomiality principle techniques and to study their quasi-monomial properties and applications. We provide some operational identities and quasi-monomial features. Also, we derive some q-differential equations of these polynomials. As applications, using the operational identity of 2-variable q-Laguerre–Appell polynomials we draw specific conclusions regarding several q-Laguerre–Appell polynomial families. Furthermore, we define the family of q-Laguerre-Sheffer polynomials by an operational approach and give some of its fundamental properties.

On the Independent Uphill Domination Polynomial of a Graph

Objectives: The concept of independent uphill domination polynomial is newly defined to deal with the present graph theory in this paper. It is characterized and analyzed within various contexts and types of graphs, its roots are discovered, its relation to different graph transforms is discussed and the study of this graph can help reveal new structures of graphs. Methods: The independent uphill domination polynomial is defined as is an independent uphill dominating set of size in . The uphill paths are used in identifying the criterion of independent uphill dominating sets. The computation of specific values of the polynomial is performed for basic graphs, and the polynomial’s response to various flip operations is observed. Findings: Checking the standard graphs for some properties of the independent uphill dominance polynomial shows the features of the independent uphill dominance polynomial as an uphill dominance polynomial of a certain type of digraph. Families of polynomials can be best understood when it comes to stability and characteristics by analyzing their roots on different graphical planes. They demonstrate how the structure of the graph and the polynomial change as a result of the different graph operations. Novelty: Incorporating uphill paths into independent dominating sets extends common domination polynomials and provides a distinct perspective distinct from previous investigations on graph dominance. Hence, this work enriches the subject and suggests new avenues for studying related polynomials and their uses by encompassing more structural properties of graphs. Keywords: Domination, Polynomial, Uphill domination, Independent domination, Root, Book graph, Independent uphill domination polynomial

Moments of Artin–Schreier L-functions

Abstract We compute moments of L-functions associated to the polynomial family of Artin–Schreier covers over $\mathbb{F}_q$, where q is a power of a prime p > 2, when the size of the finite field is fixed and the genus of the family goes to infinity. More specifically, we compute the $k{\text{th}}$ moment for a large range of values of k, depending on the sizes of p and q. We also compute the second moment in absolute value of the polynomial family, obtaining an exact formula with a lower order term, and confirming the unitary symmetry type of the family.

Hitting Sets for Orbits of Circuit Classes and Polynomial Families

The orbit of an n -variate polynomial \(f({\mathbf {x}})\) over a field \(\mathbb {F}\) is the set \(\text {orb}(f) := \lbrace f(A{\mathbf {x}}+{\mathbf {b}}) : A \in \mathrm{GL}(n,\mathbb {F}) \text{ and } {\mathbf {b}}\in \mathbb {F}^n\rbrace\) . The orbit of a polynomial f is a geometrically interesting subset of the set of affine projections of f . Affine projections of polynomials computable by seemingly weak circuit classes can be quite powerful. For example, the polynomial \(\mathsf {IMM}_{3,d}\) —the \((1,1)\) th entry of a product of d generic \(3 \times 3\) matrices—is computable by a constant-width read-once oblivious algebraic branching program (ROABP), yet every polynomial computable by a size- s general arithmetic formula is an affine projection of \(\mathsf {IMM}_{3,\text {poly}(s)}\) as shown by Ben-or and Cleve [ 12 ]. To our knowledge, no efficient hitting set construction was known for \(\text {orb}(\mathsf {IMM}_{3, d})\) before this work. In this article, we initiate the study of explicit hitting sets for the orbits of polynomials computable by several natural and well-studied circuit classes and polynomial families. In particular, we give quasi-polynomial time hitting sets for the orbits of: Low-individual-degree polynomials computable by commutative ROABPs . This implies quasi-polynomial time hitting sets for the orbits of the elementary symmetric polynomials and the orbits of multilinear sparse polynomials . Multilinear polynomials computable by constant-width ROABPs . This implies a quasi-polynomial time hitting set for the orbits of the family \(\lbrace \mathsf {IMM}_{3,d}\rbrace _{d \in \mathbb {N}}\) . Polynomials computable by constant-depth, constant-occur formulas . This implies quasi-polynomial time hitting sets for the orbits of multilinear depth-4 circuits with constant top fan-in , and also polynomial-time hitting sets for the orbits of the power symmetric polynomials and the sum-product polynomials . Polynomials computable by occur-once formulas . We say a polynomial has low individual degree if the degree of every variable in the polynomial is at most \(\text {poly}(\log n)\) , where n is the number of variables. The first two results are obtained by building upon and strengthening the rank concentration by translation technique of Agrawal, Saha, and Saxena [ 6 ]; the second result additionally uses the merge-and-reduce idea from Forbes and Shpilka [ 30 ] and Forbes, Shpilka, and Saptharishi [ 27 ]. The proof of the third result adapts the algebraic independence-based technique of Agrawal, Saha, Saptharishi, and Saxena [ 5 ] and Beecken, Mittmann, and Saxena [ 11 ] to reduce to the case of constructing hitting sets for the orbits of sparse polynomials. A similar reduction using the Shpilka-Volkovich (SV) generator-based argument in Shpilka and Volkovich [ 90 ] yields the fourth result. The SV generator plays an important role in all four results.

Polynomial and Rational Measure Modifications of Orthogonal Polynomials via Infinite-Dimensional Banded Matrix Factorizations

AbstractWe describe fast algorithms for approximating the connection coefficients between a family of orthogonal polynomials and another family with a polynomially or rationally modified measure. The connection coefficients are computed via infinite-dimensional banded matrix factorizations and may be used to compute the modified Jacobi matrices all in linear complexity with respect to the truncation degree. A family of orthogonal polynomials with modified classical weights is constructed that support banded differentiation matrices, enabling sparse spectral methods with modified classical orthogonal polynomials. We present several applications and numerical experiments using an open source implementation which make direct use of these results.

Continued Fractions, Orthogonal Polynomials and Dirichlet Series

Using an experimental mathematics approach, new relations are obtained between Dirichlet-like series for certain periodic coefficients and the moments of certain families of orthogonal polynomials. In addition to the classical hypergeometric orthogonal polynomials, of Racah type and continuous dual Hahn type, a new similar family of orthogonal polynomials intervenes.

On some $$\Sigma ^{B}_{0}$$-formulae generalizing counting principles over $$V^{0}$$

AbstractWe formalize various counting principles and compare their strengths over $$V^{0}$$ V 0 . In particular, we conjecture the following mutual independence between: a uniform version of modular counting principles and the pigeonhole principle for injections, a version of the oddtown theorem and modular counting principles of modulus p, where p is any natural number which is not a power of 2, and a version of Fisher’s inequality and modular counting principles. Then, we give sufficient conditions to prove them. We give a variation of the notion of PHP-tree and k-evaluation to show that any Frege proof of the pigeonhole principle for injections admitting the uniform counting principle as an axiom scheme cannot have o(n)-evaluations. As for the remaining two, we utilize well-known notions of p-tree and k-evaluation and reduce the problems to the existence of certain families of polynomials witnessing violations of the corresponding combinatorial principles with low-degree Nullstellensatz proofs from the violation of the modular counting principle in concern.

In Memoriam: Peter Benjamin Borwein (1953–2020)

Peter Borwein had wide-ranging mathematical interests, and was a pioneer in computational and experimental investigations in many areas. We fondly recall some of his interests and contributions in a number of topics in analysis, number theory, and other areas, especially work where computation and experimentation played an important role. This includes his work on a number of extremal problems regarding Littlewood polynomials and other families of integer polynomials with restricted coefficients, questions regarding the Mahler measure of an integer polynomial, problems on merit factors and Barker sequences, the Prouhet–Tarry–Escott problem, problems of Pólya and Turán regarding sums of the Liouville function, and questions in combinatorial geometry regarding arrangements of points and lines.

Performing a multi-stage mathematical information task "Framing the Mandelbrot set of families of polynomials of the third degree and remarkable curves"

In this article, within the framework of a multi-stage mathematical information task, the methodology for students to study Mandelbrot sets and frames of Mandelbrot sets of a family of polynomials of the third degree is indicated. Algorithms for constructing these sets in various environments are described. The connections of the frames of the Mandelbrot set with remarkable curves are studied: lemniscate, epicycloid and others. This work is aimed at developing students' creativity and research competencies. When performing a multi-stage mathematical and informational task, the student acts as a mathematician, programmer and computer artist, which is aimed at developing his creativity and increasing motivation for mathematics and programming.

Symmetric Identities Involving the Extended Degenerate Central Fubini Polynomials Arising from the Fermionic p-Adic Integral on ℤp

Since the constructions of p-adic q-integrals, these integrals as well as particular cases have been used not only as integral representations of many special functions, polynomials, and numbers, but they also allow for deep examinations of many families of special numbers and polynomials, such as central Fubini, Bernoulli, central Bell, and Changhee numbers and polynomials. One of the key applications of these integrals is for obtaining the symmetric identities of certain special polynomials. In this study, we focus on a novel generalization of degenerate central Fubini polynomials. First, we introduce two variable degenerate w-torsion central Fubini polynomials by means of their exponential generating function. Then, we provide a fermionic p-adic integral representation of these polynomials. Through this representation, we investigate several symmetric identities for these polynomials using special p-adic integral techniques. Also, using series manipulation methods, we obtain an identity of symmetry for the two variable degenerate w-torsion central Fubini polynomials. Finally, we provide a representation of the degenerate differential operator on the two variable degenerate w-torsion central Fubini polynomials related to the degenerate central factorial polynomials of the second kind.

Residue sums of Dickson polynomials over finite fields

Given a polynomial with integral coefficients, one can inquire about the possible residues it can take in its image modulo a prime p. The sum over the distinct residues can sometimes be computed independent of the prime p; for example, Gauss showed that the sum over quadratic residues vanishes modulo a prime. In this paper we provide a closed form for the sum over distinct residues in the image of Dickson polynomials of arbitrary degree over finite fields of odd characteristic, and prove a complete characterization of the size of the value set. Our result provides the first non-trivial classification of such a sum for a family of polynomials of unbounded degree.

High-Performance Krawtchouk Polynomials of High Order Based on Multithreading

Orthogonal polynomials and their moments serve as pivotal elements across various fields. Discrete Krawtchouk polynomials (DKraPs) are considered a versatile family of orthogonal polynomials and are widely used in different fields such as probability theory, signal processing, digital communications, and image processing. Various recurrence algorithms have been proposed so far to address the challenge of numerical instability for large values of orders and signal sizes. The computation of DKraP coefficients was typically computed using sequential algorithms, which are computationally extensive for large order values and polynomial sizes. To this end, this paper introduces a computationally efficient solution that utilizes the parallel processing capabilities of modern central processing units (CPUs), namely the availability of multiple cores and multithreading. The proposed multi-threaded implementations for computing DKraP coefficients divide the computations into multiple independent tasks, which are executed concurrently by different threads distributed among the independent cores. This multi-threaded approach has been evaluated across a range of DKraP sizes and various values of polynomial parameters. The results show that the proposed method achieves a significant reduction in computation time. In addition, the proposed method has the added benefit of applying to larger polynomial sizes and a wider range of Krawtchouk polynomial parameters. Furthermore, an accurate and appropriate selection scheme of the recurrence algorithm is introduced. The proposed approach introduced in this paper makes the DKraP coefficient computation an attractive solution for a variety of applications.

Several Symmetric Identities of the Generalized Degenerate Fubini Polynomials by the Fermionic p-Adic Integral on Zp

After constructions of p-adic q-integrals, in recent years, these integrals with some of their special cases have not only been utilized as integral representations of many special numbers, polynomials, and functions but have also given the chance for deep analysis of many families of special polynomials and numbers, such as Bernoulli, Fubini, Bell, and Changhee polynomials and numbers. One of the main applications of these integrals is to obtain symmetric identities for the special polynomials. In this study, we focus on a novel extension of the degenerate Fubini polynomials and on obtaining some symmetric identities for them. First, we introduce the two-variable degenerate w-torsion Fubini polynomials by means of their exponential generating function. Then, we provide a fermionic p-adic integral representation of these polynomials. By this representation, we derive some new symmetric identities for these polynomials, using some special p-adic integral techniques. Lastly, by using some series manipulation techniques, we obtain more identities of symmetry for the two variable degenerate w-torsion Fubini polynomials.

Delay Painlevé-I equation, associated polynomials and Masur-Veech volumes

We study a delay-differential analogue of the first Painlevé equation obtained as a delay periodic reduction of Shabat's dressing chain. We construct formal entire solutions to this equation and introduce a new family of polynomials (called Bernoulli-Catalan polynomials), which are defined by a nonlinear recurrence of Catalan type, and which share properties with Bernoulli and Euler polynomials. We also discuss meromorphic solutions and describe the singularity structure of this delay Painlevé-I equation in terms of an affine Weyl group of type A1(1). As an application we demonstrate the link with the problem of calculation of the Masur-Veech volumes of the moduli spaces of meromorphic quadratic differentials by re-deriving some of the known formulas.

Applications of multiple orthogonal polynomials with hypergeometric moment generating functions

We investigate several families of multiple orthogonal polynomials associated with weights for which the moment generating functions are hypergeometric series with slightly varying parameters. The weights are supported on the unit interval, the positive real line, or the unit circle and the multiple orthogonal polynomials are generalizations of the Jacobi, Laguerre or Bessel orthogonal polynomials. We give explicit formulas for the type I and type II multiple orthogonal polynomials and study some of their properties. In particular, we describe the asymptotic distribution of the (scaled) zeros of the type II multiple orthogonal polynomials via the free convolution. Essential to our overall approach is the use of the Mellin transform. Finally, we discuss two applications. First, we show that the multiple orthogonal polynomials appear naturally in the study of the squared singular values of (mixed) products of truncated unitary random matrices and Ginibre matrices. Secondly, we use the multiple orthogonal polynomials to simultaneously approximate certain hypergeometric series and to provide an explicit proof of their Q-linear independence.

$SO(3)$ квазі-мономіальні сім'ї многочленів

Let $H$ be a subgroup of the affine space group ${\rm Aff} 3)$, considered with its natural action on the vector space of three-variable polynomials. The polynomial family $\{ B_{m,n,k}(x,y,z) \}$ is called quasi-monomial with respect to $H$ if the group operators in two different bases $\{ x^m y^n z^k \}$ and $\{ B_{m,n,k}(x,y,z) \}$ have identical atrices. We derive a criterion for quasi-monomiality when the group $H$ is the special orthogonal group $SO(3)$. This criterion is expressed through the exponential generating function of the polynomial family $\{B_{m,n,k}(x,y,z)\}$. It has been proven that Appel's biorthogonal polynomials are quasi-monomials with respect to $SO(3)$ and recurrence relations have been found for them.

Formulas for p-adic q-integrals including falling-rising factorials, combinatorial sums and special numbers

The main purpose of this paper is to provide a novel approach to deriving formulas for the p-adic q-Volkenborn integral including the Volkenborn integral and p-adic fermionic integral. By applying integral equations and these integral formulas to the falling factorials, the rising factorials and binomial coefficients, we derive some various identities, formulas and relations related to several combinatorial sums, well-known special numbers such as the Bernoulli and Euler numbers, the harmonic numbers, the Stirling numbers, the Lah numbers, the Harmonic numbers, the Fubini numbers, the Daehee numbers and the Changhee numbers. Applying these identities and formulas, we give some new combinatorial sums. Finally, by using integral equations, we derive generating functions for new families of special numbers and polynomials. By using generating functions, we give relations between the Lah numbers, the Bernoulli numbers, the Euler numbers and the Laguerre polynomials. We also give further comments and remarks on these functions, numbers and integral formulas related to q-type operators potentially used to solve problems in the areas such as physics, quantum mechanics, quantum systems and the others. In addition, we provide some tables containing some of the p-adic integral formulas obtained in this paper.