✦ LIBER ✦

A two-dimensional version of the Goldschmidt–Sims conjecture

✍ Scribed by Yair Glasner

Book ID: 104140910
Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 284 KB
Volume: 269
Category: Article
ISSN: 0021-8693
DOI: 10.1016/s0021-8693(03)00530-1

No coin nor oath required. For personal study only.

✦ Synopsis

The Goldschmidt-Sims conjecture asserts that there is a finite number of (conjugacy classes of) edge transitive lattices in the automorphism group of a regular tree with prime valence. We prove a similar theorem for irreducible lattices, transitive on the 2-cells of the product of two regular trees of prime valences.

📜 SIMILAR VOLUMES

A remark on the two-dimensional Jacobian

A remark on the two-dimensional Jacobian conjecture

✍ Arno van den Essen; Halszka Tutaj 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 216 KB

A corrected version of the Duchet kernel

A corrected version of the Duchet kernel conjecture

✍ E. Boros; V. Gurvich 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 146 KB

In 1980, Piere Duchet conjectured that odd-directed cycles are the only edge minimal kernel-less connected digraphs, i.e. in which after the removal of any edge a kernel appears. Although this conjecture was disproved recently by Apartsin et al. (1996), the following modification of Duchet's conject

The input–output version of Aizerman's c

The input–output version of Aizerman's conjecture

✍ M. I. Gil; A. Ailon 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 91 KB 👁 2 views

It is proved that non-linear systems with positive impulse functions satisfy the Aizerman conjecture in the input-output version. Besides, the stability criteria are formulated in the terms of the Hurwitzness of corresponding polynomials. In addition, new positivity conditions for impulse functions

A fractional version of the Erdős-Faber-

A fractional version of the Erdős-Faber-Lovász conjecture

✍ Jeff Kahn; P. D. Seymour 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 301 KB

On a discrete version of the Laugesen–Mo

On a discrete version of the Laugesen–Morpurgo conjecture

✍ M.N. Pascu; A. Nicolaie 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 840 KB

A graph-theoretic version of the union-c

A graph-theoretic version of the union-closed sets conjecture

✍ El-Zahar, Mohamed H. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB 👁 2 views

An induced subgraph S of a graph G is called a derived subgraph of G if S contains no isolated vertices. An edge e of G is said to be residual if e occurs in more than half of the derived subgraphs of G. We introduce the conjecture: Every non-empty graph contains a non-residual edge. This conjecture