Related papers: Notes on the 33-point Erd\H{o}s--Szekeres problem

In this paper, we mainly focus on the set-valued (stochastic) analysis on the space of convex, closed, but possibly unbounded sets, and try to establish a useful theoretical framework for studying the set-valued stochastic differential…

We classify the class $S$ theories of type $E_7$. These are four-dimensional $\mathcal{N}=2$ superconformal field theories arising from the compactification of the $E_7$ $(2,0)$ theory on a punctured Riemann surface, $C$. The classification…

We study the problem of finding homomorphisms into odd cycles from planar graphs with high odd-girth. The Jaeger-Zhang conjecture states that every planar graph of odd-girth at least $4k+1$ admits a homomorphism to the odd cycle $C_{2k+1}$.…

The study of extremal problems on triangle areas was initiated in a series of papers by Erd\H{o}s and Purdy in the early 1970s. In this paper we present new results on such problems, concerning the number of triangles of the same area that…

We establish necessary and sufficient conditions for stochastic invariance of closed subsets in Hilbert spaces for solutions to infinite-dimensional stochastic differential equations (SDEs) under mild assumptions on the coefficients. Our…

Given an integral variation of Hodge structure $\mathbb{V}$ on a complex algebraic variety $S$, polarized by some bilinear form $Q : \mathbb{V} \otimes \mathbb{V} \to \mathbb{Z}$, it is believed that the set $\mathcal{A}^{\textrm{iso}}_{0}…

While the optimal transport (OT) problem was originally formulated as a linear program, the addition of entropic regularization has proven beneficial both computationally and statistically, for many applications. The Sinkhorn fixed-point…

The ESO-Spitzer extragalactic Imaging Survey (ESIS) is the optical follow up of the Spitzer Wide-Area InfraRed Extragalactic (SWIRE) survey in the ELAIS-S1 area. This paper presents B, V, R Wide Field Imager observations of the first 1.5…

The scenario approach is a general data-driven algorithm to chance-constrained optimization. It seeks the optimal solution that is feasible to a carefully chosen number of scenarios. A crucial step in the scenario approach is to compute the…

Extensional ESO is a fragment of existential second-order logic (ESO) that captures the following family of problems. Given a fixed ESO sentence $\Psi$ and an input structure $\mathbb A$ the task if to decide whether there is an extension…

In this paper, we study the problem of escaping from saddle points in smooth nonconvex optimization problems subject to a convex set $\mathcal{C}$. We propose a generic framework that yields convergence to a second-order stationary point of…

The Hirsch Conjecture stated that any $d$-dimensional polytope with n facets has a diameter at most equal to $n - d$. This conjecture was disproved by Santos (A counterexample to the Hirsch Conjecture, Annals of Mathematics, 172(1) 383-412,…

A multi-objective optimization problem is $C^r$ weakly simplicial if there exists a $C^r$ surjection from a simplex onto the Pareto set/front such that the image of each subsimplex is the Pareto set/front of a subproblem, where $0\leq r\leq…

The Erd\H{o}s-S\'{o}s Conjecture states that every graph with average degree more than $k-2$ contains all trees of order $k$ as subgraphs. In this paper, we consider a variation of the above conjecture: studying the maximum size of an…

An Ito-Skorokhod bi-linear equation driven by infinitely many independent colored noises is considered in a normal triple of Hilbert spaces. The special feature of the equation is the appearance of the Wick product in the definition of the…

The classical no-three-in-line problem asks for the largest number (D(n)) of points that can be chosen from an (n \times n) grid with no three collinear. We study the checkerboard-restricted variant in which all chosen points lie in one…

In 1930s Paul Erdos conjectured that for any positive integer $C$ in any infinite $\pm 1$ sequence $(x_n)$ there exists a subsequence $x_d, x_{2d}, x_{3d},\dots, x_{kd}$, for some positive integers $k$ and $d$, such that $\mid \sum_{i=1}^k…

In this paper we explicitly estimate the number of points in a subset $A \subset \R^{d}$ as a function of the maximum angle $\angle A$ that any three of these points form, provided $\angle A < \theta_d := \arccos(-\frac 1 {d}) \in…

We consider a convex relaxation of sparse principal component analysis proposed by d'Aspremont et al. in (d'Aspremont et al. SIAM Rev 49:434-448, 2007). This convex relaxation is a nonsmooth semidefinite programming problem in which the…

This work focuses on the problem of learning an unknown $3$-uniform hypergraph using edge-detecting queries. Our goal is to design a querying strategy that recovers the hyperedge set using as few queries as possible. We restrict our…