Related papers: No-three-in-line sets on the checkerboard grid
We study the existence and concentration of positive and nodal solutions to a Schr\"odinger equation in the presence of a shrinking self-focusing core of arbitrary shape. Via a suitable rescaling, the concentration gives rise to a limiting…
Given a set P of n points in the plane, the two-line center problem asks to find two lines that minimize the maximum distance from each point in P to its closer one of the two resulting lines. The currently best algorithm for the problem…
In this paper, we investigate optimization problems with nonnegative and orthogonal constraints, where any feasible matrix of size $n \times p$ exhibits a sparsity pattern such that each row accommodates at most one nonzero entry. Our…
For nonnegative integers $n_2, n_3$ and $d$, let $N(n_2,n_3,d)$ denote the maximum cardinality of a code of length $n_2+n_3$, with $n_2$ binary coordinates and $n_3$ ternary coordinates (in this order) and with minimum distance at least…
We propose an adaptive refinement algorithm to solve total variation regularized measure optimization problems. The method iteratively constructs dyadic partitions of the unit cube based on i) the resolution of discretized dual problems and…
We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (globally) a discrete energy involving mean curvature. Although we…
The theory of mixed finite element methods for solving different types of elliptic partial differential equations in saddle point formulation is well established since many decades. This topic was mostly studied for variational formulations…
We use Gale duality for polynomial complete intersections and adapt the proof of the fewnomial bound for positive solutions to obtain the bound (e^4+3) 2^(k choose 2) n^k/4 for the number of non-zero real solutions to a system of n…
We study the stationary points of the hierarchical three body problem in the planetary limit (m_2, m_3 << m_1) at both the quadrupole and octupole orders. We demonstrate that the extension to octupole order preserves the principal…
Considering the static solutions of the D-dimensional nonlinear Schroedinger equation with trap and attractive two-body interactions, the existence of stable solutions is limited to a maximum critical number of particles, when D is greater…
We study hyperplane covering problems for finite grid-like structures in $\mathbb{R}^d$. We call a set $\mathcal{C}$ of points in $\mathbb{R}^2$ a conical grid if the line $y = a_i$ intersects $\mathcal{C}$ in exactly $i$ points, for some…
We introduce a cutting-plane framework for nonconvex quadratic programs (QPs) that progressively tightens convex relaxations. Our approach leverages the doubly nonnegative (DNN) relaxation to compute strong lower bounds and generate…
We present several sparsification lower and upper bounds for classic problems in graph theory and logic. For the problems 4-Coloring, (Directed) Hamiltonian Cycle, and (Connected) Dominating Set, we prove that there is no polynomial-time…
In order to study projections of smooth curves, we introduce multifiltrations obtained by combining flags of osculating spaces. We classify all configurations of singularities occurring for a projection of a smooth curve embedded by a…
Let $S$ be a set of $n$ points in $\mathbb{R}^3$, no three collinear and not all coplanar. If at most $n-k$ are coplanar and $n$ is sufficiently large, the total number of planes determined is at least $1 + k…
Nonexpansive mappings play a central role in modern optimization and monotone operator theory because their fixed points can describe solutions to optimization or critical point problems. It is known that when the mappings are sufficiently…
We consider the problem of finding a local optimum for Max-Cut with FLIP-neighborhood, in which exactly one node changes the partition. Schaeffer and Yannakakis (SICOMP, 1991) showed PLS-completeness of this problem on graphs with unbounded…
In this work, we revisit the planar restricted four-body problem to study the dynamics of an infinitesimal mass under the gravitational force produced by three heavy bodies with unequal masses, forming an equilateral triangle configuration.…
We consider the problem of computing the maximal invariant set of discrete-time linear systems subject to a class of non-convex constraints that admit quadratic relaxations. These non-convex constraints include semialgebraic sets and other…
In this paper, we propose and analyze a fast two-point gradient algorithm for solving nonlinear ill-posed problems, which is based on the sequential subspace optimization method. A complete convergence analysis is provided under the…