Related papers: A note on cyclotomic polynomials and Linear Feedba…
Given a numerical semigroup $S$, we let $\mathrm P_S(x)=(1-x)\sum_{s\in S}x^s$ be its semigroup polynomial. We study cyclotomic numerical semigroups; these are numerical semigroups $S$ such that $\mathrm P_S(x)$ has all its roots in the…
Linear layered probabilistic shaping (LLPS) is proposed, an architecture for linear codes to efficiently encode to shaped code words. In the previously proposed probabilistic amplitude shaping (PAS) architecture, a distribution matcher (DM)…
This paper presents subspace of information forgetting recursive least squares (SIFt-RLS), a directional forgetting algorithm which, at each step, forgets only in row space of the regressor matrix, or the \textit{information subspace}. As a…
A compressive sensing (CS) reconstruction method for polynomial phase signals is proposed in this paper. It relies on the Polynomial Fourier transform, which is used to establish a relationship between the observation and sparsity domain.…
For an algebraically closed field $K$ of characteristic zero and a non-singular matrix $A\in \mbox{GL}_n(K)$, a semi-invariant polynomial of $A$ is defined to be a polynomial $p(x)=p(x_1,\dots,x_n)$ with coefficients in $K$ such that…
The main objective of this paper is to give a wide study on the conformable fractional Legendre polynomials (CFLPs). This study is assumed to be a generalization and refinement, in an easy way, of the scalar case into the context of the…
We propose a variation of Construction A of lattices from linear codes defined using the quotient $\Lambda/\mathfrak p\Lambda$ of some order $\Lambda$ inside a cyclic division $F$-algebra, for $\mathfrak p$ a prime ideal of a number field…
For odd square-free n > 1 the n-th cyclotomic polynomial satisfies an identity of Gauss. There are similar identity of Aurifeuille, Le Lasseur and Lucas. These identities all involve certain polynomials with integer coefficients. We show…
Multiphase ranking functions ($\mathit{M{\Phi}RFs}$) were proposed as a means to prove the termination of a loop in which the computation progresses through a number of "phases", and the progress of each phase is described by a different…
Clifford-Legendre and Clifford-Gegenbauer polynomials are eigenfunctions of certain differential operators acting on functions defined on $m$-dimensional euclidean space ${\mathbb R}^m$ and taking values in the associated Clifford algebra…
Linearized polynomials appear in many different contexts, such as rank metric codes, cryptography and linear sets, and the main issue regards the characterization of the number of roots from their coefficients. Results of this type have…
Reduced rank regression (RRR) is a widely employed model for investigating the linear association between multiple response variables and a set of predictors. While RRR has been extensively explored in various works, the focus has…
Recently, several algorithms for symbolic regression (SR) emerged which employ a form of multiple linear regression (LR) to produce generalized linear models. The use of LR allows the algorithms to create models with relatively small error…
In this paper, we propose linear maps over the space of all polynomials $f(x)$ in $\mathbb{F}_q[x]$ that map $0$ to itself, through their evaluation map. Properties of these linear maps throw up interesting connections with permutation…
In this paper, a link between polymatroid theory and locally repairable codes (LRCs) is established. The codes considered here are completely general in that they are subsets of $A^n$, where $A$ is an arbitrary finite set. Three classes of…
We consider "odd symplectic Lie algebras" defined in terms of maximal rank skew-symmetric forms. We provide FFLV polytopes for these algebras and prove their standard properties. In particular, we obtain a new graded character formula and…
Long Reed-Solomon (RS) codes are desirable for digital communication and storage systems due to their improved error performance, but the high computational complexity of their decoders is a key obstacle to their adoption in practice. As…
Source wavelet estimation is the key in seismic signal processing for resolving subsurface structural properties. Homomorphic deconvolution using cepstrum analysis has been an effective method for wavelet estimation for decades. In general,…
If $R$ is the ring of integers of a number field, then there exists a polynomial parametrization of the set $\text{SL}_2(R)$, i.e., an element $A \in \text{SL}_2(\mathbb{Z}[x_1,\ldots,x_n])$ such that every element of $\text{SL}_2(R)$ is…
A partition polynomial is a refinement of the partition number p(n) whose coefficients count some special partition statistic. Just as partition numbers have useful asymptotics so do partition polynomials. In fact, their asymptotics…