Related papers: Compositional inverses, complete mappings, orthogo…

Convex sets of completely positive maps and positive semidefinite kernels are considered in the most general context of modules over $C^*$-algebras and a complete charaterization of their extreme points is obtained. As a byproduct, we…

We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…

The concept of a fully interlacing matrix of formal power series with real coefficients is introduced. This concept extends and strengthens that of an interlacing sequence of real-rooted polynomials with nonnegative coefficients, in the…

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…

This paper defines a linear representation for nonlinear maps $F:\mathbb{F}^n\rightarrow\mathbb{F}^n$ where $\mathbb{F}$ is a finite field, in terms of matrices over $\mathbb{F}$. This linear representation of the map $F$ associates a…

We construct a new set of combinations from the mass matrices of the charged leptons and neutrinos that are invariant under basis transformation, hereafter {\it the} invariants. We use these invariants to study various symmetries and…

In this paper we continue to investigate a certain class of Hankel-like positive definite kernels using their associated orthogonal polynomials. The main result of this paper is about the structure of this kind of kernels.

Let $m, n$ be positive integers such that $m>1$ divides $n$. In this paper, we introduce a special class of piecewise-affine permutations of the finite set $[1, n]:=\{1, \ldots, n\}$ with the property that the reduction $\pmod m$ of $m$…

Let $\mathbb{F}_q$ denote the finite fields with $q$ elements. The permutation behavior of several classes of infinite families of permutation polynomials over finite fields have been studied in recent years. In this paper, we continue with…

Tensors are a fundamental data structure for many scientific contexts, such as time series analysis, materials science, and physics, among many others. Improving our ability to produce and handle tensors is essential to efficiently address…

The efficient inversion of matrix polynomials is a critical challenge in computational mathematics. We design a procedure to determine the inverse of matrices polynomial of multidimensional Laplace matrices. The method is based on…

We outline an algorithm for construction of functional bases of absolute invariants under the rotation group for sets of rank 2 tensors and vectors in the Euclidean space of arbitrary dimension. We will use our earlier results for symmetric…

We introduce a generalization of semistandard composition tableaux called permuted composition tableaux. These tableaux are intimately related to permuted basement semistandard augmented fillings studied by Haglund, Mason and Remmel. Our…

We study generalized sums of linear orders. These are binary operations that, given linear orders $A$ and $B$, return an order $A \oplus B$ that can be decomposed as an isomorphic copy of $A$ interleaved with a copy of $B$. We show that…

We construct infinite classes of almost bent and almost perfect nonlinear polynomials, which are affinely inequivalent to any sum of a power function and an affine function.

We consider the problem of learning a linear operator $\theta$ between two Hilbert spaces from empirical observations, which we interpret as least squares regression in infinite dimensions. We show that this goal can be reformulated as an…

We consider the approximation properties of finite element spaces on quadrilateral meshes. The finite element spaces are constructed starting with a given finite dimensional space of functions on a square reference element, which is then…

$ 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…

Recently subclasses of polynomial ensembles for additive and multiplicative matrix convolutions were identified which were called P\'olya ensembles (or polynomial ensembles of derivative type). Those ensembles are closed under the…

We give the explicit analytic development of Macdonald polynomials in terms of "modified complete" and elementary symmetric functions. These expansions are obtained by inverting the Pieri formula. Specialization yields similar developments…