Related papers: Efficient congruencing in ellipsephic sets: the qu…
An unsteady problem is considered for a space-fractional equation in a bounded domain. A first-order evolutionary equation involves the square root of an elliptic operator of second order. Finite element approximation in space is employed.…
We consider a linear-quadratic optimization problem with pointwise bounds on the state for which the constraint is given by the Laplace-Beltrami equation (to have uniqueness we add an lower order term) on a two-dimensional surface . By…
A common strategy in the numerical solution of partial differential equations is to define a uniform discretization of a tensor-product multi-dimensional logical domain, which is mapped to a physical domain through a given coordinate…
We study global solutions to the thin obstacle problem with at most quadratic growth at infinity. We show that every ellipsoid can be realized as the contact set of such a solution. On the other hand, if such a solution has a compact…
We present a new, far simpler family of counter-examples to Kushnirenko's Conjecture. Along the way, we illustrate a computer-assisted approach to finding sparse polynomial systems with maximally many real roots, thus shedding light on the…
Executing quantum algorithms on a quantum computer requires compilation to representations that conform to all restrictions imposed by the device. Due to devices' limited coherence times and gate fidelities, the compilation process has to…
In this paper, we propose criteria for unboundedness of the images of set-valued mappings having closed graphs in Euclidean spaces. We focus on mappings whose domains are non-closed or whose values are connected. These criteria allow us to…
We prove existence and regularity of solutions to degenerate and singular elliptic free boundary problems, where the volume of the positivity set of the solution is prescribed.
The aim of this work is to consider multiscale algorithms for solving PDEs with Galerkin methods on bounded domains. We provide results on convergence and condition numbers. We show how to handle PDEs with Dirichlet boundary conditions. We…
We use the ideas of symplectic quantization for quantizing fields in finite volumes. We consider, as examples, the Klein-Gordon and electromagnetic fields in three dif- ferent boxes. As a second idea we consider the given boundary…
Compared with constraint satisfaction problems, counting problems have received less attention. In this paper, we survey research works on the problems of counting the number of solutions to constraints. The constraints may take various…
We propose a locally conservative enriched Galerkin scheme that preserves the physical bounds for an elliptic problem. To this end, we use a substantial over-penalization of the discrete solution's jumps to obtain optimal convergence. To…
In this paper, we study some bounds for nonconvex quadratically constrained quadratic programs. We propose two types of bounds for quadratically constrained quadratic programs, quadratic and cubic bounds. For quadratic bounds, we use affine…
We derive an upper bound for the least number of variables needed to guarantee that a system of t quadratic forms (t>=2) over a field F has a nontrivial zero. In particular, if F is a local field, then 2t^2+3 variables insure the existence…
General results on convex bodies are reviewed and used to derive an exact closed-form parametric formula for the boundary of the geometric (Minkowski) sum of $k$ ellipsoids in $n$-dimensional Euclidean space. Previously this was done…
General results on convex bodies are reviewed and used to derive an exact closed-form parametric formula for the boundary of the geometric (Minkowski) sum of $k$ ellipsoids in $n$-dimensional Euclidean space. Previously this was done…
We address a specific but recurring problem related to sampled linear systems. In particular, we provide a numerical method for the rigorous verification of constraint satisfaction for linear continuous-time systems between sampling…
In this paper, we present efficient algorithms for solving the Diophantine equation $f(x, y) = m$ for an arbitrary definite binary quadratic form $f$, given the factorization of $m$. While Cornacchia's algorithm to solve $x^2 + dy^2 = m$ is…
We present a new algorithm for exactly solving decision making problems represented as influence diagrams. We do not require the usual assumptions of no forgetting and regularity; this allows us to solve problems with simultaneous decisions…
Quantum optimization algorithms hold the promise of solving classically hard, discrete optimization problems in practice. The requirement of encoding such problems in a Hamiltonian realized with a finite -- and currently small -- number of…