Papers

Initial Orbit Determination (IOD) from Very Short Arcs (VSAs) remains one of the most challenging open problems in asteroid surveillance and celestial mechanics. Classical methods require angular observations spanning a sufficient fraction of the orbit, and become ill-conditioned or fail outright when only a single observing night is available, as is the case for most newly discovered Near-Earth Objects (NEOs). We present a comparative analysis of two Neural Network (NN) models that attack the ranging problem directly: both ingest a triplet of time-tagged angular measurements $(t_i,\alpha_i,\delta_i)$, $i=1,2,3$, from a single VSA and predict the geocentric range and range-rate $(\rho,\dot\rho)$, thus completing the orbital state vector. The first is a Multi-Layer Perceptron trained on a purely data-driven objective; the second augments it with a physics-informed loss. Both are trained, under an object-disjoint partition, on a sample of the $568\,127$ VSAs of $39\,031$ real NEOs available in the NEODyS-2 catalogue. Each model returns an estimate on every arc by construction, so we assess instead whether that estimate is dynamically admissible: on a held-out test set of $56\,773$ arcs the physics-informed model places $85.1\%$ of its predictions inside the admissible region, against $76.5\%$ for the data-driven baseline, whereas Gauss's and Laplace's methods return a solution on only $45.0\%$ and $47.3\%$ of the same arcs and collapse onto the degenerate root in about nine of those cases out of ten. A stratified analysis over proper motion and true range shows that the physics-informed objective is not uniformly superior to the baseline: it trades a longer error tail for admissibility and for a marked advantage on the fast, nearby arcs that are operationally the most relevant.

We investigate the hypercyclicity of Toeplitz operators on the Bergman space $L_{A}^{2}(\mathbb{D})$ with symbols of the form $\Psi(z) = \gamma\bar{z}+\psi(z)$, where $\gamma \in \mathbb{C} \setminus \{0\}$ and $\psi$ is analytic on an open neighborhood of the closed unit disc $\overline{\mathbb{D}}$. Our approach bypasses the classical Hardy space techniques (reproducing kernel linear combinations, Nevanlinna factorization) by directly solving the integro-differential resolvent equation arising from the Bergman projection. A key winding number argument shows that for sense-reversing symbols ($|\gamma| > \sup_{z \in \overline{\mathbb{D}}} |\psi'(z)|$), the symbol's image $\Psi(\mathbb{D})$ is contained in the point spectrum of $T_\Psi$. In the tridiagonal case $\Psi(z) = a\bar{z}+b+cz$, we fully resolve the longstanding eigenvector completeness problem by linking the recurrence coefficients to a rotated Favard spectral measure on the major axis of the symbol's ellipse. Combined with self-commutator positivity, this establishes an unconditional, exact necessary and sufficient characterization of hypercyclicity: $T_\Psi$ is hypercyclic if and only if $|a| > |c|$ and $\Psi(\mathbb{D})$ intersects both the unit disc and its exterior, completely eliminating the $(3+\sqrt{2})$ restriction of previous literature.

Given an $m$-dimensional weight $\mathbf{r}$ and an $n$-dimensional weight $\mathbf{s}$, we prove that the set of $(\mathbf{r};\mathbf{s})$-badly approximable $m\times n$ matrices is hyperplane absolute winning on $\mathbb{R}^{m\times n}$. This fully answers a question \cite[Question 8.2 (iii)]{Kl} of D. Kleinbock in 1998.

Every multiparameter persistence vectorization we know of carries a one-sided Lipschitz upper bound and nothing below it: without a lower gauge there is no sense in which the features are faithful, and no per-prediction guarantee can be built on them. This paper supplies the missing side. COMPLEX is a closed-form, training-free embedding of multiparameter modules – slice the module along a fixed near-diagonal net, embed each slice barcode by the certified PLACE/PALACE landmark map, concatenate. Under a checkable witnessing-slice coherence condition, holding on 100% of audited pairs on Orbit5k, a single slice carries a closed-form lower gauge: separated modules stay separated in the embedding. With the standard upper bound this gives, to our knowledge, the first two-sided distortion bound for a multiparameter feature map, making faithfulness measurable. Measuring it, we find the floor tight within a small factor of realized distances yet operationally local: an RBF-SVM reaches 91% where 1-NN reaches 78% on the same features. Local per-prediction certification therefore fails for a structural reason common to every landmark embedding whose lower gauge is witnessed by one coordinate. With no learned embedding and no held-out calibration – only a cross-validated SVM head – COMPLEX sets the state of the art on both Orbit benchmarks (91.95% on Orbit5k, 92.98% on Orbit100k), level with or above Euler-characteristic surfaces and above transformers and graphcode. On graphs it exceeds GRIL on all four shared molecular benchmarks with one fixed configuration, including the only multiparameter method to clear COX2's majority baseline by more than three points. Closed-form selection – of the landmark radius, the kernel (certificate-preserving), and the bifiltration set – buys further accuracy; gradient-shaped adaptation buys none.

We consider a 3D rotating Navier-Stokes equation with transport-stretching noise, posed between two horizontal plates, and study the joint limit of vanishing vertical viscosity and rapid rotation. Our driving noise depends only on the horizontal coordinates and its vertical component vanishes with the viscosity. Provided that the initial data is purely horizontal, we construct martingale weak solutions which converge in $L^2_{\omega}L^\infty_tL^2_x$ to the layered strong solution of a 2D stochastic Navier-Stokes equation with damping. The damping coefficient is dependent on the limit of the ratio between vertical viscosity and inverse rotation rate.

The classical Thompson's conjecture asserts that in any finite nonabelian simple group $G$, there exists a conjugacy class $S$ whose square is equal to the entire group. Shalev (Annals Math., 2009) conjectured that a much stronger quantitative version holds: there exists $\epsilon > 0$ such that for any conjugacy class $S$ with $|S| \geq |G|^{1-\epsilon}$, we have $G \setminus \{1\} \subseteq S^2$. While the conjecture turns out to fail in general, we prove a close variant of the conjecture over $\operatorname{PSL}_n(2)$: There exist $\epsilon>0$ and $N \in \mathbb{N}$ such that for all $n\geq N$, every conjugacy class $S\subseteq\operatorname{PSL}_n(2)$ with $|S|\geq|\operatorname{PSL}_n(2)|^{1-\epsilon}$ satisfies $\{x\in\operatorname{PSL}_n(2):\operatorname{supp}(x)\neq1\}\subseteq SS^{-1}.$ On the other hand, we show that for each $\epsilon>0$, there exist conjugacy classes $S \subset \operatorname{PSL}_n(8)$ of size $>|\operatorname{PSL}_n(8))|^{1-\epsilon}$ for which $SS^{-1}$ misses even elements with support size linear in $n$. In addition, for every odd $n \ge 5$, we construct an inverse-closed normal set in $\operatorname{PSL}_n(5)$ with fixed positive density whose square misses a nonidentity element. This answers on the negative a question of Shalev (ECM, 2021) and disproves a conjecture of Pyber (Kourovka notebook, 2022).

We prove there are $1442$ four-bar coupler curves through nine generic points in the plane, and thus resolve Alt's problem. We obtain this proof in three steps. First, we identify the space of coupler curves with a Zariski open subset of $\textrm{Gr}(3,6)$. Next, we formulate the polynomial system representing the nine-point path synthesis problem in these coordinates and modify it to obtain the mixed volume $5538$. Finally, we prove that $4096$ of the branches of the generic sparse polynomial system with that support escape the torus in the sparse limit. Thus, we obtain an upper bound of $5538-4096=1442$ for the generic solution count. A lower bound of $1442$ is achieved via numerical certification on one instance.

Determining the exact minimum distances of BCH codes remains a open problem. We establish the minimum distances of several families of primitive narrow-sense BCH codes, showing that they attain their designed distances. Our approach centers on $\mathbb{F}_q$-good zero-sets, which we introduce through a derivative condition on their vanishing polynomials. We show that a $q$-ary primitive narrow-sense BCH code of length $q^m-1$ and designed distance $2\leq\delta\leq q^m-1$ has minimum distance $\delta$ if and only if there exists an $\mathbb{F}_q$-good zero-set of cardinality $\delta+1$ in the finite field $\mathbb{F}_{q^m}$ with $q^m$ elements. To construct $\mathbb{F}_q$-good zero-sets, we develop several methods based on polynomial substitutions, power maps, and shifted inverses, as well as direct constructions using polynomials of special forms. Together with suitable initial $\mathbb{F}_q$-good zero-sets, including those arising from known minimum-distance results, these methods yield new good zero-sets of various cardinalities and hence families of primitive narrow-sense BCH codes whose minimum distances equal their designed distances. These families cover a broad range of designed distances, with several known minimum-distance results recovered as special cases.

We study the quantitative codimension-two estimate for the singular set in the boundary neighborhoods of the solutions of \begin{equation*} \Delta u+V(x)u=0\qquad\text{in }\Omega, \qquad u=0\qquad\text{on }\partial\Omega, \end{equation*} where $\Omega\subset\mathbb R^n$ is a bounded $C^{1,\mathrm{Dini}}$ domain and $V\in L^p(\Omega)$ for some $p>n$. We first prove the explicit upper bound for the doubling index is given by $C(n,p,\Omega)(1+\|V\|_{L^p(\Omega)}^{\frac{2p}{3p-2n}})$.The analytic input is an interior volume estimate for solutions of second order elliptic equations with uniformly elliptic Dini leading coefficients and $V\in L^p$. Using the quantitative doubling index bound, boundary flattening, we show an explicit upper bound for singular sets in the neighborhood of the boundary of the $C^{1,\mathrm{Dini}}$ domain.

We study clustering of categorical sequences using the Optimal Matching (OM) distance under finite mixtures of finite-state Markov chains. We show that the normalized OM distance between two independent chains converges almost surely to a deterministic population quantity, concentrates exponentially around its finite-horizon mean, and admits an $O(\sqrt{\log n/n})$ convergence rate when the two chains have the same transition kernel. These population quantities yield a natural separation condition: the largest within-component limit must be smaller than the smallest between-component limit. Under this condition, hierarchical clustering with any bracketed linkage and Partitioning Around Medoids consistently recover the latent mixture partition. We also propose a consistent estimator of the number of components based on empirical OM distance profiles. The results extend to finite-state hidden Markov models and multichannel categorical observations. Overall, they provide a statistical justification for standard OM-based clustering methods for categorical time series.

B{\i}y{\i}ko{\u g}lu, Hordijk, Leydold, Pisanski, and Stadler conjectured that, for every $n\geq3$ and $1\leq i\leq n-2$, the hypercube $Q_n$ admits a Laplacian eigenfunction with eigenvalue $2i$ and exactly two strong nodal domains. In this paper, we confirm this conjecture.

The escaping set of a transcendental entire function consists of those points that tend to infinity under iteration. Eremenko asked whether every connected component of this set is unbounded. In arXiv:2108.10256, we constructed transcendental entire functions for which the escaping set has prescribed compact connected components; in particular, it may have a singleton component. This disproves the conjecture. In this note, we give an introduction to the problem, aimed at a general mathematical audience. We also sketch a variant of the construction in which a prescribed half-strip is an oscillating wandering domain and an escaping point lies on its boundary. The account is based on the second author's lecture at the 2026 International Congress of Basic Science.

We introduce Multiplicatively Optimistic Regret Matching (MORM), an uncoupled learning rule for finite general-sum games. Under simultaneous full-information self-play, every player achieves external regret $O(\sqrt n\log d)$ uniformly over all horizons, using only one-step optimism. The analysis combines a potential-based regret-matching argument with multiplicative stability and Hellinger control of strategy movement. A learning-rate safeguard additionally gives $O(\sqrt{T\log d})$ regret in the face of adversarial utilities.

In this paper, we study the Cauchy problem for a coupled system of damped wave equations with mixed product-type nonlinearities. We have succeeded in determining the critical curve, formulated in terms of the power exponents of nonlinearities, for the global (in time) existence of small data mild solutions and the nonexistence of global mild solutions. Moreover, the global existence result is established by means of Schauder's fixed point theorem and Banach's contraction principle, whereas the nonexistence analysis relies on a new iteration scheme adapted to the product-type structure of nonlinearities. To the best of our knowledge, this work provides the first critical threshold results for such systems.

We use the Boué-Dupuis variational method to construct the Abelian Yang-Mills-Higgs measure on the two-dimensional torus with polynomial Higgs potentials, giving, to our knowledge, the first rigorous construction of an interacting gauge theory by this approach. We first use the variational method to construct the Higgs field conditioned on the gauge field, with a covariant Gaussian free field as the reference measure. Integrating out the Higgs field produces a weight on the gauge field, which we control through a second application of the variational method. We also prove new exponential integrability estimates for the joint gauge-Higgs field and establish gauge covariance. Finally, we prove convergence of the Laplace transforms of the regularised measures and establish a new large-deviation principle for gauge-invariant observables in the semiclassical limit.

We consider the non-linear cubic defocusing Schrödinger equation on the 2D Torus ($T^2$) with a potential $V(x)\in H^{2^+}(T^2)$. The initial data, $u_0$,is given by a centered gaussian variable with covariance $(-\Delta+V)^{-1}$, and thus is almost surely in $H^{0^-}(T^2)$. We show that it is almost surely well-possed for all time in the weak sense, and that $u-e^{it(\Delta -V)}u_0$ is in $H^{s}(T^2)$ for some $s>0$, and that the solution is the limit of the solutions to the truncated equation. This result is a generalization of the results first given by Bourgain in Invariant Measures for the {2D}-Defocusing Nonlinear {Schrödinger} Equation.

Moser's worm problem asks for a planar region of least area containing a congruent copy of every unit arc. We show that the infimum area $\alpha$ among convex universal covers satisfies $0.239\le\alpha\le0.24633\ldots$, reducing the gap between the previous refereed bounds by over $75\%$. For the lower bound, we choose four unit polygonal arcs and prove by finite subdivision that, however they are placed, their convex hull has area at least $0.239$. For the upper bound, we construct a quadrilateral of area $0.24633\ldots$ and prove cover universality by showing that its support inequalities force uncovered arcs to have length greater than one. The full proof is formalized in Lean 4 and verified by the Lean kernel. Code and certificates are available at https://github.com/ethan-keller/moser-worm-improved-bounds.

We prove that the Y-partition into three equal sectors is the minimal spectral three-partition both for the Dirichlet Laplacian on the unit disc and for the planar harmonic oscillator $-\Delta+|x|^2$, with minimal energies $j_{3/2,1}^{2}$ and $5$; for the disc, this confirms a conjecture of Helffer and Hoffmann-Ostenhof. The minimizing regular strong partition is unique up to rotation, and every open minimizing partition has cells with the Dirichlet form domains of the sectors. The proof is a positive radial transplantation to the sphere that preserves segregation and matches the angular-energy measures of the separated model states; the three-lune theorem of Helffer, Hoffmann-Ostenhof, and Terracini then gives the lower bound. The transplantation lowers the shifted quadratic form by a nonnegative defect with strictly positive radial weight; in the equality case, spherical equipartition makes the defects vanish, which separates variables, and a Poincaré inequality on the circle identifies the sectors.

Masked diffusions are popular generative models for discrete distributions. Unlike standard autoregressive sampling, they reveal several coordinates in parallel, approximating each block's joint conditional law by a product of one-coordinate conditionals. The resulting procedure, usually called tau-leaping, reduces computational cost but introduces a factorization error ($\varepsilon_\text{fact}$), even with perfectly learned predictors. We study the resulting tradeoff between generative accuracy and computational cost, focusing on how to choose a denoising schedule to minimize $\varepsilon_\text{fact}$ for a fixed sampling budget. To do so, we establish an exact integral representation of $\varepsilon_\text{fact}$ separating the schedule from the target's dependence structure, summarized by a dependence density $\rho$. This representation yields recursive stationarity equations for optimal schedules and allows us to quantify how estimation errors in $\rho$ affect schedule selection. As the dimension $N$ and sampling budget grow, we characterize the optimal schedule and quantify the cost of random block sizes relative to a deterministic planner. We highlight a fundamental dichotomy: if $\rho$ converges uniformly to a strictly positive continuous profile as $N\to\infty$, schedule optimization can only improve the leading constant of $\varepsilon_\text{fact}$, while if $\rho$ degenerates, schedule optimization can improve the asymptotic order. Examples based on stationary processes and exchangeable mixtures illustrate these regimes.

We study finite-time explosion to $-\infty$ for the one-dimensional stochastic differential equation \[ X_t^x=x-\int_0^t b(X_s^x)\,\dd s+L_t,\quad x\in\R, \] where $b$ is locally Lipschitz and $(L_t)_{t\ge0}$ is a pure-jump Lévy process. We give verifiable conditions involving Osgood-type integrability under which explosion occurs almost surely from every finite initial state. Under stronger tail conditions, we obtain a uniform bound on the mean explosion time. In particular, under suitable tail monotonicity, converse results make these criteria necessary and sufficient, and yield an explicit classification for Riccati drifts. As an application, we consider a semilinear parabolic stochastic partial differential equation (SPDE) with additive Lévy space–time white noise and homogeneous Dirichlet boundary conditions. We give explicit conditions on the nonlinearity and the Lévy measure under which every local weak solution defined up to explosion has an almost surely finite explosion time.

We construct finite covers of a fixed product of two closed hyperbolic surfaces of genus two whose fundamental groups are generated by at most fifteen elements and whose injectivity radii tend to infinity. The construction uses fibre products over finite groups. These covers are closed aspherical four-manifolds with universal cover $\mathbb H^2\times\mathbb H^2$. They give counterexamples to a conjecture of Avramidi and Delzant for symmetric spaces of higher rank, in the case \(\mathbb H^2\times\mathbb H^2\).

LeBrun's Kähler realization $g_m$ of the Taub–NUT metric on $\mathbb{C}^2$ is complete, Ricci-flat and not flat. Loi, Zedda and Zuddas proved that no multiple $\alpha g_m$ admits a Kähler immersion into a finite- or infinite-dimensional complex projective space when $m>\alpha/2$, and conjectured that the same holds for every $m>0$. We prove the conjecture. The restriction of the Kähler potential to the axis $z_2=0$ is governed by the Lambert $W$ function, so $\exp(\alpha\Phi_m)$ has a finite radius of convergence as a power series in $|z_1|^2$ although it is real analytic on the whole half-line; the Vivanti–Pringsheim theorem forbids nonnegative Taylor coefficients, and Calabi's criterion fails. We state the mechanism, which Arezzo, Loi, Placini and Zedda recently used for radial metrics, as a general obstruction to Kähler immersions. In statistical terms the axis restriction of $g_m$ would be a natural exponential family with mean domain $(0,\infty)$ and variance function $\mu/(1+2m\mu)$; the argument gives an elementary proof of the known fact, due to Bar-Lev, Bshouty and Enis, that no such family exists with variance function $\mu/(1+c\mu)$ for any $c>0$. The result confirms onemore case of the conjecture of Loi, Salis and Zuddas that Ricci-flat projectively induced Kähler metrics are flat. The analytic core of the proof has been machine-checked in Lean~4.

In this paper, we prove a boundedness result for parabolic Riesz transforms in the range $p \le 2$ associated with degenerate parabolic operators whose elliptic part is in divergence form with complex coefficients depending measurably on space and time. The degeneracy is determined by a spatial weight in the Muckenhoupt class $A_2(\mathbb{R}^n)$. The argument relies on off-diagonal estimates for the parabolic gradient of the resolvent family, together with weighted embeddings. We obtain boundedness in a range of exponents strictly below $2$, with explicit ranges quantified by the reverse Hölder class of the weight. For real coefficients, this quantification is sharp and extends down to $1$.

We prove that right-angled Artin groups (RAAGs) are profinitely rigid relative to the class of Artin groups. More precisely, if $A_\Gamma$ is an arbitrary Artin group and $A_\Lambda$ is a right-angled Artin group such that their profinite completions are isomorphic, i.e., $\widehat{A_\Gamma}\cong\widehat{A_\Lambda},$ then $\Gamma$ is right-angled and $\Gamma\cong\Lambda$ as labeled graphs. The proof combines the structure of pro-$p$ completions of Artin groups with finite Coxeter quotients to recover the defining graph.

We study Brownian motion and Brownian bridge processes conditioned to remain in a fixed interval $[0,a]$, focusing on the conditional distribution at a single time. For a Brownian motion in $[0,a]$, conditioned on survival up to time $t$ we recall (and present in a self-contained form) the conditional density of its position at $t$ (exact extrapolation). For a Brownian bridge conditioned to remain in $[0,a]$ on $[0,T]$ we express the probability density at an interior time as a normalized product of killed transition densities (exact interpolation). These densities admit dual complementary series representations, which are linked via the Jacobi theta identity. Our main contribution is a unified exact sampling suite for both extrapolation and interpolation that (i) includes boundary endpoints and (ii) automatically switches between density representations to keep acceptance rates efficient across regimes. To that end, we derive simple proposal families which cover both small- and large-time regimes, with an automatic rule selecting the tighter envelope. Our procedures extend to exact simulation of discrete skeleton paths at multiple times via the Markov property.

We study collision times of many independent simple random walks on $\mathbb Z^2$ through the joint moment generating function of their pairwise collision local times. For a fixed number of walks, these collision times are known to be asymptotically independent after a suitable logarithmic normalisation. We investigate the extent to which this independence persists when the number of walks grows. For $N$ being the walk length, our results identify a threshold $\asymp (\log N)^{\frac{1}{3}}$, on which the transition from independence to dependence happens. The proofs combine chaos expansion techniques and a correlation inequality, which is the result of a local limit theorem.

We study the simultaneous asymptotic behaviour of homogenization and the Bourgain–Brezis–Mironescu limit for quadratic fractional energies with periodic coefficients. The functionals depend on two small parameters: the period of the coefficients and the fractional exponent approaching the local limit. We prove that the $\Gamma$-limit is completely determined by the relative scaling of these parameters. In the two extreme regimes, one recovers the expected separation of scales, yielding either the homogenized Dirichlet energy or the energy with averaged coefficients. At the critical logarithmic scaling, however, the two mechanisms coexist, and the limit is a convex combination of the homogenized and averaged energies, with weights depending explicitly on the relative scaling of the two asymptotic processes. The proof combines the homogenization analysis of the short-range interactions with a blow-up argument showing that long-range interactions are simply averaged using a Riemann–Lebesgue-type argument.

Let $(Q,g)$ be a Riemannian manifold equipped with a non-identically zero magnetic field represented by a closed $2$-form $\beta$. We allow $Q$ to be non-compact and do not assume that the metric $g$ is complete. We prove that if the magnetic strength, defined as the pointwise norm of $\beta$, attains a strict local maximum on a non-empty compact set $K$, then every sufficiently low energy level carries a contractible periodic magnetic geodesic of the pair $(g,\beta)$ localized near $K$. More precisely, such orbits exist in every neighborhood of $K$, and their lengths converge to zero with the energy. In particular, if $Q$ is compact, then every sufficiently small energy level carries a contractible periodic magnetic geodesic. We also show that, in general, neither the non-emptiness nor the compactness of $K$ can be omitted. Our proof relies on the calculus of variations of the Lagrangian action functional, and uses several new ideas. More precisely, we overcome: (i) the non-exactness of $\beta$ by restricting the minimax to the set of short loops; (ii) the non-completeness of $g$ by combining a compactification of $Q$ with Thom's Jet Transversality and a blow-up for sequences of magnetic geodesics with energy tending to zero; (iii) the possible non-compactness of Palais–Smale sequences by the positivity of the Ricci magnetic curvature for low energy established by the first-named author. Unlike previous work, Struwe's monotonicity argument cannot be used for our purposes, and we rely on a two-Lyapunov-function argument due to Abbondandolo and Majer.

We prove a colorful quantitative Steinitz theorem in which the color classes may have different centers. If the convex hull of each of $2d$ sets in $\R^d$ contains a translate of the Euclidean unit ball, then a rainbow convex hull contains a ball of radius $(3d)^{-2d^2}$ whose center belongs to the convex hull of the given centers. The main ingredient is an exact result for translates of a segment, proved by a lifting and a topological colorful Helly theorem. The same idea also yields a sharp colorful Helly theorem for translated cones: for $1 \le k \le d-1$, if every rainbow selection from $2d-k+1$ finite families of convex sets in $\mathbb{R}^d$ has a $k$-dimensional cone in its intersection, then the intersection of one of the families contains such a cone.

The elementary symmetric partition map $\pre_s$, introduced by Ballantine, Beck, and Merca, sends an integer partition to the summands in the evaluation of the $s$-th elementary symmetric polynomial at its parts. By encoding partition parts as prime-exponent valuation vectors, we connect $\pre_s$ to Leo Moser's additive Multiset Recovery Problem (1957) and prove that $\pre_s$ is unconditionally injective on partitions of length $n$ whenever $n$ lies outside the Moser root set $\mathcal{Z}_s$, with no size restrictions. Furthermore, under the equal-size constraint $|\lambda| = |\mu| = N$, we prove that $\pre_4$ is injective at the isolated singular length $n = 12$, and that every fiber of $\pre_3$ on $\Part_6(N)$ has cardinality at most $2$, completely excluding both triplets and quartets.