<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Dp on Jasper</title><link>https://jasper-aa64.github.io/tags/dp/</link><description>Recent content in Dp on Jasper</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Tue, 28 Apr 2026 00:00:00 +0800</lastBuildDate><atom:link href="https://jasper-aa64.github.io/tags/dp/index.xml" rel="self" type="application/rss+xml"/><item><title>Matrix #1: Matrix Fast Power — Linear Recurrence, DP Semirings &amp; Kitamasa</title><link>https://jasper-aa64.github.io/posts/matrix-1-fast-exponentiation/</link><pubDate>Tue, 28 Apr 2026 00:00:00 +0800</pubDate><guid>https://jasper-aa64.github.io/posts/matrix-1-fast-exponentiation/</guid><description>Matrix fast power for linear recurrences (4 patterns), 4 semiring templates (count/bool/min-plus/max-plus), matrix+segment tree for range-add Fibonacci queries, Kitamasa O(k²logn) and NTT O(k log²k logn).</description></item><item><title>Matrix #4: Matrix Problems — Fibonacci Subarray Sums, Gaussian Elimination &amp; Expected Value</title><link>https://jasper-aa64.github.io/posts/matrix-4-problems/</link><pubDate>Tue, 28 Apr 2026 00:00:00 +0800</pubDate><guid>https://jasper-aa64.github.io/posts/matrix-4-problems/</guid><description>Hard matrix problems: Fibonacci squared subarray sum with segment-tree 4-tuple and companion matrix; cycle-decomposition partition state space for random-swap sorting, first-step analysis, and Gaussian elimination.</description></item><item><title>Number Theory #3.1: Sieve Problems — Coin System DP via Sieve</title><link>https://jasper-aa64.github.io/posts/number-theory-3-1-sieve-problems/</link><pubDate>Tue, 28 Apr 2026 00:00:00 +0800</pubDate><guid>https://jasper-aa64.github.io/posts/number-theory-3-1-sieve-problems/</guid><description>Greedy optimality for divisibility-chain coin systems, DP over the maximum denomination, and a sieve-style transition by adding one larger coin.</description></item><item><title>Combinatorics: Order Theory — Chromatic Polynomials, Chordal Graphs, Order Polynomials, Dilworth &amp; Hall</title><link>https://jasper-aa64.github.io/posts/combinatorics-order-theory/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://jasper-aa64.github.io/posts/combinatorics-order-theory/</guid><description>Chromatic polynomial, chordal/interval graphs, PEO product formula, order polynomials (chain/antichain/tree/DAG/divisor lattice), MacMahon formula, Dilworth, Mirsky, Hall&amp;rsquo;s marriage theorem, Erdős–Szekeres, missile interception.</description></item><item><title>Combinatorics #2.1: FFT and Lagrange Interpolation</title><link>https://jasper-aa64.github.io/posts/combinatorics-2-1-fft-lagrange-interpolation/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://jasper-aa64.github.io/posts/combinatorics-2-1-fft-lagrange-interpolation/</guid><description>Polynomial representations, FFT/DFT over complex numbers, Triple Sums, Fuzzy Search (difference convolution), FFT template, Lagrange interpolation (O(n²) and O(n) equidistant), sum of k-th powers, Assigning Prizes polynomial DP.</description></item><item><title>Combinatorics #1.1: Permutations and Combinations</title><link>https://jasper-aa64.github.io/posts/combinatorics-1-1-permutations-combinations/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://jasper-aa64.github.io/posts/combinatorics-1-1-permutations-combinations/</guid><description>Hockey Stick identity, addition/multiplication principles, binomial identities, example problems: bitonic sequences, multiset permutations, multi-layer coloring DP, CCPC Subpermutation.</description></item><item><title>Combinatorics D1: Diophantine Equations</title><link>https://jasper-aa64.github.io/posts/combinatorics-d1-diophantine-equations/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://jasper-aa64.github.io/posts/combinatorics-d1-diophantine-equations/</guid><description>Stars and bars, bounded Diophantine equations via inclusion-exclusion, prefix-sum DP, D&amp;amp;C NTT, equal-cap formula, and a full worked example on CF 2127F.</description></item></channel></rss>