Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2603.24824

Boundary Framework, Rear Morphology, and Rectangular Ears in the Partition Graph

Fedor B. Lyudogovskiy
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the outer geometry of the partition graph $G_n$, focusing on its canonical front-and-side framework, the family of nontrivial rectangular partitions, and the rear structures suggested by the visible geometry of the graph. We formalize the boundary framework $\mathcal B_n=\mathcal M_n\cup\mathcal L_n\cup\mathcal R_n$, where $\mathcal M_n$ is the main chain and $\mathcal L_n,\mathcal R_n$ are the left and right side edges, and we isolate the nontrivial rectangular family $\mathrm{Rect}^*(n)=\{(a^b):ab=n,\ a,b\ge2\}$ as a canonical discrete family marking the rear part of $G_n$. We prove that every nontrivial rectangular vertex $ρ=(a^b)$ has degree $2$, has exactly two explicitly described neighbors, and lies in a unique triangle of $G_n$. This leads to the notions of a rectangular ear, its attachment pair, and its support edge. We also prove that $\mathrm{Rect}^*(n)$ is an independent set in $G_n$, so the weak rectangular contour is not a graph-theoretic chain but a discrete rear marker family. For every genuinely rear rectangular ear, namely for $a,b\ge3$, we show that its support edge lies in a tetrahedral configuration of the clique complex $K_n=\mathrm{Cl}(G_n)$. To organize the interaction between different ears, we introduce support zones, support distances, and support corridors between attachment pairs. The paper also records a natural divisor-theoretic indexing of the rectangular family, presents a computational atlas in small and large ranges, and concludes with open problems concerning support-zone connectivity, inter-ear corridors, and canonical rear contours in $G_n$.

Explore related subjects

math.GM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Fedor B. Lyudogovskiy. 2026-03-25. Boundary Framework, Rear Morphology, and Rectangular Ears in the Partition Graph. https://arxiv.org/abs/2603.24824

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

KEEP EXPLORING

Related papers

arXiv2026

On Hilbert's 8th Problem

This note takes the probabilistic half of the Riemann Xi story on its own terms. Every object in the subject is a first passage time: Riemann's kernel is the law of the logarithm of a sum of two hitting times of a three dimensional Bessel process, Polya's approximation is the first passage of a Brownian motion with drift, and the reciprocal Xi function, under the Riemann hypothesis, is the Laplace transform of an infinite convolution of exponentials whose rates are the squared zeros. That reciprocal is written as $F_α(s)=ξ(α)/ξ(α+\sqrt s)$, and complete monotonicity, unconditional for $α\ge1$, is conjectured to persist to the critical basepoint $α=1/2$. Kent's eigenvalue expansion says which laws can arise this way, namely those whose Thorin measure is a Dirichlet spectrum with unit atoms, and Krein's inverse spectral theory turns the hypothesis into the existence of a string. The passage from Riemann to Polya is a flow, not a jump: the Cauchy semigroup on Thorin measures, each step an Esscher tilt followed by a Brownian subordination along a curvature family of hyperbolic Bessel processes, with the arithmetic surviving as Fourier modes damped like $e^{-2πk\varepsilon}$. The arithmetic lives in the atoms and nowhere else. Approximations rank by what they keep: Polya keeps neither atoms nor tempering and is off by a factor of three, a fitted Bessel dimension reaches one per cent, and a few atoms with an erfc tempering stay better than one part in a thousand across four decades. And the flow runs backwards: the Thorin measure of the reciprocal is evaluated from a prime sieve with no reference to any zero, and nonnegative deconvolution of it returns the first ten zero ordinates with unit masses, nine of them to four decimals and one to three. All identities are verified with mpmath, and the scripts are included.

math.GM↗
arXiv2026

Dynamical Geometry of Principal Bundle Constrained Systems: Compatible Pairs, Contact Degeneration, and Adapted Metrics

We study invariant codimension-one constraints on principal bundles through compatible pairs: a constraint distribution and a nonzero coadjoint field parallel for a principal connection. Pairing the field with the connection gives an invariant one-form whose Levi form separates a horizontal curvature contribution from a vertical coadjoint-orbit contribution. This decomposition yields criteria for integrability, contactness, and characteristic reduction; holonomy and stabilizer reductions describe global existence. For evolving compatible pairs, we identify the mixed-curvature obstruction to compatibility and prove that connection transport preserves the Levi geometry. For initially contact data over a closed base of dimension $2n$, we establish matching bounds for the quadratic $H^{n+1}$ cost of contact degeneration: making the paired curvature vanish on a Darboux ball of radius $r$ in time $T$ costs an amount comparable to $[T\log(R_*/r)]^{-1}$. The constructed paths remain contact before $T$, preserve the curvature class, and force the $L^\infty$ norm of every transporting velocity gradient to grow at least as $1/[2(T-t)]$ on the collapsing region in Darboux coordinates. On a closed three-manifold, a contact form preserved by a locally free circle action admits an invariant adapted metric with any prescribed positive curl eigenvalue and unit circle generator. We parametrize all such metrics and prove that their space is contractible. Along the circle-bundle degeneration paths, every continuous tensor limit of normalized adapted metrics is degenerate above the collapsing region.

math.GM↗