Related papers: Jacobi polynomials, invariant rings, and generaliz…
In what follows, we pose two general conjectures about decompositions of homogeneous polynomials as sums of powers. The first one (suggested by G. Ottaviani) deals with the generic k-rank of complex-valued forms of any degree divisible by k…
In this paper, we give the Jacobi polynomials for first-order generalized Reed--Muller codes. We show as a corollary the nonexistence of combinatorial $3$-designs in these codes.
We discuss computing with hierarchies of families of (potentially weighted) semiclassical Jacobi polynomials which arise in the construction of multivariate orthogonal polynomials. In particular, we outline how to build connection and…
Recently, Mertens, Ono, and the third author studied mock modular analogues of Eisenstein series. Their coefficients are given by small divisor functions, and have shadows given by classical Shimura theta functions. Here, we construct a…
In this work, we define composite matrices which are derived from group rings. We extend the idea of G-codes to composite G-codes. We show that these codes are ideals in a group ring, where the ring is a finite commutative Frobenius ring…
We associate a Jacobi form over a rank s lattice to N=2, D=4 heterotic string compactifications which have s Wilson lines at a generic point in the vector multiplet moduli space. Jacobi forms of index m=1 and m=2 have appeared earlier in…
The aim of this paper is to study differential properties of orthogonal polynomials with respect to a discrete Jacobi-Sobolev bilinear form with mass point at $-1$ and/or $+1$. In particular, we construct the orthogonal polynomials using…
In the present paper, by extending some fractional calculus to the framework of Cliffors analysis, new classes of wavelet functions are presented. Firstly, some classes of monogenic polynomials are provided based on 2-parameters weight…
Let the Sobolev-type inner product <f,g> = \int fg d mu_0+ int f' g' d mu_1 with mu_0 = w + M delta_c, mu_1= N delta_c where w is the Jacobi weight, c is either 1 or -1 and M, N >= 0. We obtain estimates and asymptotic properties on [-1,1]…
We consider matrix orthogonal polynomials related to Jacobi type matrices of weights that can be defined in terms of a given matrix Pearson equation. Stating a Riemann-Hilbert problem we can derive first and second order differential…
Assume that $\{a_{n};\,n\geq0\}$ is a sequence of positive numbers and $\sum a_{n}^{\,-1}<\infty$. Let $\alpha_{n}=ka_{n}$, $\beta_{n}=a_{n}+k^{2}a_{n-1}$ where $k\in(0,1)$ is a parameter, and let $\{P_{n}(x)\}$ be an orthonormal polynomial…
For orthogonal polynomials defined by compact Jacobi matrix with exponential decay of the coefficients, precise properties of orthogonality measure is determined. This allows showing uniform boundedness of partial sums of orthogonal…
We review properties of q-orthogonal polynomials, related to their orthogonality, duality and connection with the theory of symmetric (self-adjoint) operators, represented by a Jacobi matrix. In particular, we show how one can naturally…
In this work we show how to get advantage from the Riemann--Hilbert analysis in order to obtain first and second order differential equations for the orthogonal polynomials and associated functions with a weight on the unit circle. We…
We consider positive Jacobi matrices $J$ with compact inverses and consequently with purely discrete spectra. A number of properties of the corresponding sequence of orthogonal polynomials is studied including the convergence of their…
In this paper, a link between $q$-difference equations, Jacobi operators and orthogonal polynomials is given. Replacing the variable $x$ by $ q^{-n}$ in a Sturm-Liouville $q$-difference equation we discovered the Jacobi operator. With…
Combinatorial designs are closely related to linear codes. In recent year, there are a lot of $t$-designs constructed from certain linear codes. In this paper, we aim to construct $2$-designs from binary three-weight codes. For any binary…
In this paper, we define dual codes over arbitrary finite rings with respect to arbitrary bilinear forms and provide a generalization of Hayden's theorem (Bridges, Hall, and Hayden, 1981). Building on this foundation, we introduce the…
Loop invariants are properties of a program loop that hold before and after each iteration of the loop. They are often employed to verify programs and ensure that algorithms consistently produce correct results during execution.…
Multivariate versions of classical orthogonal polynomials such as Jacobi, Hahn, Laguerre and Meixner are reviewed and their connection explored by adopting a probabilistic approach. Hahn and Meixner polynomials are interpreted as posterior…