Peer Revenue Play credits. Real papers.

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Saturday 25 April

Combinatorics · Cross-listed from cs.DS

A Linear-Time Algorithm for Finding an Odd/Even Cycle Through Two Specified Vertices

We present a deterministic linear-time algorithm for finding an odd/even cycle through two specified vertices in an undirected graph. This is shown in a generalized form as follows: Let $\Gamma$ be any group in which every element is of order at most $2$. For a given $\Gamma$-labeled graph with two specified vertices (or edges), we can determine in linear time whether there exist two cycles with distinct labels that are through both of the two specified vertices (or edges), and find such cycles if yes.
Read the full abstract

Analysis of PDEs · Cross-listed from cs.CV

A Topology fixated Shape Gradient Framework for Non Simple Boundary Extraction for CIE Lab color images with Repulsive Energy

A levelset free but a hybrid image segmentation approach based on a modified version of the piece wise constant shape gradient of an Mumford Shah shape functional and a repulsive function is considered. The segmentation is performed a non-local shape based through an evolution of discrete curves driven by a non local shape based energy to segment images containing disjoint regions and multiple boundaries. This formulation has a novel additional component as a multivariable function dependent on a few sampled points of the curves that handles the occurrence of self intersection during boundary curves evolution. The method is applied to a few gray scale and color images, including images with nested structures and astronomical objects. The results indicate effective segmentation in complex scenarios with absolute control on the topology of the segments and self-intersections of the boundaries
Read the full abstract

Functional Analysis

Nonexistence of Henkin type projections via a Wiener theorem for multipliers

Let $d\geq 2$, $l\geq 0$ and suppose $X$ is one of the function spaces $W^{l,1}(\mathbb{T}^{d})$, $W^{l,\infty }(\mathbb{T}^{d})$ or $C^{l}(\mathbb{T}^{d})$. We extend a result of Henkin (1967), showing that, for appropriate $N\times N$ matrix operators $A(D)$, the subspace of $X^{N}$ consisting of $A(D)-$free elements is noncomplemented. In order to prove this we establish a new property of the Fourier multipliers that are bounded on $X$: the kernel $k$ of any such multiplier obeys a weaker version of Wiener's theorem for the singularities of measures.
Read the full abstract

Numerical Analysis

The Energy Based Near Singularity for Fourier Spectral 3D Navier-Stokes Equations

We investigate the three-dimensional incompressible Navier-Stokes equations. The equations are discretized with Fourier spectral method and a fourth-order Runge-Kutta scheme in time. The spectral accuracy, resolution conditions, and an energy based conditional regularity framework are established analytically. Then we prove exponential convergence, algebraic convergence, and an a posteriori criterion that links numerical blowup to loss of regularity. This work develops a suite of diagnostics for detecting potential finite time singular behavior.
Read the full abstract

Functional Analysis

Bourgain-Brezis spaces obtained by real interpolation

In 2002, Bourgain and Brezis proved that for the space $X=W^{1,d}$ (on $\mathbb{T}^{d}$, with $d\geq2$) we have the equality of images \begin{equation} \operatorname{div} (L^{\infty}\cap X)=\operatorname{div} X, \tag{$\ast$} \end{equation} i.e., given a vector field $v\in X$ there exists a vector field $u\in L^{\infty }\cap X$ such that $\operatorname{div} u=\operatorname{div] v $. In this paper we show that if $X$ is a function space satisfying ($\ast$) then, any real interpolation space $X_{\theta,q}=(L^{\infty},X)_{\theta,q}$ (where $\theta\in (0,1)$ and $q\in [1,\infty)$) also satisfies ($\ast$). The proof is based on a general method that allows us to interpolate solutions of linear equations.
Read the full abstract

Numerical Analysis

Mesh-Intrinsic GFEM: Asymptotic Smoothness on C^0 Unstructured Meshes

MiGFEM constructs enriched local approximations from the original nodal degrees of freedom of a finite element mesh, without extra enrichment unknowns, thereby avoiding the linear dependence, ill-conditioning, energy inconsistency, and mass-lumping difficulties of conventional enriched formulations. This paper establishes asymptotic smoothness of MiGFEM on standard C0 unstructured meshes. Although the global approximation uses C0 partition-of-unity functions, its inter-element derivative jumps of order up to p decay as O(h^{p+1-|alpha|}) for solutions in C^{p+1}, and vanish identically when the exact solution lies in the local reconstruction space on every patch. The mechanism relies on interface coherence of patchwise local approximations and a derivative-space partition-of-unity identity (Partition of Zero) that cancels coherent interfacial traces. Asymptotic smoothness motivates the leading Leibniz derivative, which retains only the principal term of the full Leibniz expansion. This operator is globally continuous by construction; the neglected remainder shares the same asymptotic order as the inter-element jumps. Consequently, the same C0 MiGFEM trial space supports both weak Galerkin discretization via the full Leibniz derivative and strong-form collocation via the leading Leibniz derivative, on identical nodal unknowns. Numerical experiments verify the predicted jump decay and confirm exact cancellation under patchwise reproduction. The unified weak-strong framework is demonstrated on elasticity and biharmonic problems using unstructured meshes. A singular-enrichment test further shows that strong-form collocation reproduces enriched basis functions exactly without quadrature constraints.
Read the full abstract

Optimization and Control

Green Manufacturing Capacity Planning by Integrating Distributionally Robust Optimization and Generative AI

Green manufacturing has become a strategic priority for many firms seeking to address sustainability and social responsibility, while improving production efficiency and profitability. However, integrating green technologies and renewable energy unavoidably introduces climate-related randomness that affects both product demand and renewable energy generation, underscoring the need for coordinated planning of production capacity and renewable energy development. To address this challenge, we develop a comprehensive two-stage distributionally robust optimization (DRO) model for green manufacturing capacity planning in a multi-factory, multi-capacity, and multi-product setting, based on an ambiguity set constructed by a data-driven clustering technique that leverages historical data of different availabilities and qualities. To handle the computational challenges of practical instances, an effective generative AI network is integrated into an exact decomposition algorithm, through a novel encoding/decoding scheme designed to provide the AI model with structurally informative training data and to convert AI-generated outputs into algorithm-accessible formats. Experimental results on real-world instances demonstrate that the proposed DRO approach achieves strong economic performance and robust feasibility under demand and renewable generation uncertainty, while also significantly improving computational efficiency and solution consistency relative to the standard approaches. Furthermore, our results highlight the managerial value of integrating green technology adoption with coordinated capacity planning to better utilize renewable energy and align production efficiency with sustainability and corporate social responsibility objectives.
Read the full abstract

All authors Xin Zhou, Zhengsong Lu, Bo Zeng, Na Geng

Probability

High-Precision Framework for Expected Hitting Times Analysis in the Dice-Sum Process

We study the expected number of rolls required for the cumulative sum of a fair six-sided die to first enter a prescribed target set $H\subset\mathbb{Z}_{\ge0}$. A one-variable dynamic-programming formulation is introduced that removes dependence on the roll count. Within this framework, the infinite process is truncated at a large cutoff $N$ and corrected by an analytically derived overshoot term that accounts for the rare event of exceeding $N$ before entering $H$. Explicit bounds on this residual yield a strict two-sided estimate of the truncation error. The method is numerically efficient, requiring constant memory and linear time in the cutoff. For the perfect-square target set $H=\{n^2:n\in\mathbb{N}\}$, all quantities are evaluated explicitly, yielding \[ \mathbb{E}[T]=7.07976423755110510389555305690818489468\ldots, \] provably correct to 1,017 decimal places. This constitutes the most precise result known to date and establishes a general framework for high-accuracy computation of discrete hitting times.
Read the full abstract

Combinatorics

Towards a conjecture on degree conditions for Ramsey goodness of paths

Recently, Aragão, Marciano, and Mendonça [European J. Combin., 2025] conjectured that for any graph $G$ on $n$ vertices satisfying $(r-1)(t-1)k < n \le (r-1)(t-1)(k+1)$, the minimum degree condition $\delta(G) \ge n - \left\lceil \frac{k}{k+1} \left\lceil \frac{n}{r-1} \right\rceil \right\rceil$ guarantees that $G \rightarrow (K_r, P_t)$. In this paper, we prove their conjecture for the regime $k \ge t-3$. Because the parameter $k$ scales linearly with the host graph order $n$, our result establishes the asymptotic truth of the conjecture.
Read the full abstract

Information Theory

Analysis of Efficient Scheduling in Layered Decoding of GLDPC Codes

In this study, we investigate the characteristics of scheduling sequences that enable efficient decoding of generalized low-density parity-check (GLDPC) codes under the layered message-passing algorithm. In particular, we show that scheduling sequences leading to higher decoding efficiency should prioritize the update of constraint nodes corresponding to subcodes with larger minimum distance, fewer minimum-weight codewords, and shorter code length. Based on these characteristics, we design a scheduling algorithm, which further demonstrates the effectiveness of these characteristics through simulation experiments.
Read the full abstract

All authors Qingqing Peng, Dongxu Chang, Guiying Yan, Guanghui Wang

Numerical Analysis

Rank One Completion for Higher Order Tensors

We study the rank one completion problem for tensors of arbitrary orders. The notion of rank one determinable tensors is introduced. We explore its properties and propose a recursive algorithm for computing rank one tensor completion. This algorithm only requires solving linear systems and computing singular vectors. In the absence of noise, it produces a unique rank one completion under some assumptions. In the presence of noise, we show that the computed rank one tensor completion is close to the exact one when the noise is sufficiently small. Numerical experiments demonstrate the efficiency and accuracy of the proposed method.
Read the full abstract

Optimization and Control

Compressed Traffic Assignment with the Augmented Lagrangian Method

We consider large-scale traffic assignment problems and develop a path-based compression framework. In particular, we partition paths into major and minor paths according to nominal path flows and a prescribed threshold, and retain the major paths explicitly. For the minor paths, we use reference flows derived from nominal-flow information and represent deviations using a truncated singular value decomposition of the minor path-link incidence matrix. The resulting compressed formulation preserves convexity, and a simple scaling of the nominal minor flows ensures feasibility under changes in demand. To solve the resulting formulation, we use an augmented Lagrangian method with separate penalty parameters for the different constraints and adaptive penalty parameter updates. We conduct computational studies on the Chicago Sketch, Chicago Regional, and Philadelphia networks in two stages. Using nominal demand data, we first study the selection of the compression threshold and rank and the effect of path-pool expansion. The results show substantial dimensionality reduction while maintaining high solution accuracy. We then reuse the nominal representation for perturbed-demand problems. The compressed formulation remains highly accurate and reduces computational time by approximately 58%-77% on the original path pools and 51%-76% on expanded path pools. We also compare it with simpler reduced formulations that either discard the minor paths or fix their flows at the reference values. The results show that fixing the minor-path flows at their reference values already provides high accuracy, while the low-dimensional adjustments can further improve link travel-time accuracy in some cases.
Read the full abstract

All authors Xuesong Zhou, Peiheng Li, Yajun Liu, Yuchao Li, Dimitri Bertsekas

Information Theory

On the hull of linearized polynomial codes

Motivated by entanglement-assisted quantum error-correcting codes, where the hull dimension determines the number of required pre-shared entangled pairs, we study hulls of two families of $\mathbb{F}_q$-linear codes defined by $q$-polynomial operators over $\mathbb{F}_{q^m}$. Our main tool is a unified Gram-matrix method. For image codes $\mathcal{C}(\boldsymbol{\alpha})=\operatorname{im}\Phi_{\boldsymbol{\alpha}}$, with $\Phi_{\boldsymbol{\alpha}}=\sum_i\alpha_iF_i$, we prove the master hull–rank formula $\dim\operatorname{Hull}(\mathcal{C}(\boldsymbol{\alpha}))=\operatorname{rank}(\Phi_{\boldsymbol{\alpha}})-\operatorname{rank}(G(\boldsymbol{\alpha}))$, where $G(\boldsymbol{\alpha})$ is the associated Gram matrix over $\mathbb{F}_q$. Specializing to $C_{\lambda,\mu}=\operatorname{im}(\lambda x+\mu L(x))$, we obtain a quadratic Gram pencil $\lambda^2G_0+\lambda\mu G_1+\mu^2G_2$ whose determinant describes the LCD locus in $\mathbb{P}^1(\mathbb{F}_q)$. We also treat $\mathbb{F}_{q^m}$-linear rank-distance codes $\mathcal{C}=\langle X,F_1,\ldots,F_k\rangle_{\mathbb{F}_{q^m}}$ with the Delsarte inner product, where a $k\times k$ Gram matrix over $\mathbb{F}_{q^m}$ determines the hull dimension. For $L(X)=X^{q^k}$, with $d=\gcd(k,m)$, the resulting circulant Gram matrices yield a closed-form discriminant and a complete classification in three of the four bijectivity configurations over $\mathbb{P}^1(\mathbb{F}_{q^m})$. In the remaining case, the hull dimension equals $\delta=\dim_{\mathbb{F}_q}(\operatorname{im}\phi_{\lambda,\mu}\cap\ker\phi_{\lambda,\mu}^{\dagger})$, and the extremal condition $\delta=d$ is characterized by an explicit trace-isotropy criterion. We conclude with an exact count of LCD and non-LCD points, showing that the LCD density tends to $1$ as $q\to\infty$, together with a worked example over $\mathbb{F}_{64}$ and a SageMath verification.
Read the full abstract

Number Theory

On the integrality of modular functions over $\mathbb{Z}[j]$ and Kronecker-type congruences

Let $N$ be a positive integer and let $f$ be a meromorphic modular function of level $N$ with rational Fourier coefficients. For a prime $p$, define a function $f_p$ on the complex upper half-plane $\mathbb{H}$ by \begin{equation*} f_p(\tau)=f\left(\frac{\tau}{p}\right)\quad(\tau\in\mathbb{H}). \end{equation*} Let $j$ be the elliptic modular function. We show that if $p\equiv 1$ or $-1\Mod{N}$ and $f$ is integral over $\mathbb{Z}[j]$, then \begin{equation*} \frac{1}{p}(f_p^p-f)(f_p-f^p) \end{equation*} is also integral over $\mathbb{Z}[j]$. This result generalizes the classical Kronecker congruence relation for $j$.
Read the full abstract

Operator Algebras

An algebraic characterization of non-singular matrix semicircles

Let $A_1, \ldots, A_r$ be Hermitian $n \times n$ matrices and $S = \sum A_i \otimes s_i$ the associated matrix semicircle, where $s_1, \ldots, s_r$ are free semicircular variables. We prove that the following are equivalent: (i) the matrix pencil $A = \sum A_i x_i$ is LR-semisimple (decomposes, up to left–right equivalence, as a direct sum of unsplittable pencils); (ii) $S$ is non-singular at $t = 0$ (the matrix-valued Cauchy transform has a continuous boundary limit near the origin); (iii) the covariance map $\eta\colon X \mapsto \sum A_i X A_i$ is symmetrically DS-scalable (there exists $C \succ 0$ with $\eta(C) = C^{-1}$). When these hold, the spectral density satisfies $f(0) = \frac{1}{\pi}\,\mathrm{tr}(C)$, where $C$ is the unique trace minimizer of the solution set $\{W \succ 0 : \eta(W)\,W = I\}$. The proof combines algebraic and analytic ingredients. On the algebraic side, we establish the equivalence (i) $\Leftrightarrow$ (iii) using Gurvits' capacity theory for indecomposable maps and a geodesic reflection theorem in the Riemannian manifold of positive definite matrices, which upgrades DS-scalability to symmetric DS-scalability for self-adjoint completely positive maps. On the analytic side, we prove (iii) $\Rightarrow$ (ii) via a Lyapunov–Schmidt reduction of Speicher's equation at a trace-minimizing solution, showing that the Jacobian of the bifurcation equations is positive definite. This removes a stability hypothesis that was required in earlier approaches.
Read the full abstract

Information Theory

Rejection Sampling is Optimal for Relative Entropy Coding

In relative entropy coding, a sender aims to design a stochastic code such that, on input $X \sim P_X$, the receiver can generate a sample $Y \sim P_{Y \mid X}$. It is a standard result that (1) this requires at least $I(X; Y)$ bits, (2) the lower bound is achievable within a logarithmic gap, and (3) this gap cannot be reduced in general. The necessity of the gap suggests that the mutual information is not the correct information measure to quantify the rate of relative entropy coding. A potential alternative emerged in the work of Flamich et al. (2025), who proved a tighter lower bound of $I_F(X \to Y)$, a quantity we call the functional information. In this paper, we construct the ring toss code, an encoding method for rejection sampling which uses at most $I_F(X \to Y) + \log e$ bits, hence obtaining a tight one-shot characterization of relative entropy coding. For the trivial channel $Y = X$, our result recovers the noiseless source coding theorem within a small constant. For a general channel, it implies that the classical mutual information lower bound is achievable within $\log(I(X; Y) + 1) + 2.45$ bits in general and within $1.45$ bits for singular channels, which are both the tightest bounds of their kind to date. Moreover, our one-shot result also recovers Sriramu and Wagner's asymptotic results on the second-order redundancy of relative entropy codes.
Read the full abstract

All authors Spencer Hill, Fady Alajaji, Tamás Linder, Gergely Flamich

Friday 24 April

General Topology

Konig's Infinity Lemma for locally finite ultrametric spaces generated by labeled trees

We analyze the interplay between labeled trees and the ultrametric spaces they present. We provide characterizations of labeled trees that generate separable ultrametric spaces and those that generate locally finite ultrametric spaces. In particular, we establish an analog of Konig's Infinity Lemma for locally finite ultrametric spaces generated by labeled trees.
Read the full abstract

Representation Theory

Monoidal Categories associated with Kac-Moody Open Richardson Varieties in Symmetric Type

We study determinantial modules associated with open Richardson varieties of symmetric Kac–Moody type. For the seed obtained by the Bao–Ye–Ménard mutation procedure, we give an explicit bijection between its vertices and the positions complementary to the leftmost subexpression. Each initial variable is a multiplicity-one convolution factor of the corresponding determinantial module, and these determinantial modules are cluster monomials in that seed. We deduce that the quantum cluster algebra with non-invertible frozen variables embeds in the Grothendieck ring of $\mathscr C_{w,v}$, with cluster monomials represented by real simple modules up to normalization. In finite $ADE$ type, we identify the seed with Leclerc's seed and obtain a monoidal categorification after localization at the frozen variables.
Read the full abstract

Combinatorics · Cross-listed from cs.DC

Mathematical Foundations for Peer-to-Peer Lattice Computation

We give structured proofs for five mathematical propositions governing synchronous peer-to-peer computation on a finite grid graph embedded in $\mathbb{Z}^2$. Proposition 1 gives three lower bounds: a transport-work bound $\sum_i a_i \ell_i \geq W_1(\mu,\nu)$ attained by every shortest-path schedule; a completion-depth bound $D_{\min} \geq r_\mu$ attained by non-congesting parallel routing; and a compressive-reduction edge bound $|E'| \geq \mathrm{St}_G(\mathrm{supp}(\mu)\cup\{x_\star\})$. A negative result refutes naive $O(f_{\text{act}}P^{3/2})$ concentration for sink-trunk loads under corner-sink dimension-order routing, showing variance $\Theta(f_{\text{act}}(1-f_{\text{act}})P^2)$. Proposition 2 establishes, under the $\alpha$-$\beta$-$\gamma$ collective-communication and a Mixture-of-Experts sparse-activation model, that the grid-to-cluster latency ratio improves monotonically as $f_{\text{act}}$ shrinks whenever cluster fixed overhead dominates the grid geometric constant. Proposition 3 identifies a sufficient algebraic criterion for schedule-independent reduction: update rules decomposing into a local map and an abelian-monoid merge, expressed as a product-preserving functor from the Lawvere theory of commutative monoids into the hardware-state category. Proposition 4 bounds the conditional expected route length under i.i.d. site failure in the subcritical regime $\delta < p_c^{\text{site}}(\mathbb{Z}^2)$ by an additive detour, using Aizenman-Barsky exponential cluster-size decay. Proposition 5 augments the grid with $k$ uniform long-range shortcuts per node, collapsing the typical shortest-path length from $\Theta(\sqrt{P})$ to $O(\log P)$ under a mean-field (Erdős-Rényi) universality argument – rigorous for the 1-D-ring base (Newman-Watts-Strogatz), conjectural for the 2-D-grid base.
Read the full abstract

2605.22832 · 24 Apr · Foundations for software engineering of peer-to-peer distributed computation: abelian-monoid fold semantics (PCC-certifiable), reduction-depth/transport-work/Steiner-edge lower bounds, subcritical fault-tolerance detour bounds, small-world topology extension. 20 pages, 7 figures, 35 references

General Mathematics

Phase Transitions in Turnpike Theory For Mean-Field Games

We study a translation-invariant mean-field game on the flat torus with interaction $F(x,m)=\gamma (K*m)(x)$, where $K$ is smooth, even, and mean-zero. The interaction is of potential type, arising as the first variation of a quadratic energy, though the stationary system is not treated variationally. Linearizing around the uniform equilibrium yields mode-wise $2\times 2$ systems with dispersion $\sigma_\xi(\gamma)=\nu^2(2\pi|\xi|)^4+\gamma(2\pi|\xi|)^2\hat K(\xi)$. If $\hat K$ is negative for some mode, a finite threshold \[ \gamma_c=\min_{\hat K(\xi)<0}\frac{\nu^2(2\pi|\xi|)^2}{|\hat K(\xi)|} \] marks loss of stability; otherwise $\gamma_c=+\infty$. Near criticality, the spectral gap scales as $\rho(\gamma)\sim C_*\sqrt{\gamma_c-\gamma}$. For $\gamma<\gamma_c$, the uniform state is exponentially stable in the turnpike sense for finite-horizon problems, with rate $\rho(\gamma)$. At $\gamma=\gamma_c$, the gap closes and, after phase fixing and center-manifold reduction, one obtains algebraic midpoint decay of order $T^{-1/2}$. For $\gamma>\gamma_c$, a branch of nonuniform stationary solutions bifurcates via a pitchfork-type amplitude equation, with translations generating the full family. Finally, under standard asymptotic-consistency assumptions on symmetric $N$-player equilibria in the subcritical regime, we obtain qualitative propagation of chaos, without quantitative rates.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Entanglement as a Witness of Quantum Coherence: A Bipartite Monty-Hall Protocol

We present a bipartite protocol inspired by the Monty Hall puzzle that operationally distinguishes quantum coherence from classical ignorance. A principal qutrit is entangled with an ancillary qutrit via a controlled unitary, preparing $|\Psi\rangle = \frac{1}{\sqrt{3}}(|A,0\rangle + |B,1\rangle + |C,2\rangle)$. A rank-1 projective discard then eliminates one basis state, leaving a coherent superposition of the two remaining states. Finally, the ancilla and qutrit are measured, yielding joint probabilities that encode the interplay between superposition and measurement back-action. We show that the conditional probability $P(B|\text{anc}=0)$ takes the value $1/4$ in both quantum mechanics and the classical ignorant-host model, making it unsuitable as a witness. The true quantum-classical separation emerges in conditional joint probabilities that correlate ancilla outcomes with specific discard operations. We define witnesses $\mathcal{W}_{i,j} = P(anc=i, qutrit=j \mid \text{discard } k)$ where $j$ differs from the ancilla-implied state. Quantum mechanics predicts $\mathcal{W} = 1/4$, while any classical epistemic model with perfect initial correlations yields $\mathcal{W} = 0$. We provide the explicit $9 \times 9$ unitary matrix, a complete analysis of all measurement outcomes, and a detailed proof of the violation. The witness is fully immune to white noise and robust against moderate dephasing. The protocol requires only a single pair of entangled qutrits and sequential measurements – no spatial separation, no multiple copies, and no complex sets of incompatible observables. This makes it suitable for advanced undergraduate laboratories and provides a pedagogically accessible test of the ontic-epistemic distinction in quantum foundations.
Read the full abstract

General Mathematics

Structural Results for 4 x n Chomp: Unique Extension, Bimodal Asymptotic Structure, and Period-112 Geometry

We present a complete computational tabulation of all 961,619,972 P-positions in 4xn Chomp for n <= 3000, obtained via a new O(n^4) shadow-array sieve that replaces the O(n^5) hash-set approach of prior work. Three structural results are reported. First, we prove the Unique Extension property: for any triple (a,b,c), there is at most one value of d such that (a,b,c,d) is a P-position. The proof is a short contradiction using the move structure of Chomp and generalizes immediately to all k-row Chomp. Second, the P-positions exhibit a persistent bimodal decomposition into two subfamilies, HIGH and LOW, separated by a clean gap in the per-a median of d/a that grows monotonically from 0.040 at n=500 to 0.062 at n=3000, with the HIGH subfamily maintaining a stable density of 56.2% throughout. The previously conjectured global limit d/a -> 2/9 is shown to be a mixture artifact. Third, within each family the two larger row-length ratios satisfy an exact quadratic relation at machine precision, and numerical evidence suggests d/a -> 1/4 in the HIGH family, though a power-law convergence fit gives an asymptote of approximately 0.248 with exponent alpha ~ 0.05, leaving the exact limit open. The LOW family limit L3 ~ 0.183 is not well approximated by 3/16; the best rational with denominator at most 2000 is 20/109. Code and the n <= 500 dataset are available at https://github.com/gargarnav/chomp-4xn-v2.
Read the full abstract

Mathematical Physics · Cross-listed from cond-mat.quant-gas

The Lieb-Liniger model

The Lieb-Liniger model describes one-dimensional bosons with contact interactions. This many-body system admits an exact solution in terms of the Bethe ansatz. Some of the exact and perturbative results for this model are reviewed. Particular attention is devoted to the explicit evaluation, in terms of the interaction parameter, of physical quantities that can be formally exactly extracted from the Bethe ansatz solution. Another goal of this review is to stress exact relations between various quantities. The technical developments are explained in detail. The most relevant experimental realisations of the studied problems are eventually discussed. This review also contains several new results such as the study of convergence of the ground-state energy series at strong interactions, the excitation spectrum at high energies, and the evaluation of the boundary energy.
Read the full abstract

Numerical Analysis · Cross-listed from eess.SY

Probabilistic Hazard Analysis Framework with Stochastic Optimal Control for Deteriorating Civil Infrastructure Systems

The safety and resilience of civil infrastructure systems are increasingly threatened by compounded risks from various hazard events and structural deterioration due to environmental stressors. This study presents a comprehensive risk-informed, life-cycle optimization framework that extends the Performance-Based Earthquake Engineering (PBEE) and probabilistic seismic loss estimation paradigms by combining hazard uncertainties, nonstationary deterioration, structural damage accumulation, and state-dependent fragility assessments, with optimal, adaptive maintenance strategies in time. The life-cycle cost optimization is formulated in this work as a Markov Decision Process (MDP) problem, utilizing derived, transition matrices reflecting time-variant deterioration effects and hazard risks. To mitigate the curse of dimensionality in system-level optimization, a novel tensor-based method exploiting Kronecker-factored transition dynamics is introduced, reducing complexity from exponential to linear in the number of components while still preserving exact, global dynamic programming solutions. Overall, the framework is general and versatile, able to accommodate various hazard types. A seismic hazard application is, however, demonstrated and explained in detail in this work. The developed methodology eventually provides decision-makers with a practical, data-driven tool toward cost effective risk mitigation of civil infrastructure systems.
Read the full abstract

Dynamical Systems

Amalgamated Free Products of Circle Actions with a Bounded Number of Fixed Points

Inspired by constructions of Kovačević, we introduce the amalgamated free product of circle actions, obtained by blowing up two actions along prescribed orbits and rearranging the inserted intervals. Under natural orbit and index assumptions, we prove that this construction is well defined, yields a minimal action on the circle, and is unique up to topological conjugacy. We then study its dynamical properties. Using a proper ping-pong partition arising from the construction, we obtain criteria ensuring that the resulting action still has a uniformly bounded number of fixed points, and in particular at most \(2n\) fixed points. We also give sufficient conditions for the resulting action to remain Möbius-like and for it not to be topologically conjugate to a subgroup of any finite lift \(\psl^{(k)}(2,\RR)\).
Read the full abstract

Optimization and Control

Efficient primal-dual algorithm for imaging applications with matrix stacking, applied to DBT image reconstruction

The primal-dual hybrid gradient (PDHG) algorithm for solving convex optimization problems that arise in tomographic imaging is revisited. In particular, simplification of the selection of step-size parameters is developed for optimization problems with multiple terms, each containing a linear transform subject to splitting. This simplification maintains algorithm efficiency while avoiding massive grid searches for the optimal parameter settings. The PDHG framework is demonstrated on an image reconstruction problem for wide-angle digital breast tomosythesis (DBT); use of the proposed optimization problem is enabled by the framework and it is demonstrated to have some advantage in quantitative accuracy of the reconstructed volume and in improving DBT depth resolution.
Read the full abstract

All authors Emil Y. Sidky, John Paul Phillips, Zheng Zhang, Dan Xia, Ingrid S. Reiser, Xiaochuan Pan

Optimization and Control · Cross-listed from cs.CE

Learning to Trust AI and Data-driven models in Data Assimilation through a Multifidelity Ensemble Gaussian Mixture Filter Framework

AI and data-driven models have large potential for data assimilation applications by creating fast and accurate forecasts. Their tendency to produce spurious inaccurate, nonphysical results – hallucination – however, raises a serious question about their long-term use, and can be categorized as untrustworthy methods. Theory-driven methods on the other hand are slow, but are capable of staying physically realistic due to their mathematical underpinning, and can be categorized as trustworthy methods. We argue that by making use of these methods in tandem, it is possible to build a relative measure of trust between the theory-driven and data-driven methods that results in a combined trustworthy methodology. We argue, and then show, that the bandwidth scaling factors in the kernel density estimates can be used to represent our trust in the theory-driven and data-driven models. We provide for ways in which these measures of trust can be adaptively computed through an expectation-maximization approach. We combine all of these ideas to create the multifidelity ensemble Gaussian mixture filter and its adaptive trust version, which are particle filters capable of high-dimensional data assimilation. We validate our ideas on both a static banana problem and on a sequential filtering example with the Lorenz '96 equations, showing that it is possible to create a particle filter that is capable of high dimensional convergent inference in the undersampled regime – when the number of theory-driven samples is less than the dimension of the system.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

ML-Guided Primal Heuristics for Mixed Binary Quadratic Programs

Mixed Binary Quadratic Programs (MBQPs) are an important and complex set of problems in combinatorial optimization. As solving large-scale combinatorial optimization problems is challenging, primal heuristics have been developed to quickly identify high-quality solutions within a short amount of time. Recently, a growing body of research has also used machine learning to accelerate solution methods for challenging combinatorial optimization problems. Despite the increasing popularity of these ML-guided methods, a large body of work has focused on Mixed-Integer Linear Programs (MILPs). MBQPs are challenging to solve due to the combinatorial complexity coupled with nonlinearities. This work proposes ML-guided primal heuristics for Mixed Binary Quadratic Programs (MBQPs) by adapting and extending existing work on ML-guided MILP solution prediction to MBQPs. We introduce a new neural network architecture for MBQP solution prediction and a new training data collection procedure. Moreover, we extend existing loss functions in solution prediction and propose to combine contrastive and weighted cross-entropy losses. We evaluate the methods on standard and real-world MBQP benchmarks and show that the developed ML-guided methods significantly outperform existing primal heuristics and state-of-the-art solvers. Furthermore, models trained with our proposed extension with combined losses outperform other ML-based methods adapted from MILPs and improve generalization in cross-regional inference on a real-world wind farm layout optimization problem.
Read the full abstract

All authors Weimin Huang, Natalie M. Isenberg, Ján Drgoňa, Draguna L Vrabie, Bistra Dilkina

Information Theory · Cross-listed from cs.LG

Shape of Memory: a Geometric Analysis of Machine Unlearning in Second-Order Optimizers

We argue that current definitions of machine unlearning are underspecified for second-order optimizers. We compare first-order and second-order learners for their ability to handle the data deletion task with varying degrees of eigendecomposition to mimic the loss model memory. While both first and second-order methods realign with the ideal counterfactul in terms of performance and gradient, the second-order optimizer shows significant volatility in the optimizer state. This indicates residual information, supposedly deleted, that isn't detectable by first-order analysis. Various eigendecay treatments show that stability and information loss is regained only under controlled state pertubation where geometric information (or memory) is erased.
Read the full abstract