Related papers: The existence problem for Steiner networks in stri…
A sufficient condition for the infinite dimensionality of the Bergman space of a pseudoconvex domain is given. This condition holds on any pseudoconvex domain that has at least one smooth boundary point of finite type in the sense of…
A graph $G$ is {\it $n$-existentially closed} if, for all disjoint sets of vertices $A$ and $B$ with $|A\cup B|=n$, there is a vertex $z$ not in $A\cup B$ adjacent to each vertex of $A$ and to no vertex of $B$. In this paper, we investigate…
Bottleneck Steiner networks model energy consumption in wireless ad-hoc networks. The task is to design a network spanning a given set of terminals and at most $k$ Steiner points such that the length of the longest edge is minimised. The…
We consider a system of nonlinear Schrodinger equations with three waves interaction studying the existence of ground state solutions. In particular, we find a vector ground state, namely a ground state with the three components all…
A Triangulated Irregular Network (TIN) is a data structure that is usually used for representing and storing monotone geographic surfaces, approximately. In this representation, the surface is approximated by a set of triangular faces whose…
We investigate stability properties of the motion by curvature of planar networks. We prove Lojasiewicz-Simon gradient inequalities for the length functional of planar networks with triple junctions. In particular, such an inequality holds…
A graph is $n$-existentially closed ($n$-e.c.) if for any disjoint subsets $A$, $B$ of vertices with $|{A \cup B}|=n$, there is a vertex $z \notin A \cup B$ adjacent to every vertex of $A$ and no vertex of $B$. For a block design with block…
The quest for optimal/stable paths in graphs has gained attention in a few practical or theoretical areas. To take part in this quest this chapter adopts an equilibrium-oriented approach that is abstract and general: it works with…
Motivated by a result of [1] which states that if F is a subgraph of a convex complete graph K_n and F contains no boundary edge of K_n and |E(F)| \leq n-3, then K_n - F admits a triangulation, we determine necessary and sufficient…
In this paper, we study the problem of constructing a network by observing ordered connectivity constraints, which we define herein. These ordered constraints are made to capture realistic properties of real-world problems that are not…
We initiate the study of degree-bounded network design problems in the online setting. The degree-bounded Steiner tree problem { which asks for a subgraph with minimum degree that connects a given set of vertices { is perhaps one of the…
We review some recent results and announce some new ones on the problem of the existence of ground states for the Nonlinear Schr\"odinger Equation on graphs endowed with vertices where the matching condition, instead of being free (or…
We consider a one-dimensional free boundary problem governed by a nonlinear diffusion - convection equation with a Neumann condition at fixed face $x=0$, which is variable in time and a like Stefan convective condition on the free boundary.…
We investigate the presence of domain walls in models described by three real scalar fields. We search for stable defect structures which minimize the energy of the static field configurations. We work out explict orbits in field space and…
While much of network design focuses mostly on cost (number or weight of edges), node degrees have also played an important role. They have traditionally either appeared as an objective, to minimize the maximum degree (e.g., the Minimum…
We prove an existence result for the steady state flow of gas mixtures on networks. The basis of the model are the physical principles of the isothermal Euler equation, coupling conditions for the flow and pressure, and the mixing of…
The Graetz problem is a convection-diffusion equation in a pipe invariant along a direction. The contribution of the present work is to propose a mathematical analysis of the Neumann, Robin and periodic boundary condition on the boundary of…
Given a finite set of points in $\mathbb{R}^d$, Tverberg's theorem guarantees the existence of partitions of this set into parts whose convex hulls intersect. We introduce a graph structured on the family of Tverberg partitions of a given…
We investigate the increasingly prominent task of jointly inferring multiple networks from nodal observations. While most joint inference methods assume that observations are available at all nodes, we consider the realistic and more…
We consider the eigenvalue problem for the Schr\"odinger operator on bounded, convex domains with mixed boundary conditions, where a Dirichlet boundary condition is imposed on a part of the boundary and a Neumann boundary condition on its…