Omkar Baraskar

activity

20242026

collaborators

5 papers

math.NT2026

Error Term Estimates for Sets of Remainders

Omkar Baraskar, Prashant Gokhale, Sarvagya Jain +1

For a positive integer $n$ , let $S_{1} (n) = {n mod k : 1 \leq k \leq ⌊ n /2 ⌋}, s_{1} (n) = ∣ S_{1} (n) ∣.$ Baraskar and Vukusic proved $s_{1} (n) = Ξ n + O (n / (lo g n lo g lo g n))$ for…

math.NT2026

Asymptotic Behavior of Iterated Sets of Remainders

Omkar Baraskar, Prashant Gokhale, Sarvagya Jain +1

For a positive integer $n$ , let $S_{0} (n) = {1, 2, \dots, ⌊ n /2 ⌋}, S_{j + 1} (n) = {n mod k : k \in S_{j} (n) ∖ {0}},$ and put $s_{j} (n) := ∣ S_{j} (n) ∣$ . The sets define…

quant-ph2026

Constraints on recovering quantum information after erasure

Mohammad A. Alhejji, Noah Lordi, Omkar Baraskar +2

Suppose that we encode quantum information into $n$ physical carriers. With what probabilities can we perfectly recover the quantum information after sets of carriers have been e…

math.NT2025

Bounds for sets of remainders

Omkar Baraskar, Ingrid Vukusic

Let $s (n)$ be the number of different remainders $n mod k$ , where $1 \leq k \leq ⌊ n /2 ⌋$ . This rather natural sequence is sequence A283190 in the OEIS and while some…

cs.CC2024

NP-hardness of testing equivalence to sparse polynomials and to constant-support polynomials

Omkar Baraskar, Agrim Dewan, Chandan Saha +1

An $s$ -sparse polynomial has at most $s$ monomials with nonzero coefficients. The Equivalence Testing problem for sparse polynomials (ETsparse) asks to decide if a given polynomial…