// student · builder · researcher
CS & Data Science · NYU · Class of 2028
Building AI systems, chess engines, and quantitative tools. Passionate about machine learning, mathematics, and shipping real products people use.
PROJECT_001
Full-stack AI summarization platform powered by Claude. Acquired 1,500+ users in its first month. Scalable PostgreSQL schema and RESTful Node.js backend on AWS for real-time document ingestion and sub-second inference.
PROJECT_002
AlphaZero-inspired self-learning engine with a dual-headed ResNet (12.6M parameters) trained entirely via self-play. MCTS with PUCT selection, Dirichlet noise, 500K-sample replay buffer, and CUDA 11.8 batched inference.
PROJECT_003
Full-stack quant finance app implementing Modern Portfolio Theory. Monte Carlo simulation engine (3,000+ portfolios) with SciPy SLSQP convex optimization. Computes Max Sharpe Ratio, Min Variance, CVaR, and max drawdown from live market data.
PROJECT_004
End-to-end Retrieval-Augmented Generation pipeline built entirely from scratch with no external APIs. Implements TF-IDF and dense vector retrieval via FAISS, sentence-transformer embeddings, overlapping chunk indexing, and local LLM inference via Ollama (Llama 3.2). Streamlit UI supports PDF and text upload with live source attribution per answer.
PROJECT_005
Production-grade financial backend built with Spring Boot, featuring JWT authentication, AES-256-GCM encryption for PII at rest, and HMAC blind-indexing for searchable encrypted fields. Idempotent, deadlock-safe transaction engine uses pessimistic locking with canonical wallet-pair ordering to guarantee exactly-once fund transfers, backed by an immutable audit ledger and Flyway-managed schema migrations.
Math Research
Conducted advanced combinatorics research under a UPenn PhD candidate, investigating Ramsey numbers, the Hales-Jewett theorem, and the Lovász Local Lemma; authored a research paper applying probabilistic methods to formally derive Van der Waerden's theorem.
Cashier
Whole Foods Market · New York, NY
Processed high-volume transactions via POS systems and collaborated cross-functionally with team members to sustain operational efficiency during peak hours.
President
National Honor Society · Iona Preparatory
Led 200+ students, coordinating peer tutoring programs and community service initiatives; facilitated communication between students and faculty to drive academic engagement.
Brand Partner & Affiliate
I partner with Transparent Labs — one of the most science-backed supplement brands in the industry — as a fitness content creator and affiliate. I create fitness content focused on training, nutrition, and performance, and share evidence-based supplement recommendations with my audience.
Languages
AI / ML / Data
Frameworks
Cloud / DevOps
Proficiency
NVIDIA 6G Developer Program
NVIDIA
2026
CS4CS Cybersecurity Program
NYU Tandon School of Engineering
2023
CS50: Intro to Computer Science
Harvard University
2022
A self-study guide to core linear algebra — vectors, matrices, systems of equations, determinants, eigenvalues, and vector spaces — built around worked examples and practice problems for students learning the subject on their own.
A comprehensive guide covering graph theory, combinatorial proofs, counting principles, and discrete structures — written for students bridging undergraduate math and theoretical CS.
30 essential integrals for higher mathematics with original step-by-step solutions. Designed to strengthen understanding of key integral techniques for advanced math learners.
RESEARCH PAPER · EXTREMAL GRAPH THEORY · MAY 2026
A graph G on n vertices is maximal k-colorable if χ(G) = k and adding any edge raises the chromatic number — equivalently, G is a complete k-partite graph. This paper studies the edge spectrum Σχ(n, k): the set of all edge counts realized by such graphs. We prove the saturation number satχ(n, k) = (k−1)(2n−k)/2 and the abundance abχ(n, k) = ex(n, Kk+1). We show Σχ(n, k) is a complete integer interval if and only if n ≤ k + 2, determine Σχ(n, 2) exactly with explicit gap formulas, and give a parametric description for k = 3 including identification of the first partition collision at n = 9. We also establish the strict containment Σχ(n, k) ⊊ ES(n, Kk+1) for n ≥ k + 3.
RESEARCH PAPER · EXTREMAL GRAPH THEORY / QUADRATIC FORMS · JULY 2026
A follow-up to the edge-spectrum paper above, this work asks not just which edge counts are achievable but how often — the multiplicity of "collisions" between distinct partitions that yield the same complete k-partite graph size. An identity connecting the edge count to the root lattice Ak−1 turns the question into one about representations of a quadratic form, and the theory splits by rank exactly as quadratic-form theory does: a reflection involution that forces collisions whenever k divides 2n; an exact multiplicity formula for k = 3 built from Eisenstein-integer ideal counts, together with growth-rate and density results for the edge spectrum itself; unconditional spectral gaps for k = 4 via the three-squares theorem; and a "depth" filtration tying deeper collisions to the Prouhet–Tarry–Escott problem, including a pair of non-isomorphic 4-partite graphs on 18 vertices with identical vertex, edge, and triangle counts.
// download
Ryan_Brij_Raj_August_2026_2027_Resume.pdf
Download PDF