arxiv: 2604.18545 · v1 · submitted 2026-04-20 · 🧮 math.MG · math.CO· math.GT

Recognition: unknown

Soft tilings

Dorottya Dancs\'o, Gergely Ambrus

Pith reviewed 2026-05-10 02:48 UTC · model grok-4.3

classification 🧮 math.MG math.COmath.GT

keywords soft tilingsedge-bending algorithmlocally polyhedral tilingstilings of R^3polygonic tilingsspikescontinuous deformation

0 comments

The pith

Every locally polyhedral tiling of three-dimensional space can be completely softened by a new edge-bending algorithm.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper introduces an edge-bending algorithm that deforms the straight edges of any locally polyhedral tiling of R^3 into a continuous family of softened tilings. This establishes a full version of a conjecture previously stated only for strictly polyhedral space tilings. The same work supplies a short proof that any balanced polygonic tiling of the plane has an average of at least two spikes per cell. If the main result holds, then no locally polyhedral tiling of space is rigid; each one admits a continuous softening while remaining a tiling.

Core claim

By constructing a new edge-bending algorithm, every locally polyhedral tiling of R^3 can be completely softened. A weaker form of the claim for polyhedral space tilings had been conjectured in 2024. As an auxiliary result, balanced polygonic tilings of the plane have an average of at least two spikes per cell.

What carries the argument

The edge-bending algorithm, which iteratively deforms edges while producing a continuous family of tilings that remain locally polyhedral throughout the deformation.

If this is right

Every locally polyhedral tiling of R^3 admits a continuous softening deformation.
The special case of strictly polyhedral tilings is included and therefore satisfies the 2024 conjecture.
Balanced polygonic tilings of the plane necessarily average at least two spikes per cell.
The algorithm supplies a constructive procedure rather than a non-constructive existence argument.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The result suggests that local polyhedrality is compatible with global flexibility in any dimension where analogous algorithms can be defined.
Softened versions of such tilings may serve as models for non-rigid space-filling structures in materials or biology.
The 2D spike bound could be used to derive further combinatorial constraints on planar tilings with prescribed edge curvatures.

Load-bearing premise

Locally polyhedral tilings admit an edge-bending process that reaches complete softening without encountering obstructions or non-termination.

What would settle it

An explicit locally polyhedral tiling of R^3 in which the edge-bending algorithm terminates before complete softening or fails to produce a continuous deformation family.

Figures

Figures reproduced from arXiv: 2604.18545 by Dorottya Dancs\'o, Gergely Ambrus.

**Figure 1.** Figure 1: The vertex figure and vertex polyhedron of a node in a cube tiling Next, following [2], we introduce polygonic and polyhedric tilings. Let M be a plane or space tiling. We define two functions associated with M. For a given point p ∈ R 3 let C(p) denote the number of cells in M containing p, and let D(p) denote the maximal dimension d such that C(p) is constant in some topological d-ball centered at p. The… view at source ↗

**Figure 2.** Figure 2: A polyhedric tiling that is not locally polyhedral Therefore, it is natural to consider polyhedric tilings in which a neighborhood of each node has the combinatorial structure of a polyhedral tiling [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗

**Figure 3.** Figure 3: The function φ(x) and φ ′′(x) = (1 − x) 2 · [PITH_FULL_IMAGE:figures/full_fig_p010_3.png] view at source ↗

**Figure 4.** Figure 4: The function τ (ε, α) with n = 4 and σ = {+1, −1, +1, −1} Now, we are ready to define the map Φ0 : ν(V ) → R 3 in cylindrical coordinates: (9) Φ0((ε, α, h)) := (ε, α, h + τ (ε, α)). We examine the effect of Φ0 on the vertex figure ν(V ) and verify that the conditions of Definition 9 are satisfied, apart from condition (b) for faces. First, note that by (5), (8), and (9), the image of any point of ν(V ) tha… view at source ↗

**Figure 5.** Figure 5: The smoothing procedure on the cylindrical surface Hε Finally, we extend Φ1 to a homeomorphism Φ: R 3 → R 3 which coincides with the identity outside B3 (V, r), maps B3 (V, r) onto itself and satisfies the conditions of Definition 9. Since the balls B3 (V, r) chosen around distinct nodes are pairwise disjoint, the corresponding local softening transformations can be combined. Hence, by Definition 10, the t… view at source ↗

**Figure 6.** Figure 6: Vertex figure in a softened cube tiling [PITH_FULL_IMAGE:figures/full_fig_p014_6.png] view at source ↗

**Figure 7.** Figure 7: Soft cubes 5.2. Disconnected color classes. A crucial requirement of the edge bending algorithm constructed by Domokos, Goriely, G. Horváth, and Regős [2] is that the vertices of the vertex polyhedron are 2-colored so that no face is monochromatic, and one of the color classes is edge-connected, cf. Theorem 2. In contrast, our softening method also works for such colorings, thus leading to new types of sof… view at source ↗

**Figure 8.** Figure 8: A vertex figure with disconnected color classes [PITH_FULL_IMAGE:figures/full_fig_p015_8.png] view at source ↗

**Figure 9.** Figure 9: Cells arising from disconnected color classes [PITH_FULL_IMAGE:figures/full_fig_p015_9.png] view at source ↗

**Figure 10.** Figure 10: An embracing pair of soft cells 5.3. A locally polyhedral tiling [PITH_FULL_IMAGE:figures/full_fig_p015_10.png] view at source ↗

**Figure 11.** Figure 11: A locally polyhedral tiling and the corresponding well-colored vertex polyhedron [PITH_FULL_IMAGE:figures/full_fig_p016_11.png] view at source ↗

**Figure 12.** Figure 12: A softened four-faced spindle [PITH_FULL_IMAGE:figures/full_fig_p016_12.png] view at source ↗

**Figure 13.** Figure 13: A polyhedric vertex figure for which the edge bending fails [PITH_FULL_IMAGE:figures/full_fig_p016_13.png] view at source ↗

read the original abstract

By means of constructing a new edge-bending algorithm, we prove that every locally polyhedral tiling of $\mathbb{R}^3$ can be completely softened. A weaker form of this statement, for polyhedral space tilings, was conjectured by Domokos, Goriely, G. Horv\'ath and Reg\H{o}s in 2024. We also provide a short proof for a result of Domokos, G. Horv\'ath, and Reg\H{o}s, stating that in a balanced polygonic tiling of the plane, the average number of spikes is at least 2 per cell.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper proves the 2024 conjecture on softening locally polyhedral tilings of R^3 via a new edge-bending algorithm and gives a short proof for the 2D spike-average result.

read the letter

Hey, the punchline here is that they prove every locally polyhedral tiling of R^3 can be completely softened by means of a new edge-bending algorithm, settling the 2024 conjecture, and they give a short proof that balanced plane tilings have at least two spikes on average per cell. What stands out is the constructive algorithm; it actually produces the softening rather than just asserting it exists. The 2D proof is brief and to the point, which is welcome. The paper cites the relevant conjecture and prior result directly. The arguments rely on combinatorial tiling properties, which seem handled correctly without circular reasoning or extra assumptions beyond what's stated. The soft spots are around the algorithm's full specification. You would want to see explicit checks that it applies to all tilings, that it terminates, and that the resulting family is continuous and valid at every step. Edge cases might need more attention, but nothing in the stress-test suggests a load-bearing flaw. This paper is for tiling theorists and discrete geometers. Readers interested in the conjecture or in algorithmic approaches to tilings would get something out of it. I would send it to peer review. The result is specific but the new algorithm makes it worth a look.

Referee Report

0 major / 3 minor

Summary. The manuscript proves that every locally polyhedral tiling of R^3 admits a complete softening by means of a newly constructed edge-bending algorithm. This establishes a stronger form of the 2024 conjecture of Domokos, Goriely, Horváth and Regős for the polyhedral case. The paper also contains a short proof that the average number of spikes per cell in any balanced polygonal tiling of the plane is at least 2.

Significance. If the algorithm is rigorously shown to be well-defined on the entire class of locally polyhedral tilings, to terminate, and to produce a continuous one-parameter family of valid tilings, the result would be significant: it supplies a constructive resolution to a recent conjecture in tiling theory. The plane result is a clean combinatorial corollary. The manuscript ships a constructive mathematical proof, which is a clear strength.

minor comments (3)

The precise definition of 'locally polyhedral' and the termination criterion for the edge-bending algorithm should be stated explicitly in the first section that introduces the main theorem, rather than being deferred to later technical lemmas.
A small illustrative figure showing one step of the edge-bending procedure on a simple cubic tiling would improve readability of the algorithm description.
The short proof of the plane result (average spikes ≥2) could usefully include a one-sentence remark on how the argument relates to the 3D construction.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive assessment of the manuscript, the recognition of its constructive resolution of the 2024 conjecture in the polyhedral case, and the recommendation for minor revision. No specific major comments were raised in the report.

Circularity Check

0 steps flagged

Constructive proof of external conjecture; no circularity

full rationale

The paper's central result is a constructive proof via a new edge-bending algorithm that every locally polyhedral tiling of R^3 admits a continuous softening, directly addressing a conjecture by unrelated authors (Domokos et al. 2024). The derivation chain consists of defining the algorithm, proving its well-definedness and termination on the given class of tilings, and verifying the output family is continuous and valid; none of these steps are shown to reduce by construction to fitted parameters, self-definitions, or prior self-citations. The secondary plane result is an independent short proof of a statement by other authors. No load-bearing premise relies on renaming known results or importing uniqueness from the present authors' prior work.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The result rests on standard definitions of Euclidean tilings and continuous deformations; no free parameters or invented entities appear in the abstract.

axioms (2)

standard math Standard axioms of Euclidean 3-space and topology for local polyhedrality.
Defines the class of tilings to which the algorithm applies.
domain assumption Continuous deformations exist that preserve the combinatorial tiling structure.
Implicit in the meaning of 'softened'.

pith-pipeline@v0.9.0 · 5398 in / 1166 out tokens · 57269 ms · 2026-05-10T02:48:03.541356+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

10 extracted references

[1]

Appel and W

K. Appel and W. Haken. Every planar map is four colorable. Part I: Discharging.Illinois Journal of Mathematics, 21(3):429–490, 1977

1977
[2]

Domokos, A

G. Domokos, A. Goriely, Á. G. Horváth, and K. Regős. Soft cells and the geometry of seashells.PNAS Nexus, 3(9):pgae311, 2024

2024
[3]

Domokos, Á

G. Domokos, Á. G. Horváth, and K. Regős. A two-vertex theorem for normal tilings.Aequationes Mathematicae, 97(1):185–197, 2023

2023
[4]

P. M. Gruber.Convex and discrete geometry. Springer Verlag, 2007

2007
[5]

Grünbaum.Convex Polytopes, volume 221 ofGraduate Texts in Mathematics

B. Grünbaum.Convex Polytopes, volume 221 ofGraduate Texts in Mathematics. Springer Verlag, 2nd edition, 2003

2003
[6]

Grünbaum and G

B. Grünbaum and G. C. Shephard.Tilings and patterns. Freeman and Co., New York, 1987

1987
[7]

Harriss, D

E. Harriss, D. Schattschneider, and M. Senechal. Tilings. InHandbook of Discrete and Computational Geometry, 3rd Edition, pages 67–89. Chapman and Hall/CRC, 2017

2017
[8]

Karpiński and K

M. Karpiński and K. Piecuch. Linear-time algorithm for vertex 2-coloring without monochromatic triangles on planar graphs.arXiv preprint, 2021

2021
[9]

C.Thomassen.2-list-coloringplanargraphswithoutmonochromatictriangles.Journal of Combinatorial Theory, Series B, 98(6):1337–1348, 2008

2008
[10]

G. M. Ziegler.Lectures on polytopes, volume 152 ofGraduate Texts in Mathematics. Springer Verlag, 1994. Gergely Ambrus Bolyai Institute, University of Szeged, Hungary and Alfréd Rényi Institute of Mathematics, Budapest, Hungary e-mail address:ambrus@server.math.u-szeged.hu, ambrus@renyi.hu Dorottya Dancsó Bolyai Institute, University of Szeged, Hungary e-...

1994