Let Omega subset of R-n be an open set, A is an element of R-nxn and G : Omega -> R-nxn be given. We look for a solution u : Omega -> R-n of the equation ...
What is the longest rope on the unit sphere? Intuition tells us that the answer to this packing problem depends on the rope's thickness. For a countably infinite number of prescribed thickness values we construct and classify all solution curves. The simpl ...
The classical problem in a network coding theory considers communication over multicast networks. Multiple transmitters send independent messages to multiple receivers that decode the same set of messages. In this paper, computation over multicast networks ...
Institute of Electrical and Electronics Engineers2016
Let c : A(k-1) -> R+ be convex and Omega subset of R-n be a bounded domain. Let f(0) and f(1) be two closed k-forms on Omega satisfying appropriate boundary conditions. We discuss the minimization of integral(Omega) c (A) dx over a subset of (k - 1)-forms ...
Discrete choice models are defined conditional to the analyst's knowledge of the actual choice set. The common practice for many years has been to assume that individual-based choice sets can be deterministically generated on the basis of the choice contex ...
A Dirichlet problem for orthogonal Hessians in two dimensions is explicitly solved, by characterizing all piecewise C-2 functions u Omega subset of R-2 -> R with orthogonal Hessian in terms of a property named "second order angle condition" as in (1 1) ...
