相关论文: Sylvester-Gallai type theorems for approximate col…

We prove that for a residual (and hence dense) subset $\mathcal{G}$ of Riemannian metrics on $S^{n+1}$ in the $C^{3}$ topology, no area-minimizing integral $n$-current that is a boundary admits a singular tangent cone which is linearly…

There is a bijection between odd prime dimensional qudit pure stabilizer states modulo invertible scalars and affine Lagrangian subspaces of finite dimensional symplectic $\mathbb{F}_p$-vector spaces. In the language of the stabilizer…

Recently, Ji et al disproved the LU-LC conjecture and showed that the local unitary and local Clifford equivalence classes of the stabilizer states are not always the same. Despite the fact this settles the LU-LC conjecture, a sufficient…

Locally decodable codes (LDC's) are error-correcting codes that allow recovery of individual message indices by accessing only a constant number of codeword indices. For substitution errors, it is evident that LDC's exist -- Hadamard codes…

In this paper we consider the r\^ole that numerical computations -- in particular Galerkin approximations -- can play in problems modelled by the 3d Navier-Stokes equations, for which no rigorous proof of the existence of unique solutions…

We study the computation of equilibrium points of electrostatic potentials: locations in space where the electrostatic force arising from a collection of charged particles vanishes. This is a novel scenario of optimization in which…

We proceed here with our systematic study, initiated in [3], of multiscale problems with defects, within the context of homogenization theory. The case under consideration here is that of a diffusion equation with a diffusion coefficient of…

We consider a two-dimensional, pure capillary drop of nearly-circular shape, having constant vorticity. We write the Craig-Sulem equations on the unit circle, then on the flat torus. We show their Hamiltonian structure and we then observe…

In this paper, we propose a successive pseudo-convex approximation algorithm to efficiently compute stationary points for a large class of possibly nonconvex optimization problems. The stationary points are obtained by solving a sequence of…

The Big-Line-Big-Clique Conjecture of Kara, Por and Wood asserts that, for every fixed $k$ and $\ell$, every sufficiently large finite planar point set contains either $k$ collinear points or $\ell$ pairwise visible points. We prove a…

This paper provides a link between matroid theory and locally repairable codes (LRCs) that are either linear or more generally almost affine. Using this link, new results on both LRCs and matroid theory are derived. The parameters…

The first goal of this paper is to prove a sharp condition to guarantee of having a positive proportion of all congruence classes of triangles in given sets in $\mathbb{F}_q^2$. More precisely, for $A, B, C\subset \mathbb{F}_q^2$, if…

Combinatorial threshold-linear networks (CTLNs) are a special class of recurrent neural networks whose dynamics are tightly controlled by an underlying directed graph. Recurrent networks have long been used as models for associative memory…

We consider stable solutions of semilinear equations in a very general setting. The equation is set on a Polish topological space endowed with a measure and the linear operator is induced by a carr\'e du champs (equivalently, the equation…

A locally testable code (LTC) is an error-correcting code that has a property-tester. The tester reads $q$ bits that are randomly chosen, and rejects words with probability proportional to their distance from the code. The parameter $q$ is…

A locally correctable code (LCC) is an error correcting code that allows correction of any arbitrary coordinate of a corrupted codeword by querying only a few coordinates. We show that any {\em zero-error} $2$-query locally correctable code…

The stationary points of the total scalar curvature functional on the space of unit volume metrics on a given closed manifold are known to be precisely the Einstein metrics. One may consider the modified problem of finding stationary points…

This paper rigorously solves the challenging problem of recognizing periodic patterns under rigid motion in Euclidean geometry. The 3-dimensional case is practically important for justifying the novelty of solid crystalline materials…

Diophantine equations are in general undecidable, yet appear readily in string theory. We demonstrate that numerous classes of Diophantine equations arising in string theory are decidable and propose that decidability may propagate through…

Motivated by applications in spatial genomics, we revisit group testing (Dorfman~1943) and propose the class of $\lambda$-{\sf ADD}-codes, studying such codes with certain distance $d$ and codelength $n$. When $d$ is constant, we provide…