Search arXivSearch

arXiv · 2608.15925

Equilateral Completion in Floretion Triangular Coordinates: Locality, Product Points, and Reflection Symmetry

Abstract

We study unordered triples of order-$n$ floretion base vectors whose tile centroids form nondegenerate equilateral triangles. A scaled integer centroid map turns Euclidean completion into exact arithmetic on a triangular lattice, and a residue obstruction modulo $3$ shows that every equilateral centroid triangle uses three tiles of one orientation. Combined with finite triangular-lattice completion counts, this gives $|E_n|=4^n(4^n-1)/12$. For synchronized local $γ$-cycles, $|L_n|=(7^n-4^n)/3$ and $|L_n|/|E_n|\sim4(7/16)^n$, while on the no-$e$ support $S_n=\{i,j,k\}^n$ locality is exhaustive and $|E_n^S|=|L_n^S|=(2^n-1)3^{n-1}$. The union of the three main axes supports exactly $|E_n^{\rm ax}|=4^{n-1}+2^n-2$ equilateral triangles, split into the branches $x=y=z$ and $x+y+z=0$. For $T\in E_n$, the unsigned vertex product defines a product point $C_T$; a digitwise parity criterion characterizes $C_T=Q_T$ on local cycles and yields Fibonacci subfamilies. Multiplication-generation is equivalent to $p(T)=e_n$, hence $C_T=0$; locally this gives exactly the nontrivial global $γ$-orbits, and exact enumeration through order $6$ finds no nonlocal example. Retaining the signs discarded by the unsigned product gives a second classifier: a triangle has scalar vertex-sum square exactly when its three vertices pairwise anticommute. For local cycles this occurs exactly when $|S|$ is odd, giving $|\mathrm{AC}_n\cap L_n|=(7^n-1)/6$, while nonlocal pairwise-anticommuting examples already occur in order $3$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Creighton Dement. 2026-09-13. Equilateral Completion in Floretion Triangular Coordinates: Locality, Product Points, and Reflection Symmetry. https://arxiv.org/abs/2608.15925

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

KEEP EXPLORING

Related papers

Orthogonal Pairs in Maps from the Sphere to the Circle

We prove that, for any $f:S^2\to S^1$ and any $\varepsilon>0$, there exist orthogonal vectors $x,y\in S^2$ such that the length of the shortest arc between $f(x)$ and $f(y)$ is at most $π/2 +\varepsilon$. This proves a conjecture of Ghebleh from 2007 that the circular chromatic number of the real orthogonality graph is equal to four.

math.CO

Exact Area-Range Minima in the Quantitative Monsky Problem for Five and Seven Triangles

For a dissection $D$ of the unit square into $n$ nondegenerate triangles, let $R(D)=\max_i a_i-\min_i a_i, Δ(n)=\inf_D R(D).$ We prove that this infimum is attained for every $n\ge2$, and determine the exact minima for $n=5$ and $n=7$, allowing T-junctions. For five triangles, $Δ(5)=\frac{5\sqrt5-11}{8};$ equality holds precisely when three areas equal $(3-\sqrt5)/4$ and two equal $(3\sqrt5-5)/8$. For seven triangles, $Δ(7)=r_7$, where $r_7$ is the unique root in $(0,1/4900)$ of $864r^4+2160r^3-6060r^2+4972r-1.$ Every minimizer has four areas $(1+3r_7)/7$ and three areas $(1-4r_7)/7$, although its geometry need not be unique. The proofs combine finite combinatorial classification with exact symbolic and integer-interval certificates. For nine triangles, a tilted-strip construction gives the explicit algebraic upper bound $Δ(9)\le 0.0001273496861283553341\ldots,$ which is the exact minimum within that topology. Conversely, every dissection in the complete single-cap two-rail zig-zag family, with arbitrary continuous areas, has range greater than $1/3500$; hence a global minimizer must lie outside that family. The exact value of $Δ(9)$ remains open.

math.CO

Chromatic symmetric functions for annular webs

We introduce a combinatorial definition of chromatic symmetric functions for annular webs. We prove their symmetry by constructing a web analogue of the Shareshian--Wachs involution and show that they coincide with the symmetric functions associated to annular webs via Turaev's isomorphism. We then derive explicit formulas for their hook Schur coefficients. We also introduce web LLT functions, whose hook Schur coefficients admit positive Laurent-polynomial formulas. These formulas yield a combinatorial expression for the coefficients of the HOMFLY--PT polynomial of an annular web.

math.CO