Related papers: Algorithms for subelliptic multipliers in $\mathbb…
In this paper, we obtain a more precise estimate of Catlin-type distance for smoothly bounded pseudoconvex domain of finite type in $\mathbb{C}^2$. As an application, we get an alternative proof of the Gromov hyperbolicity of this domain…
This paper treats subelliptic estimates for the $\bar{\partial}$-Neumann problem on a class of domains known as regular coordinate domains. Our main result is that the largest subelliptic gain for a regular coordinate domain is bounded…
We present combinatorial upper bounds on dimensions of certain imaginary root spaces for symmetric Kac-Moody algebras. These come from the realization of the corresponding infinity-crystal using quiver varieties. The framework is general,…
In this paper, we study supnorm and modified H\"{o}lder estimates for the integral solution of the di-bar-equation on a class of convex domains of general type in $\C^2$ that includes many infinite type examples.
We propose several constructions for the original multiplication algorithm of D.V. and G.V. Chudnovsky in order to improve its scalar complexity. We highlight the set of generic strategies who underlay the optimization of the scalar…
We study the question of whether parallelization in the exploration of the feasible set can be used to speed up convex optimization, in the local oracle model of computation. We show that the answer is negative for both deterministic and…
We investigate the notion of symplectic divisorial compactification for symplectic 4-manifolds with either convex or concave type boundary. This is motivated by the notion of compactifying divisors for open algebraic surfaces. We give a…
We obtain existence and convergence theorems on two variants of the proximal point algorithm for proper lower semicontinuous convex functions in complete geodesic spaces with curvature bounded above.
It is well known that derivatives of solutions to elliptic boundary value problems may become unbounded near the corner of a domain with a conical singularity, even if the data are smooth. When the corner domain is approximated by more…
In 1979 J.J. Kohn gave an indirect argument via the Diederich-Forn\ae ss Theorem showing that finite D'Angelo type implies termination of the Kohn algorithm for a pseudoconvex domain with real-analytic boundary. We give here a direct…
We give a description (direct formulas) of all complex geodesics in a convex tube domain in $\CC^n$ containing no complex affine lines, expressed in terms of geometric properties of the domain. We next apply that result to give formulas (a…
We investigate the continuous non-monotone DR-submodular maximization problem subject to a down-closed convex solvable constraint. Our first contribution is to construct an example to demonstrate that (first-order) stationary points can…
We derive optimal estimates for the Bergman kernel and the Bergman metric for certain model domains in $\mathbb{C}^2$ near boundary points that are of infinite type. Being unbounded models, these domains obey certain geometric constraints…
We present a random-subspace variant of cubic regularization algorithm that chooses the size of the subspace adaptively, based on the rank of the projected second derivative matrix. Iteratively, our variant only requires access to…
We consider the problem of minimizing a sum of non-convex functions over a compact domain, subject to linear inequality and equality constraints. Approximate solutions can be found by solving a convexified version of the problem, in which…
This paper is the second part of our series of works to establish $L^2$ estimates and existence theorems for the $\overline{\partial}$ operators in infinite dimensions. In this part, we consider the most difficult case, i.e., the underlying…
In this paper we develop new reduction techniques for testing the finiteness of the finitistic dimension of a finite dimensional algebra over a field. Viewing the latter algebra as a quotient of a path algebra, we propose two operations on…
Pseudoconvexity of a domain in $\Bbb C^n$ is described in terms of the existence of a locally defined plurisubharmonic/holomorphic function near any boundary point that is unbounded at the point.
A sufficient condition for $\bar{\partial}$ to have closed range is given for pseudoconvex, possibly unbounded domains in $\mathbb{C}^n$.
Submodularity is one of the most well-studied properties of problem classes in combinatorial optimization and many applications of machine learning and data mining, with strong implications for guaranteed optimization. In this thesis, we…