Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2510.22584

Regular triangle unions with maximal number of sides

Giedrius Alkauskas
View original source ↗Read source document ↗Export metadata ↓

Abstract

Fix an integer n>=1. Suppose that a simple polygon is the union of n triangles whose vertices along the common boundary are arranged cyclically. How many sides can such a union -- to be called regular -- have at most? This gives OEIS sequence A375986, a recent entry. It will be shown here that the sequence begins 3, 12, 22, 33, 45, 56, 67, 80, 91, and satisfies linear lower and upper bounds. The latter is not merely an estimate: it is realizable combinatorially. This leads to two further questions: can the same combinatorics be realized in pseudoline geometry, and if so, can such a realization be stretched? The paper is largely expository, with excursions into neighboring topics (union complexity, the Zone Theorem, stretchability, the Kobon triangle problem, Davenport-Schinzel sequences, lower envelopes of line segments). However, it adds a new tool tailored for studying regular unions; namely, triangulation shifts. In essence, this is a method to represent any such n-union by a triangulation of a regular (n+1)-gon and its dynamical mutation.

Explore related subjects

math.COmath.MG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Giedrius Alkauskas. 2026-04-15. Regular triangle unions with maximal number of sides. https://arxiv.org/abs/2510.22584

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗