Related papers: The squish map and the $\text{SL}_2$ double dimer …
A new approximate scheme, DSUB$m$, is described for the coupled cluster method. We then apply it to two well-studied (spin-1/2 Heisenberg antiferromagnet) spin-lattice models, namely: the $XXZ$ and the $XY$ models on the square lattice in…
A binary extended 1-perfect code $\mathcal C$ folds over its kernel via the Steiner quadruple systems associated with its codewords. The resulting folding, proposed as a graph invariant for $\mathcal C$, distinguishes among the 361…
In this paper we consider how the following three objects are related: (i) the dual polar graphs; (ii) the quantum algebra U_q(sl_2); (iii) the Leonard systems of dual q-Krawtchouk type. For convenience we first describe how (ii) and (iii)…
We show that a purely algebraic structure, a two-dimensional scattering diagram, describes a large part of the wall-crossing behavior of moduli spaces of Bridgeland semistable objects in the derived category of coherent sheaves on…
Recent advances in the efficiency and robustness of algorithms solving convex quadratically constrained quadratic programming (QCQP) problems motivate developing techniques for creating convex quadratic relaxations that, although more…
We study certain bijection between plane partitions and $\mathbb{N}$-matrices. As applications, we prove a Cauchy-type identity for generalized dual Grothendieck polynomials. We introduce two statistics on plane partitions, whose generating…
We quantify the cosmological constraining power of the `lensing PDF' - the one-point probability density of weak lensing convergence maps - by modelling this statistic numerically with an emulator trained on $w$CDM cosmic shear simulations.…
Treemaps have been widely applied to the visualization of hierarchical data. A treemap takes a weighted tree and visualizes its leaves in a nested planar geometric shape, with sub-regions partitioned such that each sub-region has an area…
We study two fundamental problems dealing with curves in the plane, namely, the nearest-neighbor problem and the center problem. Let $\mathcal{C}$ be a set of $n$ polygonal curves, each of size $m$. In the nearest-neighbor problem, the goal…
While quantum circuits built from two-particle dual-unitary (maximally entangled) operators serve as minimal models of typically nonintegrable many-body systems, the construction and characterization of dual-unitary operators themselves are…
We present a numerical model for a two dimensional (2D) granular assembly, falling in a rectangular container when the bottom is removed. We observe the occurrence of cracks splitting the initial pile into pieces, like in experiments. We…
In this paper we generalize and improve the multiscale organization of graphs by introducing a new measure that quantifies the "closeness" between two nodes. The calculation of the measure is linear in the number of edges in the graph and…
Observables which distinguish boosted topologies from QCD jets are playing an increasingly important role at the Large Hadron Collider (LHC). These observables are often used in conjunction with jet grooming algorithms, which reduce…
To produce cartographic maps, simplification is typically used to reduce complexity of the map to a legible level. With schematic maps, however, this simplification is pushed far beyond the legibility threshold and is instead constrained by…
We compute the primary Lund plane density for jets initiated by a massive ($b$) quark to single logarithmic accuracy in Quantum Chromodynamics (QCD). In order to capture mass effects, we consider quasi-collinear factorisation and we include…
The problem of multiway partitioning of an undirected graph is considered. A spectral method is used, where the k > 2 largest eigenvalues of the normalized adjacency matrix (equivalently, the k smallest eigenvalues of the normalized graph…
Shearlet systems have been introduced as directional representation systems, which provide optimally sparse approximations of a certain model class of functions governed by anisotropic features while allowing faithful numerical realizations…
We show that any finite triangulation of the real projective plane or the dunce hat is partitionable. To prove this, we introduce simple yet useful gluing tools that allow us to reduce partitionability of a given complex to that of smaller…
We display four approximation theorems for manifold-valued mappings. The first one approximates holomorphic embeddings on pseudoconvex domains in $\Bbb C^n$ with holomorphic embeddings with dense images. The second theorem approximates…
In this work, we explore graph partitioning (GP) using quantum annealing on the D-Wave 2X machine. Motivated by a recently proposed graph-based electronic structure theory applied to quantum molecular dynamics (QMD) simulations, graph…