English
Related papers

Related papers: Computing the nearest $\Omega$-admissible descript…

200 papers

We give a complete classification of the reductive symmetric pairs (G,H) for which the homogeneous space $(G \times H)/diag(H)$ is real spherical in the sense that a minimal parabolic subgroup has an open orbit. Combining with a criterion…

Representation Theory · Mathematics 2014-05-12 Toshiyuki Kobayashi , Toshihiko Matsuki

In the Connected Dominating Set problem we are given a graph $G=(V,E)$ and seek a minimum size dominating set $S \subseteq V$ such that the subgraph $G[S]$ of $G$ induced by $S$ is connected. In the $2$-Edge-Connected Dominating Set problem…

Data Structures and Algorithms · Computer Science 2019-12-23 Amir Belgi , Zeev Nutov

Denoting by $\mathcal{E}\subseteq \R^2$ the set of the pairs $(\lambda_1(\Omega),\lambda_2(\Omega))$ for all the open sets $\Omega\subseteq\R^N$ with unit measure, and by $\Theta\subseteq\R^N$ the union of two disjoint balls of half…

Optimization and Control · Mathematics 2015-06-03 Lorenzo Brasco , Carlo Nitsch , Aldo Pratelli

The task of estimating a matrix given a sample of observed entries is known as the \emph{matrix completion problem}. Most works on matrix completion have focused on recovering an unknown real-valued low-rank matrix from a random sample of…

Statistics Theory · Mathematics 2014-08-27 Olga Klopp , Jean Lafond , Eric Moulines , Joseph Salmon

Let $G$ be a second-countable amenable group with a uniform $k$-approximate lattice $\Lambda$. For a projective discrete series representation $(\pi, \mathcal{H}_{\pi})$ of $G$ of formal degree $d_{\pi} > 0$, we show that $D^-(\Lambda) \geq…

Functional Analysis · Mathematics 2023-10-05 Ulrik Enstad , Jordy Timo van Velthoven

A prominent tool in many problems involving metric spaces is a notion of randomized low-diameter decomposition. Loosely speaking, $\beta$-decomposition refers to a probability distribution over partitions of the metric into sets of low…

Data Structures and Algorithms · Computer Science 2016-09-29 Lior Kamma , Robert Krauthgamer

This paper considers the non-convex problem of finding the nearest Metzler matrix to a given possibly unstable matrix. Linear systems whose state vector evolves according to a Metzler matrix have many desirable properties in analysis and…

Optimization and Control · Mathematics 2017-09-11 James Anderson

The "Hermitizability" problem of quantum theory is explained, discussed and illustrated via the discrete-lattice cryptohermitian quantum graphs. In detail, the description of the domain ${\cal D}$ of admissible parameters is provided for…

Quantum Physics · Physics 2012-01-16 Miloslav Znojil

We study certain pairs of subspaces $V$ and $W$ of $\mathbb{C}^n$ we call supports that consist of eigenspaces of the eigenvalues $\pm\|M\|$ of a minimal hermitian matrix $M$ ($\|M\|\leq \|M+D\|$ for all real diagonals $D$). For any pair of…

Functional Analysis · Mathematics 2019-06-18 Alberto Mendoza , Lázaro Recht , Alejandro Varela

We study proper holomorphic maps between bounded symmetric domains $D$ and $\Omega$. In particular, when $D$ and $\Omega$ are of the same rank $\ge 2$ such that all irreducible factors of $D$ are of rank $\ge 2$, we prove that any proper…

Complex Variables · Mathematics 2019-07-18 Shan Tai Chan

The renowned theorem of Dirac states that if $G$ is a graph with minimum degree at least $n/2$ then $G$ has a Hamilton cycle. A natural generalisation asks what properties of an edge-colouring of $G$ guarantee the existence of a properly…

Combinatorics · Mathematics 2026-03-24 Natalie Behague , Francesco Di Braccio , Bertille Granet , Allan Lo

We study the Closest Pair Problem in Hamming metric, which asks to find the pair with the smallest Hamming distance in a collection of binary vectors. We give a new randomized algorithm for the problem on uniformly random input…

Data Structures and Algorithms · Computer Science 2021-12-08 Andre Esser , Robert Kübler , Floyd Zweydinger

Let $(G,G^\Gamma)$ be a Klein four symmetric pair. The author wants to classify all the Klein four symmetric pairs $(G,G^\Gamma)$ such that there exists at least one nontrivial unitarizable simple $(\mathfrak{g},K)$-module $\pi_K$ that is…

Representation Theory · Mathematics 2020-02-11 Haian He

Let (X,d) be a metric space and (\Omega, d) a compact subspace of X which supports a non-atomic finite measure m. We consider `natural' classes of badly approximable subsets of \Omega. Loosely speaking, these consist of points in \Omega…

Number Theory · Mathematics 2007-05-23 Simon Kristensen , Rebecca Thorn , Sanju Velani

In this paper, we provide new discrete uniformization theorems for bounded, $m$-connected planar domains. To this end, we consider a planar, bounded, $m$-connected domain $\Omega$ and let $\bord\Omega$ be its boundary. Let $\mathcal{T}$…

Geometric Topology · Mathematics 2013-12-24 Sa'ar Hersonsky

For a prototype quadratic Hamiltonian describing a driven, dissipative system, exact matrix elements of the reduced density matrix are obtained from a generating function in terms of the normal characteristic functions. The approach is…

Quantum Physics · Physics 2021-08-24 Sh. Saedi , F. Kheirandish

In this article, we study the necessary and sufficient conditions for the existence of solutions in $W_0^{1,\infty}(\Omega;\mathbb R^n)$ in the minimal dimension of $\textrm{span }E$ for the following problem: \begin{equation*} P(D)u\in E…

Analysis of PDEs · Mathematics 2025-12-10 Nurun Nesha

In this article, we consider the (double) minimization problem $$\min\left\{P(E;\Omega)+\lambda W_p(E,F):~E\subseteq\Omega,~F\subseteq \mathbb{R}^d,~\lvert E\cap F\rvert=0,~ \lvert E\rvert=\lvert F\rvert=1\right\},$$ where $p\geqslant 1$,…

Classical Analysis and ODEs · Mathematics 2021-09-02 Qinglan Xia , Bohan Zhou

Motivated by existence problems for dissipative systems arising naturally in lattice models from quantum statistical mechanics, we consider the following $C^{\ast}$-algebraic setting: A given hermitian dissipative mapping $\delta$ is…

Classical Analysis and ODEs · Mathematics 2007-05-23 Palle E. T. Jorgensen

In this document, some structured operator approximation theoretical methods for system identification of nearly eventually periodic systems, are presented. Let $\mathbb{C}^{n\times m}$ denote the algebra of $n\times m$ complex matrices.…

Numerical Analysis · Mathematics 2020-01-31 Fredy Vides