相关论文: Sylvester-Gallai type theorems for approximate col…
We consider the problem of maintaining the Euclidean Delaunay triangulation $\DT$ of a set $P$ of $n$ moving points in the plane, along algebraic trajectories of constant description complexity. Since the best known upper bound on the…
We describe a new parameterized family of symmetric error-correcting codes with low-density parity-check matrices (LDPC). Our codes can be described in two seemingly different ways. First, in relation to Reed-Muller codes: our codes are…
Little string theories (LSTs) are UV complete non-local 6D theories decoupled from gravity in which there is an intrinsic string scale. In this paper we present a systematic approach to the construction of supersymmetric LSTs via the…
A classical approach to the Calder\'on problem is to estimate the unknown conductivity by solving a nonlinear least-squares problem. It leads to a nonconvex optimization problem which is generally believed to be riddled with bad local…
This paper introduces a methodology based on Euclidean information theory to investigate local properties of secure communication over discrete memoryless wiretap channels. We formulate a constrained optimization problem that maximizes a…
Constructions of optimal locally repairable codes (LRCs) achieving Singleton-type bound have been exhaustively investigated in recent years. In this paper, we consider new bounds and constructions of Singleton-optimal LRCs with minmum…
Locally testable codes (LTC) are error-correcting codes that have a local tester which can distinguish valid codewords from words that are "far" from all codewords by probing a given word only at a very few (sublinear, typically constant)…
We provide several equivalent characterizations of locally flat, $d$-Ahlfors regular, uniformly rectifiable sets $E$ in $\mathbb{R}^n$ with density close to $1$ for any dimension $d \in \mathbb{N}$ with $1 \le d \le n-1$. In particular, we…
A zone diagram is a relatively new concept which has emerged in computational geometry and is related to Voronoi diagrams. Formally, it is a fixed point of a certain mapping, and neither its uniqueness nor its existence are obvious in…
We introduce the theory of div point sets, which aims to provide a framework to study the combinatoric nature of any set of points in general position on an Euclidean plane. We then show that proving the unsatisfiability of some first-order…
We give improved lower bounds for binary $3$-query locally correctable codes (3-LCCs) $C \colon \{0,1\}^k \rightarrow \{0,1\}^n$. Specifically, we prove: (1) If $C$ is a linear design 3-LCC, then $n \geq 2^{(1 - o(1))\sqrt{k} }$. A design…
We consider DPG methods with optimal test functions and broken test spaces based on ultra-weak formulations of general second order elliptic problems. Under some assumptions on the regularity of solutions of the model problem and its…
We generalize theorems of Deligne-Mumford and de Jong on semi-stable modifications of families of proper curves. The main result states that after a generically \'etale alteration of the base any (not necessarily proper) family of…
Locally repairable codes (LRCs) are a class of codes designed for the local correction of erasures. They have received considerable attention in recent years due to their applications in distributed storage. Most existing results on LRCs do…
In this article, we pursue our investigation of the connections between the theory of computation and hydrodynamics. We prove the existence of stationary solutions of the Euler equations in Euclidean space, of Beltrami type, that can…
Point location problems for $n$ points in $d$-dimensional Euclidean space (and $\ell_p$ spaces more generally) have typically had two kinds of running-time solutions: * (Nearly-Linear) less than $d^{poly(d)} \cdot n \log^{O(d)} n$ time, or…
We propose a multiscale method for elliptic problems on complex domains, e.g. domains with cracks or complicated boundary. For local singularities this paper also offers a discrete alternative to enrichment techniques such as XFEM. We…
We study approximate quantum low-density parity-check (QLDPC) codes, which are approximate quantum error-correcting codes specified as the ground space of a frustration-free local Hamiltonian, whose terms do not necessarily commute. Such…
Inside the moduli space of curves of genus three with one marked point, we consider the locus of hyperelliptic curves with a marked Weierstrass point, and the locus of non-hyperelliptic curves with a marked hyperflex. These loci have…
We prove an "abelian, locally compact" Whitehead theorem in fine shape: A fine shape morphism between locally connected finite-dimensional locally compact separable metrizable spaces with trivial $\pi_0$ and $\pi_1$ is a fine shape…