Related papers: Polytopes with Bounded Integral Slack Matrices Hav…

In this paper, we focus on the quantum communication complexity of functions of the form $f \circ G = f(G(X_1, Y_1), \ldots, G(X_n, Y_n))$ where $f: \{0, 1\}^n \to \{0, 1\}$ is a symmetric function, $G: \{0, 1\}^j \times \{0, 1\}^k \to \{0,…

For integers $k,n \geq 0$ and a cost vector $c \in Z^n$, we study two fundamental integer linear programming (ILP) problems: \[ \text{(Standard Form)} \quad \max\bigl\{c^\top x \colon Ax = b,\ x \in Z^n_{\geq 0}\bigr\} \text{ with } A \in…

We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…

Let $L^{m,p}(\R^n)$ denote the Sobolev space of functions whose $m$-th derivatives lie in $L^p(\R^n)$, and assume that $p>n$. For $E \subset \R^n$, denote by $L^{m,p}(E)$ the space of restrictions to $E$ of functions $F \in L^{m,p}(\R^n)$.…

The extension complexity of a polytope $P$ is the smallest integer $k$ such that $P$ is the projection of a polytope $Q$ with $k$ facets. We study the extension complexity of $n$-gons in the plane. First, we give a new proof that the…

We describe a technique to obtain linear descriptions for polytopes from extended formulations. The simple idea is to first define a suitable lifting function and then to find linear constraints that are valid for the polytope and guarantee…

In this paper we extend recent results of Fiorini et al. on the extension complexity of the cut polytope and related polyhedra. We first describe a lifting argument to show exponential extension complexity for a number of NP-complete…

Let $\K$ be an algebraic number field of degree $d$ and discriminant $\Delta$ over $\Q$. Let $\A$ be an associative algebra over $\K$ given by structure constants such that $\A\cong M_n(\K)$ holds for some positive integer $n$. Suppose that…

We consider previously derived upper and lower bounds on the number of operators in a window of scaling dimensions $[\Delta - \delta,\Delta + \delta]$ at asymptotically large $\Delta$ in 2d unitary modular invariant CFTs. These bounds…

Consensus is one of the most thoroughly studied problems in distributed computing, yet there are still complexity gaps that have not been bridged for decades. In particular, in the classical message-passing setting with processes' crashes,…

We show that every GL(2, R) orbit closure of translation surfaces is either a connected component of a stratum, the hyperelliptic locus, or consists entirely of surfaces whose Jacobians have extra endomorphisms. We use this result to give…

We study the matrix factorization problem associated with an SO(2) spinning top by using the algebro-geometric approach. We derive the explicit expressions in terms of Riemann theta functions and discus some related problems including a…

We prove new lower bounds for bounded error quantum communication complexity. Our methods are based on the Fourier transform of the considered functions. First we generalize a method for proving classical communication complexity lower…

The border rank of the matrix multiplication operator for n by n matrices is a standard measure of its complexity. Using techniques from algebraic geometry and representation theory, we show the border rank is at least 2n^2-n. Our bounds…

Exact tight bounds of the complexity of the satisfiability problem for dense modal logics is a difficult question, likely somewhere between $\PSPACE$ and $\EXPSPACE$ depending of the logic under question. For a class of them, called here…

In this paper, we prove a strong XOR lemma for bounded-round two-player randomized communication. For a function $f:\mathcal{X}\times \mathcal{Y}\rightarrow\{0,1\}$, the $n$-fold XOR function $f^{\oplus n}:\mathcal{X}^n\times…

We investigate when the exponential sum $S_f(x,\alpha) := \sum_{n\le x}f(n)\mathrm{e}(n\alpha)$ is bounded, for a multiplicative function $f$ and $\alpha\in\mathbb{R}$. We show that under natural assumptions, $S_f(x,\alpha)$ is bounded only…

We provide a characterization of the compressed lattice polytopes in terms of their facet defining inequalities and we show that every compressed lattice polytope is affinely isomorphic to a 0/1-polytope. As an application, we characterize…

It is proposed the algorithm that find a basis of the ideal and a basis of the space of all root functionals by using the extension operation for bounded root functionals, when the number of polynomials is equal to the number of variables,…

$\newcommand{\F}{\mathbb{F}}$We study the Boolean function parameters sensitivity ($s$), block sensitivity ($bs$), and alternation ($alt$) under specially designed affine transforms. For a function $f:\F_2^n\to \{0,1\}$, and $A=Mx+b$ for $M…