Related papers: Symplectic embeddings of polydisks

Let $\mathbb{P}_K(n)$ be the probability that $n$ points $z_1,\ldots,z_n$ picked uniformly and independently in $K$, a non-flat compact convex polygon in $\mathbb{R}^2$, are in convex position, that is, form the vertex set of a convex…

This article details a construction of symplectic foliations on 3-dimensional orientable riemannian manifolds from harmonic forms; and how it suggests a topological approach to Poisson's equation and newtonian gravity.

Assume that we are given two graphic sequences, $\pi_1$ and $\pi_2$. We consider conditions for $\pi_1$ and $\pi_2$ which guarantee that there exists a simple graph $G_2$ realizing $\pi_2$ such that $G_2$ is the subgraph of any simple graph…

Let $K$ be a compact subset of a totally-real manifold $M$, where $M$ is either a $\mathcal{C}^2$-smooth graph in $\mathbb{C}^{2n}$ over $\mathbb{C}^n$, or $M=u^{-1}\{0\}$ for a $\mathcal{C}^2$-smooth submersion $u$ from $\mathbb{C}^n$ to…

Suppose that there is a family of $n$ random points $X_v$ for $v \in V$, independently and uniformly distributed in the square $\left[-\sqrt{n}/2,\sqrt{n}/2\right]^2$ of area $n$. We do not see these points, but learn about them in one of…

We show that any compact smooth real $n$-dimensional manifold $M$ with $n\leq 11$ can be smoothly embedded into $\mathbb{C}^{n+1}$ as a polynomially convex set. In general, there is no such embedding into $\mathbb{C}^n$. This solves a…

The spectral unit ball $\Omega_n$ is the set of all $n\times n$ matrices with spectral radius less than $1$. Let $\pi(M) \in \mathbb C^n$ stand for the coefficients of its characteristic polynomial of $M$ (up to signs), i.e. the elementary…

Let $Z$ be an affine algebraic variety and $X$ be a smooth flexible variety. We develop some criteria under which $Z$ admits a closed embedding into $X$. In particular, we show that if $X$ is isomorphic (as an algebraic variety) to a…

We provide some conditions for the graph of a Hoelder-continuous function on \bar{D}, where \bar{D} is a closed disc in the complex plane, to be polynomially convex. Almost all sufficient conditions known to date --- provided the function…

Let $M$ be a separable metric space. We say that $f=(f_n):M\to c_0$ is a good-$\lambda$-embedding if, whenever $x,y\in M$, $x\ne y$ implies $d(x,y)\le\Vert f(x)-f(y)\Vert$ and, for each $n$, $Lip(f_n)<\lambda$, where $Lip(f_n)$ denotes the…

Let $D$ be a domain obtained by removing, out of the unit disk $\{z:|z|<1\}$, finitely many mutually disjoint closed disks, and for each integer $n\geq 0$, let $P_n(z)=z^n+\cdots$ be the monic $n$th-degree polynomial satisfying the planar…

Let $V$ and $V'$ be $2n$-dimensional vector spaces over fields $F$ and $F'$. Let also $\Omega: V\times V\to F$ and $\Omega': V'\times V'\to F'$ be non-degenerate symplectic forms. Denote by $\Pi$ and $\Pi'$ the associated…

For Hamiltonian field theories on polysymplectic manifolds with a symmetry group action and a momentum map, we explore the redundancy in a set of necessary conditions that has appeared in the literature, for a generalized version of the…

We study the geometry of manifolds carrying symplectic pairs consisting of two closed 2-forms of constant ranks, whose kernel foliations are complementary. Using a variation of the construction of Boothby and Wang we build…

Symplectic integrator plays a pivotal role in the long-term tracking of charged particles within accelerators. To get symplectic maps in accurate simulation of single-particle trajectories, two key components are addressed: precise…

We extend the ``Extension after Restriction Principle'' for symplectic embeddings of bounded starlike domains to a large class of symplectic embeddings of unbounded starlike domains.

In an earlier paper we explained how to convert the problem of symplectically embedding one 4-dimensional ellipsoid into another into the problem of embedding a certain set of disjoint balls into \CP^2 by using a new way to desingularize…

We consider a random graph G(n,p) whose vertex set V has been randomly embedded in the unit square and whose edges are given weight equal to the geometric distance between their end vertices. Then each pair {u,v} of vertices have a distance…

Let $G=(V,E)$ be a finite, connected graph. We consider a greedy selection of vertices: given a list of vertices $x_1, \dots, x_k$, take $x_{k+1}$ to be any vertex maximizing the sum of distances to the existing vertices and iterate: we…

We present an alternative proof of the Coisotropic Embedding Theorem in which the geometric choice of a connection is recast as the algebraic choice of an embedding into the cotangent bundle. The symplectic thickening is then identified as…