相关论文: Phragm\`en-Lindel\"of type theorems for parabolic …
We investigate the validity of the Phragm\`en-Lindel\"of principle for a class of elliptic equations with a potential, posed on infinite graphs. Consequently, we get uniqueness, in the class of solutions satisfying a suitable growth…
We investigate a version of the Phragm\'en-Lindel\"of theorem for solutions of the equation $\Delta_\infty u=0$ in unbounded convex domains. The method of proof is to consider this infinity harmonic equation as the limit of the $p$-harmonic…
We prove versions of the Phragm\'en--Lindel\"of strong maximum principle for generalized analytic functions defined on unbounded domains. A version of Hadamard's three-lines theorem is also derived.
We establish two Phragm\'en--Lindel\"{o}f theorems for a fully nonlinear elliptic equation. We consider a dynamic boundary condition that includes both spatial variable and time derivative terms. As a spatial term, we consider a non-linear…
Paper dedicated to qualitative study of the solution of the Zaremba type problem in Lipschitz domain with respect to the elliptic equation in non-divergent form. Main result is Landis type Growth Lemma in spherical layer for Mixed Boundary…
Using the spectral theory of weakly convergent sequences of finite graphs, we prove the uniform existence of the integrated density of states for a large class of infinite graphs.
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…
We investigate the qualitative properties of solution to the Zaremba type problem in unbounded domain for the non-divergence elliptic equation with possible degeneration at infinity. The main result is Phragm\'en-Lindel\"of type principle…
In this paper we study the Cauchy problem for overdetermined systems of linear partial differential operators with constant coefficients in some spaces of $\omega$-ultradifferentiable functions in the sense of Braun, Meise and Taylor, for…
We present a Phragm\'en-Lindel\"of type theorem with a flavor of Nevanlinna's theorem for subharmonic functions with frequent oscillations between zero and one. We use a technique inspired by a paper of Jones and Makarov.
For a $k$-uniform hypergraph $F$ let $\textrm{ex}(n,F)$ be the maximum number of edges of a $k$-uniform $n$-vertex hypergraph $H$ which contains no copy of $F$. Determining or estimating $\textrm{ex}(n,F)$ is a classical and central problem…
The Cauchy problem for a quasilinear system of hyperbolic-parabolic equations is addressed with the method of linearization and fixed point. Coupling between the hyperbolic and parabolic variables is allowed in the linearization and we do…
We show that if a graph admits a packing and a covering both consisting of $\lambda$ many spanning trees, where $\lambda$ is some infinite cardinal, then the graph also admits a decomposition into $\lambda$ many spanning trees. For finite…
In this paper, we present several density-type theorems which show how to find a copy of a sparse bipartite graph in a graph of positive density. Our results imply several new bounds for classical problems in graph Ramsey theory and improve…
In this paper we establish a Fr\'{e}chet law for maximal cuspidal windings of the geodesic flow on a Riemannian surface associated with an arbitrary finitely generated, essentially free Fuchsian group with parabolic elements. This result…
Fr\"oberg's classical theorem about edge ideals with $2$-linear resolution can be regarded as a classification of graphs whose edge ideals have linearity defect zero. Extending his theorem, we classify all graphs whose edge ideals have…
A rigidity theory is developed for the Euclidean and non-Euclidean placements of countably infinite simple graphs in R^d with respect to the classical l^p norms, for d>1 and 1<p<\infty. Generalisations are obtained for the Laman and…
We apply ideas from the theory of limits of dense combinatorial structures to study order types, which are combinatorial encodings of finite point sets. Using flag algebras we obtain new numerical results on the Erd\H{o}s problem of finding…
We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…
In this paper, we study dynamical optimal transport on a connected graph from the perspective of the Benamou-Brenier formulation, where densities are assigned to vertices and velocities to edges. However, directly using Newton's method on…