Pith. sign in

REVIEW 1 cited by

Sinh-Gordon equations on finite graphs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2406.17166 v2 pith:JMVY36GF submitted 2024-06-24 math.DG math.AP

classification math.DGmath.AP
keywords graphsequationsinh-gordoncasedegreefinitenonzeroprescribed
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this paper, we focus on the sinh-Gordon equation on graphs. We introduce a uniform a priori estimate to define the topological degree for this equation with nonzero prescribed functions on finite, connected and symmetric graphs. Furthermore, we calculate this topological degree case by case and show several existence results. In particular, we prove that the classical sinh-Gordon equation with nonzero prescribed function is always solvable on such graphs.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Existence theory for elliptic equations of general exponential nonlinearity on finite graphs

    math.AP 2025-05 reject novelty 6.0 of 10

    A sign error in the graph-reduction step invalidates the claimed Brouwer degree formula and the existence theory built on it.

Pith tools