53 citations · 112 across the 26 of their papers we have counts for
4 papers · 1 filter
Constructing Order Type Graphs using an Axiomatic Approach
Sergey Bereg, Mohammadreza Haghpanah
A given order type in the plane can be represented by a point set. However, it might be difficult to recognize the orientations of some point triples. Recently, Aichholzer \etal \c…
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…
New Lower Bounds for Tverberg Partitions with Tolerance in the Plane
Sergey Bereg, Mohammadreza Haghpanah
Let be a set points in a -dimensional space. Tverberg's theorem says that, if is at least , then can be partitioned into sets whose convex hull…
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…