Search arXivSearch

arXiv · 2404.11460

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$, 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$, and they are $n$-gc-self-affine for $n=5$ 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$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Christian Richter. 2024-04-17. Self-affinity of discs under glass-cut dissections. https://arxiv.org/abs/2404.11460

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO