This paper mainly focuses on permutation polynomials over the residue class ring ZN , where N > 3 is composite. We have proved that for the polynomial f(x) = a1x 1 + · · · + akx with integral coefficients, f(x) mod N permutes ZN if and only if f(x) mod N permutes Sμ for all μ | N , where Sμ = {0 < t < N : gcd(N, t) = μ} and SN = S0 = {0}. Based on it, we give a lower bound of the differential u...

Abstract We study the distribution of roots a random p -adic polynomial in an algebraic closure ${\mathbb Q}_p$ . prove that mean number generating fixed finite extension K depends mostly on discriminant , containing fewer when it becomes more ramified. further for any positive integer r sufficiently large degree has about average extensions at most Beyond mean, we also higher moments and corre...

Cryptography is a collection of mathematical techniques used to secure the transmission and storage of information. A fundamental problem in cryptography is to evaluate the security of cryptosystems against the most powerful techniques. To this end, several general methods have been proposed: linear cryptanalysis, differential cryptanalysis, . . . Extensively used cryptographic standards – such...

The analysis of solutions to algebraic equations is further simplified. A couple of functions and their analytic continuation or root findings are required.

In this paper we obtain formulas for the left and right eigenvectors and minimal bases of some families of Fiedler-like linearizations of square matrix polynomials. In particular, for the families of Fiedler pencils, generalized Fiedler pencils, and Fiedler pencils with repetition. These formulas allow us to relate the eigenvectors and minimal bases of the linearizations with the ones of the po...

Abstract: This paper aims to present a polynomial approach to the steady-state optimal filtering for delayed systems. The design of the steady-state filter involves solving one polynomial equation and one spectral factorization. The key problem in this paper is the derivation of spectral factorization for systems with delayed measurement, which is more difficult than the standard systems withou...

What is algebraic geometry over algebraic systems? Many important relations between elements of a given algebraic system A can be expressed by systems of equations over A. The solution sets of such systems are called algebraic sets over A. Algebraic sets over A form a category, if we take for morphisms polynomial functions in the sense of Definition 6.1 below. As a discipline, algebraic geometr...

This paper deals with the index reduction problem for the class of quasi-regular DAE systems. It is shown that any of these systems can be transformed to a generically equivalent first order DAE system consisting of a single purely algebraic (polynomial) equation plus an under-determined ODE (that is, a semi-explicit DAE system of differentiation index 1) in as many variables as the order of th...

We propose an algorithm for automated recognition of computationally constructed curves and discuss several aspects of the recognition problem. Recognizing loci means determining a single implicit polynomial equation and geometric invariants, characterizing an algebraic curve which is given by a discrete set of sample points. Starting with these discrete samples arising from a geometric ruler a...

Including three aspects, problem solving, theorem proving and theorem discovering, automated deduction in real geometry essentially depends upon the semi-algebraic system solving. A “semi-algebraic system” is a system consisting of polynomial equations, polynomial inequations and polynomial inequalities, where all the polynomials are of integer coefficients. We give three practical algorithms f...