Self-Affinity of Discs Under Glass-Cut Dissections

Abstract A topological disc is called n -self-affine if it has a dissection into n affine images of itself. It is called n -gc-self-affine if the dissection is obtained by successive glass-cuts, which are cuts along segments splitting one disc into two. For every $$n \ge 2$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>≥</mml:mo> <mml:mn>2</mml:mn> </mml:mrow> </mml:math> , we characterize all n -gc-self-affine discs. All such discs turn out to be either triangles or convex quadrangles. All triangles and trapezoids are n -gc-self-affine for every n . Non-trapezoidal quadrangles are not n -gc-self-affine for even n . They are n -gc-self-affine for every odd $$n \ge 7$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>≥</mml:mo> <mml:mn>7</mml:mn> </mml:mrow> </mml:math> , and they are n -gc-self-affine for $$n=5$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>=</mml:mo> <mml:mn>5</mml:mn> </mml:mrow> </mml:math> if they aren’t affine kites. Only four one-parameter families of quadrangles turn out to be 3-gc-self-affine. In addition, we show that every convex quadrangle is n -self-affine for all $$n \ge 5.$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>≥</mml:mo> <mml:mn>5</mml:mn> <mml:mo>.</mml:mo> </mml:mrow> </mml:math>

Authors

Institutions

Publication Details

Journal
Discrete & Computational Geometry
Published
2025-10-15
DOI
https://doi.org/10.1007/s00454-025-00777-8
Primary Topic
Advanced Numerical Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Self-Affinity of Discs Under Glass-Cut Dissections

Christian Richter
Discrete & Computational Geometry
Advanced Numerical Analysis Techniques
article

Self-Affinity of Discs Under Glass-Cut Dissections

Christian Richter
article en

Abstract

Abstract A topological disc is called n -self-affine if it has a dissection into n affine images of itself. It is called n -gc-self-affine if the dissection is obtained by successive glass-cuts, which are cuts along segments splitting one disc into two. For every $$n \ge 2$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>≥</mml:mo> <mml:mn>2</mml:mn> </mml:mrow> </mml:math> , we characterize all n -gc-self-affine discs. All such discs turn out to be either triangles or convex quadrangles. All triangles and trapezoids are n -gc-self-affine for every n . Non-trapezoidal quadrangles are not n -gc-self-affine for even n . They are n -gc-self-affine for every odd $$n \ge 7$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>≥</mml:mo> <mml:mn>7</mml:mn> </mml:mrow> </mml:math> , and they are n -gc-self-affine for $$n=5$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>=</mml:mo> <mml:mn>5</mml:mn> </mml:mrow> </mml:math> if they aren’t affine kites. Only four one-parameter families of quadrangles turn out to be 3-gc-self-affine. In addition, we show that every convex quadrangle is n -self-affine for all $$n \ge 5.$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>≥</mml:mo> <mml:mn>5</mml:mn> <mml:mo>.</mml:mo> </mml:mrow> </mml:math>

Discrete & Computational Geometry
Friedrich Schiller University Jena (DE)
Openalex Percentile: Top 69%
Advanced Numerical Analysis Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.