Bounded and unbounded capillary surfaces in a cusp domain
نویسندگان
چکیده
منابع مشابه
EXISTENCE OF A STEADY FLOW WITH A BOUNDED VORTEX IN AN UNBOUNDED DOMAIN
We prove the existence of steady 2-dimensional flows, containing a bounded vortex, and approaching a uniform flow at infinity. The data prescribed is the rearrangement class of the vorticity field. The corresponding stream function satisfies a semilinear elliptic partial differential equation. The result is proved by maximizing the kinetic energy over all flows whose vorticity fields are rearra...
متن کاملexistence of a steady flow with a bounded vortex in an unbounded domain
we prove the existence of steady 2-dimensional flows, containing a bounded vortex, and approaching a uniform flow at infinity. the data prescribed is the rearrangement class of the vorticity field. the corresponding stream function satisfies a semilinear elliptic partial differential equation. the result is proved by maximizing the kinetic energy over all flows whose vorticity fields are rearra...
متن کاملBounded Domains and Unbounded Domains
First, notions of inside components and outside components are introduced for any subset of n-dimensional Euclid space. Next, notions of the bounded domain and the unbounded domain are defined using the above components. If the dimension is larger than 1, and if a subset is bounded, a unbounded domain of the subset coincides with an outside component (which is unique) of the subset. For a spher...
متن کاملUnbounded Allocation in Bounded Heaps
In this paper we introduce a new symbolic semantics for a class of recursive programs which feature dynamic creation and unbounded allocation of objects. We use a symbolic representation of the program state in terms of equations to model the semantics of a program as a pushdown system with a finite set of control states and a finite stack alphabet. Our main technical result is a rigorous proof...
متن کاملAutonomous Scheduling with Unbounded and Bounded Agents
Autonomous scheduling deals with the problem how to enable agents to schedule a set of interdependent tasks in such a way that whatever schedule they choose for their tasks, the individual schedules always can be merged into a global feasible schedule? Unlike the traditional approaches to distributed scheduling we do not enforce a fixed schedule to every participating agent. Instead we guarante...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 2012
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.2012.257.143