English
Related papers

Related papers: A Note on Permutation Binomials and Trinomials ove…

200 papers

We construct a new family of permutation group polynomials over finite fields of arbitrary characteristic, which are special types of bivariate local permutation polynomials. For this family, we explicitly construct their companion. We also…

Combinatorics · Mathematics 2026-02-03 Sartaj Ul Hasan , Ramandeep Kaur , Hridesh Kumar

In this paper, we prove that the equation $x^2-(p^{2k+2}+1)y^2=-p^{2l+1}$, $l \in \{0,1,\dots,k\}, k \geq 0$, where $p$ is an odd prime number, is not solvable in positive integers $x$ and $y$. By combining that result with other known…

Number Theory · Mathematics 2020-04-27 Andrej Dujella , Mirela Jukić Bokun , Ivan Soldo

By polynomial (or extended binomial) coefficients, we mean the coefficients in the expansion of integral powers, positive and negative, of the polynomial $1+t +\cdots +t^{m}$; $m\geq 1$ being a fixed integer. We will establish several…

Number Theory · Mathematics 2016-07-26 Nour-Eddine Fahssi

We construct a class of permutation polynomials of $\bF_{2^m}$ that are closely related to Dickson polynomials.

Combinatorics · Mathematics 2007-05-23 Henk D. L. Hollmann , Qing Xiang

We explore two questions about pseudo-polynomials, which are functions $f:\mathbb N \to \mathbb Z$ such that $k$ divides $f(n+k) - f(n)$ for all $n,k$. First, for certain arbitrarily sparse sets $R$, we construct pseudo-polynomials $f$ with…

Number Theory · Mathematics 2021-08-30 Vivian Kuperberg

The Mersenne primes are primes which can be written as some prime power of 2 minus 1. These primes were studied from antiquity in that their close connection with perfect numbers and even to present day in that their easiness for primality…

Number Theory · Mathematics 2022-08-09 Taekyun Kim , Dae san Kim

Every odd prime number p can be written in exactly (p + 1)/2 ways as a sum ab + cd with min(a, b) > max(c, d) of two ordered products. This gives a new proof Fermat's Theorem expressing primes of the form 1 + 4N as sums of two squares 1 .

History and Overview · Mathematics 2021-11-05 Roland Bacher

For a pair of positive integers (k,r) with r>1 such that k+1 and r-1 are relatively prime, we describe the space of symmetric polynomials in variables x_1,...,x_n which vanish at all diagonals of codimension k of the form…

Quantum Algebra · Mathematics 2007-05-23 B. Feigin , M. Jimbo , T. Miwa , E. Mukhin , Y. Takeyama

Let $N(x,y)$ denote the number of integers $n\le x$ which are divisible by a shifted prime $p-1$ with $p>y$, $p$ prime. Improving upon recent bounds of McNew, Pollack and Pomerance, we establish the exact order of growth of $N(x,y)$ for all…

Number Theory · Mathematics 2019-10-22 Kevin Ford

The expression $a^n + b^n$ can be factored as $(a+b)(a^{n-1} - a^{n-2} b + a^{n-3} b^2 - ... + b^{n-1})$ when $n$ is an odd integer greater than one. This paper focuses on proving a few properties of the longer factor above, which we call…

General Mathematics · Mathematics 2021-10-28 David Bodiu

We define a map between the set of permutations that avoid either the four patterns $3214,3241,4213,4231$ or $3124,3142,4123,4132$, and the set of Dyck prefixes. This map, when restricted to either of the two classes, turns out to be a…

Combinatorics · Mathematics 2013-01-10 Marilena Barnabei , Flavio Bonetti , Matteo Silimbani

We investigate a family of permutation polynomials of finite fields of characteristic 2. Through a connection between permutation polynomials and quadratic forms, a general treatment is presented to characterize these permutation…

Number Theory · Mathematics 2025-07-01 Ruikai Chen

Motivated by juggling sequences and bubble sort, we examine permutations on the set {1,2,...,n} with d descents and maximum drop size k. We give explicit formulas for enumerating such permutations for given integers k and d. We also derive…

Combinatorics · Mathematics 2010-01-18 Fan Chung , Anders Claesson , Mark Dukes , Ron Graham

Given a permutation polynomial of a large finite field, finding its inverse is usually a hard problem. Based on a piecewise interpolation formula, we construct the inverses of cyclotomic mapping permutation polynomials of arbitrary finite…

Number Theory · Mathematics 2018-12-20 Yanbin Zheng , Yuyin Yu , Yuanping Zhang , Dingyi Pei

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 various counting questions for irreducible binomials over finite fields. We use various results from analytic number theory to investigate these questions.

Number Theory · Mathematics 2017-07-12 Randell Heyman , Igor E. Shparlinski

In this short note we give an expression for some numbers $n$ such that the polynomial $x^{2p}-nx^p+1$ is reducible.

Number Theory · Mathematics 2013-11-06 Ralf Stephan

In this paper we study some sophisticated supercongruences involving dual sequences. For $n=0,1,2,\ldots$ define $$d_n(x)=\sum_{k=0}^n\binom nk\binom xk2^k$$ and $$s_n(x)=\sum_{k=0}^n\binom nk\binom xk\binom{x+k}k=\sum_{k=0}^n\binom…

Number Theory · Mathematics 2017-04-21 Zhi-Wei Sun

Let f(x) be a polynomial with integer coefficients, let n be a positive integer, and let p be an odd prime. Then the mapping x-->f(x) sends Z/p^n into Z/p^n. We study the topological structure of this mapping.

Number Theory · Mathematics 2007-05-23 David L. desJardins , Michael E. Zieve

This study applies the binomial, k-binomial, rising k-binomial and falling k-binomial transforms to the modified k-Fibonacci-like sequence. Also, the Binet formulas and generating functions of the above mentioned four transforms are newly…

Number Theory · Mathematics 2018-04-24 Youngwoo Kwon
‹ Prev 1 8 9 10 Next ›