arXiv subjects

Anna Kravchenko

Publications and source records attributed to Anna Kravchenko.

7 recordsLinked to original sources

arXiv2026

PlanarBench: Evaluating LLM Spatial Reasoning via Planar Graph Drawing

Existing LLM graph benchmarks typically ask models to answer graph-theoretic questions or compute symbolic solutions rather than construct spatial layouts. Within-task difficulty is also primarily stratified by vertex count. However, existing research also suggests that task difficulty is more closely related to the number of constraints imposed by the edges than to the number of vertices being arranged. We introduce PlanarBench, a benchmark that asks models to produce crossing-free ASCII drawings of planar graphs given only an edge list. Across 91 model configurations and 199 non-isomorphic connected planar graphs with 2-7 vertices, edge count is more strongly associated with mean task score than vertex count ($r=-0.85$) versus ($r=-0.47$) and remains strongly associated after controlling for vertex count ($r_p=-0.80$). PlanarBench provides a controlled setting for separating these two difficulty axes. In addition, neither drawing area nor total response length demonstrated a meaningful correlation with score, which is evidence against a simple output-size explanation. Performance varies widely: the best model scores 159.5 out of 199, most models below 30B parameters score under 25, and substantial failures remain among frontier systems.

cs.CL↗

arXiv2025

Learning complexity of many-body quantum sign structures through the lens of Boolean Fourier analysis

We study sign structures of the ground states of spin-$1/2$ magnetic systems using the methods of Boolean Fourier analysis. Previously it was shown that the sign structures of frustrated systems are of complex nature: specifically, neural networks of popular architectures lack the generalization ability necessary to effectively reconstruct sign structures in supervised learning settings. This is believed to be an obstacle for applications of neural quantum states to frustrated systems. In the present work, we develop an alternative language for the analysis of sign structures based on representing them as polynomial functions defined on the Boolean hypercube - an approach called Boolean Fourier analysis. We discuss the relations between the properties of the Boolean Fourier series and the learning complexity of sign structures, and demonstrate that such polynomials can potentially serve as variational ans\"atze for the complex sign structures that dramatically outperform neural networks in terms of generalization ability. While ans\"atze of this type cannot yet be directly used in the context of variational optimization, they indicate that the complexity of sign structures is not an insurmountable curse, and can potentially be learned with better designed NQS architectures. Finally, we show how augmenting data with Boolean functions can aid sign prediction by neural networks.

cond-mat.dis-nn↗

arXiv2024

Multi-scale structural complexity as a quantitative measure of visual complexity

While intuitive for humans, the concept of visual complexity is hard to define and quantify formally. We suggest adopting the multi-scale structural complexity (MSSC) measure, an approach that defines structural complexity of an object as the amount of dissimilarities between distinct scales in its hierarchical organization. In this work, we apply MSSC to the case of visual stimuli, using an open dataset of images with subjective complexity scores obtained from human participants (SAVOIAS). We demonstrate that MSSC correlates with subjective complexity on par with other computational complexity measures, while being more intuitive by definition, consistent across categories of images, and easier to compute. We discuss objective and subjective elements inherently present in human perception of complexity and the domains where the two are more likely to diverge. We show how the multi-scale nature of MSSC allows further investigation of complexity as it is perceived by humans.

physics.soc-ph↗

arXiv2019

Automorphisms of Kronrod-Reeb graphs of Morse functions on 2-torus

This paper is devoted to the study of special subgroups of the automorphism groups of Kronrod-Reeb graphs of a Morse functions on $2$-torus $T^2$ which arise from the action of diffeomorphisms preserving a given Morse function on $T^2$. In this paper we give a full description of such classes of groups.

math.GT↗

arXiv2019

Automorphisms of cellular divisions of $2$-sphere induced by functions with isolated critical points

Let $f:S^2\to \mathbb{R}$ be a Morse function on the $2$-sphere and $K$ be a connected component of some level set of $f$ containing at least one saddle critical point. Then $K$ is a $1$-dimensional CW-complex cellularly embedded into $S^2$, so the complement $S^2\setminus K$ is a union of open $2$-disks $D_1,\ldots, D_k$. Let $\mathcal{S}_{K}(f)$ be the group of isotopic to the identity diffeomorphisms of $S^2$ leaving invariant $K$ and also each level set $f^{-1}(c)$, $c\in\mathbb{R}$. Then each $h\in \mathcal{S}_{K}(f)$ induces a certain permutation $σ_{h}$ of those disks. Denote by $G = \{ σ_h \mid h \in \mathcal{S}_{K}(f)\}$ be the group of all such permutations. We prove that $G$ is isomorphic to a finite subgroup of $SO(3)$.

math.GT↗

arXiv2019

Automorphisms of Kronrod-Reeb graphs of Morse functions on 2-sphere

Let $M$ be a compact two-dimensional manifold and, $f \in C^{\infty}(M,\mathbb{R})$ be a Morse function, and $Γ_f$ be its Kronrod-Reeb graph. Denote by $\mathcal{O}_{f}=\{f \circ h \mid h \in \mathcal{D}\}$ the orbit of $f$ with respect to the natural right action of the group of diffeomorphisms $\mathcal{D}$ on $C^{\infty}(M,\mathbb{R})$, and by $\mathcal{S}(f)=\{h\in\mathcal{D} \mid f \circ h = f\}$ the corresponding stabilizer of this function. It is easy to show that each $h\in\mathcal{S}(f)$ induces a homeomorphism of $Γ_f$. Let also $\mathcal{D}_{\mathrm{id}}(M)$ be the identity path component of $\mathcal{D}(M)$, $\mathcal{S}'(f)= \mathcal{S}(f) \cap \mathcal{D}_{\mathrm{id}}(M)$ be group of diffeomorphisms of $M$ preserving $f$ and isotopic to identity map, and $G_f$ be the group of homeomorphisms of the graph $Γ_f$ induced by diffeomorphisms belonging to $\mathcal{S}'(f)$. This group is one of the key ingredients for calculating the homotopy type of the orbit $\mathcal{O}_{f}$. Recently the authors described the structure of groups $G_f$ for Morse functions on all orientable surfaces distinct from $2$-torus $T^2$ and $2$-sphere $S^2$. The present paper is devoted to the case $M=S^{2}$. In this situation $Γ_f$ is always a tree, and therefore all elements of the group $G_f$ have a common fixed subtree $\mathrm{Fix}(G_f)$, which may even consist of a unique vertex. Our main result calculates the groups $G_f$ for all Morse functions $f:S^{2}\to\mathbb{R}$ whose fixed subtree $\mathrm{Fix}(G_f)$ consists of more than one point.

math.GT↗

arXiv2018

Automorphisms of Kronrod-Reeb graphs of Morse functions on compact surfaces

Let $M$ be a connected orientable compact surface, $f:M\to\mathbb{R}$ be a Morse function, and $\mathcal{D}_{\mathrm{id}}(M)$ be the group of difeomorphisms of $M$ isotopic to the identity. Denote by $\mathcal{S}'(f)=\{f\circ h = f\mid h\in\mathcal{D}_{\mathrm{id}}(M)\}$ the subgroup of $\mathcal{D}_{\mathrm{id}}(M)$ consisting of difeomorphisms "preserving" $f$, i.e. the stabilizer of $f$ with respect to the right action of $\mathcal{D}_{\mathrm{id}}(M)$ on the space $\mathcal{C}^{\infty}(M,\mathbb{R})$ of smooth functions on $M$. Let also $\mathbf{G}(f)$ be the group of automorphisms of the Kronrod-Reeb graph of $f$ induced by diffeomorphisms belonging to $\mathcal{S}'(f)$. This group is an important ingredient in determining the homotopy type of the orbit of $f$ with respect to the above action of $\mathcal{D}_{\mathrm{id}}(M)$ and it is trivial if $f$ is "generic", i.e. has at most one critical point at each level set $f^{-1}(c)$, $c\in\mathbb{R}$. For the case when $M$ is distinct from $2$-sphere and $2$-torus we present a precise description of the family $\mathbf{G}(M,\mathbb{R})$ of isomorphism classes of groups $\mathbf{G}(f)$, where $f$ runs over all Morse functions on $M$, and of its subfamily $\mathbf{G}^{smp}(M,\mathbb{R}) \subset \mathbf{G}(M,\mathbb{R})$ consisting of groups corresponding to simple Morse functions, i.e. functions having at most one critical point at each connected component of each level set. In fact, $\mathbf{G}(M,\mathbb{R})$, (resp. $\mathbf{G}^{smp}(M,\mathbb{R})$), coincides with the minimal family of isomorphism classes of groups containing the trivial group and closed with respect to direct products and also with respect to wreath products "from the top" with arbitrary finite cyclic groups, (resp. with group $\mathbb{Z}_2$ only).

math.GT↗