Pith. Sign in

RECORD

Diameter preserving surjections in the geometry of matrices

PaperPDF from arXiv

data files

Paper breakdownThe authors' claims, conditions and measurements, as JSON Signed receiptProof this review has not been altered
X Bluesky LinkedIn Reddit Hacker News
Wen-ling Huang, Hans Havlicek

Combinatorics · Submitted 4 Apr 2013

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim Any surjective mapping $\phi:\Gamma\to\Gamma'$ between graphs from this class is shown to be an isomorphism provided that the following holds: Any two points of $\Gamma$ are at a distance equal to the diameter of $\Gamma$ if, and only if, their images are at a distance equal to the diameter of $\Gamma'$.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID1304.1345 (version 1)
Pith IDOS5Q2MZL, Pith's permanent record of this paper and its review
CitationHans Havlicek, Wen-Ling Huang. "Diameter preserving surjections in the geometry of matrices." arXiv:1304.1345 (2013). https://pith.science/paper/OS5Q2MZL
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13-20260917 via OpenRouter, question bank abstract-p1-20260923, 2026-09-23: 1 request, 3,052 input tokens, $0.0001 reported.

What the abstract itself states, as probabilities: claims first 0.03 · states limitation 0.44 · human participants 0.01 · controlled comparison 0.01 · randomized assignment 0.01 · states quantitative result 0.06 · compares with prior results 0.04 · mentions code or data availability 0.01.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

We consider a class of graphs subject to certain restrictions, including the finiteness of diameters. Any surjective mapping $\phi:\Gamma\to\Gamma'$ between graphs from this class is shown to be an isomorphism provided that the following holds: Any two points of $\Gamma$ are at a distance equal to the diameter of $\Gamma$ if, and only if, their images are at a distance equal to the diameter of $\Gamma'$. This result is then applied to the graphs arising from the adjacency relations of spaces of rectangular matrices, spaces of Hermitian matrices, and Grassmann spaces (projective spaces of rectangular matrices).

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 We consider a class of graphs subject to certain restrictions, including the finiteness of diameters. background 0.81 0.38 0.02 asserted 0.87
s1 Any surjective mapping $\phi:\Gamma\to\Gamma'$ between graphs from this class is shown to be an isomorphism provided that the following holds: Any two points of $\Gamma$ are at a distance equal to the diameter of $\Gamma$ if, and only if, their images are at a distance equal to the diameter of $\Gamma'$. result 0.99 0.89 0.89 asserted 1.00
s2 This result is then applied to the graphs arising from the adjacency relations of spaces of rectangular matrices, spaces of Hermitian matrices, and Grassmann spaces (projective spaces of rectangular matrices). contribution 0.78 0.86 0.07 asserted 0.99

What kind of paper the classifier reports this is: theoretical result 1.00 · evidence from proof or derivation 1.00.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

We consider a class of graphs subject to certain restrictions, including the finiteness of diameters. Any surjective mapping $\phi:\Gamma\to\Gamma'$ between graphs from this class is shown to be an isomorphism provided that the following holds: Any two points of $\Gamma$ are at a distance equal to the diameter of $\Gamma$ if, and only if, their images are at a distance equal to the diameter of $\Gamma'$. This result is then applied to the graphs arising from the adjacency relations of spaces of rectangular matrices, spaces of Hermitian matrices, and Grassmann spaces (projective spaces of rectangular matrices).

Human review

How Pith checks papers → · Full audit of this paper →

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.