Combinatorics · Cross-listed from eess.SY
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Friday 24 April
In this paper, we present the Electric Mobility Dial-a-Ride Problem (EM-DARP), which extends the Electric Vehicle Dial-a-Ride Problem (EV-DARP) to better accommodate human-focused mobility services. The problem involves utilizing a fleet of heterogeneous Electric Vehicles (EVs) to fulfill a set of customer requests with DARP and mobility-related specifications, while incorporating visits to charging stations amid requests. The problem is formulated as a Mixed-Integer Linear Program (MILP) and subsequently solved for a number of curated evaluation scenarios to demonstrate its practical applicability.
Number Theory
Non-linear geometry of multiple zeta values
Since their rediscovery in the 1990s, multiple zeta values have become ubiquitous in many areas of mathematics and physics. Their standard integral and sum representations can usually be traced back to a single source, namely the iterated integrals on the Riemann sphere with three punctures. We refer to such representations as the linear geometry of multiple zeta values, since the denominators of the corresponding integrands factor completely into linear terms. However, there also exist equally important and entirely distinct integral representations for multiple zeta values arising in mathematics and physics, in which matrix determinants appear in the denominator of the integrand. We call this the non-linear geometry of multiple zeta values. These lectures trace the origins of this non-linear geometry and provide an introductory journey through a range of topics including tropical geometry, the moduli spaces of tropical curves, Feynman integrals in quantum field theory, the general linear group of integer matrices, and the reduction theory of quadratic forms. In doing so, we propose a geometric framework for multiple zeta values based on such non-linear, determinantal representations and set out a number of open questions for future research.
Read the full abstract
Numerical Analysis · Cross-listed from gr-qc
Radiation outer boundary conditions and near-to-far field signal transformations for the Bardeen-Press equation
Several theoretical and astrophysical problems - including gravitational-wave modeling for extreme mass-ratio inspirals - require accurate time-domain solutions of the spin-weight $s=-2$ Teukolsky equation in Boyer-Lindquist coordinates. Because such simulations are performed on finite computational domains, they typically introduce an artificial outer boundary where nontrivial boundary conditions must be imposed. If these conditions are inaccurate, then spurious reflections and slowly-growing unphysical modes may corrupt long-time evolutions. We develop and implement exact radiation outer boundary conditions for the Bardeen-Press equation (a harmonic moment of the $a=0$ Teukolsky equation), making the artificial boundary transparent at any finite radius. We also construct near-to-far field teleportation kernels that map field data recorded at finite radius $r_1$ to the data reaching $r_2 > r_1$. The possible choice $r_2 = \infty$ corresponds to asymptotic waveform evaluation, that is propagation of the data to future null infinity. We show that both boundary and teleportation kernels are well approximated by exponential sums, with associated error bounds. Implemented in a time-domain solver, our kernel-based boundary conditions eliminate unphysical late-time growth and give the correct late-time decay rates, affording efficient long-duration simulations for waveform modeling and related blackhole perturbation calculations.
Read the full abstract
Algebraic Geometry
Matrix tuples with linearly dependent invariant subspaces
The set of matrix tuples with invariant subspaces whose dimensions sum up to the dimension of the space, but which do not span the whole space form an algebraic hypersurface. We found the equation of this hypersurface. This generalizes previous joint work.
Numerical Analysis
Craig-Bampton-based Quadratic Manifold for Nonlinear Substructuring
Component Mode Synthesis methods, such as the Craig-Bampton (CB) approach, are widely used in structural dynamics due to their modularity and compatibility with substructuring workflows. While highly effective for linear systems, extending these methods to geometrically nonlinear structures remains a significant challenge. In this work, we propose a nonlinear extension of the CB method tailored to such contexts. The approach is based on the construction of a quadratic reduction manifold, derived via perturbation analysis, in which high-frequency fixed-interface modes are statically condensed onto a reduced set of low-frequency modes and interface coordinates. This formulation enables the representation of geometric nonlinear effects without increasing the number of reduced degrees of freedom.The resulting Nonlinear Craig-Bampton (NL-CB) reduced-order model is obtained through Galerkin projection onto the tangent space of the manifold and admits a polynomial structure that is efficient for time integration. The formulation preserves the Lagrangian structure of the underlying finite element model, ensuring consistent energetic behavior and numerical stability.The proposed method is demonstrated on representative nonlinear structural systems of increasing complexity. The results show that the NL-CB model captures the essential nonlinear dynamic response while retaining the modularity and computational efficiency of classical substructuring approaches.
Read the full abstract
Numerical Analysis · Cross-listed from physics.ao-ph
Spectral-Domain Local Statistics with Missing-Data Support for Cartesian and Polar Grids
This paper presents a method for computing local mean, variance, standard deviation, and effective sample count on incomplete gridded data using boundary-aware spectral operators. The framework combines normalized convolution with explicit boundary-condition modeling: reflective Discrete Cosine Transform (DCT) for non-periodic Cartesian axes and periodic Real Fast Fourier Transform (RFFT) for circular azimuth processing in polar geometry. Stability safeguards (denominator floor, prefill fallback, and variance clamp) are specified for under-supported regions. We evaluate the framework across three targeted scenarios: a Cartesian boundary-condition check demonstrating the mitigation of wrap-around artifacts, a synthetic 3D outlier-identification test, and a real-radar polar application. Results establish bounded, support-aware interpretation of local statistics while preserving a concise reproducibility path through the open-source 'dct\_toolkit' implementation.
Read the full abstract
Combinatorics
Approximation algorithms and ratios for multiple domination in graphs
We analyse approximation algorithms (greedy heuristics) for the classical domination number and two multiple domination numbers in simple graphs. First, we present a short self-contained proof of the known result that the minimum domination problem in any graph $G$ with maximum degree $\Delta$ can be solved within the approximation ratio of ${\ln(\Delta+1)+1}$. The proof is based on an analysis of a simple greedy heuristic. Then, by analysing more advanced greedy heuristic techniques and using ideas from our self-contained proof for the classical domination number, we fix a gap in the existing proof of a similar result for the $k$-tuple domination number. That is, we prove that the minimum $k$-tuple domination problem indeed can be approximated within the ratio of $\ln(\Delta+1)+1$. The proof of this result is self-contained, direct, and much shorter than the existing proof, which contains the gap. Finally, we show that the known approximation ratio of $\ln(2\Delta)+1$ for the minimum $k$-domination problem can be improved to a better ratio.
Read the full abstract
Mathematical Physics · Cross-listed from physics.class-ph
How the Hahn-Banach Theorem Sheds Bright Light on Fundamental Questions in Classical Thermodynamics
The Hahn-Banach Theorem, a cornerstone of modern functional analysis, is a natural companion of the Second Law of Thermodynamics. From a Kelvin-Planck version of the Second Law, the Hahn-Banach Theorem delivers, immediately and simultaneously, entropy and thermodynamic-temperature functions of the local material state such that the Clausius-Duhem inequality is satisfied for every process a particular material might admit. For existence of such functions there is no need at all to require that their domain be restricted to states of equilibrium. However, the Hahn-Banach Theorem also indicates that for uniqueness of such a pair of functions across the entire state-space domain, every state must be visited by a reversible process. This review is intended to help make accessible to both thermodynamics scholars and mathematicians the remarkable interplay of the Hahn-Banach Theorem and the Second Law.
Read the full abstract
Statistics Theory
Statistical Analysis of Markovian Generative Modeling
These lecture notes introduce the statistical analysis of continuous-time generative models built from Markov dynamics. We begin with the stochastic-calculus foundations of score-based diffusion models, including time reversal, score matching, and sampling from learned scores. We then present the broader framework of generator matching, which describes flows, diffusions, jump processes, and discrete generative models through their infinitesimal generators. We then focus on finite-sample guarantees. We explain how errors in the learned drift or generator propagate to the final generated distribution, why stability and regularity properties are essential, and how time-adaptive neural network classes can achieve optimal Wasserstein rates for smooth target distributions. Overall, the notes aim to connect modern generative modeling algorithms with the probabilistic, analytic, and statistical tools needed to understand their worst-case performance.
Read the full abstract
Number Theory
Asymptotic behaviour of analytic torsion and cohomological torsion for $\mathbb{Q}$-rank $1$ arithmetic groups
We extend the refined asymptotics of analytic torsion associated to congruence subgroups of $\operatorname{SL}(n)$ in previous work, to congruence subgroups in a large family of reductive groups. This is applied to give new asymptotics and bounds on the growth of torsion in the cohomology of congruence subgroups of $\operatorname{SL}(2,\mathcal{O}_F)$ for $F$ a number field, and of congruence subgroups in $\operatorname{SO}(n,1)$ with $n$ odd.
Read the full abstract
Classical Analysis and ODEs
Existence of a periodic solution for superquadratic Hamiltonian systems with possible finite-time blow-up
We prove a sufficient condition for the existence of a $T$-periodic solution for the planar system $\dot z=F(t,z)$, characterized by the growth to infinity of the rotations made in one period by solutions starting at increasingly large initial values. Our result applies in particular to superquadratic Hamiltonian systems satisfying the Ambrosetti–Rabinowitz condition. The key novelty of the paper is that we do not require any growth condition on the flow to ensure global existence of solutions, allowing finite-time blow-up. Our method is based on a fixed-point theorem which exploits the rotational properties of the dynamics. To conclude, we discuss a family of examples of Hamiltonian systems showing finite-time blow-up.
Read the full abstract
Combinatorics
Planar 1-ended graphs can be periodically coloured
We conclude an investigation of Abrishami, Esperet, Giocanti, Hamman, Knappe and Möller studying the existence of periodic colourings of locally finite graphs. A colouring of a graph $\Gamma$ is periodic if the resulting coloured graph has a finite number of orbits under its colour-preserving automorphisms, as such it is natural to consider those quasi-transitive graphs with finite quotient. In the case that the graph is planar and has 1-end we prove that it always permits a periodic proper vertex colouring. This is shown by constructing isometry respecting embedded maps into the Euclidean and hyperbolic planes and leveraging known properties of Euclidean and hyperbolic isometry groups. Moreover, in the case that a graph is Euclidean we show that this can always be done in 5 colours.
Read the full abstract
Functional Analysis
Gel'fand Integration of B(E, F*)-Valued Functions With Emphasis on (q, p)-Summing Operators
We generalize results concerning Gel'fand integration of functions taking values in the space of operators on Hilbert spaces to certain Banach spaces. Building on ideas from \cite{M24} we provide sufficient conditions for the Gel'fand integral to be $(q,p)$-summing and we use the developed techniques to answer a question posed in the mentioned article. Applications to positive operator-valued functions between certain function spaces are also given.
Read the full abstract
Differential Geometry
A new framework of zero mean curvature surfaces in the isotropic 3-space
We introduce a class of zero mean curvature surfaces with singularities in the isotropic 3-space, called ZMC-faces. As a main result, we establish three Osserman-type inequalities for a ZMC-face under certain assumptions on both completeness and finiteness of the total curvature. The equality conditions of these inequalities are related to the asymptotic behaviors of the ends. Moreover, we present several examples of ZMC-faces attaining equalities in these inequalities.
Read the full abstract
Classical Analysis and ODEs
Continuity properties of strongly singular integral operators for extreme values of $p$
In this work, we establish continuity properties of strongly singular integral operators for extreme values of $p$. Particularly, weighted $L^\infty$-$BMO$ boundedness is obtained, generalizing Miyachi's result to the context of Muckenhoupt weights. As an application, we get an alternative proof of Chanillo's weighted $L^p$ estimates via extrapolation techniques.
Read the full abstract
Number Theory
Khintchine's theorem for inhomogeneous simultaneous approximation with polynomial decay
Khintchine's theorem on the measure dichotomy for the set of $\psi$-approximable numbers has been generalized to inhomogeneous and higher-dimensional settings. Allen and Ramírez conjectured that the monotonicity condition can be removed in the inhomogeneous $nm=2$ cases. In this paper, we resolve the $(n,m)=(1,2)$ case for $\psi$ satisfying a polynomial decay condition $\psi(q)=O(q^{-\delta})$ for some $\delta>0.$
Read the full abstract
Optimization and Control
Second-order geometry of optimal transport: cost identifiability and stability
We study the optimal transport value as a functional of the ground cost. Although this functional is an infimum of linear functionals and is therefore polyhedral for finitely supported marginals, it develops genuine second-order geometry in the smooth continuous setting. Under twist, nondegeneracy, and regularity assumptions, we prove twice differentiability with respect to the cost in Hölder spaces, derive a variational formula for the Hessian, and characterize its null space. The resulting curvature is strict transverse to the cost perturbations that preserve the observed optimal plan. This structure yields identifiability and quantitative stability for inverse optimal transport. For bilinear costs $c_A(x,y)=-x^\top Ay$, a full spanning condition on the Hessians of the Kantorovich potential implies that every nonzero matrix compatible with a single optimal coupling is a positive multiple of the true matrix. We show that this condition can be attained by arbitrarily small compactly supported smooth perturbations of the transport potential that preserve the target marginal's support and density class. For $d\ge2$, uniquely optimal discrete plans and same-base elliptical models, including Gaussians, retain nontrivial degeneracies. Finally, we quantify the regularization bias and sampling error of entropic inverse optimal transport as the regularization parameter vanishes. Thus the second-order geometry of the forward transport problem provides a means towards identifiability, stability, and statistical cost recovery.
Read the full abstract
Optimization and Control
Penalised and constrained geodesics in geometric control theory
In many problems in optimal control, one seeks to minimise an objective function subject to constraints on the velocity of the system. Imposing these constraints directly – the “hard-constrained” approach – is often analytically and computationally challenging. A natural alternative is to penalise violations of the constraints, solving a sequence of “soft-constrained” problems indexed by a penalty parameter $q$, and hoping that solutions converge to solutions of the hard-constrained problem as $q \to \infty$. We show that this approach is justified when applied to a broad class of geometric control problems on a Riemannian manifold $(M,g)$. We first consider the case where there are no autonomous dynamics, and so the control problem reduces to the problem of finding a curve of minimal length or energy between two points, subject to a nonholonomic velocity constraint/penalty determined by the choice of a bracket-generating subbundle $D$ of $TM$. We show that any sequence of solutions to the soft-constrained problem has an accumulation point which is a solution to the hard-constrained problem. Subsequently, we show how to transform a broad class of optimal control problems to the problem of finding a geodesic, by trivialising the inherent dynamics of the system using a change of coordinates inspired by the interaction picture transformation in quantum mechanics.
Read the full abstract
Statistics Theory
Sharp bounds for products of dependent random variables
We study the sharp bounds on $\mathbb{E}[X_1\cdots X_d]$ when the univariate marginal distributions are known, but the dependence structure between them is unspecified. Maximizing products over non-negative variables is straightforward via the comonotonic coupling, but the problem is more subtle when the marginals can take both positive and negative values. Specifically, two negative realizations can be matched to yield a positive product, whereas a single negative realization necessarily yields a negative product. We decompose the problem into a magnitude part and a sign part, and show that universal upper and lower bounds for the product expectation follow from comonotonic coupling of the absolute values and properly chosen sign vectors. Under a mild regularity assumption, we give necessary and sufficient conditions for these universal bounds to be attainable. For the upper bound, the marginal sign-bias vector must belong to the even-parity polytope, while for the lower, the corresponding condition involves the odd-parity polytope. We construct the extremal couplings via measurable selections on the parity polytope whenever these conditions hold. We study the case of identical marginals in more detail and provide examples of nonsymmetric extremal couplings that attain the universal bounds. We explicitly construct the extremal copulas in three dimensions, and use a recursive parity decomposition to obtain higher-dimensional extremal copulas from the trivariate ones.
Read the full abstract
Mathematical Physics · Cross-listed from hep-th
Generalised Symmetries and Swampland-Type Constraints from Charge Quantisation via Rational Homotopy Theory
Sati and Schreiber [arXiv:2402.18473, arXiv:2512.12431] have proposed that charge quantisation in quantum field theory and string theory is governed by a homotopy type $\mathcal A$. We provide a refinement of this postulate, incorporating other currents including matter, connecting it to adjustments in higher gauge theory and providing a prescription for determining $\mathcal A$, and show that, while the homotopy groups of $\mathcal A$ classify the possible brane charges, the homology groups of $\mathcal A$ classify the invertible higher-form symmetries. Furthermore, we show that the charge-quantisation postulate implies a number of non-trivial constraints on quantum field theories similar to those implied by swampland conjectures; in particular, it rules out noncompact gauge groups and one-form field strengths that form a non-nilpotent Lie algebra. Finally, we argue that for theories of quantum gravity the space $\mathcal A$ must be contractible, in accordance with the swampland conjectures on the absence of global generalised symmetries and the completeness of the spectrum of charges, and explain how this explicitly arises in the case of Type I string theory.
Read the full abstract
Analysis of PDEs
Correctness of Biot's model of in situ leaching for incompressible liquid and compressible solid components
We study a mathematical model of in situ leaching of rare metals, in which the joint filtration of two liquids is governed by the microscopic model $\mathbb{A}^{\varepsilon}$. A key difficulty is the unknown (free) boundary $\Gamma(r)$ between solid and liquid components, determined by an additional condition on $\Gamma(r)$; no standard methods exist for this nonlinear problem. To resolve it, we apply the fixed point theorem. For a given function $r(\boldsymbol{x},t)$ from a set $\mathfrak{M}_{(0,T)}$ of sufficiently smooth functions describing the skeleton structure, we consider the auxiliary problem $\mathbb{B}^{\varepsilon}(r)$: an elliptic system for displacements of the liquid and solid components coupled with parabolic equations for the acid concentration. Selecting the weak solution of minimal smoothness, we apply the homogenization method to pass from the microscopic to the macroscopic description. The resulting macroscopic model $\mathbb{H}(r)$ contains a homogenized boundary condition that expresses the normal boundary velocity $V_{N}=\partial r/\partial t$ as a linear function of the acid concentration $c$. Since $c$ depends on $r$ via an operator $\mathbb{F}\colon\mathfrak{M}_{(0,T)}\to\mathfrak{M}_{(0,T)}$, we prove that $\mathbb{F}$ is Lipschitz continuous and, by Banach's theorem, possesses a unique fixed point $r^{*}$, which yields the unique solution $\mathbb{H}=\mathbb{H}(r^{*})$.
Read the full abstract
Probability
Analysis of an Inhomogeneous Random Walk with Spatial Decay of Transition Probabilities and Parameter Renewal per Excursion
In this paper, we propose and analyze a novel one-dimensional inhomogeneous random walk model that combines spatial decay of transition probabilities with a temporal renewal structure for each excursion. In this model, the probability of moving to the right from each state creats a spatial inhomogeneity that causes a stronger pull-back toward the origin as the process moves farther away. Furthermore, it features a random environment aspect where the parameter of each transition probability is independently resampled from a uniform distribution at the beginning of each excursion. We rigorously derive the hitting probability to an upper boundary using a scale function. Furthermore, by solving linear difference equations, we provide the probability generating function of the first hitting time, the expected occupation time for each state during an excursion (discrete Green's function), and the distribution and expectation of the maximum penetration depth.
Read the full abstract
Differential Geometry
B-complex manifolds with generalized corners. I. Newlander-Nirenberg Theorems
We generalize complex manifolds to manifolds with corners $X$, and to manifolds with generalized corners (g-corners) in the sense of the second author arXiv:1501.00401, using complex structures on the b-tangent bundle (log tangent bundle) ${}^bTX$. We prove a formal Newlander-Nirenberg type theorem showing that along each corner stratum of $X$, the b-complex structure agrees with a standard model to infinite order. In the sequel we show that if $S$ is a log smooth log $\mathbb C$-scheme, or log smooth log complex analytic space, then the Kato-Nakayama space $S^{\rm KN}$ has the structure of a b-complex manifold with g-corners. Using our Newlander-Nirenberg theorem we give necessary and sufficient conditions for a b-complex manifold with g-corners to be a Kato-Nakayama space.
Read the full abstract
Numerical Analysis
Preconditioning of a hybridizable discontinuous Galerkin method for the coupled Stokes–Darcy system
We propose parameter-robust preconditioners for the statically condensed linear system arising from a hybridizable discontinuous Galerkin discretization of the coupled Stokes–Darcy system. The design strategy relies on first applying the operator-preconditioning framework [Numer. Linear Algebra Appl., 18(1):1–40, 2011] to construct a preconditioner for the non-condensed discretization. This is done by proving uniform well-posedness of the scheme. Next, we prove robustness of the resulting condensed preconditioner applied to the reduced linear system using the framework we proposed in [SIAM J. Sci. Comput., 47(6):A3212–A3238, 2025]. Numerical examples demonstrate robustness of the proposed preconditioners.
Read the full abstract
Probability
Poisson Hyperbolic Staircase in Discrete Time
In this paper, we propose a novel stochastic process that serves as a natural discrete-time counterpart to the continuous-time model known as the “Poisson hyperbolic staircase” proposed by Levikson et al. (1999), and clarify its analytical properties. The proposed model is a Markov chain on the state space $(0,1]$. Its transition rule states that at each time step, it jumps downwards to a value less than or equal to the current state according to a continuous uniform distribution with a probability proportional to the current state, and otherwise remains in the same state. In the analysis of the continuous-time model, the scaling property based on the continuity of time and space serves as a powerful tool. However, for this discrete-time process, an essential analytical difficulty arises because this scaling property is inapplicable. To overcome this difficulty, we adopt an approach that directly evaluates recurrence relations and integral equations. First, starting from the conditional transition of this process, we derive closed-form expressions for the marginal distribution and the joint survival function. Next, focusing on the counting process representing the number of jump occurrences and the sum of the state variables, we provide exact closed-form expressions for the probability generating function and the Laplace transform. Furthermore, we clarify the necessary and sufficient conditions that a sequence of functions must satisfy to construct a martingale associated with this process, and present a concrete sequence of martingales.
Read the full abstract
Group Theory
Decent actions of groups on restricted products
An action of a group $G$ on a set $X$ is called “decent” if every subgroup of $G$ with a finite orbit in $X$ fixes a point in $X$ and every finitely generated subgroup of $G$ such that every element of the subgroup fixes a point of $X$ must itself have a global fixed point. In this article, we study conditions on when actions of groups on restricted products are “decent”. We prove that the action of the automorphism group of a restricted product with base space the projective plane $\mathbb{P}^2(k)$ over a field $k$ is decent, generalizing a result of Lonjou–Przytycki–Urech.
Read the full abstract
Dynamical Systems
Accumulation sets and zero entropy dynamics in the Lozi map
For the Lozi map $L_{a,b}$, we consider parameter pairs for which the fixed point $X$ has no homoclinic points and the period-two orbit $\{P,P'\}$ is attracting. For such parameters, let $\ell$ be the set of accumulation points of the unstable manifold $W_X^u$ that do not lie on $W_X^u$. We construct a polygon $\mathcal{D}$ whose forward images under $L_{a,b}$ form nested sequences of sets that eventually become trapping. We show that this geometric construction gives a characterization of $\ell$ as the intersection of these iterates. Using this structure, we prove that the non-wandering set for $L_{a,b}^2$ is contained in the union of $\ell$ and the set of fixed points of $L_{a,b}$. As a consequence, the Lozi map, restricted to the complement of $\ell$ in the plane, has zero topological entropy. This result extends a recent one of Misiurewicz and Štimac to a broader set of parameters.
Read the full abstract
Combinatorics
Upper bounds on the running time of bootstrap percolation
For $k$-graphs $F$ and $H_0$ the $F$-bootstrap percolation process (or $F$-process) starting with $H_0$ is a sequence $(H_i)_{i\geq0}$ of $k$-graphs such that $H_{i+1}$ is obtained from $H_i$ by adding all those $e\in V(H_0)^{(k)}\setminus E(H_i)$ as edges that complete a new copy of $F$. The running time of this $F$-process, denoted by $M_F(H_0)$, is the smallest $i$ with $H_i=H_{i+1}$. Bollobás proposed the problem of determining the maximum running time for $n\in\mathbb{N}$, i.e., $M_F(n)=\max_{\vert V(H_0)\vert=n}M_F(H_0)$. Although this problem has received a lot of attention recently, until now the best known upper bound for $M_{K_t}(n)$, with $t\geq5$, was the trivial bound $\binom{n}{2}$. Here we provide the first non-trivial upper bound for this problem by showing that $$M_{K_t}(n)\leq\Big(\frac{t-3}{t-2}+o(1)\Big)\binom{n}{2}$$ holds for every integer $t\geq 3$. In fact, we prove the following more general result. For every $k\geq2$, every $k$-graph $F$, and every $e\in E(F)$ we have $M_F(n)\leq\big(\pi(F-e)+o(1)\big)\binom{n}{k}$, where $\pi$ is the Turán density.
Read the full abstract
Information Theory · Cross-listed from quant-ph
The Exact Replica Threshold for Nonlinear Moments of Quantum States
Joint measurements on multiple copies of a quantum state provide access to nonlinear observables such as $\operatorname{tr}(\rho^t)$, but whether replica number marks a sharp information-theoretic resource boundary has remained unclear. For every fixed order $t\ge 3$, existing protocols show that $\lceil t/2\rceil$ replicas already suffice for polynomial-sample estimation of $\operatorname{tr}(\rho^t)$, yet it has remained open whether one fewer replica must necessarily incur a sample-complexity barrier growing with the dimension. We prove that this is indeed the case in the sample/copy-access model with replica-limited joint measurements: any protocol restricted to $\lceil t/2\rceil-1$ replicas requires dimension-growing sample complexity, while $\lceil t/2\rceil$ replicas suffice by prior work. Thus the exact replica threshold for fixed-order pure moments is $\lceil t/2\rceil$. Equivalently, for fixed-order pure moments, one additional coherent replica is not merely useful but marks the exact threshold between polynomial-sample estimation and a dimension-growing regime in the replica-limited model. We further show that the same threshold law extends to a broad family of observable-weighted moments $\operatorname{tr}(O\rho^t)$, including Pauli observables and other observables with bounded operator norm and macroscopic trace norm. Coherent replica number therefore acts as a genuinely discrete resource for nonlinear quantum-state estimation.
Read the full abstract
Optimization and Control
FlashFolio: A GPU-Accelerated Solver for Portfolio Optimization
We present FlashFolio, a GPU-accelerated solver for single-period and multi-period portfolio optimization with factor-based risk modeling, bid-offer spread costs, and nonlinear market impact. These models are widely used in portfolio construction and optimal execution, but become computationally challenging at large scale, especially in the multi-period setting. We benchmark FlashFolio against MOSEK on instances constructed from realistic market inputs. FlashFolio delivers consistent runtime improvements, achieving speedups of up to 12.9x in the single-period setting and 48x in the multi-period setting, while also exhibiting stronger robustness on challenging multi-period instances. Our results show that GPU-based optimization can help improve the practicality of large-scale portfolio optimization.