Peer Revenue Past citations are no guarantee of future returns

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

Mathematics

math Watch Mathematics (sign in to use)

Friday 25 September

Complex Variables

Neighborhoods of singular elliptic curves and the Riemann-Hilbert correspondence at infinity

In his thesis work, the first author studies neighborhoods of singular elliptic curves of type $I_0^*$ (Kodaira's classification) and provides the analytic classification. This is related via a double covering construction to the analytic invariants found by Touzet, Voronin and the second author for the analytic classification of neighborhoods of smooth elliptic curves. After recalling these constructions, we explain in this note how this construction is conjecturally related to the Riemann-Hilbert correspondence at infinity for Painlevé VI case when considering neighborhood of Okamoto divisor.
Read the full abstract

Combinatorics

An improved lower bound for the van der Waerden number $w(3,k)$

For an integer $k\ge 3$, let $w(3,k)$ be the least $n$ such that every red-blue coloring of $[n]$ contains either a nontrivial three-term arithmetic progression in blue or a nontrivial $k$-term arithmetic progression in red. A recent breakthrough of Green proved that $w(3,k)\ge k^{\Omega\left(\left(\frac{\log k}{\log\log k}\right)^{1/3}\right)}$ when $k$ is large, and Hunter later improved the bound to $w(3,k)\ge k^{\Omega\left(\frac{\log k}{\log\log k}\right)}$. On the other hand, Green remarked that it is reasonable to believe that $w(3,k)\le k^{O(\log k)}$. We prove that $w(3,k)\ge k^{\Omega(\log k)}$, which perhaps gives some evidence that $k^{\Theta(\log k)}$ is the correct order of magnitude.
Read the full abstract

Information Theory

Stability of the Courtade-Kumar inequality

We prove dimension-independent stability for the Courtade-Kumar inequality: a Boolean function $f:\{-1,1\}^n\to\{-1,1\}$ whose information is close to the dictator value is close in probability to a signed dictator. The correlation dependence is sharp in order near zero and, for increasing functions, also at the noiseless endpoint.
Read the full abstract

Combinatorics

The Wang Transform Inequality

We prove the Wang transform inequality in every order: if $n$ is a positive integer, $A$ is a nonnegative $n\times n$ matrix whose row and column sums equal one, and $J_n$ has every entry $1/n$, then \[ \operatorname{per}A\ge \operatorname{per}\!\left(\frac{nJ_n+A}{n+1}\right). \] Equality holds exactly when $A=J_n$. We also obtain an explicit positive quadratic gap for every $n\ge2$.
Read the full abstract

Analysis of PDEs

Singularity models for the Bernoulli free boundary problem from isoparametric hypersurfaces

We develop a general construction of homogeneous solutions to the Bernoulli free boundary problem, as well as general extremal domains on the sphere, from isoparametric foliations of the sphere. Our construction produces rich families of infinitely many new examples with sophisticated topologies connected to minimal surfaces of the sphere by smooth families of interpolating capillary surfaces, which include novel singularity models in low dimensions and recover most known homogeneous one-phase solutions. We also introduce a geometric representation for every such homogeneous map and establish a geometric rigidity theorem: for every prescribed isoparametric foliation, and in particular for cohomogeneity-one subgroups of $O(n)$, its radial geometry uniquely determines the corresponding homogeneous solution. Finally, we study the density of the constructed solutions and conjecture that the lowest density among non-flat cones in a given dimension $n \geq 5$ is attained by an $O(k) \times O(n-k)$-invariant cone.
Read the full abstract

Differential Geometry

On Simon's area-minimizing hypersurfaces with fractal singular sets

We verify that the stable minimal hypersurfaces with prescribed singular sets constructed by Leon Simon are area-minimizing. Thus, Simon's work settles the existence of area-minimizing hypersurfaces with fractal singular sets.

Number Theory

Galois groups of twisted reciprocal polynomials: a uniform asymptotic

We study the Galois group $G_f$ of a random polynomial $f$ in the family of polynomials of degree $2n$ satisfying the twisted reciprocal relation $f(x) = x^{2n}/b^n \cdot f(b/x)$. We use a Euclidean height adapted to this relation. Our main result is an asymptotic theorem of van der Waerden–Bhargava type: for fixed $b \neq 0$ and $n \geq 4$, the number of polynomials of height at most $H$ whose Galois group is not the full hyperoctahedral group $S_2 \wr S_n$ is an explicit constant times $H^n\log H$, with an error of order $H^n$. We determine the dependence of the leading constant on $b$; the leading-order group $G_1$ is of index $2$. This paper is a sequel to a recent paper by Anderson, Bertelli, and the author addressing reciprocal polynomials (i.e. the case $b = 1$).
Read the full abstract

Differential Geometry

Optimal regularity for the arrival time equation

For a convex mean curvature flow in $\mathbb{R}^{n+1}$, the corresponding arrival time function solves a degenerate elliptic equation that becomes singular at extinction. We prove that it is $C^{24,\alpha}$ for any $0<\alpha<1$ in the plane, with a logarithmic modulus for its twenty-fourth derivatives. We prove that this bound is sharp combining regularity obstruction in our companion paper. We obtain asymptotic expansions of the rescaled flow to any prescribed order, including derivative estimates for the remainder. Combined with the work of Sesum for $n\ge 2$, this also gives the sharp $C^{2,2/n}$ regularity for convex arrival time functions in higher dimensions.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Exact series formulas for the capacities of the amplitude damping channel

We derive explicit, absolutely convergent series formulas for the quantum, unassisted classical, and entanglement-assisted classical capacities of the qubit amplitude damping channel, eliminating residual optimizations and implicit roots. We also obtain analytical upper and lower bounds on two-way assisted quantum and private communication capacities by evaluating a balanced-squashing bound and optimizing the reverse coherent information. Our results characterize the optimal input populations, establish convergence and truncation properties, and provide analytical benchmarks for quantum and classical communication over dissipative channels.
Read the full abstract

Number Theory

Formal groups and $(\varphi,\Gamma)$-modules

Let $K/E$ be a finite unramified extension of $p$-adic local fields, and let $H$ be a one-dimensional formal $\mathcal{O}_E$-module of finite height over $\mathcal{O}_K$. We introduce the exponential period map of $H$ and use it to construct a complete regular local ring $R_{H,K}$ with imperfect residue field, an endomorphism $\varphi_E$, and a commuting action of $\Gamma=\mathrm{Gal}(K(H[p^\infty](\overline{K}))/K)$. We prove an equivalence of categories between finitely generated $\mathcal{O}_E$-modules with a continuous $\mathrm{Gal}_K$-action and étale $(\varphi_E,\Gamma)$-modules over $R_{H,K}$. This recovers the classical cyclotomic and Lubin-Tate equivalences in the corresponding cases. In general, $R_{H,K}$ can have Krull dimension greater than one, and $\varphi_E$ need not lift the $q_E$-power Frobenius modulo $\pi_E$. The proof uses $F$-dynamical systems over $\mathcal{O}_E$, which combine contraction modulo $\pi_E$ with Frobenius on the residue field. For every flat $F$-dynamical system, we establish an equivalence of categories between étale $\varphi$-modules and continuous representations of the absolute Galois group of the residue field on finitely generated $\mathcal{O}_E$-modules.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Statistical attribute alignment for black-box generative AI via output post-processing

Generative AI systems are increasingly used, but aligning their outputs with user requirements poses a continuing challenge. Here, we aim to ensure that the distribution of an attribute of an AI-generated output aligns with a user-specified target. This is motivated by examples such as fairness, where we want to ensure that a protected attribute (e.g., gender, race, or age categories) follows a desired distribution, and synthetic data generation, where we want the generated data to be representative of a target distribution. We study the practically important black-box access setting, where a user can repeatedly query a generative AI model. The goal is to return $m\ge 1$ outputs whose joint attribute distribution is as close as possible to this target. For both exact and approximate alignment, we develop algorithms that minimize the expected number of queries to the generator, and we further demonstrate their optimality as the number of requested outputs $m \rightarrow \infty$. Experiments on text-to-image generation and geocoded persona generation tasks show that our post-processing algorithms improve statistical attribute alignment, complementing prompting-based interventions.
Read the full abstract

All authors Kevin Jiang, Morgane Austern, Edgar Dobriban, Jason M. Klusowski

Algebraic Geometry

Fourier duality on compactified Prym fibrations

We study Fourier-Mukai duality for a class of compactified Prym fibrations including moduli spaces of $\mathrm{SL}$ Higgs bundles over the elliptic locus. This leads to a shadow of the Hausel-Thaddeus conjecture, proof of the Corti-Hanamura motivic decomposition conjecture for these fibrations, and multiplicativity of the perverse filtration. Our approach can be described as a generalization of the Maulik-Shen-Yin package for compactified Jacobian fibrations to the case when the dual abelian fibration is a stack. This forces us to move beyond the case of full supports. Technical tools include a new pullback identity for the stacky Grothendieck-Riemann-Roch tau functor introduced by Toën, results on descent of (Arinkin-)Poincaré sheaves, and a comparison of Poincaré sheaves of the Prym varieties of families of smooth and nodal curves along the lines of Franco-Hanson-Horn-Oliveira.
Read the full abstract

Classical Analysis and ODEs

Prescribed projections for a general class of maps and efficient covering by variable plane curves

We prove a prescribed projection theorem for any class of non-linear projections defined on open subsets of the plane which satisfies some mild geometric conditions. This generalizes Davies's classic result on prescribed projections for orthogonal projections, as well as a recent result of authors, Chang, McDonald, and Taylor, on a specific class of non-linear projection maps. We also give several geometric applications, including a proof that certain classes of plane curves can be used to cover arbitrary measurable sets with measure zero error.
Read the full abstract

All authors Alan Chang, Robert Fraser, Alex McDonald, Mark Meyer, Krystal Taylor

Mathematical Physics · Cross-listed from quant-ph

Exact Characterization of the Holevo Bound by a Quantum Fisher Information Family

The quantum Cramér-Rao bound constrains the precision of parameter estimation through the symmetric logarithmic derivative quantum Fisher information (SLD QFI). It is asymptotically achievable for regular single-parameter estimation models, but generally not in the multiparameter setting, where optimal measurements for different parameters may be incompatible. For multiparameter estimation, allowing collective measurements, the corresponding asymptotically achievable precision limit is the Holevo bound, whose standard formulation is an optimization over auxiliary Hermitian operators. We bridge this apparent difference in formulation by giving an exact characterization of the Holevo bound in terms of a family of QFIs interpolating between the SLD and right logarithmic derivative (RLD) QFIs. Specifically, for any locally identifiable finite-dimensional estimation problem, we prove that the operator-feasible region in the standard variational definition of the Holevo bound coincides with the intersection of the regions defined by the corresponding Cramér-Rao-type matrix constraints for the entire QFI family. This characterization also applies to rank-deficient states and does not require any prior choice of weight matrix. Consequently, the conventional weight-dependent Holevo bound is recovered by minimizing the corresponding weighted cost over the resulting common feasible region.
Read the full abstract

Differential Geometry

General regularity obstructions for the arrival time equation

We study the regularity of the arrival time function associated with mean curvature flow, formulated as a degenerate elliptic equation encoding the singular structure of the flow. We identify a systematic mechanism obstructing higher regularity, arising from higher-order asymptotic expansions near spherical singularities. We construct uncountably many low-regularity arrival time functions in all dimensions. In particular, we settle the question of smoothness in the planar case by showing that even for convex curve shortening flow the arrival time need not be $C^{25}$. Our companion paper proves that every such arrival time is $C^{24,\alpha}$ for any $0<\alpha<1$. Hence the obstruction at order $25$ gives the optimal regularity threshold. Our approach introduces new analytic ingredients, including a precise correspondence between elliptic asymptotic expansions and parabolic long-time asymptotics of the associated rescaled mean curvature flow, a complexification of the arrival time equation, and a method for prescribing higher-order asymptotic expansions.
Read the full abstract

Number Theory

Galois groups of integer polynomials with prescribed coefficients

Fix a degree $n$, a nonzero integer constant term, and some further coefficients of a monic integer polynomial, leaving $s$ coefficients to vary in $[-H,H]$. We first prove that, when only the leading and constant coefficients are fixed, the number of polynomials whose Galois group is not $S_n$ is of order $H^{n-2}$ for every $n\ge4$. We then prove a half-dimensional extension: for $n\ge6$ the corresponding exceptional count is of order $H^{s-1}$ whenever $s>n/2+1$, provided the coefficient slice meets the higher-multiplicity loci with a specified dimension bound. This geometric condition holds for every prescribed value if the free coefficients form an initial or final block, and for a nonempty Zariski-open set of prescribed values for arbitrary coefficient positions. It also holds for every value of one additional prescribed interior coefficient. Thus, in degrees seven and eight, any one interior coefficient can be fixed in addition to the leading and constant coefficients. The proof combines a fixed-norm version of Bhargava's primitive-group sieve with sparse Hermite interpolation. A separate imprimitive estimate, using a minimal intermediate field, gives $O(H^{\beta(n)})$ outside rational partial-product hypersurfaces, where $\beta(n)=\ell+n/\ell-2\le n/2$ for composite $n$ with smallest prime divisor $\ell$, and has no logarithmic loss. The fixed-constant quartic and quintic endpoints require separate local arguments: exceptional Fourier directions for $A_4$ quartics and a quadratic Gauss sum for quintics. We isolate further even-degree endpoint results, explain the distinct cubic obstruction, and conclude with conditional improvements under the upper-bound form of Malle's conjecture.
Read the full abstract

Combinatorics

Riesz kernels of hyperbolic polynomials: positivity, admissible exponents and Jordan rigidity

Scott and Sokal asked whether every homogeneous polynomial with the half-plane property has a completely monotone negative power. We answer this question affirmatively and prove the Riesz-positivity conjecture of Michałek, Sturmfels, Uhler and Zwiernik, restated by Kozhasov, Michałek and Sturmfels: in $n$ variables, every exponent $\alpha\ge4096n^2$ is admissible, independently of the degree and coefficients. For complete hyperbolic polynomials the Riesz density is strictly log-concave, with relative Gaussian error at most $512n^2/\alpha$ and explicit curvature bounds. We characterize admissible exponents by a common spectral Dirichlet law, prove $n\le m+\alpha m(m-1)$ with its equality case, and obtain the sharp degree-dependent gap $0<\alpha<1/(2(m-1))$ whenever the degree-$m$ polynomial has a nonlinear irreducible factor. A nonnegative fourth-order defect of $-\log p$ vanishes at one point precisely for products of positive integer powers of Euclidean Jordan determinants. We classify the corresponding logarithmic Monge-Ampère equation and answer the question of Etingof, Kazhdan and Polishchuk about polynomial multiplicative Legendre transforms within irreducible complete hyperbolic polynomials; the general question has counterexamples, the Clifford quartics of Kogiso and Sato. The classification extends to reducible polynomials under a boundary-visibility hypothesis, and asymptotic common-power formulas for the Riesz densities force exact Jordan formulas.
Read the full abstract

Numerical Analysis · Cross-listed from physics.med-ph

Numerical Simulation of Electrical Properties in Cortical and Trabecular Bone: A Simplified Model

The electrical properties of biological tissues depend on their composition and microstructure and determine their response to applied electric fields. In bone tissue, these properties are closely related to its composition, porosity, and microstructural organization. However, simplified models that link bone microstructure (trabecular and cortical) to its effective electrical properties while accounting for the electrical anisotropy of cortical bone remain scarce. In this work, a multiscale approach was developed, combining finite element simulations with Bruggeman-based homogenization models. Trabecular bone was modeled using microCT derived geometries, and its effective conductivity was analyzed as a function of BV/TV and free water content. Cortical bone was represented by a simplified three-dimensional network of Haversian canals (axial = z) and Volkmann canals (transverse), incorporating their directional organization through an anisotropic Bruggeman formulation. The models captured the conductivity range reported experimentally for trabecular bone (approximately 25-200 mS/m) and reproduced the anisotropic behavior observed in the cortical FEM simulations, with higher conductivity in the axial direction. In the generated cortical geometries, 65.5% of the total porosity was associated with axial Haversian canals. At the macroscale, the tibia model with lower trabecular and cortical BV/TV and reduced cortical thickness showed an approximately 38-39% reduction in impedance relative to the reference model. These results indicate that microstructural variations in bone tissue are reflected in its effective electrical properties and in the macroscopic impedance of the model, providing a physical and computational basis for future investigations into the sensitivity of electrical measurements to changes in bone microstructure.
Read the full abstract

All authors María José Cervantes, Catalina A. Cely-Ortíz, C. Manuel Carlevaro, Ramiro M. Irastorza

Number Theory

Free semigroups of power series

Given power series $f_1,\dots,f_r\in z^2K[[z]]$ over a field $K$, we show that the semigroup $\langle f_1,\dots,f_r\rangle$ generated by the $f$'s under composition is free of rank $r$ whenever the multiplicative semigroup $\langle\mathrm{lc}(f_1),\dots,\mathrm{lc}(f_r)\rangle$ in $K^\times$ is free commutative of rank $r$; here $\mathrm{lc}(f)$ denotes the first nonzero coefficient of $f$. To do this, we associate an affine linear transformation to every $F\in\langle f_1,\dots,f_r\rangle$ and then apply a ping-pong lemma. In particular, combining this with work of Pappalardi, Sha, Shparlinski, and Stewart, it follows that most semigroups of polynomials over a number field $K$ are free, and we make this statement precise through a counting argument.
Read the full abstract

Analysis of PDEs

Optimal stability hierarchies of the Heisenberg Uncertainty Principle for solenoidal fields and of the second order Caffarelli–Kohn–Nirenberg inequalities

In 2018, V. Maz'ya proposed 75 open problems in analysis and PDEs. One of them is about the best constant for the Heisenberg Uncertainty Principle for solenoidal vector fields motivated by questions in hydrodynamics. This was answered by Cazacu, Flynn and Lam in dimension two and subsequently by Hamamoto in all dimensions $N\ge3$ by establishing sharp inequalities with explicit constants. Nevertheless, the much harder stability problem remains open in all dimensions. The first main result in this paper is to establish a sharp stability hierarchy by proving that its deficit controls the distance to the set of extremals, with the sharp stability constant $\frac12(N-\sqrt{N^2-4N+12})$ for $N\ge4$ and $1$ for $N=3$, together with chains of remainder terms measuring the distance to explicit larger families of poloidal and toroidal fields. The second main result is the second order $L^2$-Caffarelli–Kohn–Nirenberg inequality with the weights $|x|^{-2a}$ and $|x|^{-2b}$ on the line $1+a+b=0$, for which we obtain the stability constant $\frac12\min\{4(1+a),\sqrt{(N+2a)^2+4N-4}-(N+2a)\}$. This CKN inequality is sharp whenever the second number is the smaller one. We develop a novel method: the fourth order one-dimensional problems attached to the spherical modes are transformed, by a Fourier–Hankel transform of real order, into first order inequalities whose sharp stability is that of weighted Gaussian Poincaré inequalities. The inverse transform produces the extremals in terms of Kummer's function. As a byproduct of our new approach, we also obtain substantially simpler proofs, with sharp remainder terms and equality cases, of Hamamoto's one-dimensional inequality and of his sharp uncertainty principle for solenoidal fields.
Read the full abstract

All authors Anh Do, Tuan Duong, Nguyen Lam, Guozhen Lu, Van Hoang Nguyen

Probability

Algorithmic trading and stochastic integration

We study simple predictable processes whose coefficients are represented by neural networks. On finite measure spaces, we establish density results for neural networks in Orlicz spaces. For filtrations generated by a stochastic process, measurable random variables, including at stopping times, can be approximated by neural networks depending on finitely many observations. Every stochastic integral with respect to a semimartingale can then be approximated, in the semimartingale topology, by integrals of such simple predictable processes. We show that restricting trading strategies to this class leaves the minimal mean-variance hedging error under partial information unchanged and obtain a no-free-lunch characterization in terms of equivalent martingale measures. Finally, the Bichteler-Dellacherie characterization of semimartingales remains valid even upon restricting the predictable integrands to those whose coefficients are represented by neural networks.
Read the full abstract

Geometric Topology

On Line-Hyperplane Structures for Hitchin Representations

Let $n \geq 4$ and $\rho: \pi_1S \rightarrow PSL(n,\mathbb{R})$ be a Hitchin representation. We study the topology of a cocompact domain of discontinuity $\Omega_{\rho}$ in the flag manifold $\mathcal{F}_{1,n-1}$ of line-hyperplane pairs in $\mathbb{R}^n$ defined by Guichard-Wienhard. In particular, we lift $\Omega$ to its $(\mathbb{Z}_2\times \mathbb{Z}_2)$-cover $\hat{\Omega}$ in the Stiefel manifold $V_2(\mathbb{R}^n)$. The domain $\hat{\Omega}$ is highly connected and smoothly fibers over hyperbolic space $\mathbb{H}^2$ with unknown fiber $\hat{\mathfrak{F}}$, a closed $(2n-5)$-manifold. We determine the homeomorphism type of $\hat{\mathfrak{F}}$ as well as its diffeomorphism type up to connected sum with a homotopy sphere. The classification of $\hat{\mathfrak{F}}$ involves computing both its homology and a certain differential topology invariant needed to invoke Wall's classification of highly connected odd-dimensional manifolds.
Read the full abstract

Optimization and Control

No Universal Remainder Rate for Chambolle-Dossal Acceleration

Chambolle-Dossal acceleration guarantees $F(x_n)-F^*=o(n^{-2})$ for every fixed smooth convex loss with a minimizer. We show that this qualitative improvement admits no universal quantitative rate. For every damping parameter $\alpha>3$ and positive nondecreasing gain $G(n)\to\infty$, we construct a fixed one-dimensional smooth convex loss whose exact CD orbit satisfies $\sup_{n\ge1} n^2G(n)\bigl(F(x_n)-F^*\bigr)=\infty$. Thus no divergent gain improves the $n^{-2}$ scale for all fixed losses, even with instance-dependent constants. The construction prescribes queried gradients and realizes infinitely many slow blocks within one smooth convex objective. Under local $p$-power growth with $p>2$ and sufficiently strong damping, we also construct a fixed loss whose exact CD orbit satisfies $F(x_n)-F^*\sim Dn^{-2p/(p-2)}$, $D>0$, establishing the sharpness of the known convergence rate. Both main results are formally verified in Lean 4.
Read the full abstract

All authors Yuchen Yang, Xinan Dai, Wenhao Deng, Yingdong Shi, Feng Xu, Tailin Wu

Numerical Analysis

Boundary Value Correction for the Boundary Element Method

We develop a boundary element method for the Laplace equation with Dirichlet boundary conditions in a bounded three-dimensional domain. The method uses flat panels of maximum diameter \(h\) on an interior surrogate boundary and corrects the imposed boundary values by a first-order Taylor expansion along the panel normals. The correction uses the normal flux already present in the Calderón formulation and introduces no additional unknown field. Under uniform assumptions on the surrogate geometry and boundary operators, the penalised form is coercive when \(\gamma\delta_h\le c_0<4\), where \(\gamma\) is the penalty parameter and \(\delta_h\) is the maximum normal offset. The error estimate separates trace approximation from a geometry term of size \(\gamma^{1/2}\delta_h^2\|u\|_{H^3(\Omega)}\). With \(\gamma\simeq h^{-1}\), the sufficient condition \(\delta_h\lesssim h^{(k+1)/2}\) yields an error of order \(h^{k+1/2}\) for \(P_k/P_{k-1}\) Dirichlet/flux spaces under the stated regularity and uniform trace bounds. Thus an offset of order \(h^2\) supports the estimate through cubic Dirichlet approximation. We analyse two penalty variants and present numerical experiments on a sphere and an ellipsoid to examine convergence and sensitivity to geometry, penalty scaling and quadrature.
Read the full abstract

Combinatorics

2-colouring shift-chains

A shift-chain is an $ r $-uniform hypergraph $ \mathcal{H} $ on vertex set $ [n] $ with the property that, for any two edges $ \{ e_1, \ldots, e_r \} $ and $ \{ f_1, \ldots, f_r \} $ with $ e_1 < \cdots < e_r $ and $ f_1 < \cdots < f_r $, either $ e_i \le f_i $ for all $ i \in [r] $ or $ f_i \le e_i $ for all $ i \in [r] $. It is known that all shift-chains are properly vertex-colourable with three colours (that is, such that no edge is monochromatic), which is optimal for $ r \in \{ 2, 3 \} $. It was asked by Pálvölgyi in 2010 whether all shift-chains of sufficiently large uniformity are properly $ 2 $-colourable. We answer this question in a strong form, proving that in fact all shift-chains of uniformity at least $ 4 $ are properly $ 2 $-colourable. The colouring is obtained via a natural algorithm with linear running time.
Read the full abstract

Number Theory

On the infinite sum of reciprocals of the fourth powers of balancing numbers

In this note, we study the infinite reciprocal sum $\sum_{k=n}^{\infty}1/B_k^4$ involving the fourth powers of balancing numbers $B_n$. We show that, for every $n\geq2$, \begin{equation*} \left\lfloor \left( \sum_{k=n}^{\infty}\frac{1}{B_k^4} \right)^{-1} \right\rfloor = B_n^4-B_{n-1}^4 -\left\lceil\frac{B_{2n-1}}{280}\right\rceil +\varepsilon_n, \end{equation*} where $\varepsilon_n=1$ if $n\equiv1\pmod{12}$ and $\varepsilon_n=0$ otherwise. This result extends the corresponding reciprocal-sum result for Fibonacci numbers due to Hwang, Park and Song to balancing numbers.
Read the full abstract

Information Theory · Cross-listed from cs.AI

A Flow Matching Framework for Neural Representational Dissimilarity

Neural representational dissimilarity quantifies differences between neural response distributions, and is essential for comparing neural codes across stimuli, brain areas, tasks, and models. Commonly used distance metrics involve different assumptions and are estimated with separate methods. Here, we show that a variety of distance metrics can be unified under a flow matching framework developed in deep generative models. That is, these distances arise as Jeffreys divergences under different velocity constraints. We find that flow matching has advantages for estimating distances involving complicated distributions and continuous variables. Furthermore, this framework enables the design of new distance metrics in a principled way. Together, flow matching provides a unified approach for understanding, estimating, and designing neural representational dissimilarity metrics.
Read the full abstract

Functional Analysis

Quotients of $L_1$ by subsequences of the Haar system have cotype 2

Let $Y$ be the closed linear span of a subsequence of the Haar system in $L_1$. We prove that the quotient space $L_1/Y$ has cotype~$2$. This result implies that transportation cost spaces on diamond graphs have cotype $2$.
Read the full abstract

All authors Stephen Dilworth, Denka Kutzarova, Mikhail Ostrovskii, Thomas Speckhofer

Information Theory · Cross-listed from quant-ph

Sipser-Spielman meets Dijkgraaf-Witten: non-Abelian qLDPC codes via twisted sheaf gauge theory and almost-constant-overhead magic state fountain

Sipser-Spielman codes and Dijkgraaf-Witten twisted gauge theories are among the most profound ideas in the last few decades in the areas of computer science and mathematical physics respectively. This work unifies them in the same framework using the language of sheaf cohomology, and produces a new framework of twisted sheaf gauge theories describing a class of quantum low-density parity-check (qLDPC) codes with non-Abelian $D_4$ topological order. The corresponding twisted Clifford-stabilizer qLDPC code can be obtained from gauging a new type of 0-form sub-complex symmetry from a qLDPC code defined on a general sheaf complex, and can be interpreted as a topological defect network of non-Abelian $D_4$ patches glued together with proper gapped interfaces. As an application, one can use this to realize a magic state fountain via the gauging measurement of the addressable logical CZ gates as 0-form subcomplex symmetries in a 2D hypergraph-product (HGP) sheaf code. This includes a scheme of subdividing an arbitrary constant-rate 2D HGP code with parameters $[[n,\Theta(n), \Omega(n^{1/2})]]$ into a quantum sheaf code which allows preparation of $\Theta(n^{1/2})$ logical CZ magic states in parallel, equivalent to the recent geometric construction using the code-to-manifold mapping in (arXiv:2601.06736). Moreover, using the recent sheaf complex and algebraic code constructions by Golowich-Tamo-Zhu (arXiv:2609.27801) with parameters $[[n,\Theta(n^{1-\epsilon}), \Omega(n^{(1-\epsilon)/2})]]$ for arbitrary small $\epsilon$, one can prepare $\Theta(n^{1-\epsilon})$ CZ magic states in parallel and hence achieve an almost-constant magic rate.
Read the full abstract

All authors Guanyu Zhu, Shi Jie Samuel Tan, Ryohei Kobayashi, Po-Shen Hsin