Related papers: Concentration of cones in the Alt-Phillips problem
A general prescription for the treatment of constrained quantum motion is outlined. We consider in particular constraints defined by algebraic submanifolds of the quantum state space. The resulting formalism is applied to obtain solutions…
An approximate method is proposed for the recovery of a compactly supported spherically-symmetric potential from the set of fixed-energy phase-shifts known for all angular momenta. The method reduces the inverse scattering problem to a…
In this paper, we are concerned with the following elliptic equation \begin{equation*} \begin{cases} -\Delta u= Q(x)u^{2^*-1 }+\varepsilon u^{s},~ &{\text{in}~\Omega},\\[1mm] u>0,~ &{\text{in}~\Omega},\\[1mm] u=0, &{\text{on}~\partial…
We study the double obstacle problem for p-harmonic functions on arbitrary bounded nonopen sets E in quite general metric spaces. The Dirichlet and single obstacle problems are included as special cases. We obtain Adams' criterion for the…
Given a set P of n points in the plane, the two-line center problem asks to find two lines that minimize the maximum distance from each point in P to its closer one of the two resulting lines. The currently best algorithm for the problem…
The minimum dominating set problem asks for a dominating set with minimum size. First, we determine some vertices contained in the minimum dominating set of a graph. By applying a particular scheme, we ensure that the resulting graph is…
The longstanding open problem of approximating all singular vertex couplings in a quantum graph is solved. We present a construction in which the edges are decoupled; an each pair of their endpoints is joined by an edge carrying a $\delta$…
In this paper, we establish an $\varepsilon$-regularity theorem for minimizers of an Alt-Phillips type functional subject to constraint maps. We prove that under sufficiently small energy, the minimizers exhibit regularity, and hence…
Systems of identical particles with equal charge are studied under a special type of confinement. These classical particles are free to move inside some convex region S and on the boundary of it $\Omega$ (the $S^{d-1}-$ sphere, in our…
We first study Clarke's tangent cones at infinity to unbounded subsets of $\mathbb{R}^n.$ We prove that these cones are closed convex and show a characterization of their interiors. We then study subgradients at infinity for extended real…
We consider the semilinear elliptic boundary value problem \[ -\Delta u=\left\vert u\right\vert ^{p-2}u\text{ in }\Omega,\text{\quad }u=0\text{ on }\partial\Omega, \] in a bounded smooth domain $\Omega$ of $\mathbb{R}^{N}$ for supercritical…
Exact solutions describing a fall of a particle to the center of a non-regularized singular potential in classical and quantum cases are obtained and compared. We inspect the quantum problem with the help of the conventional…
We discuss the optimization problem for minimizing the $(n-1)$-volume of the intersection of a convex cone $K$ in $\Bbb R^n$ with a hyperplane through a given point, first considered in \cite{We}. We give a geometric characterization of the…
Let $X$ be a scheme of finite type over $\mathbf{Z}$. For $p \in \mathcal{P}$ the set of prime numbers, let $N_{X}(p)$ be the number of $\mathbf{F}_{p}$-points of $X/\mathbf{F}_{p}$. For fixed $n\geq 1$ and $a_{1}, \ldots, a_{n} \in…
We consider two orientation problems in a graph, namely the minimization of the sum of all the shortest path lengths and the minimization of the diameter. We show that it is NP-complete to decide whether a graph has an orientation such that…
In this paper we considerably extend the class of known $\alpha$-minimizing hypercones using sub-calibration methods. Indeed, the improvement of previous results follows from a careful analysis of special cubic and quartic polynomials.
We investigate the next Trudinger-Moser critical equations, \[ \begin{cases} -\Delta u=\lambda ue^{u^2+\alpha|u|^\beta}&\text{ in }B,\\ u=0&\text{ on }\partial B, \end{cases} \] where $\alpha>0$, $(\lambda,\beta)\in(0,\infty)\times(0,2)$…
We consider min-max optimization problems for polynomial functions, where a multivariate polynomial is maximized with respect to a subset of variables, and the resulting maximal value is minimized with respect to the remaining variables.…
Certifying feasibility in decision-making, critical in many industries, can be framed as a constraint satisfaction problem. This paper focuses on characterising a subset of parameter values from an a priori set that satisfy constraints on a…
In this paper we study the problem of maximizing the distance to a given point over an intersection of balls. It was already known that this problem can be solved in polynomial time and space if the given point is not in the convex hull of…