Unobstructedness of filling secants and the Gruson–Peskine general projection theorem

Abstract In an earlier paper [J. of Appl. Math. and Informatics, 29(3-4)(2011), 697-712] we proposed a general projection-type algorithm with corrections and proved its convergence under a set of special assumptions. In this paper we prove convergence of this algorithm under a much weaker set of assumptions. This new framework gives us the possibility to obtain as a particular case of our method the two-step algorithm analysed in [B I T, 38(2)(1998), 275-282].

Download Full-text

Projection Theorem for Discrete-Time Quantum Walks

Electronic Proceedings in Theoretical Computer Science ◽

10.4204/eptcs.315.5 ◽

2020 ◽

Vol 315 ◽

pp. 48-58

Author(s):

Václav Potoček

Keyword(s):

Discrete Time ◽

Quantum Walks ◽

Projection Theorem ◽

Time Quantum

Download Full-text

Proof without Words: Area and the Projection Theorem of a Right Triangle

Mathematics Magazine ◽

10.2307/2690464 ◽

1993 ◽

Vol 66 (1) ◽

pp. 13

Author(s):

Sidney H. Kung

Keyword(s):

Projection Theorem

Download Full-text

The Quasi-Isomorphism Theorem

The Plaid Model ◽

10.23943/princeton/9780691181387.003.0019 ◽

2019 ◽

pp. 185-194

Author(s):

Richard Evan Schwartz

Keyword(s):

Affine Transformation ◽

Equivalence Theorem ◽

Isomorphism Theorem ◽

Orbit Equivalence ◽

Geometric Properties ◽

Projection Theorem ◽

Canonical Bijection ◽

Arithmetic Graph

This chapter proves the Quasi-Isomorphism Theorem modulo two technical lemmas, which will be dealt with in the next two chapters. Section 18.2 introduces the affine transformation TA from the Quasi-Isomorphism Theorem. Section 18.3 defines the graph grid GA = TA(Z2) and states the Grid Geometry Lemma, a result about the basic geometric properties of GA. Section 18.4 introduces the set Z* that appears in the Renormalization Theorem and states the main result about it, the Intertwining Lemma. Section 18.5 explains how the Orbit Equivalence Theorem sets up a canonical bijection between the nontrivial orbits of the plaid PET and the orbits of the graph PET. Section 18.6 reinterprets the orbit correspondence in terms of the plaid polygons and the arithmetic graph polygons. Everything is then put together to complete the proof of the Quasi-Isomorphism Theorem. Section 18.7 deduces the Projection Theorem (Theorem 0.2) from the Quasi-Isomorphism Theorem.

Download Full-text