scholarly journals Electrostatic equilibria on the unit circle via Jacobi polynomials

2020 ◽  
Vol 61 (12) ◽  
pp. 122901
Author(s):  
K. Johnson ◽  
B. Simanek
2021 ◽  
Vol 9 ◽  
Author(s):  
Luc Vinet ◽  
Alexei Zhedanov

Abstract A joint algebraic interpretation of the biorthogonal Askey polynomials on the unit circle and of the orthogonal Jacobi polynomials is offered. It ties their bispectral properties to an algebra called the meta-Jacobi algebra $m\mathfrak {J}$ .


10.37236/1734 ◽  
2003 ◽  
Vol 10 (1) ◽  
Author(s):  
David Arthur

An arc-representation of a graph is a function mapping each vertex in the graph to an arc on the unit circle in such a way that adjacent vertices are mapped to intersecting arcs. The width of such a representation is the maximum number of arcs passing through a single point. The arc-width of a graph is defined to be the minimum width over all of its arc-representations. We extend the work of Barát and Hajnal on this subject and develop a generalization we call restricted arc-width. Our main results revolve around using this to bound arc-width from below and to examine the effect of several graph operations on arc-width. In particular, we completely describe the effect of disjoint unions and wedge sums while providing tight bounds on the effect of cones.


Mathematics ◽  
2020 ◽  
Vol 9 (1) ◽  
pp. 74
Author(s):  
Waleed Mohamed Abd-Elhameed ◽  
Afnan Ali

The main purpose of the current article is to develop new specific and general linearization formulas of some classes of Jacobi polynomials. The basic idea behind the derivation of these formulas is based on reducing the linearization coefficients which are represented in terms of the Kampé de Fériet function for some particular choices of the involved parameters. In some cases, the required reduction is performed with the aid of some standard reduction formulas for certain hypergeometric functions of unit argument, while, in other cases, the reduction cannot be done via standard formulas, so we resort to certain symbolic algebraic computation, and specifically the algorithms of Zeilberger, Petkovsek, and van Hoeij. Some new linearization formulas of ultraspherical polynomials and third-and fourth-kinds Chebyshev polynomials are established.


2021 ◽  
Vol 111 (2) ◽  
Author(s):  
Aleksey Kostenko

AbstractFor the discrete Laguerre operators we compute explicitly the corresponding heat kernels by expressing them with the help of Jacobi polynomials. This enables us to show that the heat semigroup is ultracontractive and to compute the corresponding norms. On the one hand, this helps us to answer basic questions (recurrence, stochastic completeness) regarding the associated Markovian semigroup. On the other hand, we prove the analogs of the Cwiekel–Lieb–Rosenblum and the Bargmann estimates for perturbations of the Laguerre operators, as well as the optimal Hardy inequality.


Symmetry ◽  
2021 ◽  
Vol 13 (7) ◽  
pp. 1134
Author(s):  
Kenta Higuchi ◽  
Takashi Komatsu ◽  
Norio Konno ◽  
Hisashi Morioka ◽  
Etsuo Segawa

We consider the discrete-time quantum walk whose local dynamics is denoted by a common unitary matrix C at the perturbed region {0,1,⋯,M−1} and free at the other positions. We obtain the stationary state with a bounded initial state. The initial state is set so that the perturbed region receives the inflow ωn at time n(|ω|=1). From this expression, we compute the scattering on the surface of −1 and M and also compute the quantity how quantum walker accumulates in the perturbed region; namely, the energy of the quantum walk, in the long time limit. The frequency of the initial state of the influence to the energy is symmetric on the unit circle in the complex plain. We find a discontinuity of the energy with respect to the frequency of the inflow.


Energies ◽  
2021 ◽  
Vol 14 (5) ◽  
pp. 1488
Author(s):  
Damian Trofimowicz ◽  
Tomasz P. Stefański

In this paper, novel methods for the evaluation of digital-filter stability are investigated. The methods are based on phase analysis of a complex function in the characteristic equation of a digital filter. It allows for evaluating stability when a characteristic equation is not based on a polynomial. The operation of these methods relies on sampling the unit circle on the complex plane and extracting the phase quadrant of a function value for each sample. By calculating function-phase quadrants, regions in the immediate vicinity of unstable roots (i.e., zeros), called candidate regions, are determined. In these regions, both real and imaginary parts of complex-function values change signs. Then, the candidate regions are explored. When the sizes of the candidate regions are reduced below an assumed accuracy, then filter instability is verified with the use of discrete Cauchy’s argument principle. Three different algorithms of the unit-circle sampling are benchmarked, i.e., global complex roots and poles finding (GRPF) algorithm, multimodal genetic algorithm with phase analysis (MGA-WPA), and multimodal particle swarm optimization with phase analysis (MPSO-WPA). The algorithms are compared in four benchmarks for integer- and fractional-order digital filters and systems. Each algorithm demonstrates slightly different properties. GRPF is very fast and efficient; however, it requires an initial number of nodes large enough to detect all the roots. MPSO-WPA prevents missing roots due to the usage of stochastic space exploration by subsequent swarms. MGA-WPA converges very effectively by generating a small number of individuals and by limiting the final population size. The conducted research leads to the conclusion that stochastic methods such as MGA-WPA and MPSO-WPA are more likely to detect system instability, especially when they are run multiple times. If the computing time is not vitally important for a user, MPSO-WPA is the right choice, because it significantly prevents missing roots.


Mathematics ◽  
2021 ◽  
Vol 9 (13) ◽  
pp. 1573
Author(s):  
Waleed Mohamed Abd-Elhameed ◽  
Badah Mohamed Badah

This article deals with the general linearization problem of Jacobi polynomials. We provide two approaches for finding closed analytical forms of the linearization coefficients of these polynomials. The first approach is built on establishing a new formula in which the moments of the shifted Jacobi polynomials are expressed in terms of other shifted Jacobi polynomials. The derived moments formula involves a hypergeometric function of the type 4F3(1), which cannot be summed in general, but for special choices of the involved parameters, it can be summed. The reduced moments formulas lead to establishing new linearization formulas of certain parameters of Jacobi polynomials. Another approach for obtaining other linearization formulas of some Jacobi polynomials depends on making use of the connection formulas between two different Jacobi polynomials. In the two suggested approaches, we utilize some standard reduction formulas for certain hypergeometric functions of the unit argument such as Watson’s and Chu-Vandermonde identities. Furthermore, some symbolic algebraic computations such as the algorithms of Zeilberger, Petkovsek and van Hoeij may be utilized for the same purpose. As an application of some of the derived linearization formulas, we propose a numerical algorithm to solve the non-linear Riccati differential equation based on the application of the spectral tau method.


Sign in / Sign up

Export Citation Format

Share Document