English
Related papers

Related papers: Infinitely many solutions for a biharmonic-Kirchho…

200 papers

This paper studies the $p$-biharmonic equation on graphs, which arises in point cloud processing and can be interpreted as a natural extension of the graph $p$-Laplacian from the perspective of hypergraph. The asymptotic behavior of the…

Analysis of PDEs · Mathematics 2025-04-28 Kehan Shi , Martin Burger

In this paper, we study an overdetermined problem with Kirchhoff type nonlocal terms related to the celebrated work by Serrin. We obtain the precise number of solutions according to the value of the bifurcation parameter and study…

Analysis of PDEs · Mathematics 2024-12-13 Kazuki Sato , Futoshi Takahashi

We prove that a fractional perfect matching in a non-bipartite graph can be written, in polynomial time, as a convex combination of perfect matchings. This extends the Birkhoff-von Neumann Theorem from bipartite to non-bipartite graphs. The…

Data Structures and Algorithms · Computer Science 2020-10-16 Vijay V. Vazirani

It is developed the theory of the Dirichlet problem for harmonic functions. On this basis, for the nondegenerate Beltrami equations in the quasidisks and, in particular, in the smooth domains, it is proved the existence of regular solutions…

Complex Variables · Mathematics 2017-10-19 Artyem Yefimushkin , Vladimir Ryazanov

In this paper we prove some linking theorems and mountain pass type results for dynamical systems in terms of local semiflows on complete metric spaces. Our results provide an alternative approach to detect the existence of compact…

Dynamical Systems · Mathematics 2015-05-19 Desheng Li , Guoliang Shi , Xianfa Song

Nonlocal models and their associated theories have been extensively investigated in recent years. Among these, nonlocal versions of the classical Laplace operator have attracted the most attention, while higher-order nonlocal operators have…

Analysis of PDEs · Mathematics 2025-05-13 Weiye Gan , Tangjun Wang , Qiang Du , Zuoqiang Shi

Invariant manifolds provide the geometric structures for describing and understanding dynamics of nonlinear systems. The theory of invariant manifolds for both finite and infinite dimensional autonomous deterministic systems, and for…

Dynamical Systems · Mathematics 2007-05-23 Jinqiao Duan , Kening Lu , Bjoern Schmalfuss

In this paper, a critical Kirchhoff equation with a logarithmic type subcritical term is considered in a bounded domain in $\mathbb{R}^4$. We view this problem as a critical elliptic equation with a nonlocal perturbation, and investigate…

Analysis of PDEs · Mathematics 2025-04-30 Qian Zhang , Yuzhu Han

In this article, we consider nonlocal Hamilton-Jacobi Equations on networks with Kirchhoff type conditions for the interior vertices and Dirichlet boundary conditions for the boundary ones: our aim is to provide general existence and…

Analysis of PDEs · Mathematics 2024-11-21 Guy Barles , Olivier Ley , Erwin Topp

\noi In this article, we study the existence of non-negative solutions of the following polyharmonic Kirchhoff type problem with critical singular exponential nolinearity $$ \quad \left\{ \begin{array}{lr} \quad…

Analysis of PDEs · Mathematics 2016-04-04 Pawan Kumar Mishra , Sarika Goyal , K. Sreenadh

This paper deals with the existence and multiplicity of solutions for a class of Kirchhoff type elliptic system involving the Trudinger-Moser exponential growth nonlinearities. We first study the existence of solutions for the following…

Analysis of PDEs · Mathematics 2022-10-06 Shengbing Deng , Xingliang Tian

We develop a new approach to recurrence and the existence of non-constant harmonic functions on infinite weighted graphs. The approach is based on the capacity of subsets of metric boundaries with respect to intrinsic metrics. The main tool…

Functional Analysis · Mathematics 2023-01-06 Daniel Lenz , Simon Puchert , Marcel Schmidt

The maximization for the independence systems defined on graphs is a generalization of combinatorial optimization problems such as the maximum $b$-matching, the unweighted MAX-SAT, the matchoid, and the maximum timed matching problems. In…

Data Structures and Algorithms · Computer Science 2022-08-23 Yuki Amano

Let $G=(V,E)$ be a locally finite graph. Firstly, using calculus of variations, including a direct method of variation and the mountain-pass theory, we get sequences of solutions to several local equations on $G$ (the Schr\"odinger…

Analysis of PDEs · Mathematics 2021-08-04 Yong Lin , Yunyan Yang

This work is a contribution to the study of the ergodic and stochastic properties of Z^d-periodic dynamical systems preserving an infinite measure. We establish functional limit theorems for natural Birkhoff sums related to local times of…

Dynamical Systems · Mathematics 2023-12-06 Françoise Pène

We analyze, mainly using bifurcation methods, an elliptic superlinear problem in one-dimension with periodic boundary conditions. One of the main novelties is that we follow for the first time a bifurcation approach, relying on a…

Classical Analysis and ODEs · Mathematics 2025-04-15 Eduardo Muñoz-Hernández , Juan Carlos Sampedro , Andrea Tellini

We investigate a generalized poly-Laplacian system with a parameter on weighted finite graph, a generalized poly-Laplacian system with a parameter and Dirichlet boundary value on weighted locally finite graphs, and a $(p,q)$-Laplacian…

Analysis of PDEs · Mathematics 2024-01-30 Yan Pang , Junping Xie , Xingyong Zhang

This paper is devoted to multiplicity results of solutions to nonlocal elliptic equations modeling gravitating systems. By considering the case of Fermi-Dirac statistics as a singular perturbation of Maxwell-Boltzmann one, we are able to…

Analysis of PDEs · Mathematics 2014-01-30 Jean Dolbeault , Robert Stanczy

We present a novel local improvement scheme for the perfectly balanced graph partitioning problem. This scheme encodes local searches that are not restricted to a balance constraint into a model allowing us to find combinations of these…

Data Structures and Algorithms · Computer Science 2012-10-02 Peter Sanders , Christian Schulz

Lipschitz learning is a graph-based semi-supervised learning method where one extends labels from a labeled to an unlabeled data set by solving the infinity Laplace equation on a weighted graph. In this work we prove uniform convergence…

Numerical Analysis · Mathematics 2023-01-31 Leon Bungert , Jeff Calder , Tim Roith