Related papers: Birkhoff-James orthogonality: A Minimax Theorem ap…
We present an optimization problem emerging from optimal control theory and situated at the intersection of fractional programming and linear max-min programming on polytopes. A na\"ive solution would require solving four nested, possibly…
We formulate the issue of minimality of self-adjoint operators on a Hilbert space as a semi-definite problem, linking the work by Overton in [1] to the characterization of minimal hermitian matrices. This motivates us to investigate the…
The conjecture of Bollob\'as and Koml\'os, recently proved by B\"ottcher, Schacht, and Taraz [Math. Ann. 343(1), 175--205, 2009], implies that for any $\gamma>0$, every balanced bipartite graph on $2n$ vertices with bounded degree and…
Motivated by the famous Blanco-Koldobsky-Turn\v{s}ek characterization of isometries, we study the \textit{approximate preservation of Birkhoff-James orthogonality by a linear operator between Banach spaces}. In particular, we investigate…
Our first result is a statement of a somewhat general form of a non-substitution theorem for linear programming problems, along with a very easy proof of the same. Subsequently, we provide an easy proof of theorem 1 in a 1979 paper of Olvi…
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…
For r < 2, we prove the boundedness of a maximal operator formed by applying all multipliers m with $\|m\|_{V^r} \leq 1$ to a given function.
We investigate an alternative solution method to the joint signal-beamformer optimization problem considered by Setlur and Rangaswamy[1]. First, we directly demonstrate that the problem, which minimizes the received noise, interference, and…
Bernstein polynomials provide a constructive proof for the Weierstrass approximation theorem, which states that every continuous function on a closed bounded interval can be uniformly approximated by polynomials with arbitrary accuracy.…
In this article, the relationship between Birkhoff-James orthogonality of elementary tensors in certain tensor product spaces with the Birkhoff-James orthogonality of individual elements in their respective spaces is studied.
In this paper we give alternate proofs of some well-known matrix inequalities. In particular, we show that under certain conditions the inequality holds \begin{align}\sum \limits_{\lambda_i\in \mathrm{Spec}(ab^{T})}\mathrm{min}\{\log…
Let $A$ be a self-adjoint operator in a separable Hilbert space. Suppose that the spectrum of $A$ is formed of two isolated components $\sigma_0$ and $\sigma_1$ such that the set $\sigma_0$ lies in a finite gap of the set $\sigma_1$. Assume…
In this paper we show variant of the spectral theorem using an algebraic Jordan-Schwinger map. The advantage of this approach is that we don't have restriction of normality on the class of operators we consider. On the other side, we have…
Given $n \times n$ real symmetric matrices $A_1, \dots, A_m$, the following {\it spectral minimax} property holds: $$\min_{X \in \mathbf{\Delta}_n} \max_{y \in S_m} \sum_{i=1}^m y_iA_i \bullet X=\max_{y \in S_m} \min_{X \in…
We give an elementary proof of Kelley's theorem based on a minimax argument. Some applications to related problems are also developed.
We combine the Riemann-Hilbert approach with the techniques of Banach algebras to obtain an extension of Baxter's Theorem for polynomials orthogonal on the unit circle. This is accomplished by using the link between the negative Fourier…
A proof based on reduction to finite fields of Esnault-Viehweg's stronger version of Sommese Vanishing Theorem for $k$-ample line bundles is given. This result is used to give different proofs of isotriviality results of A. Parshin and L.…
In this paper, we present a more complete version of the minimax theorem established in [7]. As a consequence, we get, for instance, the following result: Let $X$ be a compact, not singleton subset of a normed space $(E,\|\cdot\|)$ and let…
One of the key results in Robertson and Seymour's seminal work on graph minors is the Grid-Minor Theorem (also called the Excluded Grid Theorem). The theorem states that for every grid $H$, every graph whose treewidth is large enough…
Inspired by the classical Riemannian systolic inequality of Gromov we present a combinatorial analogue providing a lower bound on the number of vertices of a simplicial complex in terms of its edge-path systole. Similarly to the Riemannian…