Polynomial Representation Research Articles

Positive Polynomials and Boundary Interpolation with Finite Blaschke Products

The famous Jones–Ruscheweyh theorem states that n distinct points on the unit circle can be mapped to n arbitrary points on the unit circle by a Blaschke product of degree at most n-1. In this paper, we provide a new proof using real algebraic techniques. First, the interpolation conditions are rewritten into complex equations. These complex equations are transformed into a system of polynomial equations with real coefficients. This step leads to a “geometric representation” of Blaschke products. Then another set of transformations is applied to reveal some structure of the equations. Finally, the following two fundamental tools are used: a Positivstellensatz by Prestel and Delzell describing positive polynomials on compact semialgebraic sets using Archimedean module of length N. The other tool is a representation of positive polynomials in a specific form due to Berr and Wörmann. This, combined with a careful calculation of leading terms of occurring polynomials finishes the proof.

A new approach to deal with [formula omitted] cubic splines and its application to super-convergent quasi-interpolation

In this paper, we construct a novel normalized B-spline-like representation for C2-continuous cubic spline space defined on an initial partition refined by inserting two new points inside each sub-interval. The basis functions are compactly supported non-negative functions that are geometrically constructed and form a convex partition of unity. With the help of the control polynomial theory introduced herein, a Marsden identity is derived, from which several families of super-convergent quasi-interpolation operators are defined.

Portfolio Management of Copula-Dependent Assets Based on P(Y < X) Reliability Models: Revisiting Frank Copula and Dagum Distributions

Modern portfolio theory indicates that portfolio optimization can be carried out based on the mean-variance model, where returns and risk are represented as the average and variance of the historical data of the stock’s returns, respectively. Several studies have been carried out to find better risk proxies, as variance was not that accurate. On the other hand, fewer papers are devoted to better model/characterize returns. In the present paper, we explore the use of the reliability measure P(Y<X) to choose between portfolios with returns given by the distributions X and Y. Thus, instead of comparing the expected values of X and Y, we will explore the metric P(Y<X) as a proxy parameter for return. The dependence between such distributions shall be modelled by copulas. At first, we derive some general results which allows us to split the value of P(Y<X) as the sum of independent and dependent parts, in general, for copula-dependent assets. Then, to further develop our mathematical framework, we chose Frank copula to model the dependency between assets. In the process, we derive a new polynomial representation for Frank copulas. To perform a study case, we considered assets whose returns’ distributions follow Dagum distributions or their transformations. We carried out a parametric analysis, indicating the relative effect of the dependency of return distributions over the reliability index P(Y<X). Finally, we illustrate our methodology by performing a comparison between stock returns, which could be used to build portfolios based on the value of the the reliability index P(Y<X).

Restoration of images with a spatially varying PSF of the T80-S telescope optical model using neural networks

ABSTRACTMost image restoration methods in astronomy rely upon probabilistic tools that infer the best solution for a deconvolution problem. They achieve good performances when the point spread function (PSF) is spatially invariant in the image plane. However, this condition is not always satisfied in real optical systems. We propose a new method for the restoration of images affected by static and anisotropic aberrations using Deep Neural Networks that can be directly applied to sky images. The network is trained using simulated sky images corresponding to the T80-S Telescope optical model, a 80-cm survey imager at Cerro Tololo (Chile), which are synthesized using a Zernike polynomial representation of the optical system. Once trained, the network can be used directly on sky images, outputting a corrected version of the image that has a constant and known PSF across its field of view. The method is to be tested on the T80-S Telescope. We present the method and results on synthetic data.

Solutions of a singular integro-differential equation related to the adhesive contact problems of elasticity theory

Abstract Exact and approximate solutions of a some type singular integro-differential equation related to problems of adhesive interaction between elastic thin half-infinite or finite homogeneous patch and elastic plate are investigated. For the patch loaded with vertical forces, there holds a standard model in which vertical elastic displacements are assumed to be constant. Using the theory of analytic functions, integral transforms and orthogonal polynomials, the singular integro-differential equation is reduced to a different boundary value problem of the theory of analytic functions or to an infinite system of linear algebraic equations. Exact or approximate solutions of such problems and asymptotic estimates of normal contact stresses are obtained.

On Lommel Matrix Polynomials

The main aim of this paper is to introduce a new class of Lommel matrix polynomials with the help of hypergeometric matrix function within complex analysis. We derive several properties such as an entire function, order, type, matrix recurrence relations, differential equation and integral representations for Lommel matrix polynomials and discuss its various special cases. Finally, we establish an entire function, order, type, explicit representation and several properties of modified Lommel matrix polynomials. There are also several unique examples of our comprehensive results constructed.

Hankel determinants of linear combinations of moments of orthogonal polynomials, II

We present a formula that expresses the Hankel determinants of a linear combination of length d+1 of moments of orthogonal polynomials in terms of a dtimes d determinant of the orthogonal polynomials. This formula exists somehow hidden in the folklore of the theory of orthogonal polynomials but deserves to be better known, and be presented correctly and with full proof. We present four fundamentally different proofs, one that uses classical formulae from the theory of orthogonal polynomials, one that uses a vanishing argument and is due to Elouafi (J Math Anal Appl 431:1253–1274, 2015) (but given in an incomplete form there), one that is inspired by random matrix theory and is due to Brézin and Hikami (Commun Math Phys 214:111–135, 2000), and one that uses (Dodgson) condensation. We give two applications of the formula. In the first application, we explain how to compute such Hankel determinants in a singular case. The second application concerns the linear recurrence of such Hankel determinants for a certain class of moments that covers numerous classical combinatorial sequences, including Catalan numbers, Motzkin numbers, central binomial coefficients, central trinomial coefficients, central Delannoy numbers, Schröder numbers, Riordan numbers, and Fine numbers.

Random polynomials: Central limit theorems for the real roots

The number of real roots has been a central subject in the theory of random polynomials and random functions since the fundamental papers of Littlewood, Offord, and Kac in the 1940s. The main task here is to determine the limiting distribution of this random variable. In 1974, Maslova famously proved a central limit theorem (CLT) for the number of real roots of Kac polynomials. It has remained the only limiting theorem available for the number of real roots for more than four decades. In this paper, using a new approach, we derive a general CLT for the number of real roots of a large class of random polynomials with coefficients growing polynomially. Our result both generalizes and strengthens Maslova’s theorem.

Constacyclic Codes over Finite Chain Rings of Characteristic p

Let R be a finite commutative chain ring of characteristic p with invariants p,r, and k. In this paper, we study λ-constacyclic codes of an arbitrary length N over R, where λ is a unit of R. We first reduce this to investigate constacyclic codes of length ps (N=n1ps,p∤n1) over a certain finite chain ring CR(uk,rb) of characteristic p, which is an extension of R. Then we use discrete Fourier transform (DFT) to construct an isomorphism γ between R[x]/<xN−λ> and a direct sum ⊕b∈IS(rb) of certain local rings, where I is the complete set of representatives of p-cyclotomic cosets modulo n1. By this isomorphism, all codes over R and their dual codes are obtained from the ideals of S(rb). In addition, we determine explicitly the inverse of γ so that the unique polynomial representations of λ-constacyclic codes may be calculated. Finally, for k=2 the exact number of such codes is provided.

Real Eigenvalues of Elliptic Random Matrices

Abstract We consider the real eigenvalues of an $(N \times N)$ real elliptic Ginibre matrix whose entries are correlated through a non-Hermiticity parameter $\tau _N\in [0,1]$. In the almost-Hermitian regime where $1-\tau _N=\Theta (N^{-1})$, we obtain the large-$N$ expansion of the mean and the variance of the number of the real eigenvalues. Furthermore, we derive the limiting densities of the real eigenvalues, which interpolate the Wigner semicircle law and the uniform distribution, the restriction of the elliptic law on the real axis. Our proofs are based on the skew-orthogonal polynomial representation of the correlation kernel due to Forrester and Nagao.

Multiloop Multirate Continuous-Discrete Drone Stabilization System: An Equivalent Single-Rate Model

The article discusses the UAV lateral motion stabilization system, as a MIMO multiloop multirate continuous-discrete system, specified in the form of an input–output model in the domain of discrete Laplace transform or in the form of a structural diagram. Approaches to the construction of equivalent T and NT single-rate models for MIMO multiloop multirate continuous-discrete systems are considered. Here, T is the largest common divisor of the sampling periods of the system, N is a natural number that is the smallest common multiple of the numbers characterizing the sampling periods of the system. The resulting impulse representations of the outputs of equivalent models are in the form of rational functions. The basis for the construction of these models is a matrix of sampling densities—a structural invariant of sampling chains. An example of the construction of the indicated matrix and an equivalent single-rate model are given. Obtaining equivalent single-rate models for MIMO multiloop multirate systems allows us to extend the methods of research and synthesis of MIMO continuous and continuous-discrete systems to a common theoretical base—the theory of polynomials and rational functions, which are typical elements of the description of these classes of systems.

ℤ₂ℤ₄-Additive Quasi-Cyclic Codes

We study the codes of the title by the CRT method, that decomposes such codes into constituent codes, which are shorter codes over larger alphabets. Criteria on these constituent codes for self-duality and linear complementary duality of the decomposed codes are derived. The special class of the one-generator codes is given a polynomial representation and exactly enumerated. In particular, we present some illustrative examples of binary optimal linear codes with respect to the Griesmer bound derived from the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\mathbb {Z}_{2} \mathbb {Z}_{4}$ </tex-math></inline-formula> -additive quasi-cyclic codes.

Differential operators and Higher Specht polynomials

In this note, we study the action of the rational quantum Calogero-Moser system on polynomials rings. This a continuation of our paper [Ibrahim Nonkan 2021 J. Phys.: Conf. Ser. 1730 012129] in which we deal with the polynomial representation of the ring of invariant differential operators. Using the higher Specht polynomials we give a detailed description of the actions of the Weyl algebra associated with the ring of the symmetric polynomial C[x 1,..., xn]Sn on the polynomial ring C[x 1,..., xn ]. In fact, we show that its irreducible submodules over the ring of differential operators invariant under the symmetric group are its submodules generated by higher Specht polynomials over the ring of the symmetric polynomials. We end up studying the polynomial representation of the ring of differential operators invariant under the actions of products of symmetric groups by giving the generators of its simple components, thus we give a differential structure to the higher Specht polynomials.

Differential operators and reection group of type Dn

In this note, we study the actions of rational quantum Olshanetsky-Perelomov systems for finite reflections groups of type D n . we endowed the polynomial ring C[x 1,..., xn ] with a differential structure by using directly the action of the Weyl algebra associated with the ring C[x 1,..., xn ] W of invariant polynomials under the reflections groups W after a localization. Then we study the polynomials representation of the ring of invariant differential operators under the reflections groups. We use the higher Specht polynomials associated with the representation of the reflections group W to exhibit the generators of its simple components.

Differential operators and reection group of type Bn

In this note, we study the polynomial representation of the quantum Olshanetsky-Perelomov system for a finite reflection group W of type Bn. We endowed the polynomial ring C[x 1,..., xn ] with a structure of module over the Weyl algebra associated with the ring C[x 1,..., xn]W of invariant polynomials under a reflections group W of type Bn . Then we study the polynomials representation of the ring of invariant differential operators under the reflections group W. We make use of the theory of representation of groups namely the higher Specht polynomials associated with the reflection group W to yield a decomposition of that structure by providing explicitly the generators of its simple components.

Double centralisers and annihilator ideals of Young permutation modules

We study the double centraliser algebras and annihilator ideals of certain permutation modules for symmetric groups and their quantum analogues. Of particular interest is the behaviour of these algebras and ideals under base change. By exploiting connections with polynomial representation theory over a field we establish the double centraliser property and dimension invariance of annihilator ideals over fields. By elementary localisation techniques we obtain the corresponding results over arbitrary rings. The modules considered include the permutation modules relevant to partition algebras, as studied in the recent paper by Bowman, Doty and Martin, [3], and we obtain in particular their main results on the double centraliser property in this context. Much of our development is equally valid for the corresponding modules over Hecke algebras of type A and, for the most part, we give it at this level of generality.

Nonautonomous discrete elementary Toda orbits and their ultradiscretization

We derive a nonautonomous discrete analogue of the elementary Toda orbits via a spectral transformation of certain biorthogonal Laurent polynomials. We obtain particular solutions of the system by using the theory of biorthogonal polynomials. The obtained system can be written in subtraction-free form and thus can be ultradiscretized. We introduce a new family of cellular automata generalizing Takahashi and Satsuma’s box-ball system with a carrier capacity.

Gradient-free aerodynamic shape optimization using Large Eddy Simulation

In this paper we demonstrate the ability to perform gradient-free aerodynamic shape optimization using Large Eddy Simulation (LES) with the Mesh Adaptive Direct Search (MADS) optimization algorithm. We first outline the challenges associated with performing gradient-based optimization using LES, specifically chaotic divergence of the adjoint. We then introduce a Dynamic Polynomial Approximation (DPA) procedure, which allows the high-order solution polynomial representation used by the flow solver to be increased, or decreased, depending on the poll size being used by MADS. This allows rapid convergence towards the optimal design space using lower-fidelity simulations, followed by automatic transition to higher-fidelity simulations when close to the optimal design point. We demonstrate the utility of MADS for optimization of simple chaotic problems, specifically the Lorenz system. We then demonstrate the utility of DPA for aerodynamic optimization of a low Reynolds SD7003 airfoil, highlighting the benefits of the binary DPA approach. Finally, we perform aerodynamic optimization of a turbulent SD7003 airfoil with a final design that increases the mean lift to drag ratio by 32% relative to experimental data, demonstrating that shape optimization using LES and MADS is feasible for aerodynamic design.

The 4 × 4 Orthostochastic Variety

ABSTRACT Orthostochastic matrices are the entrywise squares of orthogonal matrices, and naturally arise in various contexts, including notably definite symmetric determinantal representations of real polynomials. However, defining equations for the real variety were previously known only for 3 × 3 matrices. We study the real variety of 4 × 4 orthostochastic matrices, and find a minimal defining set of equations consisting of 6 quintics and 3 octics. The techniques used here involve a wide range of both symbolic and computational methods, in computer algebra and numerical algebraic geometry.

On a class ofq-orthogonal polynomials and theq-Riemann–Hilbert problem

We give an explicit solution of aq-Riemann–Hilbert problem that arises in the theory of orthogonal polynomials, prove that it is unique and deduce several properties. In particular, we describe the asymptotic behaviour of zeros in the limit as the degree of the polynomial approaches infinity.