Nikita Gladkov

Graduate Student
UCLA Mathematics Department
Email: gladkovna@gmail.com
Office: MS 3949

Office Hours (In MS 3949):

• Math 116: Friday 4 pm - 5 pm

Currently Teaching (Spring 2025):

• Math 116 (Cryptology): Tuesday 9-10 am, Public Affairs 1337

Papers:

• On Harris–Kleitman type inequalities (with A.Zimin) (draft, 2024+)
• A lower bound on forcing numbers based on height functions (with F.Aliyev) (2024+)
• The bunkbed conjecture is false (with I.Pak and A.Zimin) (2024+), see also a blog post and a video
• Percolation inequalities and decision trees (2024+)
• Exproring mazes at random (with I.Pak) (2024+)
• Bond percolation does not simulate site percolation (with A.Zimin) (2024+)
• Positive dependence for colored percolation (with I.Pak) Letter in Physical Review E. (2024)
• A strong FKG inequality for multiple events, accepted to the Bulletin of the LMS (2024)
• The multistochastic Monge–Kantorovich problem (with A.Zimin, A.Kolesnikov) in Journal of Mathematical Analysis and Applications (2021)
• An explicit solution for a multimarginal mass transportation problem (with A.Zimin) in SIAM Journal on Mathematical Analysis (2020)
• On multistochastic Monge–Kantorovich problem, bitwise operations, and fractals (with A.Zimin, A.Kolesnikov) in Calculus of Variations and Partial Differential Equations (2019)

Talk slides:

• UCLA combinatorics seminar: Solving sudokus fractionally
• My favorite olimpiad problem (ORMC): A lower bound on forcing numbers based on height functions (see the talk on Youtube)
• Percolation Today: Percolation Inequalities and Decision Trees (see the talk on Youtube)
• LA probability forum/Algebraic and other combinatorics/UBC: The bunkbed conjecture is false
• Rutgers/Renyi/UCLA combinatorics/UCSD/Berkeley: Inequalities in Graph Percolation
• UCLA GSO: The puzzle to end all puzzles (See also a fairy tale and code)
• UCLA GSO: Finite hat puzzles
• UCLA GSO: Five proofs of the fundamental theorem of combinatorics (Tiling 10x10 square with 1x4 tiles, code is available online)
• UCLA GSO: Infinitary hat puzzles
• UCLA GSO: Mathematics of AI safety
• UCLA GSO: Small probability (philosophy and crank science)
• Eight or Nine Talks on Contemporary Optimal Transport Problems (Strasbourg): (n,k) Monge–Kantorovich problem
• HSE course paper: Knots, braids and their invariants
• Pisa Optimal Transportation and Applications, Bielefeld university: Variants of the Monge-Kantorovich problem for the cost function xyz