English
Related papers

Related papers: Lifting maps from the symmetrized polydisk in smal…

200 papers

A set $S\subseteq \re^n$ is called to be {\it Semidefinite (SDP)} representable if $S$ equals the projection of a set in higher dimensional space which is describable by some Linear Matrix Inequality (LMI). The contributions of this paper…

Optimization and Control · Mathematics 2008-12-08 J. William Helton , Jiawang Nie

In \cite{ds_hfs}, a geometric procedure for constructing a Nevanlinna-Pick problem on $\D^n$ with a specified set of uniqueness was established. In this sequel we conjecture a necessary and a sufficient condition for a Nevanlinna-Pick…

Complex Variables · Mathematics 2013-02-22 David Scheinker

The main theorem of the paper provides an existence criterion of holomorphic discs for higher $A_\infty$ operations. The key step is to show that if a minimal disc in a K\"ahler manifold with boundary in a sequence of Lagrangian…

Symplectic Geometry · Mathematics 2026-05-01 Qiang Tan , Zuyi Zhang

Consider the equivariant wave map equation from Minkowski space to a rotationnally symmetric manifold which has an equator (example: the sphere). In dimension 3, this article gives a necessary and sufficient condition for the existence of a…

Analysis of PDEs · Mathematics 2008-06-26 Pierre Germain

We study the problem of approximating the cone of positive semidefinite (PSD) matrices with a cone that can be described by smaller-sized PSD constraints. Specifically, we ask the question: "how closely can we approximate the set of…

Optimization and Control · Mathematics 2022-09-08 Dogyoon Song , Pablo A. Parrilo

We study the minimum membership geometric set cover, i.e., MMGSC problem [SoCG, 2023] in the continuous setting. In this problem, the input consists of a set $P$ of $n$ points in $\mathbb{R}^{2}$, and a geometric object $t$, the goal is to…

Computational Geometry · Computer Science 2025-06-03 Sathish Govindarajan , Mayuresh Patle , Siddhartha Sarkar

Let $f$ be a holomorphic mapping between compact complex manifolds. We give a criterion for $f$ to have {\it unobstructed deformations}, i.e. for the local moduli space of $f$ to be smooth: this says, roughly speaking, that the group of…

Complex Variables · Mathematics 2016-09-06 Ziv Ran

Several central problems in quantum information theory (such as measurement compatibility and quantum steering) can be rephrased as membership in the minimal matrix convex set corresponding to special polytopes (such as the hypercube or its…

Quantum Physics · Physics 2024-01-23 Andreas Bluhm , Ion Nechita , Simon Schmidt

Linear matrix inequalities (LMIs) are ubiquitous in real algebraic geometry, semidefinite programming, control theory and signal processing. LMIs with (dimension free) matrix unknowns are central to the theories of completely positive maps…

Functional Analysis · Mathematics 2020-05-06 J. William Helton , Igor Klep , Scott McCullough , Jurij Volčič

In this paper we prove a Schwarz-Pick lemma for the modulus of holomorphic mappings from the polydisk into the unit ball. This result extends some related results.

Complex Variables · Mathematics 2013-08-01 Shaoyu Dai , Yifei Pan

Many real-world datasets live on high-dimensional Stiefel and Grassmannian manifolds, $V_k(\mathbb{R}^N)$ and $Gr(k, \mathbb{R}^N)$ respectively, and benefit from projection onto lower-dimensional Stiefel and Grassmannian manifolds. In this…

Computational Geometry · Computer Science 2025-04-16 Andrew Lee , Harlin Lee , Jose A. Perea , Nikolas Schonsheck , Madeleine Weinstein

A spectrahedron is a set defined by a linear matrix inequality. Given a spectrahedron we are interested in the question of the smallest possible size $r$ of the matrices in the description by linear matrix inequalities. We show that for the…

Algebraic Geometry · Mathematics 2016-06-30 Mario Kummer

The Matrix Spencer Conjecture asks whether given $n$ symmetric matrices in $\mathbb{R}^{n \times n}$ with eigenvalues in $[-1,1]$ one can always find signs so that their signed sum has singular values bounded by $O(\sqrt{n})$. The standard…

Data Structures and Algorithms · Computer Science 2019-11-01 Victor Reis , Thomas Rothvoss

We address a conjecture that $\pi_1$-surjective maps between closed aspherical 3-manifolds having the same rank on $\pi_1$ must be of non-zero degree. The conjecture is proved for Seifert manifolds, which is used in constructing the first…

Geometric Topology · Mathematics 2007-05-23 Alan W. Reid , Shicheng Wang , Qing Zhou

We present algorithms for the online minimum hitting set problem in geometric range spaces: given a set $P$ of $n$ points in the plane and a sequence of geometric objects that arrive one-by-one, we need to maintain a hitting set at all…

Computational Geometry · Computer Science 2025-10-28 Minati De , Satyam Singh , Csaba D. Tóth

We show that the spectral radius of an $N\times N$ random symmetric matrix with i.i.d. bounded centered but non-symmetrically distributed entries is bounded from above by $ 2 \*\sigma + o(N^{-6/11+\epsilon}), $ where $\sigma^2 $ is the…

Probability · Mathematics 2007-05-23 Sandrine Peche , Alexander Soshnikov

The circular law asserts that the spectral measure of eigenvalues of rescaled random matrices without symmetry assumption converges to the uniform measure on the unit disk. We prove a local version of this law at any point $z$ away from the…

Probability · Mathematics 2013-12-05 Paul Bourgade , Horng-Tzer Yau , Jun Yin

We study proper holomorphic maps of annuli in complex Euclidean spaces, that is, domains with $U(n)$ as the automorphism group. By the Hartogs phenomenon and a result of Forstneri\v{c}, such maps are always rational and extend to proper…

Complex Variables · Mathematics 2026-02-06 Abdullah Al Helal , Jiri Lebl , Achinta Kumar Nandi

Given a set of disks in the plane, the goal of the problem studied in this paper is to choose a subset of these disks such that none of its members contains the centre of any other. Each disk not in this subset must be merged with one of…

Computational Geometry · Computer Science 2026-04-08 Ali Gholami Rudi

We give a simple proof of the matrix Spencer conjecture up to poly-logarithmic rank: given symmetric $d \times d$ matrices $A_1,\ldots,A_n$ each with $\|A_i\|_{\mathsf{op}} \leq 1$ and rank at most $n/\log^3 n$, one can efficiently find…

Data Structures and Algorithms · Computer Science 2022-08-30 Nikhil Bansal , Haotian Jiang , Raghu Meka
‹ Prev 1 4 5 6 7 8 10 Next ›