Related papers: An Elementary Proof of the Restricted Invertibilit…

Probabilistic algorithms are applied to prove theorems about the finite general linear and unitary groups which are typically proved by techniques such as character theory and Moebius inversion. Among the theorems studied are Steinberg's…

We present an exposition of the *Chain Bounding Lemma*, which is a common generalization of both Zorn's Lemma and the Bourbaki-Witt fixed point theorem. The proofs of these results through the use of Chain Bounding are amongst the simplest…

We prove a variant of the so-called bilinear embedding theorem for operators in divergence form with complex coefficients and with nonnegative locally integrable potentials, subject to mixed boundary conditions, and acting on arbitrary open…

We discuss Lomonosov's proof of the Pontryagin-Krein Theorem on invariant maximal non-positive subspaces, prove the refinement of one theorem from \cite{OShT} on common fixed points for a group of fractional-linear maps of operator ball and…

We establish a generalization of Bourgain double recurrence theorem and ergodic Bourgain-Sarnak's theorem by proving that for any aperiodic $1$-bounded multiplicative function $\boldsymbol{\nu}$, for any map $T$ acting on a probability…

Muchnik's theorem about simple conditional descriptions states that for all strings $a$ and $b$ there exists a short program $p$ transforming $a$ to $b$ that has the least possible length and is simple conditional on $b$. In this paper we…

Matrices with the restricted isometry property (RIP) are of particular interest in compressed sensing. To date, the best known RIP matrices are constructed using random processes, while explicit constructions are notorious for performing at…

We show that the well-known Konig's Min-Max Theorem (KMM), a fundamental result in combinatorial matrix theory, can be proven in the first order theory $\LA$ with induction restricted to $\Sigma_1^B$ formulas. This is an improvement over…

Given the single-letter capacity formula and the converse proof of a channel without constraints, we provide a simple approach to extend the results for the same channel but with constraints. The resulting capacity formula is the minimum of…

The general methods which are powerful for the necessity of bounded commutators are given. As applications, some necessary conditions for bounded commutators are first obtained in certain endpoint cases, and several new characterizations of…

In this paper, we introduce matrix weighted Bourgain-Morrey spaces and obtain two sufficient conditions for precompact sets in matrix weighted Bourgain-Morrey spaces. We prove that the dyadic average operator is bounded on some matrix…

A characterization of finitely generated shift-invariant subspaces is given when generators are g-minimal. An algorithm is given for the determination of the coefficients in the well known representation of the Fourier transform of an…

Let $A \in \mathbb{Z}^{m \times n}$ be an integer matrix with components bounded by $\Delta$ in absolute value. Cook et al.~(1986) have shown that there exists a universal matrix $B \in \mathbb{Z}^{m' \times n}$ with the following property:…

In this paper we derive new sufficient conditions for a linear system matrix $$S(\lambda):=\left[\begin{array}{ccc} T(\lambda) & -U(\lambda) \\ V(\lambda) & W(\lambda) \end{array}\right],$$ where $T(\lambda)$ is assumed regular, to be…

We prove that a matrix from the split orthogonal group over a polynomial ring with coefficients in a small-dimensional ring can be reduced to a smaller matrix by a bounded number of elementary orthogonal transformations. The bound is given…

We address the problems of computing operator norms of matrices induced by given norms on the argument and the image space. It is known that aside of a fistful of "solvable cases," most notably, the case when both given norms are Euclidean,…

Although there are many simple proofs of Jordan's decomposition theorem in the literature (see [1], the references mentioned there, and [2]), our proof seems to be even more elementary. In fact, all we need is the theorem on the dimensions…

We give a short and elementary proof of the boundedness of triangular Hilbert transform along non-flat curves definable in a polynomially bounded o-minimal structure. We also provide a criterion on the multiplier to determine whether the…

A long-standing open question in Integer Programming is whether integer programs with constraint matrices with bounded subdeterminants are efficiently solvable. An important special case thereof are congruency-constrained integer programs…

We define the domain of a linear fractional transformation in a space of operators and show that both the affine automorphisms and the compositions of symmetries act transitively on these domains. Further, we show that Liouville's theorem…