Related papers: On Inverses for Quadratic Permutation Polynomials …
We investigate invertible matrices over finite additively idempotent semirings. The main result provides a criterion for the invertibility of such matrices. We also give a construction of the inverse matrix and a formula for the number of…
This paper proves a reciprocity formula for modular inverses for non-zero integers and demonstrates some applications of the reciprocity formula in calculating or verifying some modular inverses of specific forms, including the modular…
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…
We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed. For the optimization of an…
In the recent p-adic q-integral on the p-adic integers' rings was constructed >. The purpose of this paper is to give several interesting integral equation for the p-adic q-integerals on the rings of p-adic integers. As an integral…
We previously showed that the inverse limit of standard-graded polynomial rings with perfect coefficient field is a polynomial ring, in an uncountable number of variables. In this paper, we show that the same result holds with arbitrary…
We introduce a class of permutation polynomial over $\mathbb F_{q^n}$ that can be written in the form $\frac{L(x)}{x^{q+1}}$ or $\frac{L(x^{q+1})}x$ for some $q$-linear polynomial $L$ over $\mathbb F_{q^n}$. Specifically, we present those…
In this article we give various formulates for compute the number of all coninvolutions over the group of upper triangular matrix with entries into the ring of Gaussian integers module $p$ and the ring of Quaternions integers module $p$,…
This paper considers the extension of classical Lagrange interpolation in one real or complex variable to "polynomials of one quaternionic variable". To do this we develop some aspects of the theory of such polynomials. We then give a…
In this paper, we study properties of polynomials over division rings. Moreover, we present formulas for finding roots of some polynomials
The paper presents a survey over frame multipliers and related concepts. In particular, it includes a short motivation of why multipliers are of interest to consider, a review as well as extension of recent results, devoted to the…
In this paper we study two operations, Pasting and Reversing, defined from a natural way to be applied over some rings such as the ring of polynomials and the ring of linear differential operators, which is a differential ring. We obtain…
Let p and r be two primes and n, m be two distinct divisors of pr. Consider the n-th and m-th cyclotomic polynomials. In this paper, we present lower and upper bounds for the coefficients of the inverse of one of them modulo the other one.…
Quadratically optimized polynomials are described which are useful in multi-bosonic algorithms for Monte Carlo simulations of quantum field theories with fermions. Algorithms for the computation of the coefficients and roots of these…
The pseudoinverse of a matrix, a generalized notion of the inverse, is of fundamental importance in linear algebra and, thereby, in many different fields. Despite its proven existence, an algorithmic approach is typically necessary to…
Using the theory of representations of the symmetric group, we propose an algorithm to compute the invariant ring of a permutation group. Our approach have the goal to reduce the amount of linear algebra computations and exploit a thinner…
The double-direction orthogonalization algorithm is applied to construct sequences of polynomials, which are orthogonal over the interval [0,1]with the weighting function 1. Functional and recurrent relations are derived for the sequences…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…
This brief note concerns the invertibility of certain alternant matrices. In particular those that consisting of polynomials and products of polynomials and logarithms are shown to be invertible under appropriate conditions on the degrees…
Recently, P. Yuan presented a local method to find permutation polynomials and their compositional inverses over finite fields. The work of P. Yuan inspires us to compute the compositional inverses of three classes of the permutation…