activity
20182024
most citedCutting and Gluing Surfaces

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

collaborators

6 papers

cs.DS2024

Partial Implementation of Max Flow and Min Cost Flow in Almost-Linear Time

Nithin Kavi

In 2022, Chen et al. proposed an algorithm in \cite{main} that solves the min cost flow problem in time, where is the number of edges in the graph,…

cs.DC2022

MapReduce for Counting Word Frequencies with MPI and GPUs

Nithin Kavi

In this project, the goal was to use the Julia programming language and parallelization to write a fast map reduce algorithm to count word frequencies across large numbers of docum…

math.GT2019★ 3 cited

Cutting and Gluing Surfaces

Nithin Kavi

We start with a disk with vertices along its boundary where pairs of vertices are connected with strips with certain restrictions. This forms a {\it pairing}. To relate tw…

math.GT2019

Equivalence Relations Between Closed Curves On the Pair of Pants

Nithin Kavi

We examine an equivalence relation between free homotopy classes of closed curves on the pair of pants known as k-equivalence, a generalization of a concept previously defined by L…

math.NT2018

On the Radical of Multiperfect Numbers and Applications

Nithin Kavi, Xinyi Zhang, Viraj Jayam +1

It is conjectured that for a perfect number We prove bounds on the radical of multiperfect number depending on its abundancy index. Assum…

math.GT2018★ 1 cited

Trunk of Satellite and Companion Knots

Nithin Kavi, Wendy Wu, Zhenkun Li

We study the knot invariant called trunk, as defined by Ozawa, and the relation of the trunk of a satellite knot with the trunk of its companion knot. Our first result is ${\rm tru…