Related papers: Polytopes with Bounded Integral Slack Matrices Hav…

The low-rank matrix completion problem asks whether a given real matrix with missing values can be completed so that the resulting matrix has low rank or is close to a low-rank matrix. The completed matrix is often required to satisfy…

Let $\Delta$ be a Delzant polytope in ${\mathbb R}^n$ and ${\mathbf b}\in{\mathbb Z}^n$. Let $E$ denote the symplectic fibration over $S^2$ determined by the pair $(\Delta,\,{\mathbf b})$. Under certain hypotheses, we prove the equivalence…

Nisan and Szegedy (CC 1994) showed that any Boolean function $f:\{0,1\}^n\rightarrow \{0,1\}$ that depends on all its input variables, when represented as a real-valued multivariate polynomial $P(x_1,\ldots,x_n)$, has degree at least $\log…

In this paper, we introduce the $k\times n$ (with $k\leq n$) truncated, supplemented Pascal matrix which has the property that any $k$ columns form a linearly independent set. This property is also present in Reed-Solomon codes; however,…

Discrete optimisation problems arise in many different areas and are studied under many different names. In many such problems the quantity to be optimised can be expressed as a sum of functions of a restricted form. Here we present a…

Several theorems and conjectures in communication complexity state or speculate that the complexity of a matrix in a given communication model is controlled by a related analytic or algebraic matrix parameter, e.g., rank, sign-rank,…

Integer programs with m constraints are solvable in pseudo-polynomial time in $\Delta$, the largest coefficient in a constraint, when m is a fixed constant. We give a new algorithm with a running time of $O(\sqrt{m}\Delta)^{2m} + O(nm)$,…

An XOR function is a function of the form g(x,y) = f(x + y), for some boolean function f on n bits. We study the quantum and classical communication complexity of XOR functions. In the case of exact protocols, we completely characterise…

Let $A$ be an $n \times n$ random matrix with independent identically distributed non-constant subgaussian entries. Then for any $k \le c \sqrt{n}$, \[ \text{rank}(A) \ge n-k \] with probability at least $1-\exp(-c'kn)$.

Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Expressive role constructors are important in many applications, but can…

We study the relation between the palindromic and factor complexity of infinite words. We show that for uniformly recurrent words one has P(n)+P(n+1) \leq \Delta C(n) + 2, for all n \in N. For a large class of words it is a better estimate…

In the Number On the Forehead (NOF) multiparty communication model, $k$ players want to evaluate a function $F : X_1 \times\cdots\times X_k\rightarrow Y$ on some input $(x_1,\dots,x_k)$ by broadcasting bits according to a predetermined…

We prove a complexity dichotomy for Holant problems on the boolean domain with arbitrary sets of real-valued constraint functions. These constraint functions need not be symmetric nor do we assume any auxiliary functions as in previous…

We prove a general lower bound on the bounded-error entanglement-assisted quantum communication complexity of Boolean functions. The bound is based on the concept that any classical or quantum protocol to evaluate a function on distributed…

The LogRank conjecture of Lov\'asz and Saks from 1988 is the most famous open problem in the communication complexity theory. The statement is as follows: Suppose that two players intend to compute a Boolean function $f(x,y)$ when $x$ is…

Let us consider the Schr\"{o}dinger operator $\mathcal{L}=-\Delta+V$ on $\mathbb R^d$ with $d\geq3$, where $\Delta$ is the Laplacian operator on $\mathbb R^d$ and the nonnegative potential $V$ belongs to certain reverse H\"{o}lder class…

For an atomic domain $D$, the $elasticity$ $\rho(D)$ of $D$ is defined as $\sup\{r/s: \pi_1\cdots \pi_r = \rho_1 \cdots \rho_s,~ \text{where each $\pi_i, \rho_j$ is irreducible}\}$; the elasticity provides a concrete measure of the failure…

Sharp estimates on $\beta$ are determined so that an analytic function $p$ defined on the open unit disk in the complex plane normalized by $p(0)=1$ is subordinate to some well known starlike functions with positive real part whenever…

Suppose we are given an $n$-dimensional order-3 symmetric tensor $T \in (\mathbb{R}^n)^{\otimes 3}$ that is the sum of $r$ random rank-1 terms. The problem of recovering the rank-1 components is possible in principle when $r \lesssim n^2$…

We show that the Rademacher complexity of any $\mathbb{R}^{K}$-valued function class composed with an $\ell_{\infty}$-Lipschitz function is bounded by the maximum Rademacher complexity of the restriction of the function class along each…