Related papers: Reducing graph subspaces and strong solutions to o…
A family of random matrices is said to converge strongly to a limiting family of operators if the operator norm of every noncommutative polynomial of the matrices converges to that of the limiting operators. Recent developments surrounding…
The analysis of diagonalizable matrices in terms of their so-called isospectral reduction represents a versatile approach to the underlying eigenvalue problem. Starting from a symmetry of the isospectral reduction, we show in the present…
In a recent article \textit{"Lower regularity solutions of the biharmonic Schr\"odinger equation in a quarter plane", to appear on Pacific Journal of Mathematics [15]}, the authors gave a starting point of the study on a series of problems…
We study the space complexity of sketching cuts and Laplacian quadratic forms of graphs. We show that any data structure which approximately stores the sizes of all cuts in an undirected graph on $n$ vertices up to a $1+\epsilon$ error must…
Certifying feasibility in decision-making, critical in many industries, can be framed as a constraint satisfaction problem. This paper focuses on characterising a subset of parameter values from an a priori set that satisfy constraints on a…
Generalizing the algebra of motion-invariant differential operators on a symmetric space we study invariant operators on equivariant vector bundles. We show that the eigenequation is equivalent to the corresponding eigenequation with…
{\em Partial domination problem} is a generalization of the {\em minimum dominating set problem} on graphs. Here, instead of dominating all the nodes, one asks to dominate at least a fraction of the nodes of the given graph by choosing a…
For Schr\"odinger operator $H=-\Delta+ V({\mathbf x})\cdot$, acting in the space $L_2(\mathbb R^d)\,(d\ge 3)$, necessary and sufficient conditions for semi-boundedness and discreteness of its spectrum.are obtained without assumption that…
We study generalized solutions of an evolutionary equation related to a densely defined skew-symmetric operator in a real Hilbert space. We establish existence of a contractive semigroup, which provides generalized solutions, and find…
In this paper, we consider the following two problems: (i) Deletion Blocker($\alpha$) where we are given an undirected graph $G=(V,E)$ and two integers $k,d\geq 1$ and ask whether there exists a subset of vertices $S\subseteq V$ with…
We consider sketched approximate matrix multiplication and ridge regression in the novel setting of localized sketching, where at any given point, only part of the data matrix is available. This corresponds to a block diagonal structure on…
In graph theory a partition of the vertex set of a graph is called equitable if for all pairs of cells all vertices in one cell have an equal number of neighbours in the other cell. Considering the implications for the adjacency matrix one…
A common way of partitioning graphs is through minimum cuts. One drawback of classical minimum cut methods is that they tend to produce small groups, which is why more balanced variants such as normalized and ratio cuts have seen more…
In this paper we derive novel families of inclusion sets for the spectrum and pseudospectrum of large classes of bounded linear operators, and establish convergence of particular sequences of these inclusion sets to the spectrum or…
The scaled relative graph (SRG) of an operator is a subset of the complex plane. It captures several salient features of an operator, such as contractiveness, and can be used to reveal the geometric nature of many of the inequality based…
We derive a new lower bound for the bandwidth of a graph that is based on a new lower bound for the minimum cut problem. Our new semidefinite programming relaxation of the minimum cut problem is obtained by strengthening the known…
This paper extends the algorithm of Benner, Heinkenschloss, Saak, and Weichelt: An inexact low-rank Newton-ADI method for large-scale algebraic Riccati equations, Applied Numerical Mathematics Vol.~108 (2016), pp.~125--142,…
We prove new spectral enclosures for the non-real spectrum of a class of $2\times2$ block operator matrices with self-adjoint operators $A$ and $D$ on the diagonal and operators $B$ and $-B^*$ as off-diagonal entries. One of our main…
Graph is a highly generic and diverse representation, suitable for almost any data processing problem. Spectral graph theory has been shown to provide powerful algorithms, backed by solid linear algebra theory. It thus can be extremely…
Partitioning sparse matrices and graphs is a common and important problem in many scientific and graph analytics applications. In this work, we are concerned with a spatial partitioning called rectilinear partitioning (also known as…