Papers

We study pointwise estimation of a smooth binomial mixing density and characterize its minimax rates. Assuming that the mixing density is $s$-Hölder smooth, we first consider the homogeneous setting with a common number of binomial trials $t$. We derive matching lower and upper bounds that reveal three regimes depending on the relative sizes of the sample size $n$ and the number of trials $t$. When $t$ is small, the finite number of trials creates an identification barrier that persists regardless of sample size; at intermediate $t$, more data reduce sampling uncertainty, while the number of trials limits how finely the mixing density can be recovered; and when $t$ is sufficiently large, the usual nonparametric density estimation rate is recovered. Our lower bounds exploit the polynomial structure of the binomial mixture model, while attainability is achieved by a suitably regularized orthogonal series estimator. We then extend the analysis to heterogeneous trial parameters, where the minimax rate depends on the full trial profile through the effective sample size available at each polynomial degree. These results characterize the fundamental statistical limits of learning smooth populations of binomial probabilities under both homogeneous and heterogeneous trials.

Per-target labeled random-finite-set filters, such as the state of the art $\delta$-generalized labeled multi-Bernoulli filter, cannot represent cooperating, swarm-like, motion between targets. In this work, we present a new filter that can. The new particle filter couples the joint particle filter with ensemble Gaussian mixture filter such that a measurement updates the density at every particle instead of merely reweighting. We prove that the new particle filter converges to the joint particle filter in the limit of particle number and thus to the true Bayesian posterior, under certain assumptions. Experimental results on two coupled systems, the Vicsek model and coupled Brownian motion provide evidence on the efficacy of the filter.

We study the proper hat guessing game on graphs, introduced by Adriaensen et al. in Hat guessing with proper colorings. In this game, the players are seated on the vertices of a graph $G$ and assigned hats from a set of $k$ colors such that the resulting assignment forms a proper coloring. The visibility of each vertex is limited to the hat colors of their neighborhood. Then they must simultaneously output a guess about the color of their own hat. The players win if at least one guess is correct. A parameter related to this problem is the proper hat guessing number $\operatorname{HG}_{P}(G)$ that is the maximum number of colors $m$ such that the players can guarantee a winning strategy. Motivated by the work of Shurman et al. \cite{shurman2026upper}, we establish the first upper bound that depends both on the number of vertices $n$ and the maximum degree $\Delta$ in the case where $\Delta \geq \frac{n}{e+1}$. This result leads us to show that the proper hat guessing number of the binomial random graph $G_{n,1/2}$ is bounded above by $cn$, where $c \approx 1.366$. Finally, we prove that graphs of maximum degree $(1-\gamma)n$ for some fixed $\gamma \in (0,1]$ cannot have $\operatorname{HG}_{P}(G) = (2-o(1))n$.

Policy mirror descent (PMD) has a mature finite-time theory in discounted Markov decision processes (MDPs), but less is known in the average-reward setting, a more natural objective for many control applications. We give a finite-time, finite-sample analysis of PMD in ergodic average-reward MDPs built around a single master recursion that governs convergence for any critic, without external regularization. Its specializations yield linear rates for exact, inexact-tabular, and linear function approximation (LFA) updates, with a superlinear regime for exact PMD. We complement these convergence results with end-to-end sample complexities of order $t_{\mathrm{mix}}^3/\varepsilon^2$ in both tabular ($|S||A|$-dependent) and LFA ($d$-dependent) settings. Our LFA sample complexity sharpens the prior best $t_{\mathrm{mix}}^5$ mixing dependence to $t_{\mathrm{mix}}^3$, and matching information-theoretic lower bounds establish that the critic's $t_{\mathrm{mix}}^3/\varepsilon^2$ sample complexity is unimprovable in both settings.

Regular semisimple Hessenberg varieties are subvarieties of flag varieties defined for any reductive group. Their cohomology carries a representation of the associated Weyl group, known as the dot action representation. In type $A$, these representations can be computed using the chromatic quasisymmetric functions of naturally labeled unit interval graphs. We prove that restricting the dot action representation of any Weyl group to a type $A$ parabolic subgroup yields a representation isomorphic to a direct sum of type $A$ dot action representations. This work is motivated by the conjecture that an analogous property holds for all parabolic subgroups. In particular, for classical Weyl groups of types $B/C$ and $D$, we use chromatic symmetric functions to provide a streamlined, combinatorial formula for the restriction to a specific maximal type $A$ parabolic subgroup. As an application, we prove a conjecture of Lesnevich regarding the representations associated with ideals of types $B$ and $C$ identified under the standard poset isomorphism. Specifically, we show that the corresponding dot action representations are isomorphic if and only if the ideals determine the same reflection sets in their respective root systems. Furthermore, we show that a Catalan number counts the total number of such ideals.

In his highly influential paper, On the maximal ergodic theorem for certain subsets of the integers, Bourgain introduced the study of pointwise convergence of ergodic averages along randomly generated subsets of the integers, developing a robust \(L^p\)-theory for \(p>1\). More recently, this theory was partially complemented at the \(L^1\) endpoint by work of LaVictoire, who treated averages along random sequences that are “slightly denser" than the set of squares, for which universal \(L^1\) pointwise convergence is known to fail. In this work, we prove that, almost surely, for every measure-preserving system and every integrable function, the ergodic averages formed by sampling along random sequences with quadratic growth converge almost everywhere. Our proof combines harmonic-analytic methods developed by M.~Christ with a “random sampling" of quadratic forms, thereby overcoming the main uniformity obstruction.

For an ordered ideal triangulation of a knot exterior in $S^3$, we give a cochain construction relating its face matrix $C$ to its preferred-longitude gluing matrices $A,B$. The obstruction to uniqueness is the first cohomology of the ideal compactification. Its vanishing yields nullity doubling and the FAMED matrix identity, including a constrained formulation for singular face matrices. A separate rank argument under a strict angle structure supplies a proposed proof of Wong's generalized FAMED conjecture. Over the integers, the construction gives a direct-sum decomposition of $\ker_{\mathbb{Z}}B$ and an exact sequence from the two face cokernels to the gluing cokernel, with quotient $\mathbb{Z}/2\mathbb{Z}$. In the unhalved longitude convention this implies $|\det B|=2|\det C|^2$. We also obtain cyclic face torsion, order-reversal invariance of Smith normal form, and affine face coordinates for fixed lifted gluing systems. The determinant-one assertion and the full Andersen–Kashaev volume conjecture remain open here.

Let $q=p^a$ with $p$ prime, $\lambda\in\mathbb F_p^\times$, and $\psi_q=\psi\circ\mathrm{Tr}_{\mathbb F_q/\mathbb F_p}$ for a nontrivial additive character $\psi$ of $\mathbb F_p$. For $n\ge2$ we study $\Sigma_n(h)=\sum_{u\in(\mathbb F_q^\times)^n,\sum_i h_i u_i=-\lambda}\psi_q(\sum_i u_i^{-1})$. On $\mathbb G_m^n$ we construct a lisse sheaf $\mathcal W_n$, pure of weight $n+1$ and rank $r(n)=2^n-\binom n{\lfloor n/2\rfloor}$, whose Frobenius traces equal $(-1)^{n-1}q\Sigma_n(h)$ minus an explicit polynomial in $q$, for $h\in(\mathbb F_q^\times)^n$. For odd $p$, its geometric monodromy has identity component $\mathrm{SL}_{r(n)}$ and cyclic component group of order divisible by $p$. The full group is $\{g:\det(g)^p=1\}$ for $n=2$, and for $n\ge3$ using boundary unipotence from the companion preprint arXiv:2610.03081. For $p=2$, the sheaf is self-dual and its geometric monodromy is $\mathrm{SO}_{r(n)}$ for odd $n$ and $\mathrm{Sp}_{r(n)}$ for even $n$. After normalization to weight zero, the arithmetic and geometric groups coincide, using the same companion input for odd $p$ and $n\ge3$. As $q\to\infty$ with $p$ fixed, we obtain Sato-Tate laws for centered, normalized sums with error $O(q^{-1/2})$ for polynomial tests and formulas for all power moments. For $p=2$, limiting moments are Gaussian through order $r(n)-1$, with an excess of one above the orthogonal value at order $r(n)$ for odd $n$; if $n+1$ is a power of two, every Frobenius on $\mathcal W_n$ has eigenvalue $q^{(n+1)/2}$. The proof uses $\sum_h|\Sigma_n(h)|^4=c_pq^{3n-2}+O(q^{3n-2-\delta(n)})$ for $n\ge3$, where $c_p=2$ for odd $p$, $c_2=3$ and $\delta(n)=\min(1,(n-2)/2)$, plane sections of the Cayley cubic, exact Frobenius-Schur identities, Laumon's local Fourier transforms and Artin-Schreier theory. For $n=2$ we identify twisted classical Kloosterman sums and compute the fourth moment exactly.

We prove that every finite symmetric tensor category over an algebraically closed field of positive characteristic admits a symmetric tensor functor to a higher Verlinde category. This was conjectured for arbitrary symmetric tensor categories of moderate growth by Benson, Etingof and Ostrik. The proof uses higher Frobenius functors, introduced by the authors in [CF1]. The main effort is directed towards a proof of a conjecture from [CF1] about thick tensor ideals in the representation category of elementary abelian $p$-groups, which implies that the higher Frobenius functors are symmetric monoidal. In fact, we prove a refinement of the latter conjecture that relates tensoring with restricted Steinberg modules to an iterated generalised cohomology of modules of elementary abelian $p$-groups.

We study evolutionary Nash equilibrium learning in large populations whose payoffs are generated by dynamic mechanisms. Counterclockwise dissipativity (CCW) provides a passivity-like framework for establishing learning/convergence under a broad convex cone of so-called well-behaved learning rules satisfying a natural payoff-alignment condition according to which, away from equilibria, the population's state (strategic profile) moves in a direction positively correlated with the payoffs. The cone is closed under conic combinations and encompasses a broad range of noise-free rules, including discontinuous rules such as best response, imitative rules such as the replicator rule that is not $\delta$-passive, and all noise-free $\delta$-passive rules. Existing CCW results require no knowledge of the particular rule, but establish convergence without providing a Lyapunov function or Lyapunov stability. We develop a methodology that closes this gap by constructing rule-independent Lyapunov functions from CCW storage functions of the payoff mechanism. For a nonlinear class of anticipatory mechanisms, in which agents compare current payoffs with those associated with a smoothed population state, we show that a storage can be derived as a Bregman divergence. The resulting Lyapunov function combines a potential gap with this divergence and establishes global asymptotic stability. A congestion game with a nonlinear congestion-growth toll illustrates the results.

We prove that for any set $A$ with positive multiplicative upper density, there exist $x$, $y$, $z$ and $w$ in $A$ such that $x^2 + y^2w^2 = z^2$, generalizing a result of Frantzikinakis, Klurman and Moreira. Our techniques apply more broadly to a wide class of systems of equations, allowing us to solve these equations simultaneously and furthermore to restrict the w variable in an entirely different multiplicatively dense set. To do this, we prove a novel multiple recurrence result for multiplicative dynamical systems.

We investigate bi-objective mixed integer programming to which Benders decomposition can be applied, a widely used technique for exploiting problem structures in real-world applications. Our study focuses on a sustainable supply chain network design problem that aims to minimise both economic and environmental objectives. To address the bi-objective nature, we employ the weighted sum method, which requires solving similar problems repeatedly with different weight values. To tackle this, we propose a straightforward acceleration technique that reuses Benders cuts generated in previous iterations of the weighted sum method. This approach enables the Benders decomposition master problem to be initialised with pre-generated cuts. Our computational experiments demonstrate that reusing these cuts significantly reduces computing time.

We consider the estimation of the invariant distribution $\pi$ of a Markov kernel on a discrete state space (or of the mean value $\pi(f)$ of a functional $f$ under $\pi$) when solving the invariance equation is not feasible. Look-ahead estimators exploit the knowledge of the kernel by propagating the empirical occupation measure through $k$ steps of the chain. When the kernel is known, as in Markov chain Monte Carlo, we compare their mean squared error with that of the empirical estimator, for independent or Markovian data, stationary or not. Our main result establishes that, for Markovian data, the one-step estimator always improves on the empirical one asymptotically, and that the improvement grows with $k$ for reversible kernels. A non-reversible counterexample shows that reversibility cannot simply be dropped. In the statistical setting where the kernel belongs to a parametric family with unknown parameter, we introduce plug-in look-ahead estimators, which perform the look-ahead step with an estimated kernel. When the parameter is estimated at the parametric rate, we give a necessary and sufficient condition under which the plug-in look-ahead estimator outperforms the empirical one. The theoretical results are illustrated by extensive simulation studies, which also shed further light on the behaviour of the estimators at hand. Both settings are finally applied to real data arising from geographical mobility problems in the Lyon metropolitan area, France.

Neutral atom-based quantum computers have the ability to dynamically reshape the qubit register geometry between experimental runs. This capability enables different types of problems to be mapped directly onto the hardware, significantly enhancing the efficiency of solving, for instance, complex optimization and machine learning use-cases. However, this flexibility requires finding atom positions to implement target pairwise interactions, inducing a difficult nonconvex optimization for setting up the quantum machine. In this work, we introduce a new force-directed method that targets interactions to encode the input problem on the quantum computer. Numerical results show that our new method can improve embedding feasibility and solution quality by orders of magnitude, and remains reliable on the largest instances.

In this paper, we unravel the effect of different decoder architectures on the interpretability of the latent space of the Physically Recurrent Neural Network. Particular emphasis is given to a new weight normalization constraint, which acts as a regularization technique and enables robust training in the low-data regime. A brief visual exploration illustrates how these changes impact the latent space and how the fictitious stress can align with the true state of the RVE without explicit training. Reaping the benefits of a meaningful latent space, a case study illustrates how information from the microscopic level can be retrieved and incorporated into a multi-task approach that does not require extra parameters or larger training sets. Another key contribution shows that a specific architectural choice can naturally lead to a thermodynamically consistent formulation. By enforcing an adjoint encoder-decoder structure with positive scalar contributions, this modification ensures energy consistency across scales and non-negative dissipation, leading to even lower training requirements. This alternative completes the study on interpretability, inductive bias, and thermodynamic consistency, and demonstrates that data efficiency can be improved with careful architectural choices rooted in the underlying physics.

We prove an asymmetric version of the discretised ring theorem.

We consider steady-state optimization of nonlinear dynamical systems under time-varying stochastic operating conditions, where the objective is an expected-value function over the current operating-condition distribution, so that changes in the distribution induce a moving stochastic optimum. To address this problem, we propose stochastic sequential feedback optimization (S2FO), which combines projected feedback-gradient updates with sequential sensitivity estimates obtained by linearizing the plant at realized stochastic operating conditions. We analyze the closed-loop performance of S2FO through expected dynamic regret, instantaneous tracking in expectation, and almost-sure convergence under diminishing step sizes. We then apply the method to wind farm power maximization under time-varying stochastic inflow. Simulations on a benchmark layout and on a realistic offshore wind farm show that S2FO improves average power generation when persistent wake interactions are present, and that its advantage decreases as wind-direction variability increases.

We study nonnegative, non-monotone $k$-submodular maximization with $k\ge2$ labels under support constraints, and show how the certified approximation coefficient improves as the support region permits more uniform selection. For a compact convex down-closed support region $P\subseteq[0,1]^n$, the diagonal level $\zeta(P)=\max\{t\in[0,1]:t {\bf 1} \in P\}$ ranges from $\zeta=0$, which carries no geometric promise, to $\zeta=1$, which is unrestricted support. Our main structural result is a comparator-uniform linearization of the multilinear extension, built from an objective-independent action and a comparator-independent update field. For $k\ge3$, its validity reduces, independently of the number of elements, to four polynomial inequalities of degree at most three in one or two variables, only one of which depends on $k$. Explicit parameter choices give a nondecreasing certified profile $\underline{\alpha}_k(\zeta)$, in closed form on all of $[0,1]$ when $k=2$. At $\zeta=0$ we certify $0.4456\ldots$ for $k=2$ and $0.4541\ldots$ for every $k\ge3$, improving the recent $\sqrt2-1$ guarantee for one matroid or one knapsack, as well as the $1/3$-type guarantees for a fixed number of budgets; at $\zeta=1$ we certify $1/2$ for $k=2$, $(\sqrt{17}-3)/2$ for $k=3,4$, and $k/(2k-1)$ for $k\ge5$, whose excess over $1/2$ is of order $1/k$ rather than the previous $1/k^2$. Value-retaining rounding transfers these guarantees to matroid and knapsack constraints, and the same field yields $O(\sqrt T)$ approximate regret online under gradient or post-decision value feedback.

In this paper we demonstrate that Hopf algebras and Frobenius algebras provide an appropriate setting for an analogue of the classical Lie correspondence. We introduce a compatibility structure between Hopf and Frobenius algebras called Hopf-Frobenius modules, and give constructions that can be applied to any such module, which produce corresponding Lie groups and Lie algebras. Further, we show that classical Lie algebras and Lie groups give rise to Hopf-Frobenius modules for which the corresponding Lie groups and Lie algebras produced by our construction are those of the ordinary Lie correspondence.

Let $n \geq 3$. We improve the large sieve inequality for $n$-th order Hecke characters over any number field containing the $n$-th roots of unity. Our bound is expected to be optimal in all ranges of parameters. Several applications are deduced, including a tight upper bound for the second moment of cubic characters ordered by conductor, asymptotics with lower order terms for the cubic second moment over squarefree moduli, and improved moment and zero density estimates for every $n \geq 3$.

Let $Q$ be a Gorenstein local ring, let $I$ be a proper ideal of $Q$, and set $R=Q/I$. We investigate when finite injective dimension of the conormal module $I/I^2$ forces $I$ to be generated by a regular sequence. We prove this implication for every ideal in the linkage class of a complete intersection. When $Q$ is regular, we also establish it under several numerical conditions in terms of the number of generators of $I$ and the type of $R$. For normal domain quotients, we show that finite injective dimension of $I/I^2$ forces $(\mathrm{ht}(I)+1)[\omega_R]=0$ in $\operatorname{Cl}(R)$, yielding the desired conclusion when the divisor class group is torsionfree. In the graded setting, we further prove the implication for all monomial ideals in polynomial rings. We also obtain a converse to Kunz's description of the first Koszul homology of an almost complete intersection.

We give approximation algorithms for $\max\{F(x):x\in\K\}$, where $\K$ is a nonempty compact down-closed convex subset of the unit cube and $F$ is a nonnegative diminishing-returns (DR) submodular polynomial: every entry of its Hessian is nonpositive on the cube. Starting from quadratic or cubic coefficients, we decompose the objective exactly into nonnegative rooted atoms and affine terms. Concave upper bounds for these components give a tractable roof. We then decrease the coordinates of a roof optimizer using maps that work for all components at once, recovering a fraction of the roof value while preserving feasibility. For quadratics, we also retain the concave diagonal residual exactly. Under the stated assumptions on optimization access, these constructions give deterministic polynomial-time factors of $1/2$ for quadratics and $8/17$ for cubics, up to any prescribed additive error. The cubic result includes positive cubic coefficients and repeated variables. The factor $8/17$ also holds for two larger classes: supplied compatible rooted certificates of literal degree at most twelve, and sums of nonnegative submodular local functions of arity at most four. At arbitrary finite literal degree, a common scalar map attains the optimal single-map factor $2\sqrt3-3$. Global monotonicity and concave-cardinality structure give stronger guarantees for multilinear local-function sums, with no recovery beyond the identity map. Standard matroid rounding transfers the multilinear guarantees without loss. We also prove online preservation for directed-hypergraph cuts and, separately, a Unique-Games inapproximability bound of approximately $0.82843$ for explicit quadratic input under a cardinality upper bound.

The Izhikevich model is a computationally efficient neuron model that can exhibit a wide range of firing patterns observed in the brain. However, it is a discontinuous dynamical system, which means the methods for applying weakly coupled oscillator theory developed for continuous dynamical systems cannot be applied. Therefore, the collective behaviour of coupled Izhikevich model has not been fully studied. To our knowledge, we carry out the first computation of the phase model for an Izhikevich neuronal model with chemical synapses. Using the phase model we study the existence and stability of phase-locking states and how these vary with parameters. Moreover, we find an interesting connection between the stability of anti-phase states of the phase model and the bifurcation behaviour of the uncoupled Izhikevich model itself. The accuracy of the prediction of the phase model is supported by simulations of two weakly coupled Izhikevich neurons.

We introduce and study multi-indexed Schatten spaces which lift the commutative $\ell_{q_1}\![\ell_{q_2}\![\ell_{q_3}\![\dots]]]$ -spaces to the quantum toolbox. They extend Pisier's operator-valued Schatten norms and the recently introduced two-indexed Schatten quasi-norms. For every ordered tuple $\mathcal{Q}=(q_1,\dots,q_n)$ of non-zero indices we define a quasi-norm (for positive indices) or an anti-norm (for negative indices) on operators on an $n$-fold tensor product of Hilbert spaces. We do this for indices of the same sign satisfying the mutual compatibility condition $|\frac{1}{q_i}-\frac{1}{q_j}|\leq1$. Beyond establishing desirable properties of these quasi- and anti-norms via factorization formulas that combine operator space and matrix-analytic techniques, we lift several central tools and results of the seminal [Devetak, Junge, King, Ruskai, CMP 2006] to the multi-indexed and quasi-normed setting. These include a general non-commutative Minkowski inequality relating swapped systems and two identity-removal equalities. As a consequence, complete hypercontractivity and complete reverse hypercontractivity tensorize for all compatible indices, including negative ones. Concerning quantum information theory we prove that the completely bounded minimal and the maximal output conditional entropies are additive under tensor products of quantum channels for all $\alpha\geq\frac12$. This extends the case $\alpha>1$ of [Fawzi, Kochanowski, Rouzé, Van Himbeeck, CMP 2026] and the unconditional results of [Devetak, Junge, King, Ruskai, CMP 2006]. Beyond tensor products, we establish chain rules for $\tilde H^\uparrow_\alpha$, $\alpha\in[\frac12,1)$, for compositions of possibly signaling channels, extending upon the smooth max-entropy chain rule used in device-independent entanglement certification to the whole interval $\alpha\in[1/2,1)$.

In this work we provide the complete classification of all non-zero finite-dimensional complex Lie subalgebras of the universal enveloping algebra of the special linear Lie algebra $\mathfrak{sl}(2,\mathbb{C})$. That is, we show that every such nilpotent Lie subalgebra is abelian and every non-solvable Lie subalgebra is reductive, with semisimple component isomorphic to $\mathfrak{sl}(2,\mathbb{C})$ itself. Every non-nilpotent solvable Lie subalgebra is the direct sum of an abelian center and a member of the family of solvable Lie algebras $\mathfrak{r}(\boldsymbol{d},\boldsymbol{m})$, parameterized by a vector $\boldsymbol{d}$ whose entries are strictly increasing positive integers that have greatest common divisor one together with a positive integer vector $\boldsymbol{m}$ of the same length recording their multiplicities. Moreover, we discuss the corresponding classification in a real skew-hermitian setting and its relation to the realizations in the single- and two-mode Weyl algebras.

We study finite and countable point configurations in the trace of Brownian motion in $\mathbb{R}^d$, $d\geq2$. In the plane, the set of translations placing a prescribed finite configuration on the trace has Hausdorff dimension two in every nonempty open set; we prove analogous dimension-preservation results for radial and bilipschitz patterns, and every prescribed countable configuration has a dense translation set. For $d\geq3$ we prove a sharp occurrence criterion for regular scale-invariant families of configurations, in terms of the ranks of all labelled subconfigurations. It gives exact thresholds for arithmetic progressions and for homothetic and similar copies of finite sets. In particular we recover and extend a result of Benjamini and Kozma: almost surely the longest arithmetic progression in the trace has length five in $\mathbb{R}^3$, three in $\mathbb{R}^4$ and $\mathbb{R}^5$, and two in $\mathbb{R}^d$ for $d\geq6$.

In 1906, Maillet proved that every nonconstant rational function over $\mathbb{Q}$ maps Liouville numbers to Liouville numbers. Let $R$ be a nonconstant rational function with real algebraic coefficients, of degree $d$, and let $e$ be the degree of its minimal field of definition over $\mathbb{Q}$. We prove that, for every $m\geq 1$, the possible types of $R(\xi)$, as $\xi$ ranges over $U$-numbers of type $m$, are exactly the integers $r$ with $\lceil m/(ed)\rceil\leq r\leq em$. Moreover, every such type occurs for some $\xi$ of type $m$ in every nonempty open interval. Consequently, for $m\geq2$, the only rational functions with real algebraic coefficients preserving the class of $U$-numbers of type $m$ are the Möbius transformations over $\mathbb{Q}$.

Let X and Y be finite ordered sets and let $X^Y$ denote the ordered set of order-preserving maps from $Y$ to $X$. Let $t$ be a~term formed from a~single variable by exponentiation. We prove that, for every term $t$ with at most twelve variable occurrences and arbitrary finite ordered sets $A,B$, $t(A)\cong t(B)$ implies that $A\cong B$. General constructions and reconstruction principles are developed first; the second part gives the occurrence-by-occurrence proofs. At twelve occurrences the proof covers 4,766 interchange normal forms, representing all 58,786 binary parenthesizations, including 40 exceptional forms. Two additional unbounded reconstruction families, complete finite audit data, and 457 exact height-comparison certificates are included.

Let $F$ be a number field and $f$ a normalized cuspidal Hecke eigenform on $\mathrm{GL}(2)$ over $F$, with $k/2$ as the central critical point of its $L$-function $L(f,s)$. Let $\mathfrak{p}$ be a totally split prime ideal of $F$ lying above an odd prime $p$ and coprime to the level ideal of $f$. In this article, we show that $L(f\otimes\phi, k/2)$ does not vanish for sufficiently ramified Hecke characters of $F$ of $p$-power order and $\mathfrak{p}$-power conductor. Our result improves previous works of Jaesung Kwon and Hae-Sang Sun, in which the additional hypothesis that $p$ does not divide the class number of $F$ is required.

We develop a theory of orientability for metric manifolds and singular metric spaces using locally integral currents. For topological $n$-manifolds with locally finite Hausdorff measure, we introduce local degree and measure-theoretic conditions under which topological orientations correspond canonically to boundaryless, locally integer rectifiable $n$-currents of multiplicity one on the rectifiable part. We extend these currents to a class of singular spaces whose manifold part is dense and of full measure, and establish constancy and top-dimensional homology results under local uniqueness of orientation. For orientable non-collapsed $\RCD(\kappa,n)$ spaces, we prove a current-theoretic Stokes theorem: the boundary of the orientation current is the induced orientation current of the geometric boundary, with multiplicity one. In particular, its mass measure is precisely the $(n-1)$-dimensional Hausdorff measure on that boundary. For purely $n$-dimensional, locally geodesically complete spaces with local upper curvature bounds, we show that local uniqueness of orientation excludes codimension-one branching and implies a local $1$-Poincaré inequality. The latter result applies beyond homology manifolds and extends the connection between quantitative topology and Poincaré inequalities to this class of singular spaces.