Related papers: Few maps in the rich structure for the domains $G_…
A subset of $\mathbb{C}^7$ (respectively, of $\mathbb{C}^5$) associated with the structured singular value $\mu_E$, defined on $3 \times 3$ matrices, is denoted by $G_{E(3;3;1,1,1)}$ (respectively, by $G_{E(3;2;1,2)}$). In control…
We analyse two special cases of $\mu$-synthesis problems which can be reduced to interpolation problems in the set of analytic functions from the disc into the symmetrised bidisc and into the tetrablock. For these inhomogeneous domains we…
We propose a generalization of the so-called rational map ansatz on the Euclidean space $\mathbb{R}^3$, for any compact simple Lie group $G$ such that $G/{\widehat K}\otimes U(1)$ is an Hermitian symmetric space, for some subgroup…
We analyse the 3-extremal holomorphic maps from the unit disc $\mathbb{D}$ to the symmetrised bidisc $ \mathcal{G}$, defined to be the set $ \{(z+w,zw): z,w\in\mathbb{D}\}$, with a view to the complex geometry and function theory of…
We introduce a new notion of "regularity structure" that provides an algebraic framework allowing to describe functions and / or distributions via a kind of "jet" or local Taylor expansion around each point. The main novel idea is to…
Structured Low-Rank Approximation is a problem arising in a wide range of applications in Numerical Analysis and Engineering Sciences. Given an input matrix $M$, the goal is to compute a matrix $M'$ of given rank $r$ in a linear or affine…
The set \[ \overline{\mathbb{E}}= \{ x \in {\mathbb{C}}^3: \quad 1-x_1 z - x_2 w + x_3 zw \neq 0 \mbox{ whenever } |z| < 1, |w| < 1 \} \] is called the tetrablock and has intriguing complex-geometric properties. It is polynomially convex,…
The smooth (resp. metric and complex) Nielsen Realization Problem for K3 surfaces $M$ asks: when can a finite group $G$ of mapping classes of $M$ be realized by a finite group of diffeomorphisms (resp. isometries of a Ricci-flat metric, or…
Dahmen and Schmeding have obtained the result that although the smooth Lie group $G$ of real analytic diffeomorphisms $\mathbb S^{\,1.}\to\mathbb S^{\,1.}$ has a compatible analytic manifold structure, it does not make $G$ a real analytic…
We study the analytic and topological invariants associated with complex normal surface singularities. Our goal is to provide topological formulae for several discrete analytic invariants whenever the analytic structure is generic (with…
A motivation for studying the following problems comes from applications to Biology; see \cite{cifuentes20233d}. In the $3$-dimensional Euclidean space ${\bf{E}}^3$, fix six pairwise distinct points \begin{equation*} \label{eqA}…
Random matrix theory allows for the deduction of stability criteria for complex systems using only a summary knowledge of the statistics of the interactions between components. As such, results like the well-known elliptical law are…
We show that if $X$ is an $m$-dimensional definable set in $\mathbb{R}^\text{pow}_\text{an}$, the structure of real subanalytic sets with real power maps added, then for any positive integer r there exists a $C^r$-parameterization of X…
Let $\mathcal{E}(X)$ be the group of homotopy classes of self homotopy equivalences for a connected CW complex $X$. We observe two classes of maps $\mathcal{E}$-maps and co-$\mathcal{E}$-maps. They are defined as the maps $X\to Y$ that…
Given a positive integer $p$, we consider $W^{1,p}$-maps from a Euclidean domain of dimension $p+1$ into a closed Riemannian manifold $\mathcal{N}$. The target manifold is required to satisfy suitable topological conditions; in particular,…
The main objects under consideration in this thesis are called maps, a certain class of graphs embedded on surfaces. Our problems have a powerful relatively recent tool in common, the so-called topological recursion (TR) introduced by…
The purpose of this short note is to study dominant rational maps from punctual Hilbert schemes of length $k>1$ of projective K3 surfaces $S$ containing infinitely many rational curves. Precisely, we prove that their image is necessarily…
Given a bipartite graph $G$, the graphical matrix space $\mathcal{S}_G$ consists of matrices whose non-zero entries can only be at those positions corresponding to edges in $G$. Tutte (J. London Math. Soc., 1947), Edmonds (J. Res. Nat. Bur.…
In this paper we propose and study a new complexity model for approximation algorithms. The main motivation are practical problems over large data sets that need to be solved many times for different scenarios, e.g., many multicast trees…
Let $L$ be a sequence $(\ell_1,\ell_2,\ldots,\ell_n)$ of $n$ lines in $\mathbb{C}^3$. We define the {\it intersection graph} $G_L=([n],E)$ of $L$, where $[n]:=\{1,\ldots, n\}$, and with $\{i,j\}\in E$ if and only if $i\neq j$ and the…