Source author record

Dmitry Krachun

Explore this author’s publications, collaborators and research topics. This catalog record has not been claimed by its author.

ResearcherUnclaimed source record

Catalog footprint

Research overview

7works
8topics
4close collaborators

Published work

7 publications

preprint2026arXiv

Provable Quantization with Randomized Hadamard Transform

Vector quantization via random projection followed by scalar quantization is a fundamental primitive in machine learning, with applications ranging from similarity search to federated learning and KV cache compression. While dense random rotations yield clean theoretical guarantees, they require Θ(d2)Θ(d^2) time. The randomized Hadamard transform HDHD reduces this cost to O(dlog⁡d)O(d \log d), but its discrete structure complicates analysis and leads to weaker or purely empirical compression guarantees. In this work, we study a variant of this approach: dithered quantization with a single randomized Hadamard transform. Specifically, the quantizer applies HDHD to the input vector and subtracts a random scalar offset before quantizing, injecting additional randomness at negligible cost. We prove that this approach is unbiased and provides mean squared error bounds that asymptotically match those achievable with truly random rotation matrices. In particular, we prove that a dithered version of TurboQuant achieves mean squared error (π3/2+o(1))⋅4−b\bigl(π\sqrt{3}/2 + o(1)\bigr) \cdot 4^{-b} at bb bits per coordinate, where the o(1)o(1) term vanishes uniformly over all unit vectors and all dimensions as the number of quantization levels grows.

preprint2022arXiv

On the six-vertex model's free energy

In this paper, we provide new proofs of the existence and the condensation of Bethe roots for the Bethe Ansatz equation associated with the six-vertex model with periodic boundary conditions and an arbitrary density of up arrows (per line) in the regime Δ<1Δ<1. As an application, we provide a short, fully rigorous computation of the free energy of the six-vertex model on the torus, as well as an asymptotic expansion of the six-vertex partition functions when the density of up arrows approaches 1/21/2. This latter result is at the base of a number of recent results, in particular the rigorous proof of continuity/discontinuity of the phase transition of the random-cluster model, the localization/delocalization behaviour of the six-vertex height function when a=b=1a=b=1 and c≥1c\ge1, and the rotational invariance of the six-vertex model and the Fortuin-Kasteleyn percolation.

preprint2020arXiv

On some determinants involving Jacobi symbols

In this paper we study some conjectures on determinants with Jacobi symbol entries posed by Z.-W. Sun. For any positive integer n≡3(mod4)n\equiv3\pmod4, we show that (6,1)n=[6,1]n=(3,2)n=[3,2]n=0(6,1)_n=[6,1]_n=(3,2)_n=[3,2]_n=0 and (4,2)n=(8,8)n=(3,3)n=(21,112)n=0(4,2)_n=(8,8)_n=(3,3)_n=(21,112)_n=0 as conjectured by Sun, where (c,d)n=∣(i2+cij+dj2n)∣1≤i,j≤n−1(c,d)_n=\bigg|\left(\frac{i^2+cij+dj^2}n\right)\bigg|_{1\le i,j\le n-1} and [c,d]n=∣(i2+cij+dj2n)∣0≤i,j≤n−1[c,d]_n=\bigg|\left(\frac{i^2+cij+dj^2}n\right)\bigg|_{0\le i,j\le n-1} with (⋅n)(\frac{\cdot}n) the Jacobi symbol. We also prove that (10,9)p=0(10,9)_p=0 for any prime p≡5(mod12)p\equiv5\pmod{12}, and [5,5]p=0[5,5]_p=0 for any prime p≡13,17(mod20)p\equiv 13,17\pmod{20}, which were also conjectured by Sun. Our proofs involve character sums over finite fields.

preprint2020arXiv

On sums of four pentagonal numbers with coefficients

The pentagonal numbers are the integers given by p5(n)=n(3n−1)/2 (n=0,1,2,…)p_5(n)=n(3n-1)/2\ (n=0,1,2,\ldots). Let (b,c,d)(b,c,d) be one of the triples (1,1,2),(1,2,3),(1,2,6)(1,1,2),(1,2,3),(1,2,6) and (2,3,4)(2,3,4). We show that each n=0,1,2,…n=0,1,2,\ldots can be written as w+bx+cy+dzw+bx+cy+dz with w,x,y,zw,x,y,z pentagonal numbers, which was first conjectured by Z.-W. Sun in 2016. In particular, any nonnegative integer is a sum of five pentagonal numbers two of which are equal; this refines a classical result of Cauchy claimed by Fermat.

preprint2016arXiv

On random partitions induced by random maps

The lattice of the set partitions of [n][n] ordered by refinement is studied. Given a map ϕ:[n]→[n]ϕ: [n] \rightarrow [n], by taking preimages of elements we construct a partition of [n][n]. Suppose tt partitions p1,p2,…,ptp_1,p_2,\dots,p_t are chosen independently according to the uniform measure on the set of mappings [n]→[n][n]\rightarrow [n]. The probability that the coarsest refinement of all pip_i's is the finest partitions {{1},…,{n}}\{\{1\},\dots,\{n\}\} is shown to approach 11 for any t≥3t\geq 3 and e−1/2e^{-1/2} for t=2t=2. The probability that the finest coarsening of all pip_i's is the one-block partition is shown to approach 1 if t(n)−log⁡n→∞t(n)-\log{n}\rightarrow \infty and 00 if t(n)−log⁡n→−∞t(n)-\log{n}\rightarrow -\infty. The size of the maximal block of the finest coarsening of all pip_i's for a fixed tt is also studied.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.