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

We introduce a general random model of a combinatorial optimization problem with geometric structure that encapsulates both linear programming and integer linear programming. Let $Q$ be a bounded set called the feasible set, $E$ be an…

For every multivariable polynomial $p$, with $p(0)=1$, we construct a determinantal representation $$p=\det (I - K Z),$$ where $Z$ is a diagonal matrix with coordinate variables on the diagonal and $K$ is a complex square matrix. Such a…

It is shown that any smooth closed orientable manifold of dimension $2k + 1$, $k \geq 2$, admits a smooth polynomially convex embedding into $\mathbb C^{3k}$. This improves by $1$ the previously known lower bound of $3k+1$ on the possible…

We show $L^p$ estimates for square roots of second order complex elliptic systems $L$ in divergence form on open sets in $\mathbb{R}^d$ subject to mixed boundary conditions. The underlying set is supposed to be locally uniform near the…

We initiate a systematic study of the computational complexity of the Constraint Satisfaction Problem (CSP) over finite structures that may contain both relations and operations. We show the close connection between this problem and a…

We study the satisfiability of ordering constraint satisfaction problems (CSPs) above average. We prove the conjecture of Gutin, van Iersel, Mnich, and Yeo that the satisfiability above average of ordering CSPs of arity $k$ is…

We consider a positive and power-bounded linear operator $T$ on $L^p$ over a finite measure space and prove that, if $TL^p \subseteq L^q$ for some $q > p$, then the essential spectral radius of $T$ is strictly smaller than $1$. As a special…

We consider adaptive approximations of the parameter-to-solution map for elliptic operator equations depending on a large or infinite number of parameters, comparing approximation strategies of different degrees of nonlinearity: sparse…

It is shown that two vectors with coordinates in the finite $q$-element field of characteristic $p$ belong to the same orbit under the natural action of the symmetric group if each of the elementary symmetric polynomials of degree…

A semilinear relation S is max-closed if it is preserved by taking the componentwise maximum. The constraint satisfaction problem for max-closed semilinear constraints is at least as hard as determining the winner in Mean Payoff Games, a…

We introduce and study $\ell_p$-norm-multiway-cut: the input here is an undirected graph with non-negative edge weights along with $k$ terminals and the goal is to find a partition of the vertex set into $k$ parts each containing exactly…

We consider the approximability of the maximum edge-disjoint paths problem (MEDP) in undirected graphs, and in particular, the integrality gap of the natural multicommodity flow based relaxation for it. The integrality gap is known to be…

Let $K$ be a number field and $A/K$ be an abelian variety of dimension $g$. Assuming that the image $G_{\ell^\infty}$ of the natural Galois representation attached to the Tate module $T_\ell(A)$ is $\operatorname{GSp}_{2g}(\mathbb{Z}_\ell)$…

In this paper we derive strong linear inequalities for sets of the form {(x, q) \in Rd \times R : q \geq Q(x), x \in Rd - int(P)}, where Q(x) : Rd \rightarrow R is a quadratic function, P \subset Rd and "int" denotes interior. Of particular…

Let $X$ be a normal geometrically connected variety over a finite field $\kappa$ of characteristic~$p$. Let $E$ be a number field. Using automorphic methods over global function fields, we derive properties of the geometric monodromy groups…

For any $k \in \Nat$, we show that the cone of $(k+1)$-secant lines of a closed subscheme $Z \subset \mathbb{P}^n_K$ over an algebraically closed field $K$ running through a closed point $p \in \mathbb{P}^n_K$ is defined by the $k$-th…

We consider relative or subjective optimization problems where the goal function and feasible set are dependent of the current state of the system under consideration. In general, they are formulated as quasi-equilibrium problems, hence…

We study the problem of computing the $p\rightarrow q$ norm of a matrix $A \in R^{m \times n}$, defined as \[ \|A\|_{p\rightarrow q} ~:=~ \max_{x \,\in\, R^n \setminus \{0\}} \frac{\|Ax\|_q}{\|x\|_p} \] This problem generalizes the spectral…

We consider divergence form elliptic equations $Lu:=\nabla\cdot(A\nabla u)=0$ in the half space $\mathbb{R}^{n+1}_+ :=\{(x,t)\in \mathbb{R}^n\times(0,\infty)\}$, whose coefficient matrix $A$ is complex elliptic, bounded and measurable. In…

We propose, analyze, and test a proximal-gradient method for solving regularized optimization problems with general constraints. The method employs a decomposition strategy to compute trial steps and uses a merit function to determine step…