Related papers: Openness of Regular Regimes of Complex Random Matr…

We consider the problem of computing the q->p norm of a matrix A, which is defined for p,q \ge 1, as |A|_{q->p} = max_{x !=0 } |Ax|_p / |x|_q. This is in general a non-convex optimization problem, and is a natural generalization of the…

The present paper establishes a certain duality between the Dirichlet and Regularity problems for elliptic operators with $t$-independent complex bounded measurable coefficients ($t$ being the transversal direction to the boundary). To be…

This survey paper deals with upper and lower bounds on the number of $k$-matchings in regular graphs on $N$ vertices. For the upper bounds we recall the upper matching conjecture which is known to hold for perfect matchings. For the lower…

We prove the following Theorem: Let X be a nonempty compact metrizable space, let $l_1 \leq l_2 \leq...$ be a sequence of natural numbers, and let $X_1 \subset X_2 \subset...$ be a sequence of nonempty closed subspaces of X such that for…

We prove the existence of sectors of minimal growth for general closed extensions of elliptic cone operators under natural ellipticity conditions. This is achieved by the construction of a suitable parametrix and reduction to the boundary.…

We consider minimizing a conic quadratic objective over a polyhedron. Such problems arise in parametric value-at-risk minimization, portfolio optimization, and robust optimization with ellipsoidal objective uncertainty; and they can be…

We consider systems of parabolic linear equations, subject to Neumann boundary conditions on bounded domains in $\mathbb{R}^d$, that are coupled by a matrix-valued potential $V$, and investigate under which conditions each solution to such…

We introduce the concept of strong high-order approximate minimizers for nonconvex optimization problems. These apply in both standard smooth and composite non-smooth settings, and additionally allow convex or inexpensive constraints. An…

In the multiway cut problem, we are given an undirected graph with non-negative edge weights and a collection of $k$ terminal nodes, and the goal is to partition the node set of the graph into $k$ non-empty parts each containing exactly one…

This article introduces innovative classes of open sets in \(\mathbb{R}^{N}\), where \(N=2, 3\), characterized by a geometric property associated with the inward normal. The focus lies on proving compactness results for the Hausdorff…

Given a set of points $P$ and axis-aligned rectangles $\mathcal{R}$ in the plane, a point $p \in P$ is called \emph{exposed} if it lies outside all rectangles in $\mathcal{R}$. In the \emph{max-exposure problem}, given an integer parameter…

The motivating question of this paper is roughly the following: given a group scheme $G$ over $\mathbb{Z}_p$, $p$ prime, with semisimple generic fiber $G_{\mathbb{Q}_p}$, how far are open subgroups of $G(\mathbb{Z}_p)$ from subgroups of the…

We propose practical algorithms for entrywise $\ell_p$-norm low-rank approximation, for $p = 1$ or $p = \infty$. The proposed framework, which is non-convex and gradient-based, is easy to implement and typically attains better…

Comparison of the thermodynamic entropy with Boltzmann's principle shows that under conditions of constant volume the total number of arrangements in simple thermodynamic systems with temperature-independent heat capacities is TC/k. A…

For every algebraically closed field $\boldsymbol k$ of characteristic different from $2$, we prove the following: (1) Generic finite dimensional (not necessarily associative) $\boldsymbol k$-algebras of a fixed dimension, considered up to…

The subspace approximation problem Subspace($k$,$p$) asks for a $k$-dimensional linear subspace that fits a given set of points optimally, where the error for fitting is a generalization of the least squares fit and uses the $\ell_{p}$ norm…

Let $K$ be a field. The \'etale open topology on the $K$-points $V(K)$ of a $K$-variety $V$ was introduced in our previous work. The \'etale open topology is non-discrete if and only if $K$ is large. If $K$ is separably, real, $p$-adically…

We consider a continuous analogue of Babai et al.'s and Cai et al.'s problem of solving multiplicative matrix equations. Given $k+1$ square matrices $A_{1}, \ldots, A_{k}, C$, all of the same dimension, whose entries are real algebraic, we…

In a sequence of seminal results in the 80's, Kaltofen showed that the complexity class VP is closed under taking factors. A natural question in this context is to understand if other natural classes of multivariate polynomials, for…

We consider the problem of constructing honest and adaptive confidence sets in Lp-loss (with p>=1 and p < infinity) over sets of Sobolev-type classes, in the setting of non-parametric Gaussian regression. The objective is to adapt the…