Nontrivial solutions for a generalized poly-Laplacian system on finite graphs

Abstract We investigate the existence and multiplicity of solutions for a class of the generalized coupled system involving poly-Laplacian and the parameter <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi>λ</m:mi> </m:math> \lambda on finite graphs. By using the Mountain pass lemma together with the cut-off technique, we obtain that system has at least a nontrivial weak solution <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mo>(</m:mo> <m:mrow> <m:msub> <m:mrow> <m:mi>u</m:mi> </m:mrow> <m:mrow> <m:mi>λ</m:mi> </m:mrow> </m:msub> <m:mo>,</m:mo> <m:msub> <m:mrow> <m:mi>v</m:mi> </m:mrow> <m:mrow> <m:mi>λ</m:mi> </m:mrow> </m:msub> </m:mrow> <m:mo>)</m:mo> </m:mrow> </m:math> \left({u}_{\lambda },{v}_{\lambda }) for every large parameter <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi>λ</m:mi> </m:math> \lambda when the nonlinear term <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi>F</m:mi> <m:mrow> <m:mo>(</m:mo> <m:mrow> <m:mi>x</m:mi> <m:mo>,</m:mo> <m:mi>u</m:mi> <m:mo>,</m:mo> <m:mi>v</m:mi> </m:mrow> <m:mo>)</m:mo> </m:mrow> </m:math> F\left(x,u,v) satisfies superlinear growth conditions only in a neighborhood of origin point (0, 0). We also obtain a concrete form for the lower bound of <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi>λ</m:mi> </m:math> \lambda and the trend of <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mo>(</m:mo> <m:mrow> <m:msub> <m:mrow> <m:mi>u</m:mi> </m:mrow> <m:mrow> <m:mi>λ</m:mi> </m:mrow> </m:msub> <m:mo>,</m:mo> <m:msub> <m:mrow> <m:mi>v</m:mi> </m:mrow> <m:mrow> <m:mi>λ</m:mi> </m:mrow> </m:msub> </m:mrow> <m:mo>)</m:mo> </m:mrow> </m:math> \left({u}_{\lambda },{v}_{\lambda }) with the change of <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi>λ</m:mi> </m:math> \lambda . Moreover, by using a revised Clark’s theorem together with cut-off technique, we obtain that system has a sequence of solutions tending to 0 for every <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi>λ</m:mi> <m:mo>&gt;</m:mo> <m:mn>0</m:mn> </m:math> \lambda \gt 0 when the nonlinear term <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi>F</m:mi> <m:mrow> <m:mo>(</m:mo> <m:mrow> <m:mi>x</m:mi> <m:mo>,</m:mo> <m:mi>u</m:mi> <m:mo>,</m:mo> <m:mi>v</m:mi> </m:mrow> <m:mo>)</m:mo> </m:mrow> </m:math> F\left(x,u,v) satisfies sublinear growth conditions only in a neighborhood of origin point (0, 0).

Authors

Institutions

Publication Details

Journal
Demonstratio Mathematica
Published
2025-01-01
DOI
https://doi.org/10.1515/dema-2025-0148
Primary Topic
Advanced Mathematical Modeling in Engineering
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Nontrivial solutions for a generalized poly-Laplacian system on finite graphs

Xingyong Zhang, Weiya Qi
Demonstratio Mathematica
Advanced Mathematical Modeling in Engineering
article

Nontrivial solutions for a generalized poly-Laplacian system on finite graphs

Xingyong Zhang, Weiya Qi
article en

Abstract

Abstract We investigate the existence and multiplicity of solutions for a class of the generalized coupled system involving poly-Laplacian and the parameter <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi>λ</m:mi> </m:math> \lambda on finite graphs. By using the Mountain pass lemma together with the cut-off technique, we obtain that system has at least a nontrivial weak solution <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mo>(</m:mo> <m:mrow> <m:msub> <m:mrow> <m:mi>u</m:mi> </m:mrow> <m:mrow> <m:mi>λ</m:mi> </m:mrow> </m:msub> <m:mo>,</m:mo> <m:msub> <m:mrow> <m:mi>v</m:mi> </m:mrow> <m:mrow> <m:mi>λ</m:mi> </m:mrow> </m:msub> </m:mrow> <m:mo>)</m:mo> </m:mrow> </m:math> \left({u}_{\lambda },{v}_{\lambda }) for every large parameter <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi>λ</m:mi> </m:math> \lambda when the nonlinear term <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi>F</m:mi> <m:mrow> <m:mo>(</m:mo> <m:mrow> <m:mi>x</m:mi> <m:mo>,</m:mo> <m:mi>u</m:mi> <m:mo>,</m:mo> <m:mi>v</m:mi> </m:mrow> <m:mo>)</m:mo> </m:mrow> </m:math> F\left(x,u,v) satisfies superlinear growth conditions only in a neighborhood of origin point (0, 0). We also obtain a concrete form for the lower bound of <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi>λ</m:mi> </m:math> \lambda and the trend of <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mo>(</m:mo> <m:mrow> <m:msub> <m:mrow> <m:mi>u</m:mi> </m:mrow> <m:mrow> <m:mi>λ</m:mi> </m:mrow> </m:msub> <m:mo>,</m:mo> <m:msub> <m:mrow> <m:mi>v</m:mi> </m:mrow> <m:mrow> <m:mi>λ</m:mi> </m:mrow> </m:msub> </m:mrow> <m:mo>)</m:mo> </m:mrow> </m:math> \left({u}_{\lambda },{v}_{\lambda }) with the change of <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi>λ</m:mi> </m:math> \lambda . Moreover, by using a revised Clark’s theorem together with cut-off technique, we obtain that system has a sequence of solutions tending to 0 for every <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi>λ</m:mi> <m:mo>&gt;</m:mo> <m:mn>0</m:mn> </m:math> \lambda \gt 0 when the nonlinear term <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi>F</m:mi> <m:mrow> <m:mo>(</m:mo> <m:mrow> <m:mi>x</m:mi> <m:mo>,</m:mo> <m:mi>u</m:mi> <m:mo>,</m:mo> <m:mi>v</m:mi> </m:mrow> <m:mo>)</m:mo> </m:mrow> </m:math> F\left(x,u,v) satisfies sublinear growth conditions only in a neighborhood of origin point (0, 0).

Demonstratio MathematicaVol. 58(1)
Kunming University of Science and Technology (CN)
Openalex Percentile: Top 80%
Advanced Mathematical Modeling in Engineering
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.