Related papers: Extremal bounds for pattern avoidance in multidime…
A family of mixed finite elements is proposed for solving the first order system of linear elasticity equations in any space dimension, where the stress field is approximated by symmetric finite element tensors. This family of elements has…
The capability of discretization of matrix elements in the problem of quadratic functional minimization with linear member built on matrix in N-dimensional configuration space with discrete coordinates is researched. It is shown, that…
We study a family of matroid optimization problems with a linear constraint (MOL). In these problems, we seek a subset of elements which optimizes (i.e., maximizes or minimizes) a linear objective function subject to (i) a matroid…
Let $A \in {\cal C}^n$ be an extremal copositive matrix with unit diagonal. Then the minimal zeros of $A$ all have supports of cardinality two if and only if the elements of $A$ are all from the set $\{-1,0,1\}$. Thus the extremal…
In the Inverse Matroid problem, we are given a matroid, a fixed basis $B$, and an initial weight function, and the goal is to minimally modify the weights -- measured by some function -- so that $B$ becomes a maximum-weight basis. The…
A real symmetric matrix $M$ is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size $d$. The smallest such $d$ is called the (complex) completely positive semidefinite…
It is well known that sets of $p$-capacity zero are removable for bounded $p$-harmonic functions, but on metric spaces there are examples of removable sets of positive capacity. In this paper, we show that this can happen even on unweighted…
Let $\mathcal{PMD}_{n}$ be the semigroup consisting of all monotone and order-decreasing partial transformations, and let $\mathcal{IMD}_{n}$ be the subsemigroup of $\mathcal{PMD}_{n}$ consisting of all injective monotone and…
We consider the related tasks of matrix completion and matrix approximation from missing data and propose adaptive sampling procedures for both problems. We show that adaptive sampling allows one to eliminate standard incoherence…
Recently, Grytczuk, Kordulewski, and Niewiadomski defined an extremal word over an alphabet $\mathbb{A}$ to be a word with the property that inserting any letter from $\mathbb{A}$ at any position in the word yields a given pattern. In this…
For a fixed $n\ge2$, consider an $n\times n$ matrix $M$ whose entries are random integers bounded by $k$ in absolute value. In this paper, we examine the probability that $M$ is singular (hence has eigenvalue 0), and the probability that…
In this paper we present new constructive methods, random and deterministic, for the efficient subsampling of finite frames in $\mathbb C^m$. Based on a suitable random subsampling strategy, we are able to extract from any given frame with…
We propose an information-theoretic framework for matrix completion. The theory goes beyond the low-rank structure and applies to general matrices of "low description complexity". Specifically, we consider $m\times n$ random matrices…
In this paper we study unitary Ramond twisted representations of minimal $W$-algebras. We classify all such irreducible highest weight representations with a non-Ramond extremal highest weight (unitarity in the Ramond extremal case, as well…
Random sampling of large Markov matrices with a tunable spectral gap, a nonuniform stationary distribution, and a nondegenerate limiting empirical spectral distribution (ESD) is useful. Fix $c>0$ and $p>0$. Let $A_n$ be the adjacency matrix…
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees generated by order-n recursion schemes is n-EXPTIME complete.…
Low-rank matrix completion concerns the problem of estimating unobserved entries in a matrix using a sparse set of observed entries. We consider the non-uniform setting where the observed entries are sampled with highly varying…
We consider the fundamental Matroid Theory problem of finding a circuit in a matroid spanning a set T of given terminal elements. For graphic matroids this corresponds to the problem of finding a simple cycle passing through a set of given…
This study investigates the misclassification excess risk bound in the context of 1-bit matrix completion, a significant problem in machine learning involving the recovery of an unknown matrix from a limited subset of its entries. Matrix…
We study the problem of maximizing a monotone submodular function subject to a matroid constraint, and present for it a deterministic non-oblivious local search algorithm that has an approximation guarantee of $1 - 1/e - \varepsilon$ (for…