Related papers: Generalization of Kuratowski problem in linear spa…

By using a combination of algebraic, geometric, and dynamical techniques, together with input from higher dimensional Diophantine approximation, we give a complete characterization of all linearly repetitive cut and project sets with…

The concept of convex compactness, weaker than the classical notion of compactness, is introduced and discussed. It is shown that a large class of convex subsets of topological vector spaces shares this property and that is can be used in…

As the title suggests, this is the third paper in a series addressing bilevel optimization problems that are governed by the Kantorovich problem of optimal transport. These tasks can be reformulated as mathematical problems with…

Planar point sets with many triple lines (which contain at least three distinct points of the set) have been studied for 180 years, started with Jackson and followed by Sylvester. Green and Tao has shown recently that the maximum possible…

This manuscript extends the Cantor-Kuratowski intersection theorem from the setting of metric spaces to the setting of uniformizable spaces. Complete uniformizable spaces are revisited.

In this work, we consider a class of convex optimization problems in a real Hilbert space that can be solved by performing a single projection, i.e., by projecting an infeasible point onto the feasible set. Our results improve those…

A tensor space is a vector space equipped with a finite collection of multilinear forms. The length of a tensor space is its length as a representation of its symmetry group. Infinite dimension tensor spaces of finite length are special,…

This paper introduces a new subtraction operation for convex sets, which defines their difference as a collection of inclusion-minimal convex sets with appropriate definitions of linear operations on them. With these operations the set of…

I prove several theorems concerning upward closure and amalgamation in the generic multiverse of a countable transitive model of set theory. Every such model $W$ has forcing extensions $W[c]$ and $W[d]$ by adding a Cohen real, which cannot…

Let $C$ be a closed convex cone in ${\mathbb R}^n$, pointed and with interior points. We consider sets of the form $A=C\setminus A^\bullet$, where $A^\bullet\subset C$ is a closed convex set. If $A$ has finite volume (Lebesgue measure),…

When optimization theorists consider optimization problems in infinite dimensional spaces, they need to deal with closed convex subsets(usually cones) which mostly have empty interior. These subsets often prevent optimization theorists from…

A variant of the flatness problem from integer programming is studied, in which one considers convex bodies in $\mathbb{R}^d$ with at most $k$ interior lattice points. The maximum lattice width of such a body is denoted by Flt(d,k) and it…

The faces of a convex set owe their relevance to an interplay between convexity and topology that is systematically studied in the work of Rockafellar. Infinite-dimensional convex sets are excluded from this theory as their relative…

We propose a successive generation of cutting inequalities for binary quadratic optimization problems. Multiple cutting inequalities are successively generated for the convex hull of the set of the optimal solutions $\subset \{0, 1\}^n$,…

We study a specific convex maximization problem in n-dimensional space. The conjectured solution is proved to be a vertex of the polyhedral feasible region, but only a partial proof of local maximality is known. Integer sequences with…

We prove that each non-separable completely metrizable convex subset of a Frechet space is homeomorphic to a Hilbert space. This resolves an old (more than 30 years) problem of infinite-dimensional topology. Combined with the topological…

This paper is concerned with an optimization problem that is constrained by the Kantorovich optimal transportation problem. This bilevel optimization problem can be reformulated as a mathematical problem with complementarity constraints in…

The feedback set problems are about removing the minimum number of vertices or edges from a graph to break all its cycles. Much effort has gone into understanding their complexity on planar graphs as well as on graphs of bounded degree. We…

Given a word $w$, what is the maximum possible number of appearances of $w$ reading contiguously along any of the directions in $\{-1, 0, 1\}^d \setminus \{\mathbf{0}\}$ in a large $d$-dimensional grid (as in a word search)? Patchell and…

It is classically known that a real cubic surface in the real projective 3-space cannot have more than one solitary point (locally given by x^2+y^2+z^2=0) whereas it can have up to four nodes (x^2+y^2-z^2=0). We show that on any surface of…