Related papers: The role of rationality in integer-programming rel…
We study the interaction between the group law on an elliptic curve and the additive structure of $x$-coordinates of rational points on an elliptic curve. Let $E/\mathbb{Q}$ be an elliptic curve of Mordell-Weil rank $r \geq 1$, $d \geq 1$…
Set Disjointness on a Line is a variant of the Set Disjointness problem in a distributed computing scenario with $d+1$ processors arranged on a path of length $d$. It was introduced by Le Gall and Magniez (PODC 2018) for proving lower…
We consider the global optimization of nonconvex quadratic programs and mixed-integer quadratic programs. We present a family of convex quadratic relaxations which are derived by convexifying nonconvex quadratic functions through…
We consider optimization problems containing nonconvex quadratic functions for which semidefinite programming (SDP) relaxations often yield strong bounds. We investigate linear inequalities that outer approximate the positive semidefinite…
The Lasserre hierarchy of semidefinite programming (SDP) relaxations is an effective scheme for finding computationally feasible SDP approximations of polynomial optimization over compact semi-algebraic sets. In this paper, we show that,…
We present a new framework for solving optimization problems with a diseconomy of scale. In such problems, our goal is to minimize the cost of resources used to perform a certain task. The cost of resources grows superlinearly, as $x^q$,…
Random constraint satisfaction problems (CSPs) such as random $3$-SAT are conjectured to be computationally intractable. The average case hardness of random $3$-SAT and other CSPs has broad and far-reaching implications on problems in…
The relaxation rates to the invariant density in the chaotic phase space component of the kicked rotor (standard map) are calculated analytically for a large stochasticity parameter, $K$. These rates are the logarithms of the poles of the…
We generalize the reduction mechanism for linear programming problems and semidefinite programming problems from [arXiv:1410.8816] in two ways 1) relaxing the requirement of affineness and 2) extending to fractional optimization problems.…
This paper investigates a combinatorial optimization problem motived from a secure power network design application in [D\'{a}n and Sandberg 2010]. Two equivalent graph optimization formulations are derived. One of the formulations is a…
We prove super-polynomial lower bounds on the size of linear programming relaxations for approximation versions of constraint satisfaction problems. We show that for these problems, polynomial-sized linear programs are exactly as powerful…
We present a general approach to rounding semidefinite programming relaxations obtained by the Sum-of-Squares method (Lasserre hierarchy). Our approach is based on using the connection between these relaxations and the Sum-of-Squares proof…
We study the problem of recognizing whether a given abstract simplicial complex $K$ is the $k$-skeleton of the nerve of $j$-dimensional convex sets in $\mathbb{R}^d$. We denote this problem by $R(k,j,d)$. As a main contribution, we unify…
A new relaxed variant of interior point method for low-rank semidefinite programming problems is proposed in this paper. The method is a step outside of the usual interior point framework. In anticipation to converging to a low-rank primal…
We investigate the following problem: what is the smallest possible distance between a cubic irrational $\xi$ and a rational number $p/q$ in terms of the height $H(\xi)$ and $q$? More precisely, we consider the set $D_{3,1}$ consisting of…
Reinforcement Learning with Verifiable Rewards (RLVR) has recently demonstrated remarkable potential in enhancing the reasoning capability of Large Reasoning Models (LRMs). However, RLVR often drives the policy toward over-determinism,…
We give a lower bound on the iteration complexity of a natural class of Lagrangean-relaxation algorithms for approximately solving packing/covering linear programs. We show that, given an input with $m$ random 0/1-constraints on $n$…
Let $C\subset{\mathbb P}_K^2$ be an algebraic curve over a number field $K$, and denote by $d_K$ the degree of $K$ over ${\mathbb Q}$. We prove that the number of $K$-rational points of height at most $H$ in $C$ is bounded by $c…
Given two coprime integers $p\ge 2$ and $q \ge 3$, let $D_p\subset[0,1)$ consist of all rational numbers which have a finite $p$-ary expansion, and let $$ K(q, \mathcal{A})=\bigg\{ \sum_{i=1}^\infty \frac{d_i}{q^i}: d_i\in \mathcal{A}~…
This thesis explores algorithmic applications and limitations of convex relaxation hierarchies for approximating some discrete and continuous optimization problems. - We show a dichotomy of approximability of constraint satisfaction…