Skip to main content

About Me

 

About Me

Hi! I’m Arya, a 18-year-old.

I recently decided to take a gap year after JEE, where I secured a rank of 2381. Some people think dropping after that is a drastic decision, but I know I’m capable of much more — and I want to push myself toward the things that truly excite me.

What excites me? Almost everything that sparks curiosity. But if I had to pick:

  • In math, I’m fascinated by combinatorics, geometry, algebra, and analysis.

  • In science, I’m curious about physics, computer science, and the way ideas connect across fields.

  • I also love coding, chess, table tennis, reading, and writing literature.

  • I even wrote a novel: The Midnight Files: The Vanishing Violinist.

  • And beyond all that, I’m interested in life itself — exploring the mind, asking questions, and chasing down mysteries wherever I find them.

Curiosity is what inspired me to write my first research paper on real analysis. I’ve since posted my work online, and I’ll keep sharing my explorations here.

📄 My Papers:








Github Repos:




What I’m Doing Next

I dream of building a career at the intersection of computer science and mathematics. I want to study at a top university abroad — MIT, Harvard, or anywhere that values curiosity and bold exploration.

My Messages to Readers

  1. I’m young, but serious about research. Age is not a barrier when curiosity drives you.

  2. Math is a playground. Don’t be afraid to explore, even if it looks “pathological” at first. That’s often where the beauty hides.

  3. Let’s connect. Whether you’re a student, researcher, or just someone curious about math and science, I’d love to share ideas and learn from you.

That’s me in short: a curious mind, wandering across math, science, literature, and life itself. This blog is where I’ll record my explorations.

Some Other Achievements

  • JEE Main 2025: 99.856 percentile

  • JEE Advanced 2025: AIR 2381

  • Physics Brawl Online 2024: Ranked 16 (Category A) — Team Half Spin Heroes

  • OPhO 2024: Qualified for the second stage — Team Gravitators

  • Iranian Combinatorics Olympiad 2024: Ranked 189 — Team Green Eyed Dragons

  • NSEP & NSEA 2024: National Top 1% (NSEA score above MI cutoff)

  • NSEP, NSEA, NSEC 2025: State Top 1%

  • Regional Mathematics Olympiad 2025 Ranked 8th in Maharashtra and Goa region.

    •  

    Comments

    Post a Comment

    Popular posts from this blog

    Sharp Extremal Bounds for Angular Occupancy (Behind the Curtains)

    you can find the full paper here First Attempts, and the Limits of Energy When I first began thinking about angular occupancy, I wasn’t looking for a brand-new problem. I was chasing a theme that has long fascinated me in discrete geometry: how do we measure the geometric richness of a finite set of points? This fascination is not unique to me. ErdÅ‘s, way back in 1946, posed the distinct distances problem : given n points in the plane, how many distinct distances can they determine? That question alone gave birth to entire decades of work in combinatorial geometry. Later, Fishburn and Füredi asked about distinct angles , while Pach and Sharir studied repeated angles . Each time, the same underlying itch was being scratched: when you place points in the plane, what kinds of diversity can they generate? Why angles, why bins? It was natural to think of angles — after all, distances and directions had already been well studied. But if you go straight for “distinct angles,” you run in...
    Post a Comment
    Read more

    The Art of Goodbye

      The Art of Goodbye: How Relationships End and Why It Matters The friendship had been slowly dissolving for months. What used to be weekly coffee dates became monthly check-ins, then sporadic text messages, then silence. No fight precipitated the ending, no dramatic confrontation or betrayal. It simply... faded. One day you realized you hadn't spoken to someone who was once central to your life, and you weren't sure when the relationship had officially ended or even if it had. This ambiguous loss left you with a peculiar grief – mourning someone still alive, still accessible, but no longer present in your world. This experience is incredibly common yet rarely discussed. While we have cultural scripts for how relationships begin – meet-cutes, first dates, friendship origin stories – we have few models for how they end. We talk extensively about building connections but rarely about gracefully releasing them. This gap in our social understanding leaves many people unprepared ...
    1 comment
    Read more

    Getting Stuck: When Dijkstra Meets Negative Edges

      Getting Stuck: When Dijkstra Meets Negative Edges One of the joys (and pains) of computer science is when you take a tool you know, confidently apply it, and then watch everything break down in surprising ways. This happened to me recently when I decided to revisit shortest path algorithms — specifically, Dijkstra’s algorithm — only to get stuck in a swamp of negative edges. Setting the Scene The problem was classic: Given a directed, weighted graph and a source vertex, find the shortest path to all other vertices. This is the kind of problem that every CS student learns early, usually with Dijkstra’s algorithm. I already knew Dijkstra like an old friend: Keep a priority queue of distances. Always expand the node with the current smallest distance. Relax its edges. Simple, elegant, efficient ( O((V + E) log V) with a binary heap). So when I started coding a graph utility for my project — a tool to analyze transportation networks — I confidently plugged in D...
    Post a Comment
    Read more