Skip to content
DraconiticResearch
Search Sources API
182,469 studies31 sourcesUpdated 1 min ago
PreprintarXiv licencearXiv

Sharp Bounds on Torsional Rigidity of Metric Graphs with Signed Delta-Vertex Strengths

Abstract

We study torsional rigidity on finite compact connected metric graphs with real δ-vertex strengths in the regime of strictly positive torsion. For a fixed total length L>0, let I+ be the sum of the positive strengths and I- the sum of the magnitudes of the negative strengths, with I+>I-. We determine the sharp infimum and the exact threshold for a finite universal supremum. The supremum is finite precisely when I-<I+/(1+LI+). In this regime, an interval with strengths I+ and −I- at opposite endpoints attains the sharp Saint--Venant bound. At and beyond the threshold, torsional rigidity is unbounded even among three-vertex paths with the same data and strictly positive torsion. The sharp infimum is L2/(I+−I-) throughout the range I+>I-≥0. It is not attained by any finite graph and is approached by graphs with two vertices joined by increasingly many parallel edges of equal length, preserving both strength totals separately. A vertex-matrix formulation and explicit path examples clarify the relation between strength placement, spectral positivity, and solvability.

Related

  1. Sharp connectivity thresholds for mixed rigidity packings and improved bounds for highly connected orientations of graphs
    Hanzhi Bai, Jørgen Bang-Jensen, Jin Yan
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  2. A sharp lower bound for torsional rigidity of convex domains
    M. A. Perelmuter
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsarXiv
  3. Proof of the local version of the Pólya--Szegö conjecture for the torsional rigidity of polygons
    Beniamin Bogosel, Dorin Bucur, Ilaria Fragalà
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  4. Computer-assisted local maximality of regular polygons for torsional rigidity
    Beniamin Bogosel
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingOptimisation & controlarXiv
  5. Asymptotic analysis of Dirichlet problems in supercritically perforated domains via quantification by torsional rigidity
    Naoto Sato
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
BibTeX
@misc{ozcan2026sharp,
  title = {{Sharp Bounds on Torsional Rigidity of Metric Graphs with Signed Delta-Vertex Strengths}},
  author = {Sedef Özcan},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.38330},
  eprint = {2610.38330},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.38330},
}
RIS
TY  - UNPB
TI  - Sharp Bounds on Torsional Rigidity of Metric Graphs with Signed Delta-Vertex Strengths
AU  - Sedef Özcan
PY  - 2026
DA  - 2026/10/28
PB  - arXiv
DO  - 10.48550/arxiv.2610.38330
UR  - https://arxiv.org/abs/2610.38330
AB  - We study torsional rigidity on finite compact connected metric graphs with real δ-vertex strengths in the regime of strictly positive torsion. For a fixed total length L>0, let I_+ be the sum of the positive strengths and I_- the sum of the magnitudes of the negative strengths, with I_+>I_-. We determine the sharp infimum and the exact threshold for a finite universal supremum. The supremum is finite precisely when I_-<I_+/(1+LI_+). In this regime, an interval with strengths I_+ and −I_- at opposite endpoints attains the sharp Saint--Venant bound. At and beyond the threshold, torsional rigidity is unbounded even among three-vertex paths with the same data and strictly positive torsion. The sharp infimum is L^2/(I_+−I_-) throughout the range I_+>I_-≥0. It is not attained by any finite graph and is approached by graphs with two vertices joined by increasingly many parallel edges of equal length, preserving both strength totals separately. A vertex-matrix formulation and explicit path examples clarify the relation between strength placement, spectral positivity, and solvability.
ER  -