Related papers: The squish map and the $\text{SL}_2$ double dimer …

We present an engineered version of the divide-and-conquer algorithm for finding the closest pair of points, within a given set of points in the XY-plane. For this version of the algorithm we show that only two pairwise comparisons are…

George Andrews and Peter Paule have recently conjectured an infinite family of congruences modulo powers of 3 for the 2-elongated plane partition function $d_2(n)$. This congruence family appears difficult to prove by classical methods. We…

We design new approximation algorithms for the Multiway Cut problem, improving the previously known factor of 1.32388 [Buchbinder et al., 2013]. We proceed in three steps. First, we analyze the rounding scheme of Buchbinder et al., 2013 and…

This work is concerned with approximating matrix functions for banded matrices, hierarchically semiseparable matrices, and related structures. We develop a new divide-and-conquer method based on (rational) Krylov subspace methods for…

Partial cubes are isometric subgraphs of hypercubes. Structures on a graph defined by means of semicubes, and Djokovi\'{c}'s and Winkler's relations play an important role in the theory of partial cubes. These structures are employed in the…

We design a recursive algorithm to compute the partition function of the Ising model, summed over cubic maps with fixed size and genus. The algorithm runs in polynomial time, which is much faster than methods based on a Tutte-like, or…

We introduce elliptic weights of boxed plane partitions and prove that they give rise to a generalization of MacMahon's product formula for the number of plane partitions in a box. We then focus on the most general positive degenerations of…

The superintegrability, wavefunctions and overlap coefficients of the Dunkl oscillator model in the plane were considered in the first part. Here finite-dimensional representations of the symmetry algebra of the system, called the…

The property of preserving the convexity and concavity of the Bernstein polynomial and of the B\'{e}zier curves is used to generate a method of approximating the reliability polynomial of a hammock network. The mutual behaviour of the…

In this paper, we present a surface remeshing method with high approximation quality based on Principal Component Analysis. Given a triangular mesh and a user assigned polygon/vertex budget, traditional methods usually require the extra…

In this note we elaborate on the reduction of four dimensional Seiberg duality with adjoint matter to three dimensions. We use the exact formulation of the superconformal index and of the partition function as instruments to test this…

We develop a new approach for distributed distance computation in planar graphs that is based on a variant of the metric compression problem recently introduced by Abboud et al. [SODA'18]. One of our key technical contributions is in…

In this paper using the concept of the extended Hamming code we give a construction for dense packing of points at distance at least one in such unit cubes which dimension are a power of two.

We present bijections for the planar cases of two counting formulas on maps that arise from the KP hierarchy (Goulden-Jackson and Carrell-Chapuy formulas), relying on a "cut-and-slide" operation. This is the first time a bijective proof is…

We present results from a new Monte Carlo simulation for jet fragmentation in QCD and SUSY QCD for large primary energies $\sqrt s$ up to $10^{16}$ GeV. In the case of SUSY QCD the simulation takes into account not only gluons and quarks as…

We solve the graph bi-partitioning problem in dense graphs with arbitrary degree distribution using the replica method. We find the cut-size to scale universally with <k^1/2>. In contrast, earlier results studying the problem in graphs with…

We give approximation schemes for Subset TSP and Steiner Tree on unit disk graphs, and more generally, on intersection graphs of similarly sized connected fat (not necessarily convex) polygons in the plane. As a first step towards this…

From a scalar field defined at the corner of a cube, an isosurface can be extracted using the Marching Cube algorithm. The isosurface separates the cell into two or more partial cells. A similar situation arises when an material interface…

We present an algorithm to extract the Coulomb branch Hasse diagram of orthosymplectic 3d $\mathcal{N}=4$ quiver gauge theories. The algorithm systematically predicts all descendant theories arising from Coulomb branch Higgsing, thereby…

Over the last century, a large variety of infinite congruence families have been discovered and studied, exhibiting a great variety with respect to their difficulty. Major complicating factors arise from the topology of the associated…