William Dudarov

activity

20222026

most citedSolving the n-color ice model

1 citations · 1 across the 4 of their papers we have counts for

collaborators

4 papers

math.PR2026

Geometric obstructions to Lipschitz transport between weighted Hessian $CD (κ, \infty)$ manifolds

William Dudarov, Dan Mikulincer

We construct a weighted Riemannian manifold $(R^{2}, g, μ)$ satisfying $CD (1/2, \infty)$ , the curvature-dimension condition, with the following property: if $γ$ denotes…

math.CO2023

On the image of graph distance matrices

William Dudarov, Noah Feinberg, Raymond Guo +5

Let $G = (V, E)$ be a finite, simple, connected, combinatorial graph on $n$ vertices and let $D \in R^{n \times n}$ be its graph distance matrix $D_{ij} = d (v_{i}, v_{j})$ . Stein…

math-ph2022★ 1 cited

Solving the n-color ice model

Patrick Addona, Ethan Bockenhauer, Ben Brubaker +14

Given an arbitrary choice of two sets of nonzero Boltzmann weights for $n$ -color lattice models, we provide explicit algebraic conditions on these Boltzmann weights which guarantee…

math.CO2022

A characterization of graphs with at most four boundary vertices

Nick Chiem, William Dudarov, Chris Lee +2

Steinerberger defined a notion of boundary for a graph and established a corresponding isoperimetric inquality. Hence, "large" graphs have more boundary vertices. In this paper, we…

Geometric obstructions to Lipschitz transport between weighted Hessian CD(κ,∞) manifolds

On the image of graph distance matrices

Solving the n-color ice model

A characterization of graphs with at most four boundary vertices

Geometric obstructions to Lipschitz transport between weighted Hessian $CD (κ, \infty)$ manifolds