Simon Rubinstein-Salzedo

activity

20152021

most citedInscribed triangles of Jordan curves in

R^{n}

1 citations · 1 across the 3 of their papers we have counts for

collaborators

7 papers

math.MG2021★ 1 cited

Inscribed triangles of Jordan curves in $R^{n}$

Aryaman Gupta, Simon Rubinstein-Salzedo

Nielsen's theorem states that any triangle can be inscribed in a planar Jordan curve. We prove a generalisation of this theorem, extending to any Jordan curve $J$ embedded in $\mat…

math.NT2019

Cyclotomic Coincidences

Carl Pomerance, Simon Rubinstein-Salzedo

In this paper, we show that if $m$ and $n$ are distinct positive integers and $x$ is a nonzero real number with $Φ_{m} (x) = Φ_{n} (x)$ , then $\frac{1}{2} < ∣ x ∣ < 2$ except when $\{m,n\}=\{2,6…

math.NT2019

Diophantine Tuples over $Z_{p}$

Nitya Mani, Simon Rubinstein-Salzedo

For an element $r$ of a ring $R$ , a Diophantine $D (r)$ $m$ -tuple is an $m$ -tuple $(a_{1}, a_{2}, \dots, a_{m})$ of elements of $R$ such that for all $i, j$ with $i \neq = j$ , $a_{i} a_{j} + r$ is a p…

math.CO2018

Stability for Take-Away Games

Simon Rubinstein-Salzedo, Sherry Sarkar

In this paper, we study a family of take-away games called $α$ -tag, parametrized by a real number $α \geq 1$ . We show that for any given $α$ , there is a half-open interval $I_{α}$ cont…

math.CO2018

$P$ Play in Candy Nim

Nitya Mani, Rajiv Nelakanti, Simon Rubinstein-Salzedo +1

Candy Nim is a variant of Nim in which both players aim to take the last candy in a game of Nim, with the added simultaneous secondary goal of taking as many candies as possible. W…

cs.GT2017

The Asymmetric Colonel Blotto Game

Simon Rubinstein-Salzedo, Yifan Zhu

This paper explores the Nash equilibria of a variant of the Colonel Blotto game, which we call the Asymmetric Colonel Blotto game. In the Colonel Blotto game, two players simultane…