10 papers
Hat Guessing Numbers of Degenerate Graphs
Xiaoyu He, Ray Li
Recently, Farnik asked whether the hat guessing number of a graph could be bounded as a function of its degeneracy , and Bosek, Dudek, Farnik, Grytczuk and Ma…
Effective bounds on multiplicatively dependent orbits of integer polynomials modulo S-integers
Ray Li, Igor E. Shparlinski
We obtain effective bounds on the heights of algebraic integers whose orbits contain multiplicatively dependent values modulo S-integers. Our method is based on a new upper bound o…
Coded trace reconstruction in a constant number of traces
Joshua Brakensiek, Ray Li, Bruce Spang
The coded trace reconstruction problem asks to construct a code such that any is recoverable from independent outputs ("traces") of from a binary…
Enumeration of Preferred Extensions in Almost Oriented Digraphs
Serge Gaspers, Ray Li
In this paper, we present enumeration algorithms to list all preferred extensions of an argumentation framework. This task is equivalent to enumerating all maximal semikernels of a…
A Tight Analysis of Greedy Yields Subexponential Time Approximation for Uniform Decision Tree
Ray Li, Percy Liang, Stephen Mussmann
Decision Tree is a classic formulation of active learning: given hypotheses with nonnegative weights summing to 1 and a set of tests that each partition the hypotheses, output…
On edge-ordered Ramsey numbers
Jacob Fox, Ray Li
An edge-ordered graph is a graph with a linear ordering of its edges. Two edge-ordered graphs are equivalent if their is an isomorphism between them preserving the ordering of the…