English
Related papers

Related papers: A general construction of regular complete permuta…

200 papers

Motivated by many recent constructions of permutation polynomials over $\mathbb{F}_{q^2}$, we study permutation polynomials over $\mathbb{F}_{q^3}$ in terms of their coefficients. Based on the multivariate method and resultant elimination,…

Number Theory · Mathematics 2018-06-18 Yanping Wang , WeiGuo Zhang , Daniele Bartoli , Qiang Wang

We consider perfect 1-error correcting codes over a finite field with $q$ elements (briefly $q$-ary 1-perfect codes). In this paper, a generalized concatenation construction for $q$-ary 1-perfect codes is presented that allows us to…

Discrete Mathematics · Computer Science 2017-11-02 Alexander M. Romanov

Let $\mathbb{F}_q$ be a finite field of odd characteristic. We study R\'edei functions that induce permutations over $\mathbb{P}^1(\mathbb{F}_q)$ whose cycle decomposition contains only cycles of length $1$ and $j$, for an integer $j\geq…

Number Theory · Mathematics 2020-11-10 Juliane Capaverde , Ariane M. Masuda , Virgínia M. Rodrigues

Let R be a ring of polynomials in a finite number of variables over a perfect field k of characteristic p>0 and let F:R\to R be the Frobenius map of R, i.e. F(r)=r^p. We explicitly describe an R-module isomorphism Hom_R(F_*(M),N)\cong…

Commutative Algebra · Mathematics 2010-01-19 Gennady Lyubeznik , Wenliang Zhang , Yi Zhang

We consider properties of overpartitions that are simultaneously {\ell}-regular and {\mu}-regular, where {\ell} and {\mu} are positive relatively prime integers. We prove a seven-way combinatorial identity related to these overpartitions.…

Number Theory · Mathematics 2024-12-30 Abdulaziz M. Alanazi , Augustine O. Munagi , Manjil P. Saikia

In this paper, by using a powerful criterion for permutation polynomials given by Zieve, we give several classes of complete permutation monomials over $\F_{q^r}$. In addition, we present a class of complete permutation multinomials, which…

Information Theory · Computer Science 2013-12-31 Gaofei Wu , Nian Li , Tor Helleseth , Yuqing Zhang

This paper came to existence out of the desire to understand iterations of strictly triangular polynomial maps over finite fields. This resulted in two connected results: First, we give a generalization of $\F_p$-actions on $\F_p^n$ and…

Algebraic Geometry · Mathematics 2013-01-24 Stefan Maubach

We study an analogue of the Collatz map in the polynomial ring $R[x]$, where $R$ is an arbitrary commutative ring. We prove that if $R$ is of positive characteristic, then every polynomial in $R[x]$ is eventually periodic with respect to…

Combinatorics · Mathematics 2024-10-01 Angelot Behajaina , Elad Paran

In the classical setting, a convex polytope is said to be semiregular if its facets are regular and its symmetry group is transitive on vertices. This paper studies semiregular abstract polytopes, which have abstract regular facets, still…

Combinatorics · Mathematics 2012-01-27 B. Monson , Egon Schulte

Any permutation statistic $f:\sym\to\CC$ may be represented uniquely as a, possibly infinite, linear combination of (classical) permutation patterns: $f= \Sigma_\tau\lambda_f(\tau)\tau$. To provide explicit expansions for certain…

Combinatorics · Mathematics 2011-03-08 Petter Brändén , Anders Claesson

The main purpose of this paper is to determine all normalized extremal quasimodular forms of depth 1 whose Fourier coefficients are integers. By changing the local parameter at infinity from $q=e^{2\pi i \tau}$ to the reciprocal of the…

Number Theory · Mathematics 2023-05-31 Tomoaki Nakaya

In this paper, we get several new results on permutation polynomials over finite fields. First, by using the linear translator, we construct permutation polynomials of the forms $L(x)+\sum_{j=1}^k \gamma_jh_j(f_j(x))$ and…

Number Theory · Mathematics 2014-06-03 Xiaoer Qin , Guoyou Qian , Shaofang Hong

We investigate the question as to when the members of a finite regular semigroup may be permuted in such a way that each member is mapped to one of its inverses. In general this is not possible. However we reformulate the problem in terms…

Group Theory · Mathematics 2019-01-17 Peter M. Higgins

In this paper we take a deeper look at the self conjugate reciprocal (SCR) polynomials, which towards the end of the paper aid the construction of new classes of permutation polynomials of simpler forms over $\mathbb{F}_{q^{2}}$. The paper…

Number Theory · Mathematics 2024-09-16 Bidushi Sharma , Dhiren Kumar Basnet

R. Gupta, P. Gahlyan and R.K. Sharma presented three classes of permutation trinomials over $\mathbb{F}_{q^3}$ in Finite Fields and Their Applications. In this paper, we employ the local method to prove that those polynomials are indeed…

Number Theory · Mathematics 2024-09-30 Danyao Wu , Pingzhi Yuan , Huanhuan Guan , Juan Li

The study of arithmetic properties of coefficients of modular forms $f(\tau) = \sum a(n)q^n$ has a rich history, including deep results regarding congruences in arithmetic progressions. Recently, work of C.-S. Radu, S. Ahlgren, B. Kim, N.…

Number Theory · Mathematics 2019-10-17 Sharon Garthwaite , Marie Jameson

This paper provides some statistics for the coefficients of Russell- Type modular equations for the modular function, {\lambda}({\tau}). The results hold uniformly for all odd primes. They do not rely on any numerical evaluations of…

Number Theory · Mathematics 2016-08-08 Timothy Redmond , Charles Ryavec

A singular riemannian foliation F on a complete riemannian manifold M is said to admit sections if each regular point of M is contained in a complete totally geodesic immersed submanifold (a section) that meets every leaf of F orthogonally…

Geometric Topology · Mathematics 2011-06-21 Marcos Alexandrino , Claudio Gorodski

Given a parity-check matrix $H_m$ of a $q$-ary Hamming code, we consider a partition of the columns into two subsets. Then, we consider the two codes that have these submatrices as parity-check matrices. We say that anyone of these two…

Combinatorics · Mathematics 2019-03-07 J. Borges , J. Rifà , V. A. Zinoviev

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

Commutative Algebra · Mathematics 2014-07-14 Joachim von zur Gathen , Konstantin Ziegler
‹ Prev 1 4 5 6 7 8 10 Next ›