Related papers: On two-to-one mappings over finite fields
It is well-known that a polynomial f(z)=a_d z^d(1+o(1)) can be conjugated by a holomorphic map phi to w \mapsto w^d in a neighbourhood of infinity. This map phi is called a B\"ottcher coordinate for f near infinity. In this paper we…
We develop a generalized framework for invariant-based cryptography by extending the use of structural identities as core cryptographic mechanisms. Starting from a previously introduced scheme where a secret is encoded via a four-point…
In this paper we prove existence of matings between a large class of renormalizable cubic polynomials with one fixed critical point and another cubic polynomial having two fixed critical points. The resulting mating is a Newton map. Our…
For all finite fields of $q$ elements where $q\equiv1\pmod4$ we have constructed permutation polynomials which have order 2 as permutations, and have 3 terms, or 4 terms as polynomials. Explicit formulas for their coefficients are given in…
Permutation polynomials of finite fields have many applications in Coding Theory, Cryptography and Combinatorics. In the first part of this paper we present a new family of local permutation polynomials based on a class of symmetric…
An automorphism group of an incidence structure I induces a tactical decomposition on I. It is well known that tactical decompositions of t-designs satisfy certain necessary conditions which can be expressed as equations in terms of the…
This paper considers permutation polynomials over the finite field $F_{q^2}$ in even characteristic by utilizing low-degree permutation rational functions over $F_q$. As a result, we obtain two classes of permutation binomials and six…
A Morse 2-function is a generic smooth map from a manifold M of arbitrary finite dimension to a surface B. Its critical set maps to an immersed collection of cusped arcs in B. The aim of this paper is to explain exactly when it is possible…
The "2-variable general-$\lambda$-matrix polynomials (2VG$\lambda$MP)" is a new family of matrix polynomials, introduced and studied in this article. These matrix polynomials are constructed using umbral and symbolic methods. We delve into…
By studying $\mathbb{A}^1$-curves on varieties, we propose a geometric approach to strong approximation problem over function fields of complex curves. We prove that strong approximation holds for smooth, low degree affine complete…
We describe a web of well-known dualities connecting quantum field theories in $d=1+1$ dimensions. The web is constructed by gauging ${\bf Z}_2$ global symmetries and includes a number of perennial favourites such as the Jordan-Wigner…
Let $p$ be a prime number. Irreducible cyclic codes of length $p^2-1$ and dimension $2$ over the integers modulo $p^h$ are shown to have exactly two nonzero Hamming weights. The construction uses the Galois ring of characteristic $p^h$ and…
The polynomial $x^n+1$ over finite fields has been of interest due to its applications in the study of negacyclic codes over finite fields. In this paper, a rigorous treatment of the factorization of $x^n+1$ over finite fields is given as…
The main aim of the present paper is to introduce new methods for the study of combinatorial designs related to bent functions. They are based on interpretations of convolution on finite abelian groups as multiplication by a…
By using Fourier transforms of two symmetric sequences of finite orthogonal polynomials, we introduce two new classes of finite orthogonal functions and obtain their orthogonality relations via Parseval's identity.
A deep approximation is an approximating function defined by composing more than one layer of simple functions. We study deep approximations of functions of one variable using layers consisting of low-degree polynomials or simple conformal…
We derive several existence results concerning cycle types and, more generally, the "mapping behavior" of complete mappings. Our focus is on so-called first-order cyclotomic mappings, which are functions on a finite field $\mathbb{F}_q$…
This paper presents an alternative approach to simplify the proofs of some important results related to polynomial mappings in Computational Algebraic Geometry such as Polynomial Implicitization, Image Closure and some properties of the…
We show that, up to linear equivalence, there are only finitely many polynomial quadratic mappings $F:\mathbb{C}^2\to\mathbb{C}^n$ and $F:\mathbb{R}^2\to\mathbb{R}^n$. We list all possibilities.
We study numerical integration of functions $f: \mathbb{R}^{s} \to \mathbb{R}$ with respect to a probability measure. By applying the corresponding inverse cumulative distribution function, the problem is transformed into integrating an…