Related papers: Effective Kohn Algorithm for Special Domain Define…
For each $n$, let RD$(n)$ denote the minimum $d$ for which there exists a formula for the general polynomial of degree $n$ in algebraic functions of at most $d$ variables. In this paper, we recover an algorithm of Sylvester for determining…
This paper is devoted to the investigation of multidimensional analogues of refined Bohr-type inequalities for bounded holomorphic mappings on the unit polydisc $\mathbb{D}^n$. We establish a sharp extension of the classical Bohr…
For solving large-scale non-convex problems, we propose inexact variants of trust region and adaptive cubic regularization methods, which, to increase efficiency, incorporate various approximations. In particular, in addition to approximate…
In this paper we study optimization problems for Neumann eigenvalues $\mu_k$ among convex domains with a constraint on the diameter or the perimeter. We work mainly in the plane, though some results are stated in higher dimension. We study…
A classical pseudodifferential operator $P$ on $R^n$ satisfies the $\mu$-transmission condition relative to a smooth open subset $\Omega $, when the symbol terms have a certain twisted parity on the normal to $\partial\Omega $. As shown…
Hailperin (1965) introduced a linear programming formulation to a difficult family of problems, originally proposed by Boole (1854,1868). Hailperin's model is computationally still difficult and involves an exponential number of variables…
For all $N \geq 9$, we find smooth entire epigraphs in $\R^N$, namely smooth domains of the form $\Omega : = \{x\in \R^N\ / \ x_N > F (x_1,\ldots, x_{N-1})\}$, which are not half-spaces and in which a problem of the form $\Delta u + f(u) =…
The fastest known algorithm for factoring univariate polynomials over finite fields is the Kedlaya-Umans (fast modular composition) implementation of the Kaltofen-Shoup algorithm. It is randomized and takes $\widetilde{O}(n^{3/2}\log q + n…
We study eigenvalue problems for the de Rham complex on varying three dimensional domains. Our analysis includes the Helmholtz equation as well as the Maxwell system with mixed boundary conditions and non-constant coefficients. We provide…
We show new upper and lower bounds for the effective differential Nullstellensatz for differential fields of characteristic zero with several commuting derivations. Seidenberg was the first to address this problem in 1956, without giving a…
This paper presents an extension of the unfolding operator technique, initially applied to two-dimensional domains, to the realm of three-dimensional thin domains. The advancement of this methodology is pivotal, as it enhances our…
We study the most elementary aspects of harmonic analysis on a homogeneous space of a deformation of the two-dimensional Euclidean group, admitting generalizations to dimensions three and four, whose quantum parameter has the physical…
A classical open problem in combinatorial geometry is to obtain tight asymptotic bounds on the maximum number of k-level vertices in an arrangement of n hyperplanes in d dimensions (vertices with exactly k of the hyperplanes passing below…
Based on recent ideas, stemming from the use of bubbles, we discuss an algorithm for the numerical simulation of the cubic nonlinear Schr{\"o}dinger equation with harmonic potential in any dimension, which could be easily extended to other…
This paper is devoted to the investigation of multidimensional analogues of refined Bohr-type inequalities for bounded holomorphic mappings on the unit polydisc $\mathbb{P}\Delta(0;1_n)$. We provide a definitive resolution to the Bohr…
A numerical algorithm is proposed to deal with parametric eigenvalue problems involving non-Hermitian matrices and is exploited to find location of defective eigenvalues in the parameter space of non-Hermitian parametric eigenvalue…
The techniques and analysis presented in this paper provide new methods to solve optimization problems posed on Riemannian manifolds. A new point of view is offered for the solution of constrained optimization problems. Some classical…
We derive lower bounds on the black-box oracle complexity of large-scale smooth convex minimization problems, with emphasis on minimizing smooth (with Holder continuous, with a given exponent and constant, gradient) convex functions over…
We consider the NP-hard problem of minimizing a separable concave quadratic function over the integral points in a polyhedron, and we denote by D the largest absolute value of the subdeterminants of the constraint matrix. In this paper we…
Quantum logic was introduced in 1936 by Garrett Birkhoff and John von Neumann as a framework for capturing the logical peculiarities of quantum observables. It generalizes, and on 1-dimensional Hilbert space coincides with, Boolean…