Related papers: The Takagi problem on the disk and bidisk

A natural kind of compactification of the virtual moduli spaces of rational functions of one complex variable is given. To describe the boundary points geometrically, the authors introduce the concept of rational functions with nodes,…

Polynomial optimization problems over binary variables can be expressed as integer programs using a linearization with extra monomials in addition to those arising in the given polynomial. We characterize when such a linearization yields an…

There are three new things in this paper about the open symmetrized bidisk $\mathbb G = \{(z_1+z_2, z_1z_2) : |z_1|, |z_2| < 1\}$. They are motivated in the Introduction. In this Abstract, we mention them in the order in which they will be…

It is shown that rational dilation fails on broad collection of distinguished varieties associated to constrained subalgebras of the disk algebra of the form C + B A(D), where B is a finite Blaschke product with two or more zeros. This is…

We here present three characterizations of not necessarily causal, rational functions which are (co)-isometric on the unit circle: (i) Through the realization matrix of Schur stable systems. (ii) The Blaschke-Potapov product, which is then…

Under conjugation by affine transformations, the dynamical moduli space of cubic polynomials $f$ with a $2$-cycle of Siegel disks is parameterized by a three-punctured complex plane as a degree-$2$ cover. Assuming the rotation number of…

This paper solves the open problem on the sharp bound for the number of isolated solutions in $\mathbf{R}_*^n$ to the real system of $n$ polynomial equations in $n$ variables, i.e., the real $n$ by $n$ fewnomial system. For an unmixed…

We present an approach to a large class of enumerative problems concerning rational curves in projective spaces. This approach uses analysis to obtain topological information about moduli spaces of stable maps. We demonstrate it by…

The problem of interpolation at $(n+1)^2$ points on the unit sphere $\mathbb{S}^2$ by spherical polynomials of degree at most $n$ is proved to have a unique solution for several sets of points. The points are located on a number of circles…

It is well known that for a first order system of linear difference equations with rational function coefficients, a solution that is holomorphic in some left half plane can be analytically continued to a meromorphic solution in the whole…

We give a specific method to solve with quadratic complexity the linear systems arising in known algorithms to deal with the sign determination problem. In particular, this enable us to improve the complexity bound for sign determination in…

We establish existence of positive non-decreasing radial solutions for a nonlocal nonlinear Neumann problem both in the ball and in the annulus. The nonlinearity that we consider is rather general, allowing for supercritical growth (in the…

We prove that there exist rational but not uniformly rational smooth algebraic varieties. The proof is based on computing a certain numerical obstruction developed in the case of compactifications of affine spaces. We show that for some…

We consider a modification of Winkler's "dots and coins" problem, where we constrain the dots to lie on a square lattice in the plane. We construct packings of "coins" (closed unit disks) using motif patterns.

This paper gives a complete answer to the following problem: Find the circle companion of the Hardy space of the unit disk with values in the space of all bounded linear operators between two separable Hilbert spaces. Classically, the…

Fix a ring $ R $ and look at the class of left $ R $-modules and naturally, we restrict ourselves to the case of rings such that this class is not too similar to the case $ R $ is a field. We shall solve Kaplansky test problems, all three…

We give a summary of joint work with Michael Thaddeus that realizes toroidal compactifcations of split reductive groups as moduli spaces of framed bundles on chains of rational curves. We include an extension of this work that covers Artin…

We show that finding minimally intersecting $n$ paths from $s$ to $t$ in a directed graph or $n$ perfect matchings in a bipartite graph can be done in polynomial time. This holds more generally for unimodular set systems.

We study the complexity of symmetric assembly puzzles: given a collection of simple polygons, can we translate, rotate, and possibly flip them so that their interior-disjoint union is line symmetric? On the negative side, we show that the…

We propose a method for finding approximate solutions to multiple-choice knapsack problems. To this aim we transform the multiple-choice knapsack problem into a bi-objective optimization problem whose solution set contains solutions of the…