Related papers: Higher and extended Jacobi polynomials for codes
We derive new matrix representation for higher-order changhee numbers and polynomials. This helps us to obtain simple and short proofs of many previous results on higher-order changhee numbers and polynomials. Moreover, we obtain recurrence…
In this paper, we study umbral calculus to have alternative ways of obtaining our results. That is, we derive some interesting identities of the higher-order Bernoulli, Euler and Hermite polynomials arising from umbral calculus to have…
The Jacobi identity is one of the properties that are used to define the concept of Lie algebra and in this context is closely related to associativity. In this paper we provide a complete description of all bivariate polynomials that…
We develop a method to construct algebraic invariants for hypermatrices. We then construct hyperdeterminants and exhibit a generalization of the Cayley-Hamilton theorem for hypermatrices.
In this paper, for an odd prime $p$, by extending Li et al.'s construction \cite{CL2016}, several classes of two-weight and three-weight linear codes over the finite field $\mathbb{F}_p$ are constructed from a defining set, and then their…
We study a new family of "classical" orthogonal polynomials, here called big -1 Jacobi polynomials, which satisfy (apart from a 3-term recurrence relation) an eigenvalue problem with differential operators of Dunkl-type. These polynomials…
In this paper, we give a representation of the average of complete joint weight enumerators of two linear codes of length $n$ over $\mathbb{F}_{q}$ and $\mathbb{Z}_{k}$ in terms of the compositions of $n$ and their distributions in the…
Linear codes can be employed to construct authentication codes, which is an interesting area of cryptography. The parameters of the authentication codes depend on the complete weight enumerator of the underlying linear codes. In order to…
We study highest weight vectors for symmetric and alternating spaces of tensors, whose dimensions are given by generalized Kronecker coefficients. We describe the algebraic relations for classical constructions of corresponding spanning…
We investigate Chebyshev polynomials corresponding to Jacobi weights and determine monotonicity properties of their related Widom factors. This complements work by Bernstein from 1930-31 where the asymptotical behavior of the related…
The generalized Hamming weights (GHWs) are fundamental parameters of linear codes. In this paper, we investigate the generalized Hamming weights of two classes of linear codes constructed from defining sets and determine them completely…
We construct a rational extension of a recently studied nonlinear quantum oscillator model. Our extended model is shown to retain exact solvability, admitting a discrete spectrum and corresponding closed-form solutions that are expressed…
We identify the Atkin polynomials in terms of associated Jacobi polynomials. Our identificationthen takes advantage of the theory of orthogonal polynomials and their asymptotics to establish many new properties of the Atkin polynomials.…
In this paper a recursive algorithm is presented for evaluating multivariate Pad\'e approximants (of the rectangular type described in the work of Lutterodt) which is analogous to the Jacobi formula for univariate Pad\'e approximants. This…
We propose a gradient-based Jacobi algorithm for a class of maximization problems on the unitary group, with a focus on approximate diagonalization of complex matrices and tensors by unitary transformations. We provide weak convergence…
There is a commutative algebra of differential-difference operators, with two parameters, associated to any dihedral group with an even number of reflections. The intertwining operator relates this algebra to the algebra of partial…
We establish an integral representations of a right inverses of the Askey-Wilson finite difference operator in an $L^2$ space weighted by the weight function of the continuous $q$-Jacobi polynomials. We characterize the eigenvalues of this…
In the paper, we first classify all polynomial maps $H$ of the following form: $H=\big(H_1(x_1,x_2,\ldots,x_n),H_2(x_1,x_2),H_3(x_1,x_2),\ldots,H_n(x_1,x_2)\big)$ with $JH$ nilpotent. After that, we generalize the structure of $H$ to…
In this paper, we establish the matroid structures corresponding to data-local and local maximally recoverable codes (MRC). The matroid structures of these codes can be used to determine the associated Tutte polynomial. Greene proved that…
The present paper deals with multiplication formulas for the Apostol-Genocchi polynomials of higher order and deduces some explicit recursive formulas. Some earlier results of Carlitz and Howard in terms of Genocchi numbers can be deduced.…