10 citations · 10 across the 5 of their papers we have counts for
9 papers
Mutually touching cylinders: Littlewood's seven, and at most ten in general
Ivan Matić, Kenta Kitamura, Radoš Radoičić +1
We give a computer-assisted proof that at most seven congruent infinite circular cylinders in can touch pairwise. This answers a question of Littlewood from 1968. Fo…
Insertion and expansion of cylinders around the unit ball
Ivan Matić, Radoš Radoičić, Andreas Spomer
A unit ball is surrounded with a ring of equal infinite circular cylinders. Each cylinder touches the ball and its two neighbors. Can one more cylinder of the same radius be ad…
A computer-assisted proof of Kuperberg's six-cylinder conjecture
Ivan Matić, Rados Radoičić
We prove that at most six pairwise non-overlapping infinite unit cylinders can simultaneously touch a unit ball. Six is achievable, so the answer to Kuperberg's question is exactly…
Fourier levels and almost sure bounds on higher-order derivatives in first-passage percolation
Ivan Matic, Rados Radoicic, Dan Stefanica
The variance of first-passage percolation admits a decomposition into Fourier levels indexed by the order of environment derivatives. These Fourier levels capture how local perturb…
Higher-order derivatives of first-passage percolation with respect to the environment
Ivan Matic, Rados Radoicic, Dan Stefanica
We introduce and study derivatives in first-passage percolation with edge weights given by i.i.d. random variables supported on . We show that the variance of the passage…
A generalization of the rational rough Heston approximation
Jim Gatheral, Radoš Radoičić
Previously, in [GR19], we derived a rational approximation of the solution of the rough Heston fractional ODE in the special case λ= 0, which corresponds to a pure power-law kernel…
The Zumbach effect under rough Heston
Omar El Euch, Jim Gatheral, Radoš Radoičić +1
Previous literature has identified an effect, dubbed the Zumbach effect, that is nonzero empirically but conjectured to be zero in any conventional stochastic volatility model. Ess…
Saturated simple and -simple topological graphs
Jan Kynčl, János Pach, Radoš Radoičić +1
A simple topological graph is a graph drawn in the plane so that any pair of edges have at most one point in common, which is either an endpoint or a proper crossing. is ca…
A note on coloring line arrangements
Eyal Ackerman, Rom Pinchasi
We show that the lines of every arrangement of lines in the plane can be colored with colors such that no face of the arrangement is monochromatic. This i…