Related papers: The existence problem for Steiner networks in stri…
We study the fine-grained complexity of graph connectivity problems in unweighted undirected graphs. Recent development shows that all variants of edge connectivity problems, including single-source-single-sink, global, Steiner,…
We study the stability of partitions in convex domains involving simultaneous coexistence of three phases, viz. triple junctions. We present a careful derivation of the formula for the second variation of area, written in a suitable form…
We explore the idea of a network of defects to live inside a domain wall in models of three real scalar fields, engendering the Z_2 x Z_3 symmetry. The field that governs the Z_2 symmetry generates a domain wall, and entraps the hexagonal…
We prove an existence theorem for the sliding boundary variant of the Plateau problem for $2$-dimensional sets in $\mathbb{R}^n$. The simplest case of sufficient condition is when $n=3$ and the boundary $\Gamma$ is a finite disjoint union…
This paper deals with dynamical networks for which the relations between node signals are described by proper transfer functions and external signals can influence each of the node signals. In particular, we are interested in…
We study the least gradient problem in bounded regions with Lipschitz boundary in the plane. We provide a set of conditions for the existence of solutions in non-convex simply connected regions. We assume the boundary data is continuous and…
A directed network connecting a set A to a set B is a digraph containing an a-b path for each a in A and b in B. Vertices in the directed network not in A or B are called Steiner points. We show that in a finitely compact metric space in…
Geodesic nets are types of graphs in Riemannian manifolds where each edge is a geodesic segment. One important object used in the construction of geodesic nets is a balanced vertex, where the sum of unit tangent vectors along adjacent edges…
We study the two dimensional least gradient problem in a convex, but not necessary strictly convex region. We look for solutions in the space of $BV$ functions satisfying the boundary data $f$ in trace sense. We assume that $f$ is in $BV$…
Let $n$, $k$, and $t$ be integers satisfying $n>k>t\ge2$. A Steiner system with parameters $t$, $k$, and $n$ is a $k$-uniform hypergraph on $n$ vertices in which every set of $t$ distinct vertices is contained in exactly one edge. An…
In network flow problems, there is a well-known one-to-one relationship between extreme points of the feasibility region and trees in the associated undirected graph. The same is true for the dual differential problem. In this paper, we…
We study the two dimensional least gradient problem in convex polygonal sets in the plane, $\Omega$. We show the existence of solutions when the boundary data $f$ are attained in the trace sense. The main difficulty here is a possible…
Network connectivity is usually addressed for convex domains where a direct line of sight exists between any two transmitting/receiving nodes. Here, we develop a general theory for the network connectivity properties across a small opening,…
In this paper, we establish a priori estimates for a class of fully nonlinear equations with Neumann boundary conditions. By the continuity method, we have obtained the existence theorem for the Neumann problem.
Gradient boundedness up to the boundary for solutions to Dirichlet and Neumann problems for elliptic systems with Uhlenbeck type structure is established. Nonlinearities of possibly non-polynomial type are allowed, and minimal regularity on…
We prove an existence result for solutions to the stationary Euler equations in a domain with nonsmooth boundary. This is an extension of a previous existence result in smooth domains by Alber (1992). The domains we consider have a boundary…
We establish an upper bound on the minimum codegree necessary for the existence of spanning, fractional Steiner triple systems in $3$-uniform hypergraphs. This improves upon a result by Lee in 2023. In particular, together with results from…
In this article, we investigate the incoming boundary value problem for the stationary linearized Boltzmann equations in $ \Omega \subseteq \mathbb{R}^{3}$. For a $C^2$ bounded domain with boundary of positive Gaussian curvature, the…
In this study we consider the problem of triangulated graphs. Precisely we give a necessary and sufficient condition for a graph to be triangulated. This give an alternative characterization of triangulated graphs. Our method is based on…
Consider the following problem: given a graph with edge costs and a subset Q of vertices, find a minimum-cost subgraph in which there are two edge-disjoint paths connecting every pair of vertices in Q. The problem is a failure-resilient…