Related papers: Lower Bounds for CSP Hierarchies Through Ideal Red…

In this paper, we prove a theorem on the rate of convergence for the optimal cost computed using PS methods. It is a first proved convergence rate in the literature of PS optimal control. In addition to the high-order convergence rate, two…

This article derives lower bounds on the convergence rate of continuous-time gradient-based optimization algorithms. The algorithms are subjected to a time-normalization constraint that avoids a reparametrization of time in order to make…

We propose an algorithm that produces a non-decreasing sequence of subsolutions for a class of optimal control problems distinguished by the property that the associated Bellman operators preserve convexity. In addition to a theoretical…

For a constraint satisfaction problem (CSP), a robust satisfaction algorithm is one that outputs an assignment satisfying most of the constraints on instances that are near-satisfiable. It is known that the CSPs that admit efficient robust…

We propose a new conjecture on hardness of low-degree $2$-CSP's, and show that new hardness of approximation results for Densest $k$-Subgraph and several other problems, including a graph partitioning problem, and a variation of the Graph…

Real continuous submodular functions, as a generalization of the corresponding discrete notion to the continuous domain, gained considerable attention recently. The analog notion for entropy functions requires additional properties: a real…

We prove several new tight distributed lower bounds for classic symmetry breaking graph problems. As a basic tool, we first provide a new insightful proof that any deterministic distributed algorithm that computes a $\Delta$-coloring on…

We study approximability of regular constraint satisfaction problems, i.e., CSPs where each variable in an instance has the same number of occurrences. In particular, we show that for any CSP $\Lambda$, existence of an $\alpha$…

In this paper, we define the reoptimization variant of the closest substring problem (CSP) under sequence addition. We show that, even with the additional information we have about the problem instance, the problem of finding a closest…

We propose a simplified version of the Kitaev's surface code in which error correction requires only three-qubit parity measurements for Pauli operators XXX and ZZZ. The new code belongs to the class of subsystem stabilizer codes. It…

We present a \emph{deterministic exact algorithm} for the \emph{minimum $k$-cut problem} on simple graphs. Our approach combines the \emph{principal sequence of partitions (PSP)}, derived canonically from ideal loads, with a single level of…

We develop a new method for proving explicit approximation lower bounds for TSP problems with bounded metrics improving on the best up to now known bounds. They almost match the best known bounds for unbounded metric TSP problems. In…

We consider symmetric hypothesis testing in quantum statistics, where the hypotheses are density operators on a finite-dimensional complex Hilbert space, representing states of a finite quantum system. We prove a lower bound on the…

This paper is a study of ``topological'' lower bounds for the chromatic number of a graph. Such a lower bound was first introduced by Lov\'asz in 1978, in his famous proof of the \emph{Kneser conjecture} via Algebraic Topology. This…

In this paper we study constrained subspace approximation problem. Given a set of $n$ points $\{a_1,\ldots,a_n\}$ in $\mathbb{R}^d$, the goal of the {\em subspace approximation} problem is to find a $k$ dimensional subspace that best…

We present lower bounds on the minimum pseudocodeword effective Euclidean distance (or minimum "pseudodistance") for coded modulation systems using linear codes with $q$-ary phase-shift keying (PSK) modulation over the additive white…

Let $G$ be a reductive group over a field $k$ which is algebraically closed of characteristic $p \neq 0$. We prove a structure theorem for a class of subgroup schemes of $G$, for $p$ bounded below by the Coxeter number of $G$. As…

The minimal model $\mathfrak{osp}(1|2)$ vertex operator superalgebras are the simple quotients of affine vertex operator superalgebras constructed from the affine Lie super algebra $\widehat{\mathfrak{osp}}(1|2)$ at certain rational values…

Consensus-based optimization (CBO) is a versatile multi-particle optimization method for performing nonconvex and nonsmooth global optimizations in high dimensions. Proofs of global convergence in probability have been achieved for a broad…

We prove the vanishing of certain low degree cohomologies of some induced representations. As an application, we determine certain low degree cohomologies of congruence groups.