Related papers: The double phase problems on lattice graphs
Partial vertex cover and partial dominating set are two well-investigated optimization problems. While they are $\rm W[1]$-hard on general graphs, they have been shown to be fixed-parameter tractable on many sparse graph classes, including…
This is a first part of a series of papers in which we develop explicit computational methods for automorphic forms for GL(3) and PGL(3) over elliptic function fields. In this first part, we determine explicit formulas for the action of the…
Coupled map lattices have been widely used as models in several fields of physics, such as chaotic strings, turbulence, and phase transitions, as well as in other disciplines, such as biology (ecology, evolution) and information processing.…
In Lorentz-Minkowski space, we prove that the conjugate surface of a maximal graph over a convex domain is also a graph. We provide three proofs of this result that show a suitable correspondence between maximal surfaces in…
This paper reviews the moment graph technique that allows to translate certain representation theoretic problems into geometric ones. For simplicity we restrict ourselves to the case of semisimple complex Lie algebras. In particular, we…
In this paper,we consider the solutions of the elliptic double obstacle problems with Orlicz growth involving measure data. Some pointwise estimates for the approximable solutions to these problems are obtained in terms of fractional…
A recent development in graph-minor theory is to study local separators, vertex-sets that separate graphs locally but not necessarily globally. The local separators of a graph roughly correspond to the genuine separators of its local…
For a finite not necessarily compact metric graph, one considers the differential expression $-\frac{d^2}{d x^2}$ on each edge. The boundary conditions at the vertices of the graph yielding quasi-m-accretive as well as m-accretive operators…
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum dominating set problem and the maximum matching problem in…
We apply model theoretic methods to the problem of existence of countable universal graphs with finitely many forbidden connected subgraphs. We show that to a large extent the question reduces to one of local finiteness of an…
Existence of nontrivial topological phases in a tight binding Haldane-like model on the depleted Lieb lattice is reported. This two-band model is formulated by considering the nearest-neighbor, next-nearest-neighbor and…
Given an input graph and weights on its vertices, the maximum co-2-plex problem is to find a subset of vertices maximizing the sum of their weights and inducing a graph of degree at most 1. In this article, we analyze polyhedral aspects of…
Inspired by notorious combinatorial optimization problems on graphs, in this paper we consider a series of related problems defined using a metric space and topology determined by a graph. Particularly, we present the Independent Set,…
Graphs constructed to translate some graph problem into another graph problem are usually called auxiliary graphs. Specifically total graphs of simple graphs are used to translate the total colouring problem of the original graph into a…
In this paper, we present two new matrices, namely the resistance Laplacian and resistance signless Laplacian matrix of a connected graph. We provide a generalized form of these matrices for different classes of graphs, including the…
We study the most general Two Higgs Doublet Model with $SU(2)$ gauge fields on the lattice. The phase space is probed through the computation of gauge-invariant global observables serving as proxies for order parameters. In each phase, the…
We study the uniqueness of optimal solutions to extremal graph theory problems. Lovasz conjectured that every finite feasible set of subgraph density constraints can be extended further by a finite set of density constraints so that the…
For the parabolic obstacle-problem-like equation $$\Delta u - \partial_t u = \lambda_+ \chi_{\{u>0\}} - \lambda_- \chi_{\{u<0\}} ,$$ where $\lambda_+$ and $\lambda_-$ are positive Lipschitz functions, we prove in arbitrary finite dimension…
We study the connections between volume growth, spectral properties and stochastic completeness of locally finite graphs. For a class of graphs with a very weak spherical symmetry we give a condition which implies both stochastic…
In this paper we discuss the problem of decomposition for unbounded $2\times 2$ operator matrices by a pair of complementary invariant graph subspaces. Under mild additional assumptions, we show that such a pair of subspaces decomposes the…