activity
20182023
most citedQuantitative Coding and Complexity Theory of Continuous Data

2 citations · 4 across the 5 of their papers we have counts for

collaborators

6 papers

cs.LO2023

Degrees of Second and Higher-Order Polynomials

Donghyun Lim, Martin Ziegler

Second-order polynomials generalize classical first-order ones in allowing for additional variables that range over functions rather than values. We are motivated by their applicat…

math.NT2023★ 1 cited

Nonemptiness of single affine Deligne-Lusztig varieties

Dong Gyu Lim

Affine Deligne-Lusztig varieties with various level structures show up in the study of Shimura varieties and moduli spaces of shtukas. Among is the Iwahori level structure which is…

math.NT2022★ 1 cited

The connected components of affine Deligne--Lusztig varieties

Ian Gleason, Dong Gyu Lim, Yujie Xu

We compute the connected components of arbitrary parahoric level affine Deligne-Lusztig varieties and local Shimura varieties, thus resolving a folklore conjecture in full generali…

math.LO2020★ 2 cited

Quantitative Coding and Complexity Theory of Continuous Data

Donghyun Lim, Martin Ziegler

Specifying a computational problem requires fixing encodings for input and output: encoding graphs as adjacency matrices, characters as integers, integers as bit strings, and vice…

math.NA2019

Randomized Computation of Continuous Data: Is Brownian Motion Computable?

Willem Fouché, Hyunwoo Lee, Donghyun Lim +3

We consider randomized computation of continuous data in the sense of Computable Analysis. Our first contribution formally confirms that it is no loss of generality to take as samp…

cs.LO2018

Representation Theory of Compact Metric Spaces and Computational Complexity of Continuous Data

Akitoshi Kawamura, Donghyun Lim, Svetlana Selivanova +1

Choosing an encoding over binary strings for input/output to/by a Turing Machine is usually straightforward and/or inessential for discrete data (like graphs), but delicate -- heav…