Nuh Aydin

works on

coding theory 1 extremal combinatorics 1 Gilbert-Varshamov bound 1 graph theory 1 metric spaces 1

From the 1 of 3 linked papers with an AI index.

collaborators

3 papers

math.CO2026

Bipartite Extremal Numbers of Trees

Lucas Waite, Nuh Aydin

We study a restriction of the classical Erdős--Sós problem, the extremal number of trees, to the class of bipartite host graphs, both when only the order of the host is prescribed…

math.CO2026

Combinatorial Bounds for Codes over Metric Spaces: Ramsey-Sidorenko Thresholds and Subgraph Counts

Lucas Waite, Nuh Aydin

The paper studies codes in finite metric spaces by modeling them as independent sets in proximity graphs, extending the Gilbert‑Varshamov bound and showing that local subgraph coun…

cs.IT2025

Bounds and Equivalence of Skew Polycyclic Codes over Finite Fields

Hassan Ou-azzou, Anna-Lena Horlemann, Nuh Aydin

We study skew polycyclic codes over a finite field $F_{q}$ , associated with a skew polynomial $f (x) \in F_{q} [x; I ¨ ]$ , where $I ¨ $ is an automorphism of $F_{q}$ .…