Linda Morales

most citedEquivalence Relations for Computing Permutation Polynomials

1 citations · 2 across the 3 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

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 $V (x) / U (x)$ , where both $V (x)$ and $U (x)$ are polynomials over the finite field $F_{q}$ . Polynomials that permute the elements of…

math.CO2018★ 1 cited

New Lower Bounds for Permutation Arrays Using Contraction

Sergey Bereg, Zevi Miller, Luis Gerardo Mojica +2

A permutation array $A$ is a set of permutations on a finite set $Ω$ , say of size $n$ . Given distinct permutations $π, σ \in Ω$ , we let $h d (π, σ) = ∣ {x \in Ω : π (x) \neq = σ (x)} ∣$ , c…