Searcharxiv⌕ Search

arXiv subjects

Steven Finch

Publications and source records attributed to Steven Finch.

At least 19 recordsLinked to original sources

Slicing a Doughnut at Random

Choose a random plane that hits a solid torus. How likely is the slice to be a single disk, and how fat should the doughnut be to make this as likely as possible? Answering requires saying precisely what a "random plane" is. We explain this from scratch, first for random lines in the plane and then for random planes in space, and then solve the problem with nothing more than calculus. Along the way we meet a two-dimensional cousin of the problem (the doughnut's shadow) and two tempting wrong turns. One wrong turn appeared in print; it turns out to be a correct solution of the two-dimensional cousin. The other was the author's own first attempt, which luckily stayed in a drawer.

math.PR↗

Schwarz $\mathrm{P}$ and Schwarz $\mathrm{D}$ as free-boundary minimal disks in a tetragonal disphenoid: exact areas

Let $T$ be the tetragonal disphenoid whose four congruent faces are isosceles triangles with sides $2,\sqrt3,\sqrt3$, so that the dihedral angles are $π/2$ along one opposite pair of edges and $π/3$ along the remaining four. By Smyth's theorem $T$ contains three embedded minimal disks meeting $\partial T$ orthogonally; the symmetry group $D_{2d}$ of $T$ fixes one and interchanges the other two. We identify all three completely. The distinguished disk is a patch of $\textbf{Schwarz's $\mathrm{P}$ surface}$ and the congruent pair are patches of $\textbf{Schwarz's $\mathrm{D}$ surface}$, with exact areas \[ \operatorname{Area}(Σ^{*}_{A}) = \frac{K\!\left(\tfrac14\right)} {K\!\left(\tfrac34\right)} = 0.781700961348056\ldots, \] \[ \operatorname{Area}(Σ^{*}_{B}) = \frac{K\!\left(\tfrac34\right)} {2\,K\!\left(\tfrac14\right)} = 0.639630785585503\ldots \] in the normalization $\operatorname{Vol}(T)=2/3$, inradius $r_T=\sqrt2/4$. In particular $2\,\operatorname{Area}(Σ^{*}_{A})\operatorname{Area}(Σ^{*}_{B})=1$, which we show is the Bonnet relation for the adjoint pair $(\mathrm{D},\mathrm{P})$. The proof is a reversal of the usual strategy: rather than uniformizing the Gauss map, we identify Smyth's three Plateau contours as the $\textit{tetrahedral four edges}$ and the $\textit{octahedral four edges}$ --- classically solved by $\mathrm{D}$ and $\mathrm{P}$ respectively --- and then conjugate. Both areas agree with Surface Evolver computations of Ken Brakke to all $15$ reported digits. We also show that all twelve corners of the three disks are midpoints of edges of $T$, each of the six midpoints being used twice, and that $T$ is precisely the alcove of the affine Weyl group $\widetilde{A}_{3}$, confirming a remark of Gandy, Cvijović, et al. (1999).

math.DG↗

Fractional Iterates and Oscillatory Convergence

The simple continued fractions for the Golden & Silver means are well-known. It is astonishing that, as far as we know, no one has published half-iterates (let alone quarter-iterates) for the corresponding algorithms. We also examine the cosine and logistic maps (with parameter $2 < λ< 3$).

math.NT↗

Three Quadratic Recurrences Modulo 3: What We Can Prove and What We Can Guess

We study three innocent-looking recurrences modulo $3$, each built from squares of two earlier terms. One of them turns out to be secretly $\textit{linear}$, and we can compute its periods exactly. One is a $\textit{permutation}$ hiding a small, perfectly orderly piece inside a large, random-looking one. The third looks thoroughly random, but it still has a few provable features. Along the way we meet open problems that need nothing beyond a first course in abstract algebra to state. This paper is a starting point, not the final word in any sense.

math.NT↗

An exact hypergeometric Weierstrass representation for Smyth's free-boundary minimal disk in the regular tetrahedron

Smyth (1984) proved that every tetrahedron $T\subset\mathbb{R}^3$ contains three embedded minimal disks meeting $\partial T$ orthogonally, obtained as conjugate surfaces of Plateau solutions in a skew quadrilateral $Q$ whose edges are $c_iν_i$, where $φ_1,φ_2,φ_3,φ_4$ are faces of $T$, $c_i=\operatorname{Area}(φ_i)$ and $ν_i$ are outward normal vectors. For the $\textit{regular}$ tetrahedron we give the Weierstrass data explicitly. The Gauss map is a Schwarz triangle function for a circular-arc triangle with angles $(π/4,\ π/2,\ πβ/2)$, where $β=\arccos(-1/3)/π$; the hypergeometric parameters are linear in $β$ and there is $\textit{no accessory parameter and no free parameter}$. We record a closed form for $κ$ in $Γ$-values, a Wronskian closed form for $g'$, the exact total curvature $2π(2β-1)$, the symmetric-square structure of the data, and a rigidity statement: since $β/2$ is irrational, the projective monodromy is dense and the data $\textit{cannot}$ be algebraic. Numerically the representation extends to 28 digits -- $\operatorname{Area}/\ell^{2}=0.2172341554075574483760009126\ldots$ -- confirming a 2013 Surface Evolver computation of Ken Brakke.

math.DG↗

Elimination of the parameters in an elliptic parametrization of the Schwarz primitive surface

Let $Ω$ be the curvilinear square bounded by the four circular arcs $|ζ\mp1|=\sqrt{2}$, $|ζ\mp i|=\sqrt{2}$, and let $W=\sqrt{1+14ζ^{4}+ζ^{8}}$. Put \[ θ(ζ)=\arcsin\frac{2(1+i)ζ} {\sqrt{1+4iζ^{2}-ζ^{4}}}, \] \[ f=\tfrac14\bigl(-iF[θ,\tfrac14]+F[θ,\tfrac34]\bigr),\quad \quad g=\tfrac14\bigl(\ \ iF[θ,\tfrac14]+F[θ,\tfrac34]\bigr), \] \[ \mathfrak h=(2-\sqrt3)\, F\bigl[\arcsin\bigl(i(2+\sqrt3)ζ^{2}\bigr),(2-\sqrt3)^{4}\bigr]. \] These are, verbatim, the three functions of our companion paper $\mathrm{[D]}$ on the diamond surface $\mathrm{D}$: the two papers start from the same point, and differ only in which real parts are taken. With $X=(κ\,\operatorname{Re}f,\ κ\,\operatorname{Re}g,\ \tfrac12+κ\,\operatorname{Im}\mathfrak{h})$ and $κ=3/(2K[1/9])$, the map $X$ parametrizes a fundamental patch of Schwarz's primitive surface $\mathrm{P}$, the conjugate of $\mathrm{D}$. Part I builds the algebraic apparatus $\ldots$ the normalizing constant is identified exactly: $\varpi:=κ^{-1}=K[-3]=\tfrac12 K[3/4]=\tfrac23 K[1/9]$. Part II carries out the elimination and completes the proof of \[ (\star)\qquad \operatorname{sn}\bigl(\varpi(x{+}y),-3\bigr)\,\operatorname{sn}\bigl(\varpi(x{-}y),-3\bigr) =\tfrac13\operatorname{sn}\bigl(3\varpi(z-\tfrac12),\tfrac19\bigr). \] Part III shows that $(\star)$ is, after all, additively separable $\ldots$ for an overview of this paper and $\mathrm{[D]}$, please see arXiv:2609.14206.

math.DG↗

The two cubic separable minimal surfaces: $\mathcal D_1\mathcal D_2\mathcal D_3=1$ and $\mathcal C_1+\mathcal C_2+\mathcal C_3=3\,\mathcal C_1\mathcal C_2\mathcal C_3$

A minimal surface in $\mathbb{R}^3$ is $\textit{separable}$ if it is the zero set of $f(x)+g(y)+h(z)$, and $\textit{isotropic}$ if moreover $f=g=h$. We announce that there are exactly two non-planar isotropic separable minimal surfaces up to homothety and rigid motion, that they are conjugate, and that they are Schwarz's diamond surface $\mathrm{D}$ and Schwarz's primitive surface $\mathrm{P}$. In lattice-normalized coordinates their implicit equations are \[\mathrm{D}:\; \mathcal{D}(x)\mathcal{D}(y)\mathcal{D}(z)=1,\] \[\mathrm{P}:\; \mathcal{C}(x)+\mathcal{C}(y)+\mathcal{C}(z) =3\,\mathcal{C}(x)\mathcal{C}(y)\mathcal{C}(z),\] where $\mathcal{D}(t)=\frac{\operatorname{sn}\operatorname{dn}}{\operatorname{cn}}(K[\frac{1}{4}]t,\frac{1}{4})$ and $\mathcal{C}(t)=\operatorname{cn}(2K[\frac{3}{4}]t,\frac{3}{4})$. The first equation is classical -- it is due to Schwarz, later Cayley, and appears in Nitsche's $\textit{Lectures}$ -- we identify Nitsche's transcendental function exactly as $\operatorname{sn}\operatorname{dn}/\operatorname{cn}$ at parameter $\frac{1}{4}$. The second appears to be new; it is the symmetric member of the two-parameter family of Kim and Ogata (2024), and it proves their assertion that the family contains $\mathrm{P}$. Both surfaces are governed by one differential equation with two signs, \[φ'^{\,2}=1+2\cosh 2φ \ (\mathrm{D}),\] \[φ'^{\,2}=1+2\cos 2φ \ (\mathrm{P}),\] the two signs of the separation constant of the classical reduction; and in that common normalization the two lattice periods are $2K[\frac{1}{4}]$ and $2K[\frac{3}{4}]$, whose ratio is Schwarz's 1866 constant $K'[\frac{1}{4}]/K[\frac{1}{4}]=1.2792615...$, the necessary scale ratio for a conjugate pair. Proofs will appear in [D, P].

math.DG↗

Small Matrices with Large Inverses: Unimodular $4 \times 4$ Cases

How close to singularity can an $n \times n$ unimodular matrix be? For ternary cases as $n$ increases, exact expressions are unlikely, but upon fixing $n=4$ and assessing $(2k+1)$-ary cases as $k$ increases, we make significant progress; similarly for $(k+1)$-ary cases of $4\times 4$ nonnegative unimodular matrices.

math.CO↗

Small Matrices with Small Inverses: Unimodular Zerofree Cases

We consider unimodular matrices $M$ such that neither $M$ nor $M^{-1}$ contain zero entries. Matrices typically exhibit a trade-off: small $M$ imply large $M^{-1}$. We investigate rare cases where both remain small, classify these matrices up to symmetry, and discuss aspects of this balanced setting.

math.CO↗

$n$th Roots of $n$th Powers

Seeking simple, efficient solutions of a matrix equation leads (quite circuitously) to optimizing unimodular zerofree matrices. Canonicalizing such matrices under signed-permutation double action offers an ideal application of GPUs (graphics processing units).

math.GM↗

Large Components and Trees of Random Mappings

Let $\mathcal{T}_n$ be the set of all mappings $T:[n]\to[n]$, where $[n]=\{1,2,\ldots,n\}$. The corresponding graph $G_T$ of $T$, called a functional digraph, is a union of disjoint connected components. Each component is a directed cycle of rooted labeled trees. We assume that each $T\in\mathcal{T}_n$ is chosen uniformly at random from the set $\mathcal{T}_n$. The components and trees of $G_T$ are distinguished by their size. In this paper, we compute the limiting conditional probability ($n\to\infty$) that a vertex from the largest component of the random graph $G_T$, chosen uniformly at random from $[n]$, belongs to its $s$-th largest tree, where $s\ge 1$ is a fixed integer. This limit can be also viewed as an approximation of the probability that the $s$-th largest tree of $G_T$ is a subgraph of its largest component, which is a solution of a problem suggested by Mutafchiev and Finch (2024).

math.CO↗

Exercises in Iterational Asymptotics IV

Abel's functional equation for $2^{x/2}$ and half-iterates of $λx (1-x)$ & $\sqrt{1+x}$ are featured in this collection of exercises ($0 < λ\neq 1 < 2$).

math.NT↗

Half-Iterates and Delta Conjectures

The vivid contrast between two competing algorithms for solving Abel's equation $g(θ(x)) = g(x) + 1$, given $θ(x)$, is easily sketched. EJ is faster and more efficient, but ML evaluates a limit characterizing the principal solution $g(x)$ directly. EJ finds $g(x)+δ$, where $δ$ is possibly nonzero but independent of $x$. If we were to know an exact expression for $δ$, then the "intrinsicality" of ML would be subsumed by EJ. Filling this gap in our knowledge is the aim of this paper.

math.NT↗

Generalized Logistic Maps and Convergence

We treat three cubic recurrences, two of which generalize the famous iterated map $x \mapsto x (1-x)$ from discrete chaos theory. A feature of each asymptotic series developed here is a constant, dependent on the initial condition but otherwise intrinsic to the function at hand.

math.DS↗

Popa's "Recurrent Sequences" and Reciprocity

Dumitru Popa found asymptotic expansions for certain nonlinear recurrences, but left open the numerical evaluation of associated constants. We address this issue. A change of variables involving reciprocals and the algorithm of Mavecha & Laohakosol play a key role in our computations.

math.CA↗

Abel's Functional Equation and Interrelations

Convex solutions $A,B,I,J$ of four Abel equations are numerically studied. We do not know exact formulas for any of these functions, but conjecture that $A,B$ and $I,J$ are closely related. [Corrigendum at end.]

math.CA↗

Exercises in Iterational Asymptotics III

The nonlinear recurrences we consider here include simple continued fractions for the Golden & Silver means and a parametric family of cubics in connection with Abel's functional equation.

math.NT↗