Related papers: Scaling hypothesis for the Euclidean bipartite mat…
We introduce a new approach to the anisotropic Calder\'on problem, based on a map called Poisson embedding that identifies the points of a Riemannian manifold with distributions on its boundary. We give a new uniqueness result for a large…
In some recent papers the classical `splitting necklace theorem' is linked in an interesting way with a geometric `pattern avoidance problem'. We explore the topological constraints on the existence of a (relaxed) measurable coloring of R^d…
The calculations of the double parton scattering cross sections are discussed. It is shown that the commonly used factorised formula is valid only in the limit of low cross sections. The applicability of this approximation is studied with a…
The effect of an electric field on conduction in a disordered system is an old but largely unsolved problem. Experiments cover an wide variety of systems - amorphous/doped semiconductors, conducting polymers, organic crystals, manganites,…
We show that a generalised sparse grid combination technique which combines multi-variate extrapolation of finite difference solutions with the standard combination formula lifts a second order accurate scheme on regular meshes to a fourth…
We aim to fill a gap in the proof of an inequality relating two exponents of uniform Diophantine approximation stated in a paper by Bugeaud. We succeed to verify the inequality in several instances, in particular for small dimension.…
Dimension reduction algorithms are a crucial part of many data science pipelines, including data exploration, feature creation and selection, and denoising. Despite their wide utilization, many non-linear dimension reduction algorithms are…
The unit Euclidean distance degree and the generic Euclidean distance degree are two well-studied invariants of projective varieties. These quantities measure the algebraic complexity of nearest-point problems on a variety, and in many…
A $\Gamma$-convergence analysis is used to perform a 3D-2D dimension reduction of variational problems with linear growth. The adopted scaling gives rise to a nonlinear membrane model which, because of the presence of higher order external…
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension $d$: i) Given $n$ points in $\Rd$, compute their minimum enclosing cylinder. ii) Given two $n$-point sets in $\Rd$, decide…
This paper examines a stochastic deconvolution problem on compact symmetric spaces which is referred to as decompounding. This involves estimating the step distributions of a random walk, where in addition the number of steps between…
We derive the canonical-ensemble scaling of Tan's contact for $N$ harmonically trapped Tonks--Girardeau bosons at finite temperature in the large-$N$ limit. The leading scaling coefficient reproduces the local-density-approximation result…
In this paper we generalize a weak sequential result of \cite{fan20182} to a non-scattering solutions in dimension $d \geq 2$. No symmetry assumptions are required for the initial data. We build on a previous result of \cite{dodson20202}…
The Poisson bipolar model considers user-base station pairs distributed at random on a flat domain, similar to matchsticks scattered onto a table. Though this is a simple and tractable setting in which to study dense networks, it doesn't…
M. Goresky and R. MacPherson intersection homology is also defined from the singular chain complex of a filtered space by H. King, with a key formula to make selections among singular simplexes. This formula needs a notion of dimension for…
We give evidence for 3d bosonization in Conformal Field Theories (CFTs) by computing monopole operator scaling dimensions in 2+1 dimensional quantum electrodynamics (QED3) with Chern-Simons level $k$ and $N$ complex bosons in a large $N,k$…
Monte Carlo simulations alone could not clarify the corrections to scaling for the size-dependent p_c(L) above the upper critical dimension. Including the previous series estimate for the bulk threshold $p_c(\infty)$ gives preference for…
Arranging many modules within a bounded domain without overlap, central to the Electronic Design Automation (EDA) of very large-scale integrated (VLSI) circuits, represents a broad class of discrete geometric optimization problems with…
Classical multidimensional scaling (CMDS) is a technique that embeds a set of objects in a Euclidean space given their pairwise Euclidean distances. The main part of CMDS involves double centering a squared distance matrix and using a…
This paper describes a simple greedy D-approximation algorithm for any covering problem whose objective function is submodular and non-decreasing, and whose feasible region can be expressed as the intersection of arbitrary (closed upwards)…