Papers

A longstanding open problem concerning Ramanujan-Sato series is given by determining an expression for the coefficients $c_{11}(n)$ associated with Ramanujan-Sato series of level 11 with a fixed, nested, finite binomial sum for all nonnegative integers $n$, by direct analogy with the known formulas for the coefficients for lower-level Ramanujan-Sato series (and this is clarified and made explicit in our paper). This open problem was given by Cooper et al. in 2015 [J. Math. Anal. Appl.], in Cooper's 2017 textbook on Ramanujan's theta functions, and in Cooper's 2025 contribution to the Contemp. Math. series. This problem seems to have remained open. We succeed in solving this problem, by introducing and proving a double binomial sum formula for $c_{11}(n)$ that is directly analogous to the coefficient formulas for lower-level Ramanujan-Sato series.

We study negative edge correlation for two well-known models in statistical physics, the arboreal gas and the $q < 1$ random-cluster model. We show that after the edges $e$ and $f$ are removed, their Rayleigh difference is a crossing contribution minus the covariance of two endpoint-connectivity events. For the arboreal gas on an arbitrary finite graph, we analyze the two leading coefficients of this difference. The first is the classical transfer-current square. If it vanishes, the second has an electrical sum-of-squares formula. This proves negative edge correlation at sufficiently large fugacity whenever one of the two leading coefficients of the Rayleigh difference is nonzero, and characterizes simultaneous equality by an equipotential decomposition. For the random-cluster model on the complete graph $K_n$, we prove negative edge correlation throughout $q<1$ when all edge weights are at least $2$. In the uniform case, we prove something stronger:negative correlation holds when all the weights are equal and at least $1$. In particular, distinct edges in a connected spanning subgraph of $K_n$, weighted by a fixed fugacity, are negatively correlated for every $n$. We also explore what seems to be a general phenomenon: positive correlation of connectivity events. For the arboreal gas, we prove positive correlation for connectivity events at high fugacities. On lattices, the conjectured inequality would make the two-point function supermultiplicative and produce a convex inverse correlation length. Exact computations support the graph and matroid conjectures, including the Seymour–Welsh matroid $\mathcal S_8$, where ordinary edge-negative correlation fails. The results in this paper were derived by the authors without the use of Large Language models. The authors did benefit from using GPT-5 Pro for generating code to test out hypotheses as well as for simplifying the arguments.

We establish a Pogorelov type interior $C^2$ estimate for the real twisted Monge-Ampere equation without assuming uniform ellipticity. This equation is fully nonlinear and elliptic, but is neither concave nor a function of the eigenvalues of the Hessian, so the standard techniques for interior second-derivative estimates do not directly apply. Building on the partial Legendre transform formulation of Streets and Warren, we derive a differential identity for the associated positive-definite matrix $W(D^2u)$ and use some linear algebra to control the third-order terms arising in the maximum principle argument. As an application, we prove a Liouville theorem for entire split convex solutions with quadratic growth, extending the rigidity theorem of Streets and Warren by replacing their uniform ellipticity hypothesis with suitable quadratic growth assumptions.

This paper addresses the control of multi-input strict-feedback nonlinear systems subject to a joint capacity constraint, in which the admissible input set is a coupled subset of the individual actuator limits. Unlike existing constraint-handling methods that enforce actuator bounds channel by channel and may unnecessarily suppress admissible control directions, we develop an Anisotropic Joint-Admissibility-Preserving Input Realization (AJ-APIR) framework that explicitly exploits the geometry of the joint constraint. The proposed realization constructs a state-dependent gain matrix whose spectral decomposition separates the commanded input into normal and tangential directions relative to the constraint boundary. The normal component is attenuated as the boundary is approached, while the tangential component is preserved, which allows the admissible control effort to be redistributed without loss of tracking authority. Integrated with a backstepping controller, the AJ-APIR framework guarantees forward invariance of the joint admissible set for all time. We establish exponential convergence of the tracking error to zero together with uniform boundedness of all closed-loop signals, and characterize the resulting command-demand behavior under the joint constraint. Simulation results for a representative second-order, two-input nonlinear system subject to a power-budget constraint demonstrate the efficacy of the proposed method to enforce the joint input constraint.

Sipser and Spielman constructed LDPC codes from either bipartite spectral expanders or one-sided lossless expanders. In higher dimensions, spectral expansion similarly played a central role in the constructions of asymptotically good classical LTCs and qLDPC codes by Dinur, Evra, Livne, Lubotzky, and Mozes and by Panteleev and Kalachev. Alternatively, Lin and Hsieh constructed classical LTCs and qLDPC codes from two-dimensional lossless cubical complexes. In this work we develop the higher-dimensional lossless approach. We do not construct the required high-dimensional lossless cubical complexes; rather, we investigate what their existence would imply. We associate with a high-dimensional cubical complex a level chain complex, whose chain groups are supported on the level sets of the Boolean cube rather than on its cells. Our main technical contribution is a clean local-to-global theorem for this structure: suitable one-dimensional lossless expansion in the directional graphs implies small-set coboundary expansion of the global level complex. As a consequence, sufficiently imbalanced, two-sided lossless four-dimensional cubical complexes give rise to asymptotically good quantum locally testable codes. We expect the local-to-global principle developed here to have further applications.

The $\hat{Z}$ invariant of a three-manifold $M_{3}$, a half-index of the $3d$ $\mathcal{N}=2$ theory $T[M_{3}]$, is well understood for negative-definite plumbed three-manifolds. For orientation-reversed manifolds, however, the known formulas fail to produce $q$-series, and making sense of the operation $q \rightarrow q^{-1}$ remains a central open problem. Seifert manifolds, whose $\hat{Z}$ invariants are built from false theta functions, offer a natural testing ground. We study “dual false theta functions”, the objects that should replace false theta functions under orientation reversal. Two characterizations of these duals exist in the literature: a modular one, based on mock modularity with a prescribed shadow, and a resurgent one, based on Borel–Mordell integrals and transseries. We prove that the two characterizations are equivalent. We construct a new family of dual false theta functions for values of positive integer $p$ satisfying a Pell-equation condition. Its members are built from Zwegers' indefinite theta functions, have integer coefficients, and have effective central charge $c_{\text{eff}} \leq 1$. We also show that the mock theta functions of Li and Schwagenscheidt satisfy these characterizations and arise from a natural regularization of the divergent product $\eta^{3}(\tau)\psi_{p, a}(- \tau)$.

We study a class of Cauchy problems driven by pseudo-differential operators with Lévy-type symbols. We extend earlier results from exponential initial data to a broader set of initial conditions. We demonstrate the existence and uniqueness of the solution, which has an explicit convolution representation with the associated kernel. We then derive an asymptotic expansion of the solution, with coefficients expressed in terms of moments and, after taking logarithms, in terms of cumulants. These expansions are organized through generalized Feynman graph representations, providing a clear combinatorial description of both the solution and its logarithm. We also establish a Borel summability result under suitable conditions and recover the classical exponential case as a special instance. Finally, we illustrate the convolution kernel and solution through a one-dimensional Lévy-Gaussian example.

We establish non-asymptotic risk bounds for power Fréchet means in geodesic metric spaces with curvature bounded above. The observations form weighted, possibly infinite sequences of independent random variables whose laws and means may differ. We treat three settings. For $2$-Fréchet means in Hadamard spaces, we obtain a sharp mean squared error bound that becomes an identity in Hilbert spaces. For $2$-Fréchet means in CAT($\kappa$) spaces with $\kappa>0$, we establish variance and Wasserstein contraction inequalities with optimal constants depending on the circumradius $\varrho$ of the closed convex data domain, and obtain mean squared error bounds throughout the maximal range $\varrho<\pi/(2\sqrt{\kappa})$. For $\alpha$-Fréchet means in Hadamard spaces, $1<\alpha<2$, we derive finite $L^\alpha$ risk bounds under weighted $\alpha$-moment conditions, allowing even an infinite $\alpha$-moment of the population mixture. The proofs combine variance, quadruple, and contraction inequalities with a leave-one-out stability technique. Applications give prior and posterior bounds for Dirichlet-process Fréchet means and finite-sample guarantees for local constant Fréchet regression. The regression results require no response-space entropy condition and replace density smoothness assumptions common in earlier work with transport smoothness; for $\alpha<2$, the bounds remain finite even when the responses have infinite variance.

For a graph $G=(V,E)$ of order $n$ and an integer $k$ between $1$ and $\lfloor\frac{n}{2}\rfloor$, its token graph $F_k(G)$ is the graph whose vertices consist of the $\binom{n}{k}$ $k$-subsets of $V$, and two vertices of $F_k(G)$ are adjacent whenever their symmetric difference is an edge in $E$. It was found that the algebraic connectivity of a graph is greater than or equal to that of its token graph, while the Laplacian spectral radius of a graph is less than or equal to that of its token graph. Moreover, a conjecture that the algebraic connectivity of a graph coincides with that of its token graph has been proved by using the theory of continuous Markov chains of random walks. In this paper, we derive some results about the algebraic connectivities of a graph and the same graph after adding new edges and their token graphs to obtain a combinatorial/algebraic proof. Besides, we provide some conditions under which the Laplacian spectral radius of a graph is less than that of its token graph. Finally, we characterize the graphs that have the same Laplacian spectral radius as their token graphs, including trees.

We prove that, for every genus $g\geq 3$, the primary obstruction of each parity component of the moduli superstack of smooth unpunctured super Riemann surfaces is nonzero, both algebraically and holomorphically. Consequently, both components are non-projected and, in particular, non-split: neither admits an algebraic or holomorphic retraction onto its reduced moduli stack of spin curves.

We study gaugino condensates in $\mathcal{N}=1$ $SU(N)$ super-Yang–Mills theory on Eguchi–Hanson space using instanton methods. Fractional topological charge and the spectral asymmetry of the asymptotic $\mathbb{RP}^3$ boundary modify the instanton calculus. A charge-$\frac12$ instanton carries only two adjoint gaugino zero modes and can therefore contribute directly to the bilinear. Because the Eguchi–Hanson path integral prepares a boundary state on $\mathbb{RP}^3$, the observables are boundary-sector-projected amplitudes. Moreover, supersymmetric Ward identities ensure that chiral correlators are independent of insertion points and the Eguchi–Hanson resolution parameter. For $SU(2)$ instanton, with central holonomy, the full collective-coordinate integral gives $\langle\operatorname{tr}(\lambda\lambda)\rangle=16\pi^2\Lambda^3$ for a specified boundary projection, reproducing the flat-space value. For a single $SU(2)$-block embedding in $SU(N>2)$, the noncentral holonomy requires a continuum determinant for renormalization-group invariance, so zero modes alone do not determine the bilinear. We also study a charge-$1$ $SU(4)$ two-block saddle with central holonomy, $16$ bosonic moduli, and $8$ adjoint zero modes. Its collective-coordinate integral gives $\langle\prod_{i=1}^4\operatorname{tr}(\lambda\lambda)(x_i)\rangle=\frac16(16\pi^2\Lambda^3)^4$. Under the assumptions required for position independence and clustering, this result determines the fourth power of the bilinear condensate in the corresponding boundary sector. Since no independent bilinear calculation is available in the same sector, the factor $1/6$ does not by itself constitute a clustering puzzle.

We prove that the classical part of the Nicolai map for a supersymmetric free nonrelativistic particle moving on a Kähler manifold is linear in the Kähler metric and local for its velocity. Moreover, we give an exact expression for the one-loop correction of the map in terms of the Kähler potential and point out a direct way to higher loop order. This provides another example for the rare cases of exact Nicolai maps, and the first all-order one-loop result. As a check we have verified the Nicolai-map conditions to zero and one-loop order (free-action and determinant-matching). A graphical representation is given as well.

Infinite-distance limits play a central role in the Swampland program, but understanding their behaviour at intersections of boundary divisors is subtle, as it requires control over simultaneous limits of several moduli. To address this, we establish a necessary and sufficient criterion for a boundary stratum of arbitrary codimension in the complex-structure moduli space of Calabi-Yau manifolds to lie at infinite Weil-Petersson distance. In particular, intersections of infinite-distance boundary divisors necessarily remain at infinite distance. The result holds for the full Weil-Petersson metric and arbitrary trajectories, including those with unrestricted hierarchies in the saxions and axion winding. In compactifications of Type IIB string theory on Calabi-Yau threefolds, our proof is based on an inequality relating the Weil-Petersson length of a trajectory to the BPS mass associated with an auxiliary charge vector. If this mass tends to zero while the charge-to-mass ratio remains uniformly bounded, every trajectory approaching the limit has infinite length. Using asymptotic Hodge theory, we construct an auxiliary charge vector satisfying these conditions and derive the criterion directly from the limiting mixed Hodge structure associated with the degeneration. More generally, our result applies to polarized variations of Hodge structure of Calabi-Yau type. In particular, we prove Wang's conjecture on finite Weil-Petersson distance for degenerations over higher-dimensional bases.

Next-generation large language models (LLMs) are expanding from the cloud to ubiquitous edge devices. However, edge devices typically either lack the memory to store increasingly large LLM weights or, even with enough memory, spend unaffordable energy on loading the weights. This raises our question: can an edge device run an LLM without storing or loading its weights, but receive them over the air and consume them on the fly? Inspired by wireless broadcasting, we present AIR-LLM, an LLM inference architecture for edge devices, which is composed of: (i) a central radio (e.g., 5G base stations) that broadcasts the LLM weights into the air, and (ii) the edge user that receives the weights and completes the general matrix-vector multiplication (GEMV) of LLM inference directly in the radio frequency (RF) domain using RF mixers. To further shorten the airtime, AIR-LLM exploits MIMO spatial multiplexing and proposes an energy-efficient precoder-postcoder pair on the edge to calibrate its own wireless channel. Since the central radio stays user-unaware, AIR-LLM is user-scalable so that one broadcast serves unlimited users within its coverage. We implement AIR-LLM on the NVIDIA Sionna ray-traced channels of two real-world urban scenes and the profiling of a real RF mixer. With a WikiText-2 perplexity degradation of 4.0% on LLaMA-3.1-8B, AIR-LLM saves the energy by 157.7x/40.4x against the FP16 and weight-only quantization baselines; with 20 users, its airtime is 104.1x/26.0x shorter, respectively.

Neural network field theory specifies a Euclidean field theory by a network architecture and a density on its parameters, so that correlation functions are integrals over those parameters. We introduce constructive neural network field theory and use it to realize finite-volume scalar $\phi^4_2$ as a limit of network measures. For each dyadic momentum shell of the free propagator, the field is given a separate set of neurons with Gaussian coefficients, uniform phases, and frequencies drawn from the shell's spectral density. Once the frequencies and phases are fixed, integrating out one shell's coefficients is a finite-dimensional integral against a Gaussian density reweighted by the Wick-ordered quartic interaction. For widths that grow fast enough with the shell index and almost every draw of the frequencies and phases, the reweighted density is uniformly log-concave for every shell above a threshold, at any coupling in two and three dimensions, and the fluctuations of those shell fields are held to the free-field scale. In two dimensions, an induction over scales shows that shell $j$ contributes $O(2^{-2j}j^3)$ to the log partition function, and the total-variation distance between marginals at successive cutoffs is of the same order. Because these contributions are summable, the ultraviolet cutoff can be removed for any suitable fixed sequence of widths. Almost surely, the ultraviolet and infinite-width limits commute, and in either order the joint laws of finitely many smeared fields converge to those of the standard finite-volume $\phi^4_2$ measure. The method of parametrizing a field via a network organized into momentum shells and integrating out one shell at a time is not specific to $\phi^4_2$, so we expect it to extend to other theories.

We discuss (2+1)d Chern-Simons Higgsing transitions based on conformal embeddings and their relation to the proliferation of anyons. These transitions preserve or enlarge the intrinsic topological order despite reducing the gauge group. When the topological order is enlarged, the two phases differ by anyon condensation, and the transition takes an Abelian topological order to a non-Abelian one. In the $SO(N)_{2} \hookrightarrow SU(N)_{1}$ family with $N \geq 3$, the two semiclassical regimes have equivalent intrinsic topological orders but distinct realizations of a global $U(1)$ symmetry. For odd $N$, these are non-Abelian realizations of transitions from fermionic $1/N$ Laughlin states to charge-$2e$ anyon superconductivity coexisting with the same chiral $\mathbb{Z}_{N}$ topological order. The scalar representations are always non-integrable with respect to the UV Chern-Simons level and therefore do not directly label anyons of the un-Higgsed phase, despite defining Wilson lines in the UV. Using heuristic adjoint screening, we propose candidate anyons in the un-Higgsed phase, while branching under the Higgs subgroup reveals channels corresponding to condensable anyons of the Higgs phase. We further construct a $\mathrm{Spin}(16)_{1} \to \mathrm{Spin}(9)_{2}$ transition admitting a condensable algebra that contains a non-Abelian anyon but not all of the allowed gaugable channels in its self-fusion.

Parity superselection forbids direct measurement of odd Majorana observables. We learn time-independent, parity-covariant, $k$-mode-local Lindbladians on $m$ modes using even preparations and measurements with uninterrupted short-time evolution. Internal markers turn odd probes into even observables, and pair measurements among three separated markers calibrate their dynamical contributions. Signed Fierz inversion recovers canonical coefficients, while semidefinite fitting yields a valid generator. For finite-range models on known bounded-degree graphs with suitable marker access and a supplied weighted-strength bound $\bar\alpha$, entrywise error $\varepsilon$ is achieved using $\widetilde{\mathcal{O}}(\bar\alpha^2\varepsilon^{-2}\log(m/\delta))$ samples, without external modes or known nonzero coefficient locations. Recovery to diamond-norm error $\varepsilon$ costs an additional factor $m^2$, matching lower bounds for short-time experiments on fresh systems up to logarithmic and fixed geometric factors. Without a supplied graph, one idle ancillary mode per system mode and potentially nonlocal pair operations give total absolute coefficient error at most $\varepsilon$ per mode using $\widetilde{\mathcal{O}}_k(\bar\alpha^2\mathsf d^2m^{\lfloor k/2\rfloor}\varepsilon^{-2}\log(m/\delta))$ samples, under a supplied approximate coefficient-degree bound $\mathsf d$ and controlled weak-coefficient tails. All guarantees hold with probability at least $1-\delta$. For geometric models, fixed-support even observables can be predicted with logarithmic system-size sample complexity at fixed time and accuracy. We also give finite-volume and exponential-tail extensions.

As an alternative to the standard geometric analyses, we give an exact, information-theoretic analysis of stochastic gradient descent (SGD) and its variants. We show that a preconditioned SGD step is the posterior-mean update of a Gaussian Bayes model, and that its one-step regret splits into an intrinsic-time cost and a change in comparator information. The split extends to an identity for the objective itself. Convex convergence, strict-saddle-point escape, the link between flatness and generalization, the standard learning-rate schedules, adaptive optimizers, and the noisy, momentum, heavy-tailed, and gradient-free variants of SGD each correspond to a term or a special case of this identity. We measure its terms on synthetic and real training runs. On real networks it attributes the slack of classical convergence bounds to the terms their derivations drop and separates optimizers that reach the same training loss. That separation follows the number and consistency of their steps. Its relation to which of them generalizes better differs between networks. For gradient-free SGD the identity determines how a curvature preconditioner should enter the update. The sharpness-based generalization certificate it yields, with a data-independent isotropic prior, is vacuous at network scale unless the curvature spectrum is nearly flat across all parameters.

We generalise Berger's dilation theorem from numerical ranges to scaled $q$-numerical ranges. Specifically, we prove that if the scaled $q$-numerical range $\frac{W_q(A)}{q}$ is contained in the closed unit disk, then $A$ admits a unitary $\rho_q$-dilation, where $$ \rho_q=\max\left\{1,\frac{2|q|}{1+\sqrt{1-|q|^2}}\right\}. $$ As a corollary we show that every disk containing $\Omega_q(A)$ is a complete $\rho_q$-spectral set for $A$. At $q=1$, this recovers the classical fact that any disk containing $W(A)$ is a complete $2$-spectral set for $A$.

We determine the optimal success probability for transmitting a fixed number of classical messages through a finite number of uses of the quantum erasure channel, assisted by noiseless classical feedback and without initial shared entanglement. For an input dimension $d$, an erasure probability $p$, a blocklength $n$, and $M$ equiprobable messages, the optimal success probability is equal to $E[\min\{1,d^K/M\}]$, where $K$ is binomial with parameters $n$ and $1-p$. The converse allows arbitrary adaptive quantum encoders, quantum memories, and receiver instruments. Its main ingredient is an elementary dimension bound for noiseless quantum communication with classical feedback, proved by fixing the classical controls without conditioning the sender's state on the observed transcript. A classical protocol that transmits the base-$d$ digits of an integer representing the message, repeating each digit until the receiver acknowledges its reception or the prescribed blocklength is reached, attains the bound for every integer $M$. We also establish a relative-majorization property of erasure-channel outputs and exactly evaluate a hypothesis-testing converse, recovering the same numerical bound without feedback. That converse need not be achievable without feedback: four uses of the qubit erasure channel and four messages give a strict gap. A product-state code employing tetrahedral qubit states nevertheless outperforms every classical binary erasure code with these parameters. We give an explicit message-size formula and show that the bounded-remainder normal approximation and the average-success strong-converse exponent are unchanged without feedback. We also determine the feedback-assisted error exponent below capacity, prove that it agrees with the no-feedback exponent above a critical rate, and give no-feedback bounds at lower rates.

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\nu_i$, where $\varphi_1,\varphi_2,\varphi_3,\varphi_4$ are faces of $T$, $c_i=\operatorname{Area}(\varphi_i)$ and $\nu_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 $(\pi/4,\ \pi/2,\ \pi\beta/2)$, where $\beta=\arccos(-1/3)/\pi$; the hypergeometric parameters are linear in $\beta$ and there is $\textit{no accessory parameter and no free parameter}$. We record a closed form for $\kappa$ in $\Gamma$-values, a Wronskian closed form for $g'$, the exact total curvature $2\pi(2\beta-1)$, the symmetric-square structure of the data, and a rigidity statement: since $\beta/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.

We construct, over any field, a ten-dimensional algebra $A$ with $(\operatorname{rad}A)^3=0$ such that $\operatorname{findim}A=2$, $\operatorname{Findim}A=\infty$, and $\operatorname{Findim}(A^{\mathrm{op}})=0$. An explicit inverse-syzygy construction gives countably generated right modules of every positive finite projective dimension, disproving the big finitistic dimension conjecture. At each step we identify the full projective-cover kernel, and nonzero Ext detects the exact resolution length. For this algebra, we classify the modules of projective dimension at most one that embed in radicals of projective modules, with no generation restriction, in terms of invertible linear operators. We determine all dimension vectors of finite-dimensional modules of projective dimension two and classify those attaining the sharp dimension bounds, including all fourteen-dimensional modules of projective dimension two. For arbitrary Artin algebras, we give recursive sufficient criteria that control finite projective resolutions through radical-annihilated ideals and suitable corners. For finite-dimensional elementary radical-cube-zero algebras, we prove finiteness of the big finitistic dimension in the two-vertex case with one loop at each vertex and obtain multiplication-map criteria for bounds of one or two. Finally, an exact representation embedding yields wildness of the projective-dimension-two class and, over every field, a superdecomposable pure-injective module in that class.

While constellation shaping improves spectral efficiency, its application to quadrature phase-shift keying (QPSK) remains limited. We address this limitation by incorporating a short shaping code into low-density parity-check (LDPC)-coded QPSK systems. Specifically, a subset of LDPC codeword bits is used as shaping bits and mapped by the shaping code to a sparse codeword that enables probabilistic shaping by controlling non-equiprobable selection between lower- and higherenergy QPSK constellations. Because zeros dominate the sparse codeword, lower-energy constellation points are transmitted more frequently, yielding a Gaussian-like symbol distribution. By exploiting the channel-code protection of the shaping bits, we develop receiver algorithms that refine shaping-bit log-likelihood ratios (LLRs) using LDPC decoder feedback. Joint optimization of the shaping codebook, bit-to-symbol mapping and constellations enables the proposed shaping scheme to achieve gains of up to 0.6 and 0.53 dB over 5G New Radio (NR) LDPC-coded QPSK and QAM-16, respectively.

Børve, Horiatakis, and Kalck defined the magnitude of the module category of a representation-finite algebra as the sum of the entries of the inverse of the matrix of Hom dimensions between indecomposable modules. They showed it is an Euler characteristic, the alternating count of vertices, arrows, and meshes of the Auslander–Reiten quiver, and conjectured that it is at least the number of simple modules, with equality precisely for special biserial algebras. We prove this conjecture over an algebraically closed field. For a representation-directed algebra, we relate the magnitudes of the module category, the subcategory of modules without a given simple composition factor, and the ideal quotient by it. By the theory of hammocks of Ringel and Vossieck, this quotient is equivalent to a category of representations of a finite poset, whose magnitude we compute. The general case reduces to the representation-directed case through algebras obtained by grading a standard form.

Let $K$ be the trefoil or figure-eight knot and let $M_K$ denote zero surgery on $K$. We prove that the fiberwise elliptic involution gives a two-fold branched cover \[ M_K\times S^1\longrightarrow T^2\times S^2 \] whose branch locus is a section together with a connected braided three-section. The corresponding braid words are computed explicitly for both knots and make visible the relation with Luttinger surgery along product Lagrangian tori. More generally, for a genus-$g$ fibered knot with hyperelliptic monodromy, the same construction gives a braided $(2g+2)$-section; this includes every genus-two fibered knot. We also state the corresponding surface-bundle version over $T^2$. We then track the induced peripheral data and gluing diffeomorphisms in the constructions of $Y_K$ and its twisted double $X_K$, as studied by the author in \cite[Section~4]{Akh07}, and through the constructions of the small exotic manifolds homeomorphic to $\CP^2\#k\CPb^2$, $k=3,5$ \cite{AkhmedovSmall,ABP,AP2008}. In the symmetric construction of a $k=5$ example \cite[Section~3.3]{ABP}, each summand admits a double cover branched along a surface, although the marked complements used in the twisted double need not be invariant. Finally, we prove boundary-action, relative-homology, and local-smoothing obstructions to extending these local involutions across the gluing regions to a branched cover of the closed manifold.

The rough response calculus for the rotationally marked SLE welding law gives a closed Weil–Petersson energy but does not by itself give a process on rough weldings. For $0<\kappa\leq4$, we prove that this form is quasi-regular in the natural topology of circle homeomorphisms and therefore generates a canonical diffusion reversible with respect to the SLE welding probability. The proof constructs a compact form nest from inverse arc masses. We identify the generator as $-D^*D$ and prove absolute $L^2$ convergence of its Fourier expansion on the response cylinder core, together with the Fukushima decomposition. A common Fourier noise and planar estimates preventing boundary collapse yield a second quasi-regular realization by normalized Jordan welding triples. The diffusion is irreducible and converges strongly in $L^2$ to equilibrium. For $0<\kappa<4$, the complement of the conformally removable welding locus has zero capacity.

We study the monic recurrence coefficients of the generalized Charlier polynomials associated with the discrete weight \[ \rho_\mu(k) = \frac{\mu^k}{(k!)^2}, \qquad k\in\mathbb N_0, \qquad \mu>0. \] We establish complete factorial asymptotics for the deviations $\beta_n-n$ and $\mu-\gamma_n$, proving that they are beyond all algebraic orders and appear at the scale $\mu^{n}/(n!)^2$. The key step is a parametrization $\beta_n-n=\sqrt{\mu}\,c_nc_{n+1}$, $\gamma_n=\mu(1-c_n^2)$, which reduces the problem to a positive sequence $(c_n)$ satisfying a discrete Painlevé II equation. Linearization around $c_n=0$ yields a discrete Bessel equation whose recessive solution is $J_n(2\sqrt{\mu})$. We prove that the ratio $c_n/J_n(2\sqrt{\mu})$ converges to a finite limit $L(\mu)$, which we identify exactly as $L(\mu)=1$ by combining Bessel comparison with a global analysis based on the sector decomposition of the associated Hankel determinant. This yields the exact connection formula \[ c_n \sim J_n(2\sqrt{\mu}), \qquad n\to\infty, \] and consequently the precise asymptotics \[ \beta_n-n\sim \frac{\mu^{n+1}}{n!(n+1)!}, \qquad \mu-\gamma_n\sim \frac{\mu^{n+1}}{(n!)^2}. \] We further develop a complementary approach based on Hankel determinants interpreted as a discrete logarithmic gas. We show that the Hankel determinant factorizes as $\Delta_n(\mu)=\mu^{n(n-1)/2}T_n(\mu)$ and admits a sector decomposition $T_n(\mu)=1+\sum_{q=1}^{n}S_q(\mu)$ with sector contributions independent of $n$. We establish $S_q(\mu)\sim e^\mu\mu^q/(q!)^2$, providing an independent derivation of the factorial corrections. Together, the Bessel comparison and sector decomposition reveal a rich integrable structure linking discrete Painlevé dynamics, Toda deformations, and Hankel–partition representations.

We study the computational complexity of static output feedback (SOF) stabilization for continuous-time linear systems. For rational plant data, we prove that this problem is complete for the existential theory of the reals: it is equivalent, under polynomial-time transformations, to deciding whether a system of polynomial equations and inequalities with integer coefficients has a real solution. This result holds even for controllable and observable integer plants with two inputs. We characterize the effective gain dimension as the minimum number of linear combinations of gain entries that determine the characteristic polynomial for every gain. When this dimension is fixed, both feasibility testing and the construction of a rational stabilizing gain, whenever one exists, can be performed in polynomial time. SOF stabilization also remains strongly NP-hard for a family of minimal single-input integer plants. Every feasible plant in this family admits a stabilizing gain with entries in $\{-1,1\}$. For these gains, stability is preserved under simultaneous perturbations of all entries, provided that each perturbation has magnitude at most a uniform positive constant independent of the plant dimensions.

The integer Chebyshev constant of [0,1] has been bracketed by 0.4213 <= t_Z([0,1]) <= 0.422685 since the work of Pritsker (2005) and of Flammang (2014). We prove 0.4222286000 <= t_Z([0,1]) <= 0.4226846976, narrowing the interval from 1.39e-3 to 4.56e-4. Both bounds are established by explicit certificates. The upper bound is carried by an integer polynomial with 92 factors and explicit integer exponents; the lower bound by a discrete measure on 947 cells together with a library of 206 irreducible polynomials, through an inequality in which the terms paying for divisibility are made explicit. Two self-contained scripts, included as ancillary files, re-derive both bounds from the certificates alone.

Model quantization reduces the numerical precision of neural network weights and activations to lower storage and computational costs. Model inversion attacks recover or reconstruct sensitive training data or inference inputs from model outputs or intermediate features, so quantization may also alter their effectiveness. However, two questions remain unresolved: How does model quantization affect model inversion? How do data characteristics influence this relationship? To address the first, we bound quantization-induced changes in mutual information between inputs and a categorical variable defined by prediction probabilities, distinguishing informational effects from attack optimization obstacles. To address the second, we identify data-dependent changes in feature distributions and inversion outcomes, with pronounced quantization sensitivity differences at 4 bits. These insights guide a privacy-aware post-training quantization method that improves inversion resistance while recovering utility. It uses a Fisher-type task-sensitivity proxy for budget-aware bit allocation, calibrates activation ranges, and jointly optimizes weight and activation scales and weight-rounding decisions with task-recovery and geometry-retention objectives and scale and rounding regularization. Experiments cover multiple metrics, neural network architectures, and face, palmprint, and iris recognition tasks. On ResNet-50, Palm at 4 bits reduces RL-MIA's strict success from 54% to 26%, while accuracy decreases from 99.01% to 96.55% relative to FP32. Our method also supports output-level defenses: adding Stealthy Shield Defense (SSD, epsilon = 0.1) to Iris at 4.5 bits reduces BREP-MI's strict success from 63.33% to 37.33%, while accuracy decreases from 92.8% to 87.6% relative to quantization alone.