相关论文: Maximal entries of elements in certain matrix mono…

We prove two tight bounds on the behavior of a model of self-assembling particles introduced by Dabby and Chen (SODA 2013), called insertion systems, where monomers insert themselves into the middle of a growing linear polymer. First, we…

We enumerate a certain class of monomino-domino coverings of square grids, which conform to the \emph{tatami} restriction; no four tiles meet. Let $\mathbf T_{n}$ be the set of monomino-domino tatami coverings of the $n\times n$ grid with…

Let $Q_d$ be the hypercube of dimension $d$ and let $H$ and $K$ be subsets of the vertex set $V(Q_d)$, called configurations in $Q_d$. We say that $K$ is an \emph{exact copy} of $H$ if there is an automorphism of $Q_d$ which sends $H$ onto…

We consider a basic computational task of finding $s$ planted rank-1 $m \times n$ matrices in a linear subspace $\mathcal{U} \subseteq \mathbb{R}^{m \times n}$ where $\dim(\mathcal{U}) = R \ge s$. The work of Johnston-Lovitz-Vijayaraghavan…

Matrix completion is a fundamental problem that comes up in a variety of applications like the Netflix problem, collaborative filtering, computer vision, and crowdsourcing. The goal of the problem is to recover a k-by-n unknown matrix from…

We establish embeddings on a class of Sobolev spaces with potential weights on unbounded domains. Our results provide embeddings into weighted Lebesgue spaces $L^q_\theta$ with radial power weights and establish the existence and…

We consider the problem of collaborative tree exploration posed by Fraigniaud, Gasieniec, Kowalski, and Pelc where a team of $k$ agents is tasked to collectively go through all the edges of an unknown tree as fast as possible. Denoting by…

Repeated idempotent elements are commonly used to characterise iterable behaviours in abstract models of computation. Therefore, given a monoid $M$, it is natural to ask how long a sequence of elements of $M$ needs to be to ensure the…

Maximum-likelihood (ML) decoding for arbitrary block codes remains fundamentally hard, with worst-case time complexity-measured by the total number of multiplications-being no better than straightforward exhaustive search, which requires…

We consider two matrix completion problems, in which we are given a matrix with missing entries and the task is to complete the matrix in a way that (1) minimizes the rank, or (2) minimizes the number of distinct rows. We study the…

Let $D$ denote the distance matrix for an $n+1$ point metric space $(X,d)$. In the case that $X$ is an unweighted metric tree, the sum of the entries in $D^{-1}$ is always equal to $2/n$. Such trees can be considered as affinely independent…

Given $U$ an $n\times m$ matrix of rank $n$ and $V$ block of columns inside $U$, we consider the problem of extracting a block of columns of rank $n$ which minimize the Hilbert-Schmidt norm of the inverse while preserving the block $V$.…

A subalgebra pair of semisimple complex algebras B < A with inclusion matrix M is depth two if MM^t M < nM for some positive integer n and all corresponding entries. If A and B are the group algebras of finite group-subgroup pair H < G, the…

One of the earliest conjectures in computational learning theory-the Sample Compression conjecture-asserts that concept classes (equivalently set systems) admit compression schemes of size linear in their VC dimension. To-date this…

Recently, Dvir, Golovnev, and Weinstein have shown that sufficiently strong lower bounds for linear data structures would imply new bounds for rigid matrices. However, their result utilizes an algorithm that requires an $NP$ oracle, and…

Let $I$ be a monomial ideal $I$ in a polynomial ring $R = k[x_1,...,x_r]$. In this paper we give an upper bound on $\overline{\dstab} (I)$ in terms of $r$ and the maximal generating degree $d(I)$ of $I$ such that $\depth R/\overline{I^n}$…

We formulate conjectures regarding the maximum value and maximizing matrices of the permanent and of diagonal products on the set of stochastic matrices with bounded rank. We formulate equivalent conjectures on upper bounds for these…

One of the major open problems in complexity theory is to demonstrate an explicit function which requires super logarithmic depth, a.k.a, the $\mathbf{P}$ versus $\mathbf{NC^1}$ problem. The current best depth lower bound is $(3-o(1))\cdot…

Assume that we embed the path $P_n$ as a subgraph of a $2$-dimensional grid, namely, $P_k \times P_l$. Given such an embedding, we consider the ordered set of subpaths $L_1, L_2, \ldots , L_m$ which are maximal straight segments in the…

Let A be a square matrix with real entries. The spread of A is defined as the maximum of the distances among the eigenvalues of A. Let $S_m[a,b]$ denote the set of all $m\times m$ symmetric matrices with entries in the real interval $[a,b]$…