Numerical Analysis
A Discrete-Time Random Feature Method for Nonlinear Evolution Equations with Implicit-Explicit Runge–Kutta Time Stepping
Haoran Zhou, Zhaohui Fu, Yangshuai Wang et al. (+1 more)
We study a discrete-time random feature method for nonlinear, time-dependent partial differential equations. In contrast to continuous-time formulations that treat time as an additional input variable, the method advances the solution step by step, with each time level computed from previously available states. The spatial solution at each step is represented in the random feature trial space, and the time discretization is given by an implicit-explicit Runge–Kutta (IMEX-RK, 4 stages, third-order) scheme. After splitting the operator into linear and nonlinear parts, each stage admits a linear least-squares formulation, which avoids nonlinear least-squares solves. We also derive a global error estimate for the fully discrete method, separating the contributions of the stage-wise RFM approximation, perturbations in the least-squares coefficients, and the temporal discretization. Numerical experiments for the Allen–Cahn, Burgers, Korteweg–De Vries, and Cahn–Hilliard equations show relative $L^2$-errors of order $10^{-6}$ and convergence rates consistent with the third-order IMEX scheme. A comparison with an IMEX-PINN variant shows that the proposed method achieves higher accuracy at substantially lower computational cost.
Read the full abstract ▾
All authors Haoran Zhou, Zhaohui Fu, Yangshuai Wang, Xinlong Feng
Mathematical Physics · Cross-listed from quant-ph
Sector-dominant graph-local drivers for path-window barrier Hamiltonians on the Boolean hypercube
Takiko Sasaki and Tetsuji Tokihiro
We study finite-size adiabatic state preparation on Boolean hypercubes using graph-local drivers built from sector/path coordinates related to monotone Gray-code representatives. The construction is not presented as a new all-$n$ Gray-code existence
theorem; rather, it provides finite representatives, explicitly checked through the cases used in the numerical experiments, for testing problem-dependent graph-local drivers. For ordinary diagonal-cost transverse-field annealing, the ordering does not yield a robust advantage, and we include this negative result as a baseline. For non-diagonal target
Hamiltonians whose geometry is expressed in the same sector/path coordinates, hybrid drivers combining sector, path-window, and small transverse-field components can substantially improve the final ground-state fidelity in centered barrier instances. Reproduction runs from the accompanying code confirm a representative centered original-window barrier value of approximately \(0.9799\) for the fixed-control hybrid parameters \((w,\alpha,\epsilon)=(8,0.50,0.15)\), while also showing that the improvement is target-class dependent. Randomized and ablation controls indicate that the dominant contribution is the sector-preserving skeleton, with strict one-bit completion acting as a secondary refinement. We provide code, finite certificates, CSV files, validation logs, and reproduction scripts to make the finite-size claims traceable.
Read the full abstract ▾
Analysis of PDEs
Mathematical Models of Traffic Flow at a Signalized Intersection
Akbota Senkebayeva
This paper presents two one-dimensional mathematical models describing automobile traffic flow on straight road segments at a signalized intersection. When the traffic light is permissive, the flow density and velocity are obtained by solving an initial-boundary value problem for a first-order
hyperbolic system. When the signal is prohibitive, the same quantities are governed by a mixed system comprising a second-order
parabolic equation for the velocity and a first-order equation for the density.
Read the full abstract ▾
Probability
A mathematical analysis of hierarchical Hopfield models
Markus Heydenreich, Christian Hirsch and Matthias Löwe
The central question that we address is: How can structured information be stored in a hierarchical Hopfield model involving hidden layers? To this end, we develop a formalism of strokes and concepts that allows us to appropriately structure information: initial features are first classified into strokes, which in a second step are aggregated into concepts. We rigorously derive criteria under which concepts can be retrieved from noisy input data. A remarkable effect is that we do not require a perfect
retrieval at the level of strokes, as the second-layer
retrieval procedure compensates for first-layer errors. We treat separately the cases of fixed and variable-sized concepts.
Read the full abstract ▾
Optimization and Control · Cross-listed from eess.SY
Distributed adaptive estimation for stochastic large regression models
Die Gan, Siyu Xie, Zhixin Liu et al. (+1 more)
This paper studies the distributed adaptiveestimation problems for
stochastic large regression modelswith an infinite number of parameters. By constructing a re-cursive local cost function, we propose a novel distributedrecursive least squares
algorithm to estimate the unknownsystem parameters, where the growth rate of regressors'dimension is characterized by a non-decreasing positivefunction. The almost sure convergence of the proposedalgorithm is established under a cooperative excitationcondition, which incorporates the temporal information andthe spatial information to reflect the cooperative effectamong multiple
agents. Moreover, we analyze the predic-tion error by establishing the asymptotic upper boundof the accumulated regret without any excitation condi-tions. The main difficulty of theoretical analysis lies in howto analyze properties of the product of non-independentand non-stationary random
matrices, whose dimensionschange over time simultaneously. Some techniques, suchas
stochastic Lyapunov function, double-array martingaletheory and algebraic graph theory, are employed to dealwith the above issue. Our theoretical results are derivedwithout imposing independence or stationarity assump-tions on the regression vectors, thereby not excluding thecorrelated feedback signals.
Read the full abstract ▾
All authors Die Gan, Siyu Xie, Zhixin Liu, Xuebo Zhang
Optimization and Control · Cross-listed from cs.LG
Subspace Optimization for Efficient Federated Learning under Heterogeneous Data
Shuchen Zhu, Zhengyang Huang, Yuqi Xu et al. (+1 more)
Federated learning increasingly operates in a large-model regime where communication,
memory, and computation are all scarce. Typically, non-IID client data induce drift that degrades the stability and performance of local training. Existing remedies such as SCAFFOLD introduce heterogeneity-correction mechanisms to address this challenge, but they incur substantial extra communication and
memory overhead. This paper proposes a subspace optimization method for
federated learning (SSF), which performs heterogeneity-corrected optimization in a low-dimensional subspace using only projected quantities, while preserving full-dimensional control information through a backfill-style update that retains residual components whenever the active subspace changes. Under standard smoothness and bounded-variance assumptions, SSF attains a non-asymptotic rate of order $\widetilde{\mathcal{O}}(1/T+1/\sqrt{NKT})$. Experiments show favorable accuracy–efficiency trade-offs under heterogeneous data.
Read the full abstract ▾
All authors Shuchen Zhu, Zhengyang Huang, Yuqi Xu, Peijin Li
Representation Theory
Faithful perversities
Alessio Cipriani and Jon Woolf
We show that the faithful highest weight hearts in an algebraic triangulated category are the serially faithful glued hearts, equivalently the hearts containing a dual pair of full exceptional collections in the sense of Bodzenta–Bondal (arXiv:2601.22004). We then characterise faithful highest weight categories of perverse sheaves on topologically stratified spaces algebraically, in terms of the exactness of certain functors, and topologically, in terms of the vanishing of certain
cohomology groups of pairwise links. We prove that the global dimension of a faithful category of perverse sheaves on a topologically stratified space $X$ with finitely many strata is bounded by the dimension of $X$. Finally, we show that in this setting the hypercohomology of a perverse sheaf can be computed from a projective resolution of the constant sheaf, and conversely that the multiplicities of the terms in a minimal projective resolution of the constant sheaf can be computed as intersection
cohomology groups.
Read the full abstract ▾
Mathematical Physics · Cross-listed from hep-th
Liouville Blocks from Spectral Networks
Lotte Hollands and Subrabalan Murugesan
This is part I of a series of papers in which we investigate the role of spectral networks in
quantum Liouville theory, with particular emphasis on spectral networks of Fenchel-Nielsen type. In this part, we focus on the computation of $SL(2, \mathbb C)$
quantum parallel transports on any (punctured) Riemann surface $C$, which in
quantum Liouville theory has a well-known prescription through the Moore-Seiberg formalism. Our main achievement is rederiving this prescription through an extension of the $q$-nonabelianisation formalism applied to spectral networks of Fenchel-Nielsen type. One of the
spin-offs is a proposal for a
quantum version of the NRS proposal.
Read the full abstract ▾
Representation Theory
Representations of Super Yangians with Gelfand-Tsetlin bases
Vyacheslav Futorny, Zheng Li and Jian Zhang
The evaluation homomorphism from the super Yangian $\mathrm Y(\mathfrak{gl}_{m|n})$ to the universal enveloping
algebra $\mathrm U(\mathfrak{gl}_{m|n})$ allows one to regard the $\mathfrak{gl}_{m|n}$-modules as $\mathrm Y(\mathfrak{gl}_{m|n})$-modules. In this paper, we establish necessary and sufficient conditions for simple tensor products of covariant evaluation modules to be tame. We also provide an explicit construction of Gelfand-Tsetlin bases for tensor products of skew modules.
Read the full abstract ▾
Number Theory
Cyclotomic Numbers of Order $q-1$ over $\mathbb{F}_{q^r}$
Hayaki Kudo and Yuto Nogata
Let $q=p^n$, $r\in \mathbb{Z}_{\ge 2}$, $e=q-1$, and $k=\frac{q^r-1}{e}$. In this paper, we study the cyclotomic numbers $(a,b)_{q-1}$ over $\mathbb{F}_{q^r}$. We prove that $(a,b)_{q-1}\le \left\lceil \frac{k}{2}\right\rceil$ for all $0\le a,b\le q-2$ except when $q=2$ and $r\ge 3$. We also give sharper bounds for
prime values of $r$, especially for $r=2$ and $r=3$.
Read the full abstract ▾
Number Theory
The threshold for linear independence of multiple zeta values in positive characteristic
Bo-Hae Im, Hojin Kim and Tuan Ngo Dac
A fundamental
conjecture formulated by Thakur in 2009, which has guided significant developments in function field arithmetic, asserts that multiple
zeta values (MZV's) in positive characteristic of fixed weight are linearly independent over $\mathbb{F}_q$. In this paper we settle this
conjecture by determining the precise threshold for this independence. We prove that linear independence holds for all weights up to 2q, while for weight 2q+1 we establish the existence of a unique and explicit $\mathbb{F}_q$-linear relation. This result provides the first counterexample to Thakur's
conjecture. Our proof relies on a new connection between MZVs and Carlitz multiple polylogarithms over $\mathbb{F}_q$, generalizing a central result of [IKLNDP24]. We also introduce a modification of the
algorithm from [ND21] that yields a weight-preserving operator acting on $\mathbb{F}_q$-linear relations, providing the algebraic framework for these results.
Read the full abstract ▾
Number Theory
The Subtractive Divisor Orbit: Unconditional Bounds, Parity Constraints, and a Conditional Framework
Marco Mantovanelli
Let $\tau(n)$ denote the number of positive divisors of $n$. Starting from $n_0=x$, consider the orbit $n_{j+1}=n_j-\tau(n_j)$, and let $a(x)$ be its hitting time of zero. Although the average order of $\tau$ suggests $a(x)\asymp x/\log x$, the orbit samples the divisor function endogenously, and no unconditional estimate of this order is known to us. We prove the exact identity $\sum_{j<a(x)}\tau(n_j)=x$ and the unconditional bounds $$ \frac{x}{(\log(2x))^3}\ll a(x)\le \frac{3x}{8}+O\!\left(\frac{\sqrt{x}}{\log x}\right). $$ We also show that the orbit changes parity exactly at square states. On dyadic orbit segments, we establish a local-to-global criterion, a large-value truncation, and a quantitative implication from small relative variance to a step-mass-saturating dynamic near-ladder. Finally, under two explicit hypotheses – a regularity-or-ladder dichotomy and an anti-ladder estimate – we obtain $a(x)\asymp x/\log x$.
Read the full abstract ▾
Information Theory
Central Limit Theorem for Mutation Systems
Liav Koram and Ohad Elishco
DNA-based storage has emerged as a promising alternative to traditional data storage methods, offering unmatched advantages in data density, longevity, and sustainability. Two main approaches have developed: in-vitro storage, where information is synthesized in controlled environments, and in-vivo storage, where data is embedded within an organism's DNA for enhanced confidentiality and protection. While in-vivo DNA storage provides unique advantages, it faces significant challenges from mutations, including duplications, deletions, and substitutions, which cause sequence
evolution over time. Thus, in-vivo systems experience continuous sequence alterations that increase length and change composition, making error correction particularly challenging. We study the asymptotic behavior of mutation systems, which model the probabilistic
evolution of sequences over a finite alphabet, and are central to the analysis of in-vivo DNA-based data storage. Building upon prior works that established the limit of empirical $k$-tuple frequencies, we characterize the
stochastic fluctuations around these values by establishing a Central Limit
Theorem (CLT). Our approach leverages the spectral properties of the $k$-substitution
matrix to project the centered count vectors, allowing us to approximate the system via a martingale difference sequence, and then verifying the classical martingale CLT conditions. In addition, we explicitly derive the limiting covariance
matrix.
Read the full abstract ▾
Classical Analysis and ODEs
Quantitative estimates for the absolute convergence of wavelet-type series
Grigori A. Karagulyan and Gor A. Melkumyan
We establish new quantitative estimates for general systems of functions with wavelet-type dyadic structure. These estimates are applied to obtain the optimal growth of various types of Weyl multipliers for certain wavelet-type systems. Some of our results are sufficiently general to allow the orthogonality assumption to be removed. In particular, as a consequence of these estimates we show that the condition \begin{equation*} \sum_{n=1}^\infty\frac{1}{nw(n)}<\infty \end{equation*} is necessary and sufficient for an increasing sequence $w(n)$ to be an almost everywhere unconditional convergence Weyl multiplier for an arbitrary wavelet-type system. We also prove that $\log n$ is an almost everywhere convergence Weyl multiplier for any rearranged wavelet-type system, and that this bound is optimal.
Read the full abstract ▾
Combinatorics
Partition division maps, symmetric functions and positivity
Per Alexandersson and Lilan Dai
We study a linear map on symmetric functions that “divides” a partition by a positive integer $k$, sending a Schur function indexed by a partition of $kn$ to a symmetric function indexed by partitions of $n$. We determine its Schur expansion explicitly for Schur and skew Schur functions, showing that the coefficients are enumerated by a new family of combinatorial objects, called $k$-Yamanouchi tableaux, which generalize the classical ballot (Yamanouchi) tableaux appearing in the Littlewood–Richardson rule. We also study the images of elementary symmetric functions under this map, derive the power-sum expansion of their $\omega$-images, and establish power-sum positivity. A further application establishes a connection to work of Tewodros Amdeberhan, John Shareshian, and Richard Stanley on alternating permutations and Euler numbers.
Read the full abstract ▾
Numerical Analysis
Fractional calculus via variable-transform-based spectral approximations
Xiaolin Liu and Kuan Xu
We present a novel and unifying framework for constructing spectral approximations to fractional integral operators. These spectral approximations are based on transplanted Chebyshev
polynomials, which are obtained by composing Chebyshev
polynomials with a variable transform. When an algebraic transform is used, the framework produces spectral approximations based on Jacobi fractional
polynomials. When an exponential transform is used, it yields a versatile spectral approximation that is applicable to a much broader class of fractional calculus problems. The construction of such spectral approximations is both numerically stable and optimal in terms of complexity. These spectral approximations lead to stable and fast spectral methods for fractional calculus. The spectral approximation based on the double-exponential transform is demonstrated through extensive numerical examples that are intractable for existing spectral methods.
Read the full abstract ▾
Number Theory
Additive index and Carlitz rank
Pierre-Yves Bienvenu and Arne Winterhof
We compare several complexity measures for self-mappings of finite fields. In particular, we show that Carlitz rank and additive index cannot be small simultaneously up to trivial exceptions. That is, these two measures detect cryptographic weaknesses of different classes of functions. We also study the relationship between additive index and degree or weight, respectively, complementing earlier results of Aksoy et al. and Gómez-Pérez et al. on the relationship between Carlitz rank and degree or weight, respectively. Finally, we show that a function closely related to the discrete logarithm provides an example in which all four complexity measures, degree, weight, additive index and Carlitz rank, are large.
Read the full abstract ▾
Numerical Analysis
Convergence analysis of a full discretization of operator-valued differential Riccati equations
Eskil Hansen, Tony Stillfjord and Teodor Åberg
In recent previous work [E. Hansen, T. Stillfjord and T. Åberg, SIAM J. Numer. Anal., to appear], we analyzed the convergence of operator splitting methods applied to operator-valued differential Riccati equations (DRE). In this paper, we extend these results by analyzing the convergence of a full discretization based on finite elements in space and Lie splitting in time. As far as we are aware, this is the first such analysis for DRE. There are very few analyses of temporal discretizations of DRE overall, and none of them have been combined with spatial discretizations. However, it is clearly vital to know when the full discretization converges, since this is what will be used in practical applications. Our main result is that except for logarithmic factors, the method converges with order one in time and order two in space, under fairly weak assumptions on the problem data. This is illustrated by a numerical experiment based on an application in optimal control.
Read the full abstract ▾
Algebraic Geometry
Excess logarithmic residues for foliations by curves and applications
Alana Cavalcante, Maurício Corrêa, Fernando Lourenço et al. (+1 more)
We introduce excess logarithmic residues for one-dimensional holomorphic foliations tangent to a divisor. They arise from the comparison between the logarithmic normal sheaf and the ordinary normal sheaf of the foliation, and measure the local variation between the logarithmic and classical Baum–Bott contributions. We prove a global residue formula expressing the corresponding Chern numbers as sums of local residues. We then derive a Poincaré-type bound for invariant hypersurfaces from the non-negativity of the relevant logarithmic residues. Finally, for a normal \(\mathbb Q\)-Gorenstein surface $Y$, we show that the componentwise logarithmic residues of a lifted foliation along the exceptional divisor of a functorial resolution recover the log discrepancies of the singularities of $Y$, giving a dynamical and foliated test for log canonicity of these singularities.
Read the full abstract ▾
All authors Alana Cavalcante, Maurício Corrêa, Fernando Lourenço, Elaheh Shahsavaripour
Number Theory
Congruences via Partitions with Exactly Two Part Sizes
Sittinon Jirattikansakul, Teeradej Kittipassorn, Kraiwich Kongsiri et al. (+2 more)
We prove the congruence $\sum_{1 \leq k < \sqrt{N}} \sigma_0 (N - k^2) \equiv 0 \pmod 4$, where $\sigma_0(m)$ denotes the number of positive divisors of $m$, for $N = An + B$ with $(A,B) \in \{ (16,14),$ $(36,30),$ $(72,42),$ $(196,70),$ $(252,114) \}$. Our proof relies on a result of Keith which states that $\nu_2 (N) \equiv 0 \pmod 4$, where $\nu_2(N)$ is the number of partitions of $N$ with exactly two part sizes. Inspired by Dewitt and Keith, our approach combines combinatorial arguments with modular arithmetic techniques.
Read the full abstract ▾
All authors Sittinon Jirattikansakul, Teeradej Kittipassorn, Kraiwich Kongsiri, Nitipon Moonwichit, Kirati Sriamorn
Optimization and Control
An uncertainty model for positive-valued parameters with application to robust optimization
Tatsuya Tanaka, Huimin Li, Shota Yamanaka et al. (+2 more)
Many practical optimization problems involve uncertain parameters that are strictly positive. However, the most common uncertainty sets used in robust optimization are the box and the ellipsoidal sets, which may include non-positive values when the level of uncertainty is large. This can lead to overly conservative solutions or make the corresponding robust counterpart infeasible. To overcome this, in this paper, we propose a new uncertainty-set model that not only preserves positivity but is also computationally tractable. The proposed set uses a particular convex function that measures the variation of uncertain parameters from their nominal values. We can also write the dual reformulation of the associated robust problem. For the theoretical results, we show several properties of the proposed model, including analytical bounds that guide the choice of the uncertainty level, as well as a probabilistic guarantee result. To check the validity of our proposal, we consider photovoltaic-battery operation planning problems and support vector machines in the numerical experiments. For these problems, standard uncertainty models may lead to infeasibility of the robust counterpart, while the proposed uncertainty set gives a tractable dual reformulation.
Read the full abstract ▾
All authors Tatsuya Tanaka, Huimin Li, Shota Yamanaka, Ellen H. Fukuda, Nobuo Yamashita
Operator Algebras
A finitary criterion for selfless tracial C*-algebras
Ali Jabbari
We study the class of selfless C*-probability spaces introduced by Robert. It is known that a selfless tracial
algebra has strict comparison and a unique trace. We prove that for separable tracial C*-
algebras, selflessness is equivalent to approximate selflessness, a finitary condition: for every finite set $F$, every $N \geq 1$ and $\varepsilon > 0$ there exists a
unitary $u$ with $|\tau(u^k)| < \varepsilon$ ($1 \leq |k| \leq N$) and $|\tau(w)| < \varepsilon$ for all alternating words $w$ of length $\leq N$ built from centered elements of $F$ and powers $u^n$ ($|n| \leq N$). The equivalence is established using a diagonalisation argument in the tracial ultrapower. As an application, we give a concise proof that countable groups with a topologically-free extreme boundary are C*-selfless. We also discuss the relation to nuclearity and $\mathcal{Z}$-stability.
Read the full abstract ▾
Optimization and Control · Cross-listed from q-fin.PM
Yau's Affine-Normal Descent for Large-Scale Unrestricted Higher-Moment Portfolio Optimization
Ya-Juan Wang, Yi-Shuai Niu, Artan Sheshmani et al. (+1 more)
Unrestricted mean-variance-skewness-kurtosis portfolio optimization can capture asymmetry and tail risk, but sample-moment formulations become computationally impractical when the asset universe is large: they produce dense nonconvex quartic objectives with prohibitive coskewness and cokurtosis tensors and anisotropic, ill-conditioned level sets. We develop a structure-exploiting
algorithm based on Yau's affine-normal descent that follows affine-normal directions of the current level set while working directly with the return
matrix. The method avoids explicit higher-order tensors and exploits the quartic structure for exact sample oracles, derivative evaluation, and exact line search. We also provide theory for the reduced simplex formulation, including regularity and convexity conditions that separate data-map geometry from investor preference coefficients. Computational results show a clear implementation split: a direct configuration is effective on the standard small
benchmark, whereas a preconditioned conjugate-gradient configuration with stall recovery becomes the preferred large-scale implementation by the upper end of the hundreds and remains competitive as the asset universe moves into the thousands. On a 5-minute A-share panel with 5,440 stocks, the method makes direct full-universe comparisons with exact mean-variance portfolios feasible and shows on the baseline split that the incremental value of higher moments is strongest at moderate return targets.
Read the full abstract ▾
All authors Ya-Juan Wang, Yi-Shuai Niu, Artan Sheshmani, Shing-Tung Yau
Optimization and Control
From Cursed to Competitive: Closing the ZO-FO Gap via Input-to-State Stability
Amir Ali Farzin, Philipp Braun and Iman Shames
While it is generally understood that zeroth-order (ZO)
algorithms have an extra dependency on their number of iterations for any choice of parameters, compared to their first-order (FO) counterparts, in this work, we show that under several conditions, in expectation, ZO methods do not suffer from extra dimension dependencies in their convergence rates with respect to their FO counterparts. We look at optimisation
algorithms from the dynamical systems perspective and analyse the conditions under which one can formulate the average of a ZO
algorithm as the average of its FO counterpart with bounded perturbations with values dependent on design parameters. Then, using input-to-state stability properties, we show ZO methods follow the same decay rate as their FO counterparts and converge to a neighbourhood of the fixed point of FO methods, where its radius depends on the bound of the norm of the perturbations, which can be made arbitrarily small. The theoretical findings are illustrated via numerical examples.
Read the full abstract ▾
Statistics Theory
Self-organized regime switching in null-recurrent dynamics
Johannes Brutsche, Sebastian Hahn and Angelika Rohde
Based on discrete observations $X_0,X_{\Delta},\dots, X_{n\Delta}$ for $\Delta=n^{-\gamma}$ with $\gamma\in [0,1)$ of the null-recurrent dynamic $dX_t = \sigma(X_t)dW_t$ with a Brownian motion $W$ and $\sigma(x)=\alpha\mathbb{1}\{x<\rho\} + \beta\mathbb{1}\{x\geq \rho\}$, we derive rate of convergence and limiting distribution of the profile MLE for $\rho$. This includes low-frequency asymptotics ($\gamma=0$) for which the observations form a null-recurrent Markov chain. The derived non-standard limit is the argsup over a doubly
stochastic drifted Poisson process explicitly involving the local time of oscillating Brownian motion. Its dependence on $\rho$ as well as the unknown
volatility levels $\alpha$ and $\beta$ is shown to be continuous w.r.t. the
topology of weak convergence, enabling statistical inference. Whereas this limit is independent of the sampling frequency, the profile MLE's rate of convergence equals $n^{-(1+\gamma)/2}$ and is proven to be minimax optimal. The surprising idea of the proof of the limit
theorem is to relate the long-term behavior of the null-recurrent Markov chain to the infill asymptotics on a fixed time interval. Indeed, in the very special case that $(X_t)_{t\geq 0}$ is started in the true parameter $X_0=\rho_0$, the process $(X_t-\rho_0)_{t\geq 0}$ is shown to possess a desirable distributional self-similarity. On basis of the strong Markov property, the artificial constellation of starting in $\rho_0$ is finally overcome by a coupling argument.
Read the full abstract ▾
Differential Geometry
A gerbe-like construction in gauge theory II: the case of homology tori
Mitsuyoshi Adachi
In the previous paper, the author showed that for a smooth family $X \to \mathbb{X} \to B$ of a homotopy $K3$ surface, the obstruction for the tangent bundle along the fibers $T_B \mathbb{X}$ to have a
spin structure is canonically isomorphic to the obstruction for $\mathcal{H}^+(\mathbb{X})$, the vector bundle over $B$ consisting of self-dual harmonic 2-forms, to have a
spin structure. In this paper, we show an analogous result for homology
tori with odd determinant. The strategy for proof is similar to the case of homotopy $K3$ surfaces: take the determinant line bundle of the $K$-theoretic Seiberg–Witten invariant and construct an anti-linear $\mathbb{Z}/4$-action on it at the representative level. We also see that the anti-linear $\mathbb{Z}/4$-action possesses the information of the ordinary mod 2 Seiberg–Witten invariant. This recovers part of the result by Baraglia(2023) which computes the mod 2 Seiberg–Witten invariants for any closed
spin 4-
manifold.
Read the full abstract ▾
Mathematical Physics · Cross-listed from physics.flu-dyn
The Wooding problem revisited
A. Barletta and D. A. S. Rees
The threshold conditions to convective instability in a semi-infinite porous layer saturated by a fluid are determined. The classical setup for this problem in geothermal fluid dynamics was originally modelled by Wooding in 1960. Its formulation is here reconsidered to allow for an imperfect heat transfer across the boundary, parametrised through the Biot number. The temperature boundary condition considered by Wooding is here recovered as the limit of an infinite Biot number. The linear stability analysis of the stationary boundary layer which establishes in the porous medium when a boundary steady suction occurs is carried out. Two different versions of the Rayleigh number are considered, namely, a temperature-difference-based version and a heat-flux-based version. While the former is the classical Rayleigh number for flow in porous media, the latter is a variant definition which displays a finite limit at neutral stability in both the opposite limiting cases of an infinite or of a zero Biot number.
Read the full abstract ▾
Probability
Exact Closed-Form Formulae for Linear and Circular Continuous Scan Statistics: $P_c(N - 1; N, w)$, $P_c(3; N, w)$, and $P(3; N, w)$
Haowei Yuan
The continuous linear $P(k; N, w)$ and circular scan statistics $P_c(k; N, w)$ are fundamental tools in probability and spatial statistics, frequently used to detect clustering in uniform data. Let $X_1, X_2, \dots, X_N$ be independently and uniformly distributed random variables on a unit interval or unit ring. The exact distribution of these scan statistics relies on the minimum window width required to capture exactly $k$ points. Furthermore, the survival function $1 - P_c(k; N, w)$ directly corresponds to the
geometric probability that if $N$ arcs of length $1 - w$ are uniformly and randomly placed on a unit circle, every point on the circle is covered at least $N + 1 - k$ times. Historically, evaluating the exact cumulative distribution functions, $P(k; N, w)$ and $P_c(k; N, w)$, relies heavily on complex recursive approximations. In this paper, we bypass these traditional recursive methods to derive direct, generalized closed-form expressions for some linear and circular continuous scan statistics. Specifically, we present the exact analytical solutions for $P_c(N - 1; N, w)$, $P_c(3; N, w)$, and $P(3; N, w)$ for arbitrary values of $N$ and window width $w$. These newly derived closed-form expressions not only provide exact baseline distributions for extreme spacings but also significantly simplify computational complexity compared to existing iterative approaches.
Read the full abstract ▾
Optimization and Control
Handling Overtime Constraints in Mixed Integer Linear Programming for Surgical Scheduling: A Comparison of Neural Network and Classical Linearization Techniques
Cindy Pistorius and J. Theresia van Essen
Uncertainty in surgery durations continues to be difficult to account for in operating room scheduling. In particular, it remains complex to accurately incorporate uncertainty in
surgical overtime constraints within mixed-integer linear programming (MILP) models. Therefore, we propose a method that integrates feedforward neural networks (FNNs) into MILP models to approximate the total surgery duration in these overtime constraints. The proposed approach is evaluated using real-life hospital data and compared against two classical approaches: scenario-based modelling and piecewise linear function approximations. We demonstrate that with a relatively small FNN, we achieve competitive operating room schedules in terms of both solution quality and computational performance. The FNN-based approach is the most computationally efficient with an optimality gap lower than 2% in all cases, achieves the highest operating room utilization in six out of eight considered cases, and on average produces simulated overtime probabilities closest to the predefined target.
Read the full abstract ▾
Information Theory
On the Minimum Distances of Some Families of Goppa Codes and BCH Codes
Yaqi Chen, Hao Chen, Cunsheng Ding et al. (+1 more)
Goppa codes form an important class of alternant codes with wide applications in algebraic coding theory and code-based cryptography. Determining the true minimum distance of a Goppa code is a difficult problem. In this paper, we provide a necessary and sufficient criterion for a Goppa code to attain its designed distance $\delta=t+1$, where $t$ is the degree of the Goppa
polynomial. As applications, we determine the minimum distances of several classes of $q$-ary Goppa codes. In particular, we prove the tightness of the improved lower bound for a class of wild Goppa codes, and extend the family with $G(x)=x^t+A$ from the binary case to arbitrary odd
prime powers. We then specialize the criterion to the monomial case $G(x)=x^t$, which is equivalent to primitive BCH codes. This leads to several infinite families of primitive BCH codes with $d=\delta$, including the binary codes $\mathbf{C}_{(2,2^m-1,9,1)}$ and $\mathbf{C}_{(2,2^m-1,15,1)}$, the family $\mathbf{C}_{(p,p^p-1,2p+2,1)}$ with an odd
prime $p$ and the family $\mathbf{C}_{(q,q^m-1,r\frac{q^m-1}{q-1}+1,1)}$ with $r\mid q-1$. In particular, we prove that the primitive BCH code $\mathbf{C}_{(q,q^m-1,q^t+1,1)}$ has minimum distance $q^t+1$ under the condition $t\mid m$, improving the previously known condition $pt\mid m$.
Read the full abstract ▾
All authors Yaqi Chen, Hao Chen, Cunsheng Ding, Huimin Lao