I. H. Sudborough

activity

20062023

most citedNew Lower Bounds for Permutation Arrays Using Contraction

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

collaborators

8 papers

math.CO2023

Improved Bounds for Permutation Arrays Under Chebyshev Distance

Sergey Bereg, Mohammadreza Haghpanah, Brian Malouf +1

Permutation arrays under the Chebyshev metric have been considered for error correction in noisy channels. Let $P (n, d)$ denote the maximum size of any array of permutations on $n$ …

math.CO2023

Bounds for Permutation Arrays under Kendall Tau Metric

Sergey Bereg, William Bumpass, Mohammadreza Haghpanah +2

Permutation arrays under the Kendall- $τ$ metric have been considered for error-correcting codes. Given $n$ and $d \in [1.. (2 n)]$ , the task is to find a large permutation arr…

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…

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★ 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…

cs.DM2015

Constructing Permutation Arrays from Groups

Sergey Bereg, Avi Levy, I. Hal Sudborough

Let M(n, d) be the maximum size of a permutation array on n symbols with pairwise Hamming distance at least d. We use various combinatorial, algebraic, and computational methods to…

math.CO2014

Embedding multidimensional grids into optimal hypercubes

Zevi Miller, Dan Pritikin, I. H. Sudborough

Let $G$ and $H$ be graphs, with $∣ V (H) ∣ \geq ∣ V (G) ∣$ , and $f : V (G) \to V (H)$ a one to one map of their vertices. Let $d i l a t i o n (f) = ma x {d i s t_{H} (f (x), f (y)) : x y \in E (G)}$ ,…

math.CO2006

Short Proofs for Cut-and-Paste Sorting of Permutations

Daniel Cranston, I. Hal Sudborough, Douglas B. West

We consider the problem of determining the maximum number of moves required to sort a permutation of $[n]$ using cut-and-paste operations, in which a segment is cut out and then pa…