Related papers: A note on cyclotomic polynomials and Linear Feedba…

We consider a construction of the fundamental spin representations of the simple Lie algebras $\mathfrak{so}(n)$ in terms of binary arithmetic of fixed width integers. This gives the spin matrices as a Lie subalgebra of a…

$ n-$cycle permutation polynomials with small n have the advantage that their compositional inverses are efficient in terms of implementation. These permutation polynomials have significant applications in cryptography and coding theory. In…

Despite the promise of RLHF in aligning LLMs with human preferences, it often leads to superficial alignment, prioritizing stylistic changes over improving downstream performance of LLMs. Underspecified preferences could obscure directions…

In this article, a new approach based on linear algebra is adopted to study a hybrid Sheffer polynomial sequences. The recurrence relations and differential equation for these polynomials are derived by using the properties and…

We study non-parametric regression estimates for random fields. The data satisfies certain strong mixing conditions and is defined on the regular $N$-dimensional lattice structure. We show consistency and obtain rates of convergence. The…

Consider a polynomial $F$ in $m$ variables and a finite point ensemble $S=S_1 \times ... \times S_m$. When given the leading monomial of $F$ with respect to a lexicographic ordering we derive improved information on the possible number of…

We characterize the graphs with loops whose degree sequences have no repeated values and find their adjacency spectrum. In the case of simple graphs, such graphs are called anti-regular graphs and are examples of threshold graphs. The…

Protecting the intellectual property of open-source Large Language Models (LLMs) is very important, because training LLMs costs extensive computational resources and data. Therefore, model owners and third parties need to identify whether a…

We show some properties on a special case of level 1 cyclotomic KLR algebras of type $A_{n}^{(1)}$; the number of primitive idempotents, systematic change of structures, the dimension.

Invariants of generalized tensor fields on a line are classified using special polynomials P_mk^(-1/lambda) introduced here for this purpose. For the case of positive characteristic, a new invariant of formal power series, a width, is…

We use cyclotomy to design new classes of permutation polynomials over finite fields. This allows us to generate many classes of permutation polynomials in an algorithmic way. Many of them are permutation polynomials of large indices.

Fine-tuning has become a popular approach to adapting large foundational models to specific tasks. As the size of models and datasets grows, parameter-efficient fine-tuning techniques are increasingly important. One of the most widely used…

A Littlewood polynomial is a single-variable polynomial all of whose coefficients lie in $\{ \pm 1\}$. We establish the leading term asymptotics of the number of reciprocal or skew-reciprocal Littlewood polynomials with square discriminant.…

We study the problems of testing isomorphism of polynomials, algebras, and multilinear forms. Our first main results are average-case algorithms for these problems. For example, we develop an algorithm that takes two cubic forms $f, g\in…

In this paper we propose a new approach to study the properties of the Partial Least Squares (PLS) estimator. This approach relies on the link between PLS and discrete orthogonal polynomials. Indeed many important PLS objects can be…

One of basic difficulties of machine learning is handling unknown rotations of objects, for example in image recognition. A related problem is evaluation of similarity of shapes, for example of two chemical molecules, for which direct…

We show how to solve a generalised version of the Multi-sequence Linear Feedback Shift-Register (MLFSR) problem using minimisation of free modules over $\mathbb F[x]$. We show how two existing algorithms for minimising such modules run…

We give a Clifford correspondence for an algebra A over an algebraically closed field, that is an algorithm for constructing some finite-dimensional simple A-modules from simple modules for a subalgebra and endomorphism algebras. This…

Formulas to calculate multivector exponentials in a base-free representation and in a orthonormal basis are presented for an arbitrary Clifford geometric algebra Cl(p,q). The formulas are based on the analysis of roots of characteristic…

Nonparametric estimators of a regression function with circular response and Rd-valued predictor are considered in this work. Local polynomial type estimators are proposed and studied. Expressions for their asymptotic biases and variances…