{
  "count": 90,
  "description": "Technical notes, essays, and interactive explorations on systems performance, computer graphics, mathematics, algorithms, and software engineering.",
  "generatedAt": "2026-11-21T19:53:34Z",
  "notes": [
    {
      "date": "2026-09-06",
      "interactive": true,
      "isFavorite": false,
      "lastmod": "2026-10-25",
      "readingTime": 28,
      "relUrl": "/notes/optimizing-the-inference-stack/",
      "series": "Systems Performance Engineering",
      "seriesUrl": "/series/systems-performance-engineering/",
      "summary": "An end-to-end framework for optimizing LLM inference: map hardware, kernels, host execution, runtimes, and orchestration, define service demand, rank bottlenecks with capacity and queueing, and choose experiments that improve goodput. Includes case studies from Makora and Baseten.",
      "tags": [
        "performance",
        "systems performance engineering",
        "system design",
        "inference serving",
        "benchmarking",
        "queuing theory",
        "kubernetes",
        "linux",
        "gpu",
        "hardware",
        "llm-d"
      ],
      "title": "Optimizing the LLM Inference Stack",
      "url": "https://www.mauriciopoppe.com/notes/optimizing-the-inference-stack/",
      "wordCount": 5827
    },
    {
      "date": "2026-09-01",
      "interactive": true,
      "isFavorite": true,
      "lastmod": "2026-10-25",
      "readingTime": 16,
      "relUrl": "/notes/pareto-frontier-in-inference-serving/",
      "series": "Systems Performance Engineering",
      "seriesUrl": "/series/systems-performance-engineering/",
      "summary": "Why a single performance number tells only part of the story in LLM serving, and when you need the whole Pareto frontier instead. Covers the limits of scalarization on concave trade-offs, how Optuna and Google Vizier actually store trial values (the frontier is derived, not persisted), and how production tools like Prism, InferenceBench, and NVIDIA Dynamo present the frontier as the reportable artifact.",
      "tags": [
        "performance",
        "system design",
        "inference serving",
        "benchmarking",
        "pareto frontier",
        "multi-objective optimization",
        "optuna",
        "vizier"
      ],
      "title": "The Pareto Frontier in LLM Inference Serving",
      "url": "https://www.mauriciopoppe.com/notes/pareto-frontier-in-inference-serving/",
      "wordCount": 3384
    },
    {
      "date": "2026-08-28",
      "interactive": false,
      "isFavorite": true,
      "lastmod": "2026-10-25",
      "readingTime": 14,
      "relUrl": "/notes/benchmarking-for-systems-engineers/",
      "series": "Systems Performance Engineering",
      "seriesUrl": "/series/systems-performance-engineering/",
      "summary": "A practical guide to benchmarking: define the performance problem, characterize production workloads, measure latency distributions, avoid Coordinated Omission, choose an arrival model, and explain what the result means.",
      "tags": [
        "system design",
        "benchmarking",
        "load testing",
        "distributed systems",
        "performance"
      ],
      "title": "Benchmarking for Systems Engineers",
      "url": "https://www.mauriciopoppe.com/notes/benchmarking-for-systems-engineers/",
      "wordCount": 2851
    },
    {
      "date": "2026-08-24",
      "interactive": true,
      "isFavorite": false,
      "lastmod": "2026-10-25",
      "readingTime": 16,
      "relUrl": "/notes/queuing-theory-for-systems-engineers/",
      "series": "Systems Performance Engineering",
      "seriesUrl": "/series/systems-performance-engineering/",
      "summary": "A practical, example-first guide to queuing theory in systems engineering: single-server M/M/1 response time and the 50% load paradox, the hockey stick latency curve, Pollaczek-Khinchine service variance, multi-server resource pooling (M/M/c), and capacity planning rules of thumb with interactive visualizers.",
      "tags": [
        "system design",
        "performance",
        "queuing theory",
        "distributed systems",
        "math",
        "latency"
      ],
      "title": "Queuing Theory for Systems Engineers",
      "url": "https://www.mauriciopoppe.com/notes/queuing-theory-for-systems-engineers/",
      "wordCount": 3368
    },
    {
      "date": "2026-08-23",
      "interactive": true,
      "isFavorite": true,
      "lastmod": "2026-09-11",
      "readingTime": 10,
      "relUrl": "/notes/performance-fundamentals/",
      "series": "Systems Performance Engineering",
      "seriesUrl": "/series/systems-performance-engineering/",
      "summary": "Core concepts in systems performance engineering: formalizing latency, throughput, and resource utilization, Little's Law, and analyzing multi-worker queue dynamics and diurnal traffic cycles with interactive simulators.",
      "tags": [
        "performance",
        "system design",
        "queuing theory",
        "latency",
        "throughput"
      ],
      "title": "Performance Fundamentals",
      "url": "https://www.mauriciopoppe.com/notes/performance-fundamentals/",
      "wordCount": 2025
    },
    {
      "date": "2026-05-09",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2026-09-04",
      "readingTime": 8,
      "relUrl": "/notes/return-of-the-builder/",
      "series": "",
      "seriesUrl": "",
      "summary": "I think the cost of building things has changed a lot lately. For a while in my career, being an engineer meant spending more time on \"alignment\" and design docs than on actual code. But with the way agents are working now, I feel like we're going back to a time where the most important thing you can do is just build.",
      "tags": [
        "career",
        "ai",
        "agents",
        "software-engineering",
        "productivity"
      ],
      "title": "Return of the Builder",
      "url": "https://www.mauriciopoppe.com/notes/return-of-the-builder/",
      "wordCount": 1507
    },
    {
      "date": "2026-01-19",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2026-09-04",
      "readingTime": 4,
      "relUrl": "/notes/home-server-setup/",
      "series": "",
      "seriesUrl": "",
      "summary": "Bootstrapping a home server on an Orange Pi 5 using Gemini and SSHFS.",
      "tags": [
        "ai",
        "gemini",
        "devops",
        "orangepi",
        "sshfs",
        "productivity",
        "self-hosted",
        "docker"
      ],
      "title": "Building a Home Server with Orange Pi 5 and Gemini",
      "url": "https://www.mauriciopoppe.com/notes/home-server-setup/",
      "wordCount": 746
    },
    {
      "date": "2026-01-19",
      "interactive": false,
      "isFavorite": true,
      "lastmod": "2026-11-21",
      "readingTime": 12,
      "relUrl": "/notes/learning-japanese/",
      "series": "",
      "seriesUrl": "",
      "summary": "I've been learning Japanese since December 2025. In this article, I share my goals and the tools and strategies I'm using to learn this new language.",
      "tags": [
        "learning",
        "languages",
        "japanese",
        "life"
      ],
      "title": "Learning Japanese",
      "url": "https://www.mauriciopoppe.com/notes/learning-japanese/",
      "wordCount": 2540
    },
    {
      "date": "2025-10-13",
      "interactive": false,
      "isFavorite": true,
      "lastmod": "2026-11-21",
      "readingTime": 9,
      "relUrl": "/notes/learning-french/",
      "series": "",
      "seriesUrl": "",
      "summary": "I've been learning French on my own since mid 2024. I'm progressing in my fluency, and I can\nunderstand and speak it with relative comfort. In this article, I share how I'm learning\nthis new language.",
      "tags": [
        "learning",
        "languages",
        "french",
        "life"
      ],
      "title": "Learning French",
      "url": "https://www.mauriciopoppe.com/notes/learning-french/",
      "wordCount": 1906
    },
    {
      "date": "2025-06-21",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2026-09-04",
      "readingTime": 6,
      "relUrl": "/notes/tmux-to-zellij/",
      "series": "",
      "seriesUrl": "",
      "summary": "I spent a few weeks using Zellij to see if it could be a replacement for Tmux.\nIt had some things I liked for a terminal multiplexer, but a few\nthings that I didn't like eventually sent me back to my reliable Tmux setup.",
      "tags": [
        "tmux",
        "zellij",
        "terminal",
        "productivity"
      ],
      "title": "Tmux to Zellij (and back)",
      "url": "https://www.mauriciopoppe.com/notes/tmux-to-zellij/",
      "wordCount": 1115
    },
    {
      "date": "2024-12-01",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2026-10-28",
      "readingTime": 3,
      "relUrl": "/notes/backing-track-for-open-mic/",
      "series": "",
      "seriesUrl": "",
      "summary": "I perform in open mics in my spare time. When I decide to perform a cover of\na song, I usually play the guitar and sing. Therefore, I prepare\na backing track without the tracks I use as background music during\nthe performance.\n\nIn this article, I show how to ask a coding agent to create a backing track using\nthe open-mic project, yt-dlp, Demucs, and FFmpeg.",
      "tags": [
        "life",
        "karaoke",
        "open mic",
        "demucs",
        "ffmpeg",
        "guitar",
        "singing",
        "music",
        "bachata"
      ],
      "title": "Creating a Backing Track from Your Favorite Song for an Open Mic",
      "url": "https://www.mauriciopoppe.com/notes/backing-track-for-open-mic/",
      "wordCount": 611
    },
    {
      "date": "2024-11-17",
      "interactive": false,
      "isFavorite": true,
      "lastmod": "2026-09-02",
      "readingTime": 9,
      "relUrl": "/notes/bachata/",
      "series": "",
      "seriesUrl": "",
      "summary": "This is my bachata dancing journey. I talk about how I first got started with bachata and what motivated me to keep going. I talk about my experiences at bachata festivals and how they've helped me to grow as a dancer. Finally, I also share some of my favorite bachata dancers and bachata combos that I've learned over the years.",
      "tags": [
        "life",
        "dancing",
        "bachata",
        "singing",
        "open mic",
        "guitar",
        "music"
      ],
      "title": "Bachata",
      "url": "https://www.mauriciopoppe.com/notes/bachata/",
      "wordCount": 1756
    },
    {
      "date": "2024-11-10",
      "interactive": false,
      "isFavorite": true,
      "lastmod": "2026-09-04",
      "readingTime": 5,
      "relUrl": "/notes/documenting-my-life/",
      "series": "",
      "seriesUrl": "",
      "summary": "Ordinary moments may not seem valuable now, but they will become more so over time.\nWe might think that mundane things will stay the same forever, but they don't.\nI decided to document my life by journaling, printing pictures, and making vlogs.",
      "tags": [
        "life",
        "productivity",
        "habits",
        "journaling"
      ],
      "title": "Documenting my life",
      "url": "https://www.mauriciopoppe.com/notes/documenting-my-life/",
      "wordCount": 1020
    },
    {
      "date": "2023-04-30",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2026-09-02",
      "readingTime": 1,
      "relUrl": "/notes/computer-science/system-design/kubernetes/",
      "series": "",
      "seriesUrl": "",
      "summary": "Kubernetes is an open-source container orchestration platform that automates the deployment, scaling, and management of containerized applications.",
      "tags": [
        "system design",
        "distributed systems",
        "container orchestration",
        "scaling",
        "user namespace"
      ],
      "title": "Kubernetes",
      "url": "https://www.mauriciopoppe.com/notes/computer-science/system-design/kubernetes/",
      "wordCount": 56
    },
    {
      "date": "2022-05-11",
      "interactive": false,
      "isFavorite": true,
      "lastmod": "2026-09-04",
      "readingTime": 10,
      "relUrl": "/notes/productivity-skills/",
      "series": "",
      "seriesUrl": "",
      "summary": "I try to improve my productivity every day to get better use of my time. This article summarizes my day-to-day productivity framework and how it has evolved from traditional multitasking and manual terminal tools to modern workflows using AI agents. These are divided into: getting used to multitasking, having time for deep focus, managing emails, task management, note retrieval with NotebookLM, deep research, and development tools.",
      "tags": [
        "life",
        "software engineer",
        "task management",
        "time management",
        "productivity",
        "ai",
        "agents",
        "notebooklm"
      ],
      "title": "Productivity",
      "url": "https://www.mauriciopoppe.com/notes/productivity-skills/",
      "wordCount": 2012
    },
    {
      "date": "2020-10-12",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2025-10-12",
      "readingTime": 27,
      "relUrl": "/notes/software-engineer-interview-preparation/",
      "series": "",
      "seriesUrl": "",
      "summary": "This is my interview preparation plan for a software engineering role.\nI share a summary of my preparation, a plan of problems to tackle for\ncoding interviews, the topics to study for system design interviews, and\nthe questions to prepare for the behavioral section.",
      "tags": [
        "interview preparation",
        "software engineering",
        "system design",
        "coding interview",
        "behavioral interview"
      ],
      "title": "Preparation for a Software Engineer Interview",
      "url": "https://www.mauriciopoppe.com/notes/software-engineer-interview-preparation/",
      "wordCount": 5691
    },
    {
      "date": "2020-08-08",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2025-09-07",
      "readingTime": 6,
      "relUrl": "/notes/computer-science/system-design/back-of-the-envelope-calculations/",
      "series": "",
      "seriesUrl": "",
      "summary": "When designing a system, it's important to consider the limitations of the technologies chosen. Making some approximate calculations when the system is designed helps us decide on the tradeoffs of the different approaches. These approximations include: This article has a table with latency comparison numbers, common numbers used in system design calculations, and some challenges to put all of this info into practice.",
      "tags": [
        "system design",
        "architecture",
        "scalability",
        "back of the envelope"
      ],
      "title": "Back of the envelope calculations",
      "url": "https://www.mauriciopoppe.com/notes/computer-science/system-design/back-of-the-envelope-calculations/",
      "wordCount": 1196
    },
    {
      "date": "2020-06-25",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2026-09-02",
      "readingTime": 1,
      "relUrl": "/notes/computer-science/artificial-intelligence/machine-learning/introduction/",
      "series": "",
      "seriesUrl": "",
      "summary": "A very brief introduction to what ML is for and the problems to which it\ncan be applied, along with some example applications.",
      "tags": [
        "ai",
        "machine learning",
        "artificial intelligence"
      ],
      "title": "Introduction to Machine Learning",
      "url": "https://www.mauriciopoppe.com/notes/computer-science/artificial-intelligence/machine-learning/introduction/",
      "wordCount": 212
    },
    {
      "date": "2020-05-25",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2025-09-07",
      "readingTime": 2,
      "relUrl": "/notes/computer-science/artificial-intelligence/machine-learning/glossary/",
      "series": "",
      "seriesUrl": "",
      "summary": "A glossary of terms used in machine learning. For an up-to-date glossary, also check https://developers.google.com/machine-learning/glossary.",
      "tags": [
        "machine learning",
        "iterations",
        "batch",
        "epoch",
        "k-fold",
        "feature extraction",
        "sampling"
      ],
      "title": "Machine Learning Glossary",
      "url": "https://www.mauriciopoppe.com/notes/computer-science/artificial-intelligence/machine-learning/glossary/",
      "wordCount": 244
    },
    {
      "date": "2020-05-25",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2025-09-07",
      "readingTime": 2,
      "relUrl": "/notes/computer-science/artificial-intelligence/machine-learning/hyperparameter-tuning/",
      "series": "",
      "seriesUrl": "",
      "summary": "Hyperparameter tuning is the process of finding the optimal hyperparameters (the parameters fed into the model for it to change its inner parameters) for a model to converge efficiently through trial and error.",
      "tags": [
        "machine learning",
        "hyperparameter tuning"
      ],
      "title": "Hyperparameter tuning",
      "url": "https://www.mauriciopoppe.com/notes/computer-science/artificial-intelligence/machine-learning/hyperparameter-tuning/",
      "wordCount": 223
    },
    {
      "date": "2020-05-09",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2025-09-07",
      "readingTime": 4,
      "relUrl": "/notes/computer-science/data-structures/data-structures-for-massive-datasets/",
      "series": "",
      "seriesUrl": "",
      "summary": "The algorithms that we use every day to manipulate data assume that we have access to all\nthe data we need. What if there's more data than can fit on a single computer, or if accessing\nthe data itself to do searches is expensive? If so, we can use specialized data structures\nthat can help us \"estimate\" the actual value without actually computing it. In some cases,\nan estimate might be good enough. These data structures include the count-min sketch, bloom filters,\nand reservoir sampling.",
      "tags": [
        "data structures",
        "big data",
        "probability",
        "count-min sketch",
        "bloom filters",
        "reservoir-sampling"
      ],
      "title": "Data structures for massive datasets",
      "url": "https://www.mauriciopoppe.com/notes/computer-science/data-structures/data-structures-for-massive-datasets/",
      "wordCount": 812
    },
    {
      "date": "2020-03-16",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2026-09-02",
      "readingTime": 3,
      "relUrl": "/notes/computer-science/artificial-intelligence/machine-learning/expectation-maximization/",
      "series": "",
      "seriesUrl": "",
      "summary": "Expectation maximization is a method of finding maximum likelihood estimates of the parameters of a model.\nThe method alternates between making an expectation (E) step based on the current estimate of\nthe parameters and a maximization (M) step, which computes new parameters.",
      "tags": [
        "machine learning",
        "expectation maximization",
        "k-means clustering",
        "gaussian distribution",
        "multivariate gaussian distribution",
        "probability"
      ],
      "title": "Expectation maximization",
      "url": "https://www.mauriciopoppe.com/notes/computer-science/artificial-intelligence/machine-learning/expectation-maximization/",
      "wordCount": 528
    },
    {
      "date": "2020-03-05",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2025-09-07",
      "readingTime": 5,
      "relUrl": "/notes/mathematics/probability/bayesian-networks/",
      "series": "",
      "seriesUrl": "",
      "summary": "A Bayesian network is a directed graph in which each node is annotated with quantitative probability\ninformation. This article covers the definition of a Bayesian network with a graphical representation,\nthe determination of independence between variables, and the problem of finding the probability\ndistribution of a set of query values given some observed events.",
      "tags": [
        "math",
        "probability",
        "bayesian networks",
        "exact inference",
        "conditional independence relations",
        "full joint distribution"
      ],
      "title": "Bayesian Networks",
      "url": "https://www.mauriciopoppe.com/notes/mathematics/probability/bayesian-networks/",
      "wordCount": 1006
    },
    {
      "date": "2020-02-29",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2026-09-02",
      "readingTime": 2,
      "relUrl": "/notes/computer-science/system-design/kafka/",
      "series": "",
      "seriesUrl": "",
      "summary": "Kafka is a distributed event streaming platform designed for building high-throughput, fault-tolerant, and scalable data streaming applications. This article covers key designs in Kafka, such as how messages for a topic are shared into partitions assigned to brokers. Then, we see some guarantees about producers, consumers, and consumer groups.",
      "tags": [
        "system design",
        "distributed systems",
        "producer consumer",
        "message broker",
        "data streams",
        "partitioning"
      ],
      "title": "Kafka",
      "url": "https://www.mauriciopoppe.com/notes/computer-science/system-design/kafka/",
      "wordCount": 321
    },
    {
      "date": "2020-02-29",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2026-09-04",
      "readingTime": 5,
      "relUrl": "/notes/computer-science/data-structures/memtable-sstable/",
      "series": "",
      "seriesUrl": "",
      "summary": "The pattern of batching data in memory, tracking it in a write-ahead log, and periodically flushing it to disk is ubiquitous today. Open-source examples include LevelDB, Cassandra, InfluxDB, and HBase. In this article, I implement a tiny memtable for a time-series database in Go and briefly talk about how it can be compressed into a sorted string table.",
      "tags": [
        "memtable",
        "sorted string table",
        "data structures",
        "big data",
        "linked list"
      ],
      "title": "Memtable \u0026 SSTable (Sorted String Table)",
      "url": "https://www.mauriciopoppe.com/notes/computer-science/data-structures/memtable-sstable/",
      "wordCount": 891
    },
    {
      "date": "2020-02-28",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2025-09-07",
      "readingTime": 5,
      "relUrl": "/notes/computer-science/system-design/cassandra/",
      "series": "",
      "seriesUrl": "",
      "summary": "Cassandra is a highly scalable, distributed NoSQL (non-relational) database management system designed for handling large amounts of data across multiple commodity servers. This article covers key design features of Cassandra, such as the usage of consistent hashing, the write pattern to a write-ahead log and a memtable, the read pattern from the memtable and from SSTables, and, most importantly, some examples of data modeling for different types of queries.",
      "tags": [
        "system design",
        "distributed systems",
        "databases",
        "columnar datastore",
        "memtable",
        "sstable",
        "quorum",
        "data modeling"
      ],
      "title": "Cassandra",
      "url": "https://www.mauriciopoppe.com/notes/computer-science/system-design/cassandra/",
      "wordCount": 989
    },
    {
      "date": "2018-01-08",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2026-09-04",
      "readingTime": 3,
      "relUrl": "/notes/computer-science/system-design/partitioning/",
      "series": "",
      "seriesUrl": "",
      "summary": "Data partitioning refers to the process of dividing a system's data into smaller, more manageable subsets, which are distributed across multiple storage locations or nodes. This article covers several strategies for partitioning, including random partitioning, by hash key, by range, and a hybrid approach for skewed workloads. It also discusses strategies to rebalance partitions, whether there's a static or dynamic number of partitions.",
      "tags": [
        "distributed-systems",
        "data modeling",
        "system design",
        "partitioning"
      ],
      "title": "Partitioning",
      "url": "https://www.mauriciopoppe.com/notes/computer-science/system-design/partitioning/",
      "wordCount": 534
    },
    {
      "date": "2018-01-02",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2025-09-07",
      "readingTime": 2,
      "relUrl": "/notes/computer-science/system-design/non-functional-requirements/",
      "series": "",
      "seriesUrl": "",
      "summary": "Non-functional requirements refer to quality attributes or system characteristics that describe how well a software system or solution performs or behaves. This article covers well-known non-functional requirements such as reliability, availability, scalability, performance, and durability.",
      "tags": [
        "system design",
        "availability",
        "scalability",
        "reliability",
        "performance",
        "durability"
      ],
      "title": "Non Functional Requirements",
      "url": "https://www.mauriciopoppe.com/notes/computer-science/system-design/non-functional-requirements/",
      "wordCount": 244
    },
    {
      "date": "2017-09-16",
      "interactive": true,
      "isFavorite": true,
      "lastmod": "2026-09-02",
      "readingTime": 16,
      "relUrl": "/notes/computer-science/computation/promises/",
      "series": "",
      "seriesUrl": "",
      "summary": "Futures/promises refer to constructs used to synchronize program execution. Learning how they work under the hood by implementing them is a great fundamental skill to have. This article is about writing an A+ Promise implementation from scratch, following the A+ promise spec in JavaScript the TDD way.",
      "tags": [
        "Promises",
        "JavaScript",
        "Futures",
        "Software Engineering"
      ],
      "title": "Implementing an A+ Conformant Promise Library in JavaScript the TDD Way",
      "url": "https://www.mauriciopoppe.com/notes/computer-science/computation/promises/",
      "wordCount": 3198
    },
    {
      "date": "2017-05-21",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2025-09-07",
      "readingTime": 5,
      "relUrl": "/notes/mathematics/number-theory/divisibility/",
      "series": "",
      "seriesUrl": "",
      "summary": "Let $a,b \\in \\mathbb{Z}$. We say that $a$ _**divides**_ $b$, written $a \\given b$, if there's an integer $n$ such that $b = na$. If $a$ divides $b$, then $b$ is _**divisible**_ by $a$, and $a$ is a _**divisor or factor**_ of $b$. Also, $b$ is called a _**multiple**_ of $a$. This article covers the greatest common divisor and how to find it using the Euclidean Algorithm, the Extended Euclidean Algorithm to find solutions to the equation $ax + by = gcd(a, b)$ where $x, y$ are unknowns.",
      "tags": [
        "math",
        "number theory",
        "divisibility",
        "modulo",
        "euclidean algorithm",
        "extended euclidean algorithm"
      ],
      "title": "Divisibility",
      "url": "https://www.mauriciopoppe.com/notes/mathematics/number-theory/divisibility/",
      "wordCount": 1052
    },
    {
      "date": "2016-06-03",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2026-08-29",
      "readingTime": 4,
      "relUrl": "/notes/computer-graphics/surface-shading/",
      "series": "",
      "seriesUrl": "",
      "summary": "Surface shading colors a surface to mimic how objects look in real life. This article covers the variables shared by shading models, then the models themselves: flat, Lambertian diffuse, Blinn-Phong specular, and ambient.",
      "tags": [
        "shading",
        "surface",
        "computer graphics"
      ],
      "title": "Surface Shading",
      "url": "https://www.mauriciopoppe.com/notes/computer-graphics/surface-shading/",
      "wordCount": 728
    },
    {
      "date": "2016-04-29",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2026-09-02",
      "readingTime": 4,
      "relUrl": "/notes/computer-graphics/first-person-camera/",
      "series": "",
      "seriesUrl": "",
      "summary": "A first-person camera captures objects from the viewpoint of a player character. Orbiting with mouse pitch and yaw, coordinate space transformations, pitch clamping, and 6-DOF quaternion camera comparison.",
      "tags": [
        "computer graphics",
        "camera",
        "first-person",
        "pov",
        "euler angles",
        "linear algebra",
        "quaternions"
      ],
      "title": "First-Person Camera",
      "url": "https://www.mauriciopoppe.com/notes/computer-graphics/first-person-camera/",
      "wordCount": 727
    },
    {
      "date": "2016-04-26",
      "interactive": true,
      "isFavorite": true,
      "lastmod": "2026-09-04",
      "readingTime": 12,
      "relUrl": "/notes/computer-graphics/quaternions/",
      "series": "Computer Graphics Pipeline",
      "seriesUrl": "/series/computer-graphics-pipeline/",
      "summary": "Quaternions represent 3D orientations on a 4D hypersphere without gimbal lock. Rotor construction, sandwich product proofs, Rodrigues equivalence, SLERP, composition, and the Three.js API, with an interactive flight simulator.",
      "tags": [
        "quaternions",
        "3d",
        "computer graphics",
        "rotation"
      ],
      "title": "Quaternions",
      "url": "https://www.mauriciopoppe.com/notes/computer-graphics/quaternions/",
      "wordCount": 2392
    },
    {
      "date": "2016-04-05",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2025-09-07",
      "readingTime": 1,
      "relUrl": "/notes/computer-science/operating-systems/bin/gcc/",
      "series": "",
      "seriesUrl": "",
      "summary": "GCC is a suite of compilers for various programming languages, including C and C++. In this article,\nI cover the compilation stages and the flags used to compile source code into a binary.",
      "tags": [
        "gcc",
        "build tools",
        "tooling",
        "c++",
        "c"
      ],
      "title": "gcc",
      "url": "https://www.mauriciopoppe.com/notes/computer-science/operating-systems/bin/gcc/",
      "wordCount": 195
    },
    {
      "date": "2016-03-31",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2025-09-07",
      "readingTime": 9,
      "relUrl": "/notes/computer-science/operating-systems/bin/make/",
      "series": "",
      "seriesUrl": "",
      "summary": "`Make` is a build automation tool commonly used in software development to compile source code and create executable programs or other output files. It automates the process of building complex software projects, including compiling source code, linking object files, and creating executable files or other types of output. In this article, I cover the following: targets and prerequisites, variables, recipes to build an out-of-date target, and finally, an example of how to use it in a simple C++ project.",
      "tags": [
        "make",
        "makefile",
        "tooling",
        "build automation tools",
        "c++",
        "c"
      ],
      "title": "make",
      "url": "https://www.mauriciopoppe.com/notes/computer-science/operating-systems/bin/make/",
      "wordCount": 1809
    },
    {
      "date": "2016-03-31",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2025-09-07",
      "readingTime": 3,
      "relUrl": "/notes/computer-science/operating-systems/bin/cmake/",
      "series": "",
      "seriesUrl": "",
      "summary": "CMake is a cross-platform build system generator of `Makefile`s. Projects specify their build process with platform-independent CMake listfiles included in each directory of a source tree with the name `CMakeLists.txt`. This article explains how to use CMake to build projects.",
      "tags": [
        "cmake",
        "tooling",
        "build automation tools",
        "c++",
        "c"
      ],
      "title": "CMake",
      "url": "https://www.mauriciopoppe.com/notes/computer-science/operating-systems/bin/cmake/",
      "wordCount": 455
    },
    {
      "date": "2016-03-26",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2025-09-07",
      "readingTime": 16,
      "relUrl": "/notes/computer-science/programming-languages/cpp-refresher/",
      "series": "",
      "seriesUrl": "",
      "summary": "Refresher notes on C++, including the mechanics of a C++ program, program structure, pointers, functions, classes, and miscellaneous operations.",
      "tags": [
        "c++",
        "c",
        "pointers",
        "classes",
        "multithreading"
      ],
      "title": "C++ refresher",
      "url": "https://www.mauriciopoppe.com/notes/computer-science/programming-languages/cpp-refresher/",
      "wordCount": 3234
    },
    {
      "date": "2016-03-16",
      "interactive": true,
      "isFavorite": false,
      "lastmod": "2026-09-02",
      "readingTime": 3,
      "relUrl": "/notes/computer-graphics/culling-clipping/",
      "series": "Computer Graphics Pipeline",
      "seriesUrl": "/series/computer-graphics-pipeline/",
      "summary": "Before rasterization, primitives must be checked against the camera's view volume. Culling discards geometry that is not visible from the camera to save processing time, while clipping removes the parts of primitives that fall outside the view volume.",
      "tags": [
        "computer graphics",
        "culling",
        "clipping",
        "geometry",
        "3d"
      ],
      "title": "Culling \u0026 Clipping",
      "url": "https://www.mauriciopoppe.com/notes/computer-graphics/culling-clipping/",
      "wordCount": 513
    },
    {
      "date": "2016-03-15",
      "interactive": true,
      "isFavorite": false,
      "lastmod": "2026-09-02",
      "readingTime": 5,
      "relUrl": "/notes/mathematics/geometry/affine-spaces/",
      "series": "",
      "seriesUrl": "",
      "summary": "An affine space is a generalization of the notion of a vector space, but without the requirement of a fixed origin or a notion of \"zero\".",
      "tags": [
        "math",
        "geometry",
        "affine geometry",
        "affine spaces"
      ],
      "title": "Affine spaces",
      "url": "https://www.mauriciopoppe.com/notes/mathematics/geometry/affine-spaces/",
      "wordCount": 937
    },
    {
      "date": "2016-03-14",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2026-09-02",
      "readingTime": 3,
      "relUrl": "/notes/mathematics/geometry/vector-spaces/",
      "series": "",
      "seriesUrl": "",
      "summary": "A vector space is a set whose elements are called \"vectors\" (denoted as $\\v{v}$ or $\\mathbf{v}$), which have two operations defined on them: addition of vectors and multiplication of a scalar by a vector. This article covers some examples of vector spaces, bases of vector spaces, and linear maps.",
      "tags": [
        "math",
        "mathematics",
        "vector spaces",
        "geometry",
        "computer graphics",
        "linear algebra"
      ],
      "title": "Vector spaces",
      "url": "https://www.mauriciopoppe.com/notes/mathematics/geometry/vector-spaces/",
      "wordCount": 545
    },
    {
      "date": "2016-03-10",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2026-09-02",
      "readingTime": 2,
      "relUrl": "/notes/mathematics/geometry/triangle/",
      "series": "",
      "seriesUrl": "",
      "summary": "In an affine space, any point can be represented by the sum of an origin point plus a set\nof scaled vectors. This article covers defining all the points in a triangle within an affine space.",
      "tags": [
        "math",
        "mathematics",
        "geometry",
        "triangle",
        "affine spaces",
        "affine geometry"
      ],
      "title": "Triangle in affine spaces",
      "url": "https://www.mauriciopoppe.com/notes/mathematics/geometry/triangle/",
      "wordCount": 299
    },
    {
      "date": "2016-03-09",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2025-09-07",
      "readingTime": 3,
      "relUrl": "/notes/mathematics/geometry/geometric-tests/",
      "series": "",
      "seriesUrl": "",
      "summary": "Different algorithms to test geometric properties, such as finding the intersection of two lines.",
      "tags": [
        "math",
        "geometry",
        "euclidean geometry",
        "line line intersection"
      ],
      "title": "Geometric tests",
      "url": "https://www.mauriciopoppe.com/notes/mathematics/geometry/geometric-tests/",
      "wordCount": 440
    },
    {
      "date": "2016-03-08",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2026-08-29",
      "readingTime": 3,
      "relUrl": "/notes/computer-graphics/screen-space/",
      "series": "Computer Graphics Pipeline",
      "seriesUrl": "/series/computer-graphics-pipeline/",
      "summary": "The last matrix in the 3D to 2D pipeline is the viewport transform. It maps normalized device coordinates, the cube $[-1, 1]^3$, onto the actual grid of screen pixels through linear interpolation, and it produces the viewport transformation matrix.",
      "tags": [
        "computer graphics",
        "transformation matrix",
        "viewport transform",
        "3d",
        "2d"
      ],
      "title": "Screen Space",
      "url": "https://www.mauriciopoppe.com/notes/computer-graphics/screen-space/",
      "wordCount": 449
    },
    {
      "date": "2016-03-08",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2026-08-29",
      "readingTime": 3,
      "relUrl": "/notes/computer-graphics/normals/",
      "series": "Computer Graphics Pipeline",
      "seriesUrl": "/series/computer-graphics-pipeline/",
      "summary": "A **normal vector** to a curve at a particular point is a vector perpendicular to the *tangent* vector of the curve at that point (also called a *gradient*).",
      "tags": [
        "computer graphics",
        "geometry",
        "normal"
      ],
      "title": "Normals",
      "url": "https://www.mauriciopoppe.com/notes/computer-graphics/normals/",
      "wordCount": 436
    },
    {
      "date": "2016-03-07",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2025-09-07",
      "readingTime": 2,
      "relUrl": "/notes/mathematics/linear-algebra/eigenvalues-and-eigenvectors/",
      "series": "",
      "seriesUrl": "",
      "summary": "An eigenvalue represents how an object scales (or stretches/compresses) a particular direction (or eigenvector) when acted upon by the object. This article covers how to find these values in a square matrix, as well as their applicability in computer graphics.",
      "tags": [
        "math",
        "linear algebra",
        "eigenvalue",
        "eigenvector",
        "computer graphics"
      ],
      "title": "Eigenvalues and eigenvectors",
      "url": "https://www.mauriciopoppe.com/notes/mathematics/linear-algebra/eigenvalues-and-eigenvectors/",
      "wordCount": 418
    },
    {
      "date": "2016-03-04",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2025-09-07",
      "readingTime": 4,
      "relUrl": "/notes/mathematics/geometry/projective-space/",
      "series": "",
      "seriesUrl": "",
      "summary": "In projective geometry, unlike Euclidean geometry, two parallel lines meet at a point. Desargues\nintroduced the concept of a line at infinity where a point at infinity can be defined. This article\ncovers the need for a point at infinity in projective space, the line at infinity, and the projective plane.",
      "tags": [
        "math",
        "geometry",
        "projective geometry",
        "projective space"
      ],
      "title": "Projective space",
      "url": "https://www.mauriciopoppe.com/notes/mathematics/geometry/projective-space/",
      "wordCount": 650
    },
    {
      "date": "2016-02-26",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2026-08-29",
      "readingTime": 4,
      "relUrl": "/notes/computer-graphics/ray-tracing/",
      "series": "",
      "seriesUrl": "",
      "summary": "Ray tracing is the process of identifying the color of all the pixels on a 2D screen by emitting rays from all the pixels, simulating how light travels in real life. This article covers the math for ray generation from each pixel for both orthographic and perspective cameras.",
      "tags": [
        "computer graphics",
        "ray tracing",
        "orthographic projection",
        "perspective projection"
      ],
      "title": "Ray Tracing",
      "url": "https://www.mauriciopoppe.com/notes/computer-graphics/ray-tracing/",
      "wordCount": 661
    },
    {
      "date": "2016-02-26",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2026-08-29",
      "readingTime": 2,
      "relUrl": "/notes/computer-graphics/rendering/",
      "series": "",
      "seriesUrl": "",
      "summary": "Rendering is a process that takes as input a set of objects and produces as its output an array of pixels (image), each of which stores information about the color of the image at a particular point in a grid (determined by the target width and height).",
      "tags": [
        "computer graphics",
        "rendering"
      ],
      "title": "Rendering",
      "url": "https://www.mauriciopoppe.com/notes/computer-graphics/rendering/",
      "wordCount": 392
    },
    {
      "date": "2016-02-14",
      "interactive": true,
      "isFavorite": true,
      "lastmod": "2026-09-02",
      "readingTime": 12,
      "relUrl": "/notes/computer-graphics/projection-transform/",
      "series": "Computer Graphics Pipeline",
      "seriesUrl": "/series/computer-graphics-pipeline/",
      "summary": "Objects in a 3D scene reach the screen through projection. This article derives the orthographic and perspective projection matrices that map view-space points into the canonical view volume.",
      "tags": [
        "computer graphics",
        "transformation matrix",
        "orthographic projection",
        "perspective projection",
        "3d",
        "2d"
      ],
      "title": "The Projection Transform",
      "url": "https://www.mauriciopoppe.com/notes/computer-graphics/projection-transform/",
      "wordCount": 2476
    },
    {
      "date": "2016-02-13",
      "interactive": true,
      "isFavorite": true,
      "lastmod": "2026-08-29",
      "readingTime": 7,
      "relUrl": "/notes/computer-graphics/view-transform/",
      "series": "Computer Graphics Pipeline",
      "seriesUrl": "/series/computer-graphics-pipeline/",
      "summary": "The view transform maps objects from world space to view space, placing the camera at the origin. This article builds the camera coordinate frame from camera, at, and up, derives the view matrix, and explores the transform interactively.",
      "tags": [
        "computer graphics",
        "transformation matrix",
        "view transform",
        "3d",
        "2d",
        "coordinate systems"
      ],
      "title": "The View Transform",
      "url": "https://www.mauriciopoppe.com/notes/computer-graphics/view-transform/",
      "wordCount": 1342
    },
    {
      "date": "2016-02-10",
      "interactive": true,
      "isFavorite": true,
      "lastmod": "2026-08-29",
      "readingTime": 4,
      "relUrl": "/notes/computer-graphics/combining-transformations/",
      "series": "Computer Graphics Pipeline",
      "seriesUrl": "/series/computer-graphics-pipeline/",
      "summary": "Taking multiple matrices, each encoding a single transformation, and combining them\nis how we transform vectors between different spaces. This article covers creating a\ntransformation matrix that combines a rotation followed by a translation, a translation\nfollowed by a rotation, and why the order of the multiplication matters.",
      "tags": [
        "computer graphics",
        "transformation matrix",
        "linear algebra"
      ],
      "title": "Combining Matrix Transformations",
      "url": "https://www.mauriciopoppe.com/notes/computer-graphics/combining-transformations/",
      "wordCount": 850
    },
    {
      "date": "2016-02-06",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2026-08-29",
      "readingTime": 2,
      "relUrl": "/notes/computer-graphics/perspective-projection/",
      "series": "Computer Graphics Pipeline",
      "seriesUrl": "/series/computer-graphics-pipeline/",
      "summary": "Perspective projection is a fundamental projection technique that transforms objects in a higher dimension to a lower dimension. This transformation is usually used for objects in a 3D world to be rendered into a screen (a 2D surface). In the transformation, these objects give the realistic impression of depth. This article covers the math behind it and how to generate the transformation matrix to achieve the transformation.",
      "tags": [
        "computer graphics",
        "perspective projection"
      ],
      "title": "Perspective Projection",
      "url": "https://www.mauriciopoppe.com/notes/computer-graphics/perspective-projection/",
      "wordCount": 400
    },
    {
      "date": "2016-02-05",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2026-08-29",
      "readingTime": 3,
      "relUrl": "/notes/computer-graphics/orthographic-projection/",
      "series": "Computer Graphics Pipeline",
      "seriesUrl": "/series/computer-graphics-pipeline/",
      "summary": "Orthographic projection is a dimension-reducing operation: a point is projected onto an axis in 2D or a plane in 3D by zeroing the coordinate along the perpendicular direction, which keeps parallel lines parallel. This article derives the projection matrices for cardinal axes and planes, and then for an arbitrary axis or plane.",
      "tags": [
        "computer graphics",
        "orthographic projection"
      ],
      "title": "Orthographic Projection",
      "url": "https://www.mauriciopoppe.com/notes/computer-graphics/orthographic-projection/",
      "wordCount": 480
    },
    {
      "date": "2016-02-05",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2026-08-29",
      "readingTime": 4,
      "relUrl": "/notes/computer-graphics/translation/",
      "series": "Computer Graphics Pipeline",
      "seriesUrl": "/series/computer-graphics-pipeline/",
      "summary": "We build different types of transformation matrices to translate objects along cardinal axes and arbitrary axes in 2D and 3D with matrix multiplication!",
      "tags": [
        "computer graphics",
        "transformation matrix",
        "2d",
        "3d",
        "linear algebra",
        "translation"
      ],
      "title": "Translation",
      "url": "https://www.mauriciopoppe.com/notes/computer-graphics/translation/",
      "wordCount": 649
    },
    {
      "date": "2016-02-05",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2026-08-29",
      "readingTime": 5,
      "relUrl": "/notes/computer-graphics/euler-angles/",
      "series": "Computer Graphics Pipeline",
      "seriesUrl": "/series/computer-graphics-pipeline/",
      "summary": "Euler angles describe the orientation of a rigid body with three numbers: yaw, pitch, and roll. This article covers how a sequence of three rotations encodes orientation, the intrinsic vs extrinsic distinction, coordinate frame conversions, and why gimbal lock pushes real systems toward quaternions.",
      "tags": [
        "geometry",
        "rotation",
        "computer graphics",
        "euler angles",
        "quaternions"
      ],
      "title": "Euler Angles",
      "url": "https://www.mauriciopoppe.com/notes/computer-graphics/euler-angles/",
      "wordCount": 946
    },
    {
      "date": "2016-02-05",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2026-08-29",
      "readingTime": 2,
      "relUrl": "/notes/computer-graphics/shearing/",
      "series": "Computer Graphics Pipeline",
      "seriesUrl": "/series/computer-graphics-pipeline/",
      "summary": "Shearing is a transformation that skews the coordinate space. The idea is to add a multiple of one coordinate to another.",
      "tags": [
        "computer graphics",
        "transformation matrix",
        "shearing",
        "2d",
        "3d",
        "linear algebra"
      ],
      "title": "Shearing",
      "url": "https://www.mauriciopoppe.com/notes/computer-graphics/shearing/",
      "wordCount": 290
    },
    {
      "date": "2015-12-15",
      "interactive": true,
      "isFavorite": false,
      "lastmod": "2026-09-04",
      "readingTime": 4,
      "relUrl": "/notes/computer-graphics/rotation/",
      "series": "Computer Graphics Pipeline",
      "seriesUrl": "/series/computer-graphics-pipeline/",
      "summary": "Rotation transforms in 2D and 3D space, cardinal axis rotation matrices, arbitrary axis rotation with Rodrigues' formula, and quaternion rotor foundations.",
      "tags": [
        "rotation",
        "quaternions",
        "2d",
        "3d",
        "computer graphics"
      ],
      "title": "Rotation",
      "url": "https://www.mauriciopoppe.com/notes/computer-graphics/rotation/",
      "wordCount": 704
    },
    {
      "date": "2015-10-20",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2026-08-29",
      "readingTime": 3,
      "relUrl": "/notes/computer-graphics/scale/",
      "series": "Computer Graphics Pipeline",
      "seriesUrl": "/series/computer-graphics-pipeline/",
      "summary": "We build different types of transformation matrices to scale objects along cardinal axes and arbitrary axes in 2D and 3D with matrix multiplication!",
      "tags": [
        "computer graphics",
        "transformation matrix",
        "2d",
        "3d",
        "linear algebra",
        "scaling"
      ],
      "title": "Scaling",
      "url": "https://www.mauriciopoppe.com/notes/computer-graphics/scale/",
      "wordCount": 563
    },
    {
      "date": "2015-10-15",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2026-09-06",
      "readingTime": 5,
      "relUrl": "/notes/computer-graphics/transformation-matrix/",
      "series": "Computer Graphics Pipeline",
      "seriesUrl": "/series/computer-graphics-pipeline/",
      "summary": "A transformation matrix encodes a linear transformation as a grid of numbers. The rows or columns record where the basis vectors land, so multiplying a vector by the matrix applies the transformation. Matrices compose through multiplication, which is why the rendering pipeline stores every step as one matrix.",
      "tags": [
        "computer graphics",
        "transformation matrix",
        "2d",
        "3d",
        "linear algebra",
        "geometry",
        "quaternions"
      ],
      "title": "Transformation Matrix",
      "url": "https://www.mauriciopoppe.com/notes/computer-graphics/transformation-matrix/",
      "wordCount": 890
    },
    {
      "date": "2015-10-15",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2026-08-29",
      "readingTime": 4,
      "relUrl": "/notes/computer-graphics/coordinate-systems/",
      "series": "Computer Graphics Pipeline",
      "seriesUrl": "/series/computer-graphics-pipeline/",
      "summary": "The position and orientation of an object in real life can be described with\ndirection and magnitude, e.g., the TV is 3 meters in front of me. While that description is good\nfor me, it might be that for someone else in a room, the TV is 5 meters to the right of that\nperson. Information about objects is given in the context of a reference frame.\nUsually, in Computer Graphics, objects need to be expressed with respect to the camera frame.\nThis article covers why we need to have multiple reference frames and the math\nneeded to express objects in a different reference frame.",
      "tags": [
        "computer graphics",
        "transformation matrix",
        "coordinate systems",
        "object space",
        "upright space",
        "world space"
      ],
      "title": "Coordinate Systems",
      "url": "https://www.mauriciopoppe.com/notes/computer-graphics/coordinate-systems/",
      "wordCount": 826
    },
    {
      "date": "2015-09-08",
      "interactive": true,
      "isFavorite": false,
      "lastmod": "2026-09-02",
      "readingTime": 8,
      "relUrl": "/notes/mathematics/numeral-systems/complex-numbers/",
      "series": "",
      "seriesUrl": "",
      "summary": "Imaginary numbers were invented to solve problems for equations with no real roots. Complex numbers extend imaginary numbers by adding a real number. This article covers the definition of complex numbers and operations such as addition, product, norm, conjugate, inverse, and square root. Finally, this article covers the geometric and polar representations of complex numbers.",
      "tags": [
        "math",
        "numeral systems",
        "complex numbers",
        "imaginary numbers"
      ],
      "title": "Complex Numbers",
      "url": "https://www.mauriciopoppe.com/notes/mathematics/numeral-systems/complex-numbers/",
      "wordCount": 1510
    },
    {
      "date": "2015-07-07",
      "interactive": true,
      "isFavorite": false,
      "lastmod": "2026-09-02",
      "readingTime": 1,
      "relUrl": "/notes/computer-science/data-structures/graphs/special/hamiltonian_graphs/",
      "series": "",
      "seriesUrl": "",
      "summary": "Hamiltonian graphs and Hamiltonian cycles.",
      "tags": [
        "graph theory",
        "hamiltonian graph",
        "hamiltonian cycle"
      ],
      "title": "Hamiltonian Graphs",
      "url": "https://www.mauriciopoppe.com/notes/computer-science/data-structures/graphs/special/hamiltonian_graphs/",
      "wordCount": 107
    },
    {
      "date": "2015-07-05",
      "interactive": true,
      "isFavorite": false,
      "lastmod": "2026-09-02",
      "readingTime": 7,
      "relUrl": "/notes/computer-science/data-structures/graphs/special/eulerian-graphs/",
      "series": "",
      "seriesUrl": "",
      "summary": "This article discusses Eulerian circuits and trails in graphs. An Eulerian circuit is a closed trail that contains every edge of a graph, and an Eulerian trail is an open trail that contains all the edges of a graph but doesn't end in the same start vertex. This article also explains the Königsberg Bridge Problem and why it's impossible to find a trail in it. Finally, there are two implementations in C++ to find Eulerian trails in directed and undirected graphs.",
      "tags": [
        "graph theory",
        "eulerian graph",
        "eulerian trail"
      ],
      "title": "Eulerian Graph and Eulerian Trails",
      "url": "https://www.mauriciopoppe.com/notes/computer-science/data-structures/graphs/special/eulerian-graphs/",
      "wordCount": 1288
    },
    {
      "date": "2015-07-03",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2025-09-07",
      "readingTime": 6,
      "relUrl": "/notes/computer-science/data-structures/graphs/single-source-shortest-path/",
      "series": "",
      "seriesUrl": "",
      "summary": "Given a weighted graph $G$ with $V$ vertices and $E$ edges, where all the weights are non-negative, and a source vertex $s$, the single-source shortest path problem consists of finding the distance from $s$ to all other vertices. In this article, I describe the problem in a weighted and unweighted graph, as well as implementations using BFS for unweighted graphs and Dijkstra's algorithm for weighted graphs using an array and a priority queue.",
      "tags": [
        "graph theory",
        "single source shortest path",
        "weighted graph",
        "unweighted graph",
        "dijkstra",
        "bfs",
        "set",
        "priority queue"
      ],
      "title": "Single Source Shortest Path (SSSP) in a graph",
      "url": "https://www.mauriciopoppe.com/notes/computer-science/data-structures/graphs/single-source-shortest-path/",
      "wordCount": 1255
    },
    {
      "date": "2015-06-30",
      "interactive": true,
      "isFavorite": false,
      "lastmod": "2026-09-02",
      "readingTime": 1,
      "relUrl": "/notes/computer-science/data-structures/graphs/tree/introduction/",
      "series": "",
      "seriesUrl": "",
      "summary": "An introduction to trees in graph theory.",
      "tags": [
        "graph theory",
        "tree"
      ],
      "title": "Introduction to Trees in Graph Theory",
      "url": "https://www.mauriciopoppe.com/notes/computer-science/data-structures/graphs/tree/introduction/",
      "wordCount": 61
    },
    {
      "date": "2015-06-25",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2025-09-07",
      "readingTime": 5,
      "relUrl": "/notes/computer-science/data-structures/graphs/components/",
      "series": "",
      "seriesUrl": "",
      "summary": "A strongly connected component of a directed graph is a subgraph in which there exists a path from every vertex to every other vertex in the subgraph. In this article, I implement Tarjan's algorithm to find strongly connected components in a graph.",
      "tags": [
        "graph theory",
        "tarjan's algorithm",
        "strongly connected components"
      ],
      "title": "Strongly Connected Components in Graph Theory",
      "url": "https://www.mauriciopoppe.com/notes/computer-science/data-structures/graphs/components/",
      "wordCount": 918
    },
    {
      "date": "2015-06-24",
      "interactive": true,
      "isFavorite": false,
      "lastmod": "2026-09-02",
      "readingTime": 12,
      "relUrl": "/notes/computer-science/data-structures/graphs/tree/spanning-tree/",
      "series": "",
      "seriesUrl": "",
      "summary": "This article covers the minimum spanning tree (MST). MSTs have important applications; for example, they can be used to minimize the cost of building a communication network or to identify important features or patterns in a dataset. I implement the Prim and Kruskal algorithms to find the minimum spanning tree in a graph, with different implementations for sparse and dense graphs. With the theory covered, I also implement an algorithm to find the number of minimal spanning trees in a graph.",
      "tags": [
        "minimum spanning tree",
        "prim",
        "kruskal",
        "graph theory",
        "disjoint set",
        "union find"
      ],
      "title": "Minimum Spanning Tree",
      "url": "https://www.mauriciopoppe.com/notes/computer-science/data-structures/graphs/tree/spanning-tree/",
      "wordCount": 2554
    },
    {
      "date": "2015-06-24",
      "interactive": true,
      "isFavorite": false,
      "lastmod": "2026-09-02",
      "readingTime": 7,
      "relUrl": "/notes/computer-science/data-structures/graphs/cut-vertices/",
      "series": "",
      "seriesUrl": "",
      "summary": "A vertex $v$ in a connected graph $G$ is called a **cut-vertex** if $G - v$ results in a disconnected graph. Note that $G - v$ is an induced subgraph of $G$ (meaning that $G - v$ contains all the vertices of $G$ except $v$ and a set of edges $G - E_v$, where $E_v$ consists of all the edges incident to $v$). In this article, I implement an algorithm to find the articulation points in an undirected graph. I also explain biconnected components in an undirected graph and concepts such as edge connectivity and vertex connectivity.",
      "tags": [
        "graph theory",
        "cut vertices",
        "articulation points",
        "biconnected components",
        "edge connectivity",
        "vertex connectivity",
        "depth first search"
      ],
      "title": "Cut-vertices (articulation points) in Graph Theory",
      "url": "https://www.mauriciopoppe.com/notes/computer-science/data-structures/graphs/cut-vertices/",
      "wordCount": 1423
    },
    {
      "date": "2015-06-24",
      "interactive": true,
      "isFavorite": false,
      "lastmod": "2026-09-02",
      "readingTime": 4,
      "relUrl": "/notes/computer-science/data-structures/graphs/cut-edges/",
      "series": "",
      "seriesUrl": "",
      "summary": "An edge $e = uv$ of a connected graph $G$ is called a bridge if $G - e$ is disconnected (it increases the number of components). In this article, I implement an algorithm to find the bridges of an undirected graph using DFS. Next, I describe an algorithm to find strong bridges in directed graphs.",
      "tags": [
        "graph theory",
        "cut edges",
        "bridges",
        "depth first search"
      ],
      "title": "Cut-edges (bridges) in Graph Theory",
      "url": "https://www.mauriciopoppe.com/notes/computer-science/data-structures/graphs/cut-edges/",
      "wordCount": 795
    },
    {
      "date": "2015-06-24",
      "interactive": true,
      "isFavorite": false,
      "lastmod": "2026-09-02",
      "readingTime": 2,
      "relUrl": "/notes/computer-science/data-structures/graphs/topological-sorting/",
      "series": "",
      "seriesUrl": "",
      "summary": "Topological sorting is a linear ordering of the vertices of a directed acyclic graph (DAG) such that for every directed edge (u, v), vertex u comes before vertex v in the ordering. In other words, it is a way to order the vertices of a DAG such that there are no directed cycles. In this article, I implement the topological sorting algorithm and provide an example of how to use it to find the shortest path in a directed acyclic graph.",
      "tags": [
        "graph theory",
        "topological sorting",
        "dag",
        "graph cycles"
      ],
      "title": "Topological sorting of a graph",
      "url": "https://www.mauriciopoppe.com/notes/computer-science/data-structures/graphs/topological-sorting/",
      "wordCount": 410
    },
    {
      "date": "2015-06-24",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2025-09-07",
      "readingTime": 5,
      "relUrl": "/notes/computer-science/data-structures/graphs/traversal/",
      "series": "",
      "seriesUrl": "",
      "summary": "There are many ways to traverse a graph. For example, through breadth-first search and depth-first search. Exploring it with a breadth-first search has interesting properties, like implicitly computing the distance from a source $s$ to all the reachable vertices. Exploring it with a depth-first search has properties related to edges, like finding back edges, forward edges, and cross edges. This article has implementations for both BFS and DFS.",
      "tags": [
        "graph theory",
        "bfs",
        "dfs",
        "cycle finding",
        "tree edge",
        "back edge",
        "forward edge",
        "cross edge"
      ],
      "title": "Traversal of graphs",
      "url": "https://www.mauriciopoppe.com/notes/computer-science/data-structures/graphs/traversal/",
      "wordCount": 965
    },
    {
      "date": "2015-06-22",
      "interactive": true,
      "isFavorite": true,
      "lastmod": "2026-09-02",
      "readingTime": 12,
      "relUrl": "/notes/computer-science/data-structures/graphs/introduction/",
      "series": "",
      "seriesUrl": "",
      "summary": "Graph theory has numerous applications in real life. It can be used in problems found in social networks, transportation networks, the internet, chemistry, computer science, and electrical networks, among others. In general, any problem that involves relationships between objects can be modeled as a graph.",
      "tags": [
        "graph theory",
        "directed graph",
        "undirected graph",
        "complete graph",
        "dense graph",
        "sparse graph",
        "complement graph",
        "bipartite graph",
        "k-partite graph",
        "biconnected graph",
        "multigraphs",
        "pseudographs",
        "weighted graph",
        "digraphs",
        "degree"
      ],
      "title": "Introduction to Graph Theory",
      "url": "https://www.mauriciopoppe.com/notes/computer-science/data-structures/graphs/introduction/",
      "wordCount": 2400
    },
    {
      "date": "2015-06-14",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2025-09-07",
      "readingTime": 8,
      "relUrl": "/notes/mathematics/number-theory/integer-factorization/",
      "series": "",
      "seriesUrl": "",
      "summary": "Integer factorization is the process of decomposing a *composite* number into a product of smaller integers, if these integers are restricted to be prime numbers then the process is called **prime factorization**. This article covers factorization using trial division and fermat factorization through Pollard's Rho algorithm and using the sieve of eratosthenes.",
      "tags": [
        "math",
        "number theory",
        "integer factorization",
        "divisibility",
        "prime factorization",
        "erathosthenes sieve",
        "prime numbers"
      ],
      "title": "Integer Factorization",
      "url": "https://www.mauriciopoppe.com/notes/mathematics/number-theory/integer-factorization/",
      "wordCount": 1626
    },
    {
      "date": "2015-06-13",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2025-09-07",
      "readingTime": 4,
      "relUrl": "/notes/mathematics/number-theory/divisor-function/",
      "series": "",
      "seriesUrl": "",
      "summary": "The divisor function returns the number of divisors of an integer. This article\ncovers important relations of the divisor function and prime numbers.",
      "tags": [
        "math",
        "number theory",
        "divisor function",
        "prime numbers"
      ],
      "title": "Divisor Function",
      "url": "https://www.mauriciopoppe.com/notes/mathematics/number-theory/divisor-function/",
      "wordCount": 681
    },
    {
      "date": "2015-06-11",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2025-10-11",
      "readingTime": 7,
      "relUrl": "/notes/mathematics/number-theory/primality-test/",
      "series": "",
      "seriesUrl": "",
      "summary": "A prime number is a natural number greater than $1$ which has no positive divisors other than $1$ and itself. This article covers different algorithms for checking if a number is prime or not, including a naive test, the Eratosthenes Sieve, the Euler Primality Test, and the Miller-Rabin Primality Test.",
      "tags": [
        "math",
        "number theory",
        "prime numbers",
        "erathostenes sieve",
        "fermat primality test",
        "euler primality test",
        "miller-rabin primality test"
      ],
      "title": "Primality Test",
      "url": "https://www.mauriciopoppe.com/notes/mathematics/number-theory/primality-test/",
      "wordCount": 1386
    },
    {
      "date": "2015-06-09",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2025-09-07",
      "readingTime": 5,
      "relUrl": "/notes/mathematics/number-theory/special-factorial-modulo-m/",
      "series": "",
      "seriesUrl": "",
      "summary": "Let $n!_{\\\\%p}$ be a special factorial where $n!$ is divided by the maximum exponent of $p$\nthat divides $n!$. This article describes this problem and its solution, with\nan implementation in C++.",
      "tags": [
        "math",
        "number theory",
        "prime numbers",
        "modular arithmetic",
        "divisibility"
      ],
      "title": "Special factorial modulo p",
      "url": "https://www.mauriciopoppe.com/notes/mathematics/number-theory/special-factorial-modulo-m/",
      "wordCount": 854
    },
    {
      "date": "2015-06-09",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2025-09-07",
      "readingTime": 2,
      "relUrl": "/notes/mathematics/number-theory/prime-factors-factorial/",
      "series": "",
      "seriesUrl": "",
      "summary": "This article describes and implements a solution for the following problem:\ngiven two numbers $n$ and $k$ find the greatest power of $k$ that divides $n!$",
      "tags": [
        "math",
        "number theory",
        "prime numbers",
        "integer factorization"
      ],
      "title": "Prime factors of a factorial",
      "url": "https://www.mauriciopoppe.com/notes/mathematics/number-theory/prime-factors-factorial/",
      "wordCount": 255
    },
    {
      "date": "2015-06-08",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2025-09-07",
      "readingTime": 3,
      "relUrl": "/notes/mathematics/number-theory/discrete-logarithm/",
      "series": "",
      "seriesUrl": "",
      "summary": "The discrete logarithm finds a solution for $x$ in the congruence $a^x \\equiv b \\pmod{n}$ where\n$a$, $b$, and $n$ are **integers**, $a$ and $n$ are coprime. This article covers two algorithms to solve this\nproblem: by trial multiplication and using Baby Step Giant Step.",
      "tags": [
        "math",
        "number theory",
        "discrete logarithm"
      ],
      "title": "Discrete Logarithm",
      "url": "https://www.mauriciopoppe.com/notes/mathematics/number-theory/discrete-logarithm/",
      "wordCount": 588
    },
    {
      "date": "2015-06-05",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2025-09-07",
      "readingTime": 3,
      "relUrl": "/notes/mathematics/number-theory/chinese-remainder-theorem/",
      "series": "",
      "seriesUrl": "",
      "summary": "The Chinese Remainder Theorem (CRT) is a theorem that deals with finding a solution to a system of congruences. This article covers the definition of the CRT and an example implementation in C++.",
      "tags": [
        "math",
        "number theory",
        "chinese remainder theorem",
        "congruences"
      ],
      "title": "Chinese Remainder Theorem",
      "url": "https://www.mauriciopoppe.com/notes/mathematics/number-theory/chinese-remainder-theorem/",
      "wordCount": 609
    },
    {
      "date": "2015-06-04",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2025-09-07",
      "readingTime": 5,
      "relUrl": "/notes/mathematics/number-theory/modular-arithmetic/",
      "series": "",
      "seriesUrl": "",
      "summary": "Modular arithmetic is a type of arithmetic that deals with integers and remains within a fixed range of values. It involves performing arithmetic operations such as addition, subtraction, multiplication, and division, but with the added concept of a \"modulus\" or a \"mod\" value. This article covers the definition of a congruence relation, and some of its properties like addition, multiplication, exponentiation, and inverse. Next, I show how we can use the Extended Euclidean Algorithm to find the modular multiplicative inverse in a general case and in the case of coprime numbers.",
      "tags": [
        "math",
        "number theory",
        "divisibility",
        "modulo"
      ],
      "title": "Modular Arithmetic",
      "url": "https://www.mauriciopoppe.com/notes/mathematics/number-theory/modular-arithmetic/",
      "wordCount": 1002
    },
    {
      "date": "2015-06-02",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2025-09-07",
      "readingTime": 4,
      "relUrl": "/notes/mathematics/number-theory/extended-euclidean-algorithm/",
      "series": "",
      "seriesUrl": "",
      "summary": "The Extended Euclidean Algorithm finds solutions to the equation $ax + by = gcd(a, b)$\nwhere $x, y$ are unknowns. This article covers a few applications of the Extended Euclidean Algorithm\nlike finding the modular multiplicative inverse of a number and finding solutions for\nlinear congruence equations.",
      "tags": [
        "math",
        "number theory",
        "divisibility",
        "modulo",
        "linear congruence equations",
        "mudular multiplicative inverse",
        "extended euclidean algorithm",
        "euclidean algorithm",
        "diophantine equations"
      ],
      "title": "Extended Euclidean Algorithm",
      "url": "https://www.mauriciopoppe.com/notes/mathematics/number-theory/extended-euclidean-algorithm/",
      "wordCount": 815
    },
    {
      "date": "2015-06-01",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2025-09-07",
      "readingTime": 2,
      "relUrl": "/notes/mathematics/number-theory/euclidean-algorithm/",
      "series": "",
      "seriesUrl": "",
      "summary": "The Euclidean Algorithm finds the greatest common divisor of two numbers. In this article\nI implement the algorithm from scratch in C++.",
      "tags": [
        "math",
        "number theory",
        "divisibility",
        "modulo",
        "euclidean algorithm",
        "greatest common divisor",
        "gcd"
      ],
      "title": "Euclidean Algorithm",
      "url": "https://www.mauriciopoppe.com/notes/mathematics/number-theory/euclidean-algorithm/",
      "wordCount": 425
    },
    {
      "date": "2015-06-01",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2025-09-07",
      "readingTime": 1,
      "relUrl": "/notes/mathematics/number-theory/erathostenes-sieve/",
      "series": "",
      "seriesUrl": "",
      "summary": "The Eratosthenes Sieve is an algorithm to find prime numbers up to a positive number $n$\nusing $O(n)$ space.",
      "tags": [
        "math",
        "number theory",
        "prime numbers",
        "erathostenes sieve"
      ],
      "title": "Eratosthenes Sieve",
      "url": "https://www.mauriciopoppe.com/notes/mathematics/number-theory/erathostenes-sieve/",
      "wordCount": 136
    },
    {
      "date": "2015-06-01",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2025-09-07",
      "readingTime": 1,
      "relUrl": "/notes/mathematics/number-theory/binary-exponentiation/",
      "series": "",
      "seriesUrl": "",
      "summary": "Given two numbers $a$ and $n$, finding $a^n$ involves performing $n$ multiplications of $a$.\nHowever, it's possible to do this in $log(n)$ operations using binary exponentiation.",
      "tags": [
        "math",
        "number theory",
        "binary exponentiation"
      ],
      "title": "Binary Exponentiation",
      "url": "https://www.mauriciopoppe.com/notes/mathematics/number-theory/binary-exponentiation/",
      "wordCount": 191
    },
    {
      "date": "2015-06-01",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2025-09-07",
      "readingTime": 3,
      "relUrl": "/notes/mathematics/number-theory/eulers-phi/",
      "series": "",
      "seriesUrl": "",
      "summary": "*Euler's phi function* represented as $\\phi(n)$ gives, for a number $n$, the number of coprimes in the range $[1..n]$; in other words, the quantity of numbers in the range $[1..n]$ whose greatest common divisor with $n$ is the unity. In this article, I try to explain how it works and implement it in C++.",
      "tags": [
        "math",
        "number theory",
        "divisibility",
        "euler's phi function",
        "prime numbers",
        "greatest common divisor",
        "gcd"
      ],
      "title": "Euler's phi function",
      "url": "https://www.mauriciopoppe.com/notes/mathematics/number-theory/eulers-phi/",
      "wordCount": 513
    },
    {
      "date": "2015-04-02",
      "interactive": false,
      "isFavorite": false,
      "lastmod": "2025-09-08",
      "readingTime": 4,
      "relUrl": "/notes/mathematics/calculus/taylor-theorem-infinite-series/",
      "series": "",
      "seriesUrl": "",
      "summary": "Taylor series help approximate the value of a definite integral for a function\nwhose antiderivative is hard to find. This article explains the key ideas\nbehind Taylor's Theorem and an example of approximating its value with\na polynomial function.",
      "tags": [
        "math",
        "calculus",
        "taylor series",
        "function"
      ],
      "title": "Taylor's Theorem and Infinite Series",
      "url": "https://www.mauriciopoppe.com/notes/mathematics/calculus/taylor-theorem-infinite-series/",
      "wordCount": 772
    },
    {
      "date": "2015-04-02",
      "interactive": true,
      "isFavorite": false,
      "lastmod": "2026-09-02",
      "readingTime": 14,
      "relUrl": "/notes/mathematics/calculus/integral/",
      "series": "",
      "seriesUrl": "",
      "summary": "An integral is a mathematical concept that represents the accumulation or summing up of quantities over a certain interval or region. In this article, we'll discuss the properties\nof the integral by looking at an example of antidifferentiation and some examples\nof evaluating definite integrals.",
      "tags": [
        "math",
        "calculus",
        "integral",
        "maxima minima"
      ],
      "title": "Integral",
      "url": "https://www.mauriciopoppe.com/notes/mathematics/calculus/integral/",
      "wordCount": 2917
    },
    {
      "date": "2015-04-02",
      "interactive": true,
      "isFavorite": false,
      "lastmod": "2026-09-02",
      "readingTime": 17,
      "relUrl": "/notes/mathematics/calculus/derivative/",
      "series": "",
      "seriesUrl": "",
      "summary": "The derivative is a concept that represents the rate of change or the slope of a function at a particular point. It is a fundamental concept in calculus and is used to analyze how a function changes with respect to its input as the input changes very slightly. This article covers the physical and geometric interpretation of the derivative, as well as some applications like finding maxima and minima in a function and the Newton-Raphson method.",
      "tags": [
        "math",
        "calculus",
        "derivative",
        "maxima minima"
      ],
      "title": "Derivative",
      "url": "https://www.mauriciopoppe.com/notes/mathematics/calculus/derivative/",
      "wordCount": 3440
    },
    {
      "date": "2015-03-31",
      "interactive": true,
      "isFavorite": true,
      "lastmod": "2026-09-02",
      "readingTime": 2,
      "relUrl": "/notes/mathematics/calculus/introduction/",
      "series": "",
      "seriesUrl": "",
      "summary": "This article gives an introduction to calculus, starting with the concept of a function\nand how calculus helps us solve problems related to determining tangents to curves (expressed\nas functions), finding the minima/maxima like determining the maximum range of a projectile,\nand finding the length of curves, areas, and volumes.",
      "tags": [
        "math",
        "calculus",
        "function"
      ],
      "title": "Introduction to Calculus",
      "url": "https://www.mauriciopoppe.com/notes/mathematics/calculus/introduction/",
      "wordCount": 420
    },
    {
      "date": "2015-01-01",
      "interactive": true,
      "isFavorite": false,
      "lastmod": "2026-09-12",
      "readingTime": 18,
      "relUrl": "/notes/ux-interaction-principles/",
      "series": "",
      "seriesUrl": "",
      "summary": "The implementation reference for building UI. Design tokens, the typography and border conventions, the four interaction states, and the canonical two column widget layout, each shown with the CSS that implements it and a live example built from the real theme tokens.",
      "tags": [
        "design",
        "design system",
        "ux"
      ],
      "title": "UX Interaction Principles",
      "url": "https://www.mauriciopoppe.com/notes/ux-interaction-principles/",
      "wordCount": 3636
    }
  ],
  "title": "Notes",
  "url": "https://www.mauriciopoppe.com/notes/"
}