Related papers: The von Neumann inequality for 3x3 matrices
The Multiplicity Conjecture is a deep problem relating the multiplicity (or degree) of a Cohen-Macaulay standard graded algebra with certain extremal graded Betti numbers in its minimal free resolution. In the case of level algebras of…
We define the symmetric Post Correspondence Problem (PCP) and prove that it is undecidable. As an application we show that the original proof of undecidability of the freeness problem for 3-by-3 integer matrix semigroups works for the…
Two different problems are considered here. First, a version of Schwarz-Pick Lemma for $n$ points leads to an interpolation problem for analytic functions from the disc into itself, which may be considered as a particular case of the…
We revisit four approaches to the BiTangential Operator Argument Nevanlinna-Pick (BTOA-NP) interpolation theorem on the right half plane: (1) the state-space approach of Ball-Gohberg-Rodman, (2) the Fundamental Matrix Inequality approach of…
The article deals with isometric dilation and commutant lifting for a class of $n$-tuples $(n \geq 3)$ of commuting contractions. We show that operator tuples in the class dilate to tuples of commuting isometries of BCL type. As a…
We established a method for obtaining set-theoretical solutions to the 3D reflection equation by using known ones to the Zamolodchikov tetrahedron equation, where the former equation was proposed by Isaev and Kulish as a boundary analog of…
In 2011 at an Oberwolfach workshop in Discrete Geometry, V. Dol'nikov posed the following problem. Consider three non-empty families of translates of a convex compact set $K$ in the plane. Suppose that every two translates from different…
We derive a family of interpolation estimates which improve Hardy's inequality and cover the Sobolev critical exponent. We also determine all optimizers among radial functions in the endpoint case and discuss open questions on nonrestricted…
Eigenvalue problem for Poincare-Steklov-3 integral equation is reduced to the solution of three transcendential equations for three unknown numbers, moduli of pants. The complete list of antisymmetric eigenfunctions of integral equation in…
The purpose of this note is threefold. (i) To explain the effective Kohn algorithm for multipliers in the complex Neumann problem and its difference with the full-real-radical Kohn algorithm, especially in the context of an example of…
We introduce the notion of a \lambda-nonisotropically balanced domain and show that the symmetrized polydisc in C^n, n \geq 2, is an example of such a domain. Given a \lambda-nonisotropically balanced domain \Omega, we derive effective…
The randomized Kaczmarz method is an iterative algorithm that solves overdetermined systems of linear equations. Recently, the method was extended to systems of equalities and inequalities by Leventhal and Lewis. Even more recently, Needell…
In this paper we establish an estimate for the rate of convergence of the Krasnosel'ski\v{\i}-Mann iteration for computing fixed points of non-expansive maps. Our main result settles the Baillon-Bruck conjecture [3] on the asymptotic…
Linear interpolation inequalities that combine Hardy's inequality with sharp Sobolev embedding are obtained using classical arguments of Hardy and Littlewood (Bliss lemma). Such results are equivalent to Caffarelli-Kohn-Nirenberg…
In this paper, we study a problem posed by Furstenberg on intersections between $\times 2, \times 3$ invariant sets. We present here a direct geometrical counting argument to revisit a theorem of Wu and Shmerkin. This argument can be used…
This paper introduces a new method for constructing approximate solutions to a class of Wiener--Hopf equations. This is particularly useful since exact solutions of this class of Wiener--Hopf equations, at the moment, cannot be obtained.…
We consider the nonlinear Neumann problem for fully nonlinear elliptic PDEs on a quadrant. We establish a comparison theorem for viscosity sub and supersolutions of the nonlinear Neumann problem. The crucial argument in the proof of the…
Let $A$ be a square complex matrix, $z_1$, ..., $z_{n}\in\mathbb C$ be (possibly repetitive) points of interpolation, $f$ be analytic in a neighborhood of the convex hull of the union of the spectrum of $A$ and the points $z_1$, ...,…
We present a deterministic polynomial-time algorithm that solves the 3-satisfiability problem.
The L'vov-Kaplansky conjecture states that the image of a multilinear noncommutative polynomial $f$ in the matrix algebra $M_n(K)$ is a vector space for every $n \in {\mathbb N}$. We prove this conjecture for the case where $f$ has degree…