158 citations · 160 across the 3 of their papers we have counts for
4 papers
Representing the GCD as linear combination in non-PID rings
Géza Kós
In this note we prove the following fact: if finite many elements of a unique factorization domain are given such that the greatest common divisor of each pair $(…
On the grasshopper problem with signed jumps
Géza Kós
The 6th problem of the 50th International Mathematical Olympiad (IMO), held in Germany, 2009, was the following. Let be distinct positive integers and let be…
Alon's Nullstellensatz for multisets
Géza Kós, Lajos Rónyai
Alon's combinatorial Nullstellensatz (Theorem 1.1 from \cite{Alon1}) is one of the most powerful algebraic tools in combinatorics, with a diverse array of applications. Let $\F$ be…
The on-line shortest path problem under partial monitoring
Andras Gyorgy, Tamas Linder, Gabor Lugosi +1
The on-line shortest path problem is considered under various models of partial monitoring. Given a weighted directed acyclic graph whose edge weights can change in an arbitrary (a…