Results 31 to 40 of about 57,503 (225)

Algorithms for Quantum Branching Programs Based on Fingerprinting [PDF]

Electronic Proceedings in Theoretical Computer Science, 2009
In the paper we develop a method for constructing quantum algorithms for computing Boolean functions by quantum ordered read-once branching programs (quantum OBDDs).
Farid Ablayev, Alexander Vasiliev
doaj   +1 more source

A converse to the Grace--Walsh--Szeg\H{o} theorem

, 2008
We prove that the symmetrizer of a permutation group preserves stability of a polynomial if and only if the group is orbit homogeneous. A consequence is that the hypothesis of permutation invariance in the Grace-Walsh-Szeg\H{o} Coincidence Theorem cannot
DAVID G. WAGNER, Grace, PETTER BRÄNDÉN, Rahman   +3 more
core   +1 more source

On Permutation Polynomials

Finite Fields and Their Applications, 2002
The author studies the question when a polynomial of the form \(f(x)=x^u(x^v+1)\) with positive integers \(u,v\) induces a permutation on the finite field \(\mathbb F_q\). For \(d=3\) and \(d=5\) he gives sufficient and necessary conditions for \(f\) to be a permutation polynomial over \(\mathbb F_q\) where \(d\mid q-1\) and \(\gcd(v,q-1)=(q-1)/d ...
openaire   +2 more sources

Further results on permutation polynomials and complete permutation polynomials over finite fields

AIMS Mathematics, 2021
<abstract><p>In this paper, by employing the AGW criterion and determining the number of solutions to some equations over finite fields, we further investigate nine classes of permutation polynomials over $ \mathbb{F}_{p^n} $ with the form $ (x^{p^m}-x+\delta)^{s_1}+(x^{p^m}-x+\delta)^{s_2}+x $ and propose five classes of complete ...
Liu, Qian, Xie, Jianrui, Liu, Ximeng, Zou, Jian   +3 more
openaire   +4 more sources

Key-avoidance for alternating sign matrices [PDF]

Discrete Mathematics & Theoretical Computer Science
We initiate a systematic study of key-avoidance on alternating sign matrices (ASMs) defined via pattern-avoidance on an associated permutation called the \emph{key} of an ASM.
Mathilde Bouvel, Rebecca Smith, Jessica Striker   +2 more
doaj   +1 more source

A Recursive Construction of Permutation Polynomials over $\mathbb{F}_{q^2}$ with Odd Characteristic from R\'{e}dei Functions

, 2017
In this paper, we construct two classes of permutation polynomials over $\mathbb{F}_{q^2}$ with odd characteristic from rational R\'{e}dei functions. A complete characterization of their compositional inverses is also given. These permutation polynomials
Feng, Xiutao, Fu, Shihui, Lin, Dongdai, Wang, Qiang   +3 more
core   +1 more source

Attacking scheme against the permutation-based multi-polynomial scheme for pair-wise key establishment in wireless sensor networks

Tongxin xuebao, 2015
An attacking scheme was proposed against the permutation-based multi-polynomial scheme proposed by Guo,et al for pair-wise key establishment in wireless sensor networks.Attacks on polynomials were carried out by constructing a black-box to integrally ...
Ai-wen WANG, Tao WEN, Yong ZHANG, Feng-mei ZHU, Di WU   +4 more
doaj   +2 more sources

On some permutation polynomials over finite fields

International Journal of Mathematics and Mathematical Sciences, 2005
Let p be prime, q=pm, and q−1=7s. We completely describe the permutation behavior of the binomial P(x)=xr(1+xes) (1≤e≤6) over a finite field Fq in terms of the sequence {an} defined by the recurrence relation an=an−1+2an−2−an−3 (n≥3) with initial ...
Amir Akbary, Qiang Wang
doaj   +1 more source

Factoring peak polynomials [PDF]

Discrete Mathematics & Theoretical Computer Science, 2015
Given a permutation $\pi=\pi_1\pi_2\cdots \pi_n \in S_n$, we say an index $i$ is a peak if $\pi_{i-1} < \pi_i > \pi_{i+1}$. Let $P(\pi)$ denote the set of peaks of $\pi$.
Sara Billey, Matthew Fahrbach, Alan Talmage   +2 more
doaj   +1 more source

Cyclotomy and permutation polynomials of large indices [PDF]

, 2012
We use cyclotomy to design new classes of permutation polynomials over finite fields. This allows us to generate many classes of permutation polynomials in an algorithmic way.
Wang, Qiang
core