相关论文: On Quadratic Inverses for Quadratic Permutation Po…

We show that every polynomial overring of the ring ${\rm Int}(\mathbb Z)$ of polynomials which are integer-valued over $\mathbb Z$ may be considered as the ring of polynomials which are integer-valued over some subset of $\hat{\mathbb{Z}}$,…

We parametrize quartic commutative algebras over any base ring or scheme (equivalently finite, flat degree four $S$-schemes), with their cubic resolvents, by pairs of ternary quadratic forms over the base. This generalizes Bhargava's…

Let $\mathfrak{p}$ be a monic irreducible polynomial in $A:=\mathbb{F}_q[\theta]$, the ring of polynomials in the indeterminate $\theta$ over the finite field $\mathbb{F}_q$, and let $\zeta$ be a root of $\mathfrak{p}$ in an algebraic…

A polynomial transformation of the real plane $\Bbb R^2$ is a mapping $\Bbb R^2\to\Bbb R^2$ given by two polynomials of two variables. Such a transformation is called quadratic if the degrees of its polynomials are not greater than two. In…

It is shown how to compute quotients efficiently in non-commutative univariate polynomial rings. This extends earlier work where efficient generic quotients were studied with a primary focus on commutative domains. Fast algorithms are given…

Tensor interpolation is an essential step for tensor data analysis in various fields of application and scientific disciplines. In the present work, novel interpolation schemes for general, i.e., symmetric or non-symmetric, invertible…

Given an integral domain $D$ with quotient field $K$, the ring of integer-valued polynomials on D is the subring $\{f (X) \in K[X]: f(D) \subset D\}$ of the polynomial ring $K[X]$. Using the related tools of $t$-closure and associated…

While preconditioning is a long-standing concept to accelerate iterative methods for linear systems, generalizations to matrix functions are still in their infancy. We go a further step in this direction, introducing polynomial…

Let $V$ be a valuation ring of a global field $K$. We show that for all positive integers $k$ and $1 < n_1 \leq \ldots \leq n_k$ there exists an integer-valued polynomial on $V$, that is, an element of $\text{Int}(V) = \{ f \in K[X] \mid…

In this paper convolutional codes with cyclic structure will be investigated. These codes can be understood as left principal ideals in a suitable skew-polynomial ring. It has been shown in [3] that only certain combinations of the…

We present an algorithm to construct quantum circuits for encoding and inverse encoding of quantum convolutional codes. We show that any quantum convolutional code contains a subcode of finite index which has a non-catastrophic encoding…

We establish an ideal-theoretic rigidity principle for quadratic distance images over integer residue rings. Specifically, we prove that near-extremal collapse of the distance set in $\mathbb{Z}_n^d$ forces strong algebraic structure…

We study kernel quadrature rules with convex weights. Our approach combines the spectral properties of the kernel with recombination results about point measures. This results in effective algorithms that construct convex quadrature rules…

Commutative analogues of Clifford algebras are algebras defined in the same way as Clifford algebras except that their generators commute with each other, in contrast to Clifford algebras in which the generators anticommute. In this paper,…

Let $R$ be a unital ring with involution.In this paper, several new necessary and sufficient conditions for the existence of the Moore-Penrose inverse of an element in a ring $R$ are given.In addition, the formulae of the Moore-Penrose…

By using the three-term recurrence equation satisfied by a family of orthogonal polynomials, the Christoffel-Darboux-type bilinear generating function and their asymptotic expressions, we obtain quadrature formulas for integral transforms…

In this paper, a transform approach is used for polycyclic and serial codes over finite local rings in the case that the defining polynomials have no multiple roots. This allows us to study them in terms of linear algebra and invariant…

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…

It is well known that the ring of polynomial invariants of a reductive group is finitely generated. However, it is difficult to give strong upper bounds on the degrees of the generators, especially over fields of positive characteristic. In…

We study connections between self-inversive and self-reciprocal polynomials, reduction theory of binary forms, minimal models of curves, and formally self-dual codes. We prove that if $\mathcal X$ is a superelliptic curve defined over…