1 citations · 1 across the 1 of their papers we have counts for
3 papers
math.CO2020
Improved Lower Bounds for Permutation Arrays Using Permutation Rational Functions
Sergey Bereg, Brian Malouf, Linda Morales +2
We consider rational functions of the form , where both and are polynomials over the finite field . Polynomials that permute the elements of…
cs.IT2020★ 1 cited
Equivalence Relations for Computing Permutation Polynomials
Sergey Bereg, Brian Malouf, Linda Morales +3
We present a new technique for computing permutation polynomials based on equivalence relations. The equivalence relations are defined by expanded normalization operations and new…
math.CO2018
New Lower Bounds for Permutation Arrays Using Contraction
Sergey Bereg, Zevi Miller, Luis Gerardo Mojica +2
A permutation array is a set of permutations on a finite set , say of size . Given distinct permutations , we let , c…