Combinatorics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Thursday 19 March
A polyform is a planar figure formed by gluing congruent regular polygons along entire edges. We study polyforms in hyperbolic ${p,q}$-tessellations and the extremal problem of minimizing the number of tiles needed to realize exactly $h$ holes. Denoting this minimum by $g_{p,q}(h)$, we establish general lower and upper bounds, compute exact values in several small cases, and give a sufficient structural condition for a polyform to have $h$ holes and $g_{p,q}(h)$ tiles.
Optimization and Control
Robust mean-field games under entropy-based uncertainty
In this article, we introduce a new class of entropy-penalized robust mean field game problems in which the representative agent is opposed to Nature. The agent's objective is formulated as a min-max stochastic control problem, in which Nature distorts the reference probability measure at an entropic cost. As a consequence, the distribution of the continuum of agents represented by the player is given by the effective measure induced by Nature. Existence of a mean-field game equilibrium is established via a Schauder fixed point argument. To ensure uniqueness, we introduce a joint flat anti-monotonicity and displacement monotonicity condition, extending the classical Lasry-Lions monotonicity framework. Finally, we present two classes of N -player games for which the mean-field game limit yields $\epsilon$-Nash equilibria.
Read the full abstract
Geometric Topology
Local Knots, $\nu^+$-Sharp Knots, and Rational Slice Genus
Hom and Wu introduced the knot concordance invariant $\nu^{+}$ for knots in $S^{3}$ and proved that it gives a lower bound for the slice genus. Wu and Yang extended $\nu^{+}$ to knots in rational homology $3$-spheres, where it gives a lower bound for the rational slice genus, an analogue of the slice genus for knots in rational homology $3$-spheres. We call a knot $\nu^{+}$-sharp if this bound is realized as an equality. An open question asks whether a local knot in a $3$-manifold $Y$, that is, a knot contained in a $3$-ball, can bound a surface of smaller genus in $Y\times I$ than in $S^{3}\times I$. Using the Heegaard Floer invariant $\nu^+$, we show that this does not occur for local knots arising from $\nu^+$-sharp knots: if $K\subset S^3$ is $\nu^+$-sharp and $Y$ is a rational homology $3$-sphere, then the induced local knot in $Y$ has rational slice genus equal to the slice genus of $K$. The proof proceeds by establishing an additivity result for the rational slice genus.
Read the full abstract
Dynamical Systems
Periodicity and Rotation Number for Random Circle Homeomorphisms
We study discrete-time random dynamical systems where each fibre map is an orientation-preserving homeomorphism of the circle. We prove that the existence of a random periodic cycle with period at least two implies that the random rotation number is rational almost surely. Moreover, in clear contrast with the deterministic setting, we demonstrate that a common fixed point for the fibre maps does not imply that the random rotation number is an integer. Conversely, we show that if the mean random rotation number is an integer, then the fibre maps have a fixed point with positive probability.
Read the full abstract
Mathematical Physics
Radiation damping of the soliton internal mode in 1D quadratic Klein-Gordon equation
We study long-time dynamics of small even perturbations of the soliton in 1D quadratic Klein-Gordon equation. The soliton possesses both an internal mode and the unstable mode. On a codimension-one manifold of fine-tuned initial data the instability is suppressed and the internal mode decays slowly by transferring energy into the continuum. We show that this decay and the associated nonlinear frequency shift are accurately captured by a cubic resonant approximation, with the damping rate determined by a Fermi golde rule-type coefficient. This provides a quantitative description of irreversible energy transfer from the internal mode to dispersive radiation.
Read the full abstract
Statistics Theory
Sometimes nonparametrics beat parametrics, even when the model is right
A basic issue in both teaching of and practice of statistics is the interplay between modelling assumptions and inference performance. The general message conveyed is that stronger assumptions lead to better statistical performance of the relevant estimators, tests and confidence intervals, provided that these assumptions hold. On the other hand, fewer assumptions often lead to safer and more robust methods that are good also outside narrow conditions, but not quite as good as specialist methods that exploit such narrower conditions, if these are fulfilled. This interplay is nicely illustrated in the context of density estimation, where parametric and nonparametric methods can be contrasted. The parametric ones have mean squared errors of size $O(n^{-1})$ in terms of sample size $n$ if the parametric model is right, but are not even consistent outside the model. The nonparametric methods are everywhere consistent and have mean squared errors of size $O(n^{-4/5})$ for broad classes of estimands. The point we are making here is that this picture is not universally true! We show that a simple kernel density estimator can perform better than a directly estimated parametric density on the latter's home turf, for small sample sizes, in the sense of mean integrated squared error. Our main example is that of estimating an unknown normal density. In the process of developing and discussing this somewhat counter-intuitive and half-paradoxical example we touch on several tangential issues of interest, pertaining to exact small-sample analysis of density estimators.
Read the full abstract
General Topology
Furtherness in finite topological spaces
In this paper, we introduce a novel distance-like notion of furtherness for finite topological spaces, demonstrating that every finite space can be viewed as an asymmetric pseudometric space. In particular, we show that every finite T0 space is asymmetric metric space. The topology induced by the forward balls coincides with the original topology of the space, while the backward balls induce the opposite topology. To capture essential information about each finite space, we construct a furtherness Matrix, which gives significant structural details of the finite space. As an application, we introduce the notion of center and radius of subsets of finite topological spaces.
Read the full abstract
Number Theory
Close fields, affine Springer fibers and fundamental lemmas
We prove a geometric local constancy theorem for affine Springer fibers in families of close local fields. Consequently, stable orbital integrals are locally constant in these families, and both the base change fundamental lemma and the standard endoscopic fundamental lemma transfer from characteristic zero to arbitrary positive characteristic.
Read the full abstract
Information Theory
Some structural properties of mixed orthogonal arrays and their irredundancy
Mixed (asymmetric) orthogonal arrays (MOAs) generalize classical orthogonal arrays by allowing columns over different alphabets. However, their study requires very different structural tools than those used for symmetric orthogonal arrays (OAs), since several key features of the symmetric setting are no longer available in the mixed case, including Euclidean duality, a unique global index, and certain classical bounds. In this paper, we establish three structural results for mixed orthogonal arrays. First, we prove a Singleton-type upper bound and obtain a characterization of MDS and almost-MDS mixed orthogonal arrays. Second, we introduce a trace duality for $\mathbb{F}_q$-linear MOAs over $\prod_{i=1}^{s} \mathbb{F}_{q^{n_i}}$ and establish a correspondence with $\mathbb{F}_q$-linear error-block codes that determines the strength of the MOA via the dual distance of the associated error-block code. Finally, we develop a structural theory of irredundant mixed orthogonal arrays (IrMOAs), motivated by their role in the construction of $t$-uniform and absolutely maximally entangled (AME) quantum states. In the extremal case $t=\lfloor s/2\rfloor$, we prove that $\mathbb{F}_q$-linear IrMOAs with minimum index $1$ (yielding AME states of minimal support) are equivalent to $\mathbb{F}_q$-linear error-block MDS codes.
Read the full abstract
Combinatorics
The typical structure of oriented graphs and digraphs with forbidden blow-up of transitive tournaments
We study the typical structure of oriented graphs and digraphs that do not contain a blow-up T_{r+1}^t of a transitive tournament. For any integers r >= 2, t >= 1 and any real a in (3/2,2], we prove that almost all T_{r+1}^t-free oriented graphs and almost all T_{r+1}^t-free digraphs are r-partite. This extends the results of Kuhn, Osthus, Townsend and Zhao (2017) on forbidden transitive tournaments to their blow-ups, thereby confirming a generalised form of Cherlin's conjecture. Our proof combines the hypergraph container method, a weighted analogue of the Erdos-Stone theorem for digraphs, and a stability analysis for near-extremal T_{r+1}^t-free digraphs. The core of the proof is the interplay between the directed regularity lemma and an embedding lemma, which together provide a rigorous bridge from macroscopic extremal conditions to microscopic concrete structures.
Read the full abstract
Combinatorics
Almost all $C_k$-free oriented graphs have $\Theta(n)$ backwards edges
We prove a conjecture of Kühn, Osthus, Townsend and Zhao \cite{kuhn2017structure} stating that almost every $C_k$-free oriented graph on $n$ vertices has $\Theta(n)$ backwards edges in a transitive-optimal ordering. The same holds for $C_k$-free digraphs when $k$ is even. Our proof combines the hypergraph container method with a stability analysis and an inductive counting argument. As a byproduct, we also determine the typical structure of oriented graphs and digraphs that avoid the blow-up $C_{k}^t$, extending the main result of \cite{kuhn2017structure} to the blown-up setting.
Read the full abstract
Optimization and Control
Learning Decision-Sufficient Representations for Linear Optimization
We study how to construct compressed datasets that suffice to recover optimal decisions in linear programs with an unknown cost vector $c$ lying in a prior set $\mathcal{C}$. Recent work by Bennouna et al. provides an exact geometric characterization of sufficient decision datasets (SDDs) via an intrinsic decision-relevant dimension $d^\star$. However, their algorithm for constructing minimum-size SDDs requires solving mixed-integer programs. In this paper, we establish hardness results showing that computing $d^\star$ is NP-hard and deciding whether a dataset is globally sufficient is coNP-hard, thereby resolving a recent open problem posed by Bennouna et al. To address this worst-case intractability, we introduce pointwise sufficiency, a relaxation that requires sufficiency for an individual cost vector. Under nondegeneracy, we provide a polynomial-time cutting-plane algorithm for constructing pointwise-sufficient decision datasets. In a data-driven regime with i.i.d.\ costs, we further propose a cumulative algorithm that aggregates decision-relevant directions across samples, yielding a stable compression scheme of size at most $d^\star$. This leads to a distribution-free PAC guarantee: with high probability over the training sample, the pointwise sufficiency failure probability on a fresh draw is at most $\tilde{O}(d^\star/n)$, and this rate is tight up to logarithmic factors. Finally, we apply decision-sufficient representations to contextual linear optimization, obtaining compressed predictors with generalization bounds scaling as $\tilde{O}(\sqrt{d^\star/n})$ rather than $\tilde{O}(\sqrt{d/n})$, where $d$ is the ambient cost dimension.
Read the full abstract
Algebraic Topology
Borsuk-Ulam type theorem for Stiefel manifolds and orthogonal mass partitions
We prove a Borsuk–Ulam-type zero theorem for the Stiefel manifold $V_{n,k}$ with the free action of the hyperoctahedral group $B_k=(\mathbb{Z}/2)^k\rtimes S_k$. The theorem gives a nonvanishing criterion for explicit polynomials in ${R}_{n,k}=\mathbb{F}_2[a_1,\ldots,a_k]/(a_1^n,a_2^{n-1},\ldots,a_k^{n-k+1})$. We apply this criterion to equipartitions by mutually orthogonal hyperplanes. If $(P_{k,n})^m\ne0$ in ${R}_{d,k}=\mathbb{F}_2[a_1,\ldots,a_k]/(a_1^{d+1},a_2^d,\ldots,a_k^{d-k+2})$, then any $m$ finite Borel measures in $\mathbb{R}^d$ that vanish on affine hyperplanes admit $k$ mutually orthogonal hyperplanes such that every $n$-element subfamily divides each measure into $2^n$ equal parts. For the least possible dimension $\Delta^*(m,k,n)$, we obtain general lower bounds and prove upper bounds in several cases. These give exact values, including $\Delta^*(2^j-1,k,2)=2^{j-1}(k+1)-1$ for all $j\ge1$ and $k\ge2$. In the case $n=k$, the upper bound of Mani-Levitska, Vrećica, and Zivaljević [18], originally obtained without an orthogonality requirement, remains valid under the stronger requirement that all $k$ hyperplanes be mutually orthogonal.
Read the full abstract
Combinatorics
A container theorem for general digraphs with forbidden subdigraphs
In a seminal work, Kühn, Osthus, Townsend, and Zhao used the hypergraph container method to determine the typical structure of oriented graphs and digraphs avoiding a fixed tournament or cycle. Their main tool, a container theorem for oriented graphs, does not directly extend to all digraphs due to the existence of counterexamples such as the double triangle $DK_3$. In this paper we prove a container theorem for general digraphs under a natural sparsity condition. For the edge-weight parameter $a=2$, this condition permits digraphs with $2$-cycles (density at most $1$) but excludes denser obstructions like $DK_3$; for larger $a$ it allows digraphs with a controlled density of $2$-cycles. As applications, we obtain asymptotic counting results for $H$-free digraphs and describe the typical structure of digraphs avoiding a fixed digraph $H$ satisfying our condition. Our results unify and extend several previous results in the area.
Read the full abstract
Combinatorics
A weighted cycle-localization inequality
In 1959, Erdős and Gallai showed that every $2$-connected graph $G$ contains a cycle of length at least $\frac{2|E(G)|}{|V(G)|-1}$. This result was subsequently extended to weighted graphs by Bondy and Fan in 1991. A natural local variant of this problem arises by considering, for each edge $e\in E(G)$, the quantity $c(e)$, defined as the length of the longest cycle in $G$ containing $e$ (with $c(e)=2$ if $e$ is a bridge). Zhao and Zhang recently proved that for every graph $G$ on $n$ vertices satisfies $\sum_{e\in E(G)}\frac{1}{c(e)}\le \frac{n-1}{2}.$ In this note, we establish a weighted generalization of this inequality. For a weighted graph $(G,w)$ with positive edge weights, let $C_w(e)$ denote the maximum weight of a cycle containing $e$ (setting $C_w(e)=2w(e)$ if $e$ is a bridge). We prove that $$ \sum_{e\in E(G)}\frac{w(e)}{C_w(e)}\le \frac{n-1}{2}. $$ Our result can be viewed as a weighted local analogue of the Bondy-Fan theorem, thereby establishing a correspondence between the global and local perspectives. Furthermore, we present a broad class of graphs attaining equality and derive necessary conditions for equality.
Read the full abstract
Complex Variables
On the univalence criteria for elliptic polyharmonic and polyelliptic-harmonic mappings
In this paper, we first establish Landau-Bloch-type theorems for poly $(K,K')$-elliptic harmonic mappings, which are sharp in some given cases. Thereafter, we provide several coefficient bounds for $(K,K')$-elliptic and $K$-quasiregular polyharmonic mappings with bounded minimum distortion. Furthermore, using these coefficient bounds, we establish Landau-Bloch-type theorems for these mappings.
Read the full abstract
Complex Variables
Integral formulas and Hodge decomposition in the theory of generalized partial-slice mo-nogenic functions
This paper explores generalized slice monogenic functions by introducing their operator symbols, representation formula, and integral formula. The study extends the Teodorescu transform to a broader class of theorems and inferences, providing new analytical tools for function theory in this setting. Additionally, the Hodge decomposition is established, providing a foundation for further research.
Read the full abstract
Numerical Analysis
Born-Preconditioned Learning for Iterative Neural PDE Solvers
Simulating high-frequency waves in spatially varying media remains challenging for both classical iterative methods and neural PDE solvers. We propose Neural Preconditioned Born Series (NPBS), a framework for learning iterative neural PDE solvers. Our guiding idea is to use a simple reference preconditioner to help learn a more effective neural preconditioner. Building on the Convergent Born Series (CBS), NPBS feeds a preconditioned residual to a neural network that predicts a solution update. We train the network to reduce the preconditioned residual after each update. The same reference preconditioner is used for the network input and the loss, giving a metric-matched training objective. Experiments on heterogeneous Helmholtz problems show reduced iteration counts across neural architectures and larger gains at higher wavenumbers. Within a Krylov solver, NPBS achieves the lowest wall-clock time in the evaluated solver comparison. The framework also extends naturally to three-dimensional problems. The same metric-matched formulation also improves convergence on convection-diffusion-reaction systems and Newton linear systems for nonlinear PDEs, indicating that NPBS provides a general framework for learning neural preconditioners.
Read the full abstract
Combinatorics
Spectral radius and rainbow $k$-factors in a bipartite graph family
Let $\mathcal{G}=\{G_1, G_2, \ldots , G_{kn}\}$ be a family of balanced bipartite graphs on the same vertex set $[2n]$. A rainbow $k$-factor of $\mathcal{G}$ is defined as a $k$-factor such that any two distinct edges come from different graphs in $\mathcal{G}.$ In this paper, we provide a tight sufficient condition in terms of the spectral radius for a family of balanced bipartite graphs $\mathcal{G}$ to contain a rainbow $k$-factor. Furthermore, we completely characterize the corresponding spectral extremal graph.
Read the full abstract
Number Theory
Norm-trace and Kloosterman sums in finite semi-simple algebras
An asymptotic formula with a square root error term is obtained for the number of elements with given trace and norm in a finite semisimple algebra over a finite field. This extends previous results from finite etale algebras (commutative case) to finite semi-simple algebras (non-commutative case). The main idea is to apply the Eichler formula for Gauss sums over the general linear group and the Hasse-Davenport relation to reduce the problem to the classical geometric case where the result is known to be true. As an application of this reduction, we also obtain a square root estimate for Kloosterman sums over semi-simple algebras. Similar square root estimates are discussed when norm-trace is replaced by product-trace, leading to a new conjecture on product-trace counting over finite semi-simple algebras.
Read the full abstract
Statistics Theory
Approximation by mixtures of multivariate Erlang distributions
We prove that finite multivariate Erlang mixture densities with a common rate parameter are dense in the class of probability densities on $\mathbb{R}_{+}^{d}$ that belong to $L^{p}$, for every dimension $d\in\mathbb{N}$ and every $1\le p<\infty$. The argument is constructive: the one-dimensional Szász–Mirakjan–Kantorovich operator yields Erlang mixture approximations, and its tensor product yields multivariate approximants with a common scale. We then obtain several quantitative consequences. These include compact-set uniform approximation bounds and, under local Hölder conditions of order $\alpha\in(0,1]$, rates of order $n^{-\alpha/2}$ as the common scale $1/n$ tends to zero, whole-domain convergence in weighted sup norms, weighted and unweighted $L^{p}$ rates, and explicit rates for finite mixtures indexed by the number of mixture components. In particular, if the approximating density is required to have at most $K$ mixture components, then on fixed compact cubes we obtain an algebraic rate of order $K^{-\alpha/(2d)}$; in global weighted sup norms we obtain the explicit algebraic component-count rate $K^{-\alpha/[2d(2d+\alpha)]}$; and for $1<p<\infty$ we obtain corresponding weighted $L^{p}$ component-count rates. The results strengthen the weak-approximation theory for multivariate Erlang mixture distributions and yield immediate corollaries for broader classes such as product-gamma mixtures. \noindentKeywords: multivariate Erlang mixtures; Erlang distributions; Szász–Mirakjan–Kantorovich operator; density approximation; weighted $L^{p}$ approximation; approximation rates.
Read the full abstract
Differential Geometry
Homogeneous Sobolev gradient flow of the length functional
The well-known curve shortening flow can be formulated as the gradient flow of the length functional on the space of immersed closed planar curves, where the gradient is taken with respect to a reparametrisation-invariant $L^2$ Riemannian metric. This metric is degenerate, giving a geodesic distance of zero between any two curves. We instead consider a family of Sobolev $H^1$ metrics depending on two parameters $\lambda>0$ and $a\in \mathbb R$, where $\lambda$ sets the weight of the first-derivative term, and $a$ indexes a length normalisation which ensures that the metric is scale-homogeneous. For each such metric, the gradient of length can be written explicitly in terms of a convolution with respect to normalised arc length against the periodic Green's function of $(\lambda^2 \partial_x^2-1)$. The associated evolution is a reparametrisation invariant nonlocal ODE whose right-hand side is well-defined even on curves that are not immersed. Working in the optimal low-regularity setting $W^{1,1}(\mathbb S,\mathbb R^2)$, we prove local well-posedness using the Picard–Lindelöf theorem and convergence to constant maps in finite time when $a<2$, and as $t\to\infty$ when $a\geq 2$. This behaviour is exhibited by round circles, which evolve self-similarly and collapse at an explicit time. We further prove that if the initial curve is an immersion, $C^1$, $C^2$, or bounds a strictly convex set, then each of these properties is preserved along the flow.
Read the full abstract
Optimization and Control
Computationally Efficient Density-Driven Optimal Control via Analytical KKT Reduction and Contractive MPC
Efficient coordination for collective spatial distribution is a fundamental challenge in multi-agent systems. Prior research on Density-Driven Optimal Control (D2OC) established a framework to match agent trajectories to a desired spatial distribution. However, implementing this as a predictive controller requires solving a large-scale Karush-Kuhn-Tucker (KKT) system, whose computational complexity grows cubically with the prediction horizon. To resolve this, we propose an analytical structural reduction that transforms the T-horizon KKT system into a condensed quadratic program (QP). This formulation achieves O(T) linear scalability, significantly reducing the online computational burden compared to conventional O(T^3) approaches. Furthermore, to ensure rigorous convergence in dynamic environments, we incorporate a contractive Lyapunov constraint and prove the Input-to-State Stability (ISS) of the closed-loop system against reference propagation drift. Numerical simulations verify that the proposed method facilitates rapid density coverage with substantial computational speed-up, enabling long-horizon predictive control for large-scale multi-agent swarms.
Read the full abstract
Statistics Theory
The minimax optimal convergence rate of posterior density in the weighted orthogonal polynomials
We investigate Bayesian nonparametric density estimation via orthogonal polynomial expansions in weighted Sobolev spaces. A core challenge is establishing minimax optimal posterior convergence rates, especially for densities on unbounded domains without a strictly positive lower bound. For densities bounded away from zero, we give sufficient conditions under which the framework of \cite{shen2001} applies directly. For densities lacking a positive lower bound, the equivalence between Hellinger and weighted $L_2$-norm distance fails, invalidating the original theory. We propose a novel shifting method that lifts the true density $g_0$ to a sequence of proxy densities $g_{0,n}$. We prove a modified convergence theorem applicable to these shifted densities, preserving the optimal rate. We also construct a Gaussian sieve prior that achieves the minimax rate $\varepsilon_n=n^{-p/(2p+1)}$ for any integer $p\geq1$. Numerical results confirm that our estimator approximates the true density well and validates the theoretical convergence rate.
Read the full abstract
Combinatorics
There are many 5-holes
Given a set P of points on the plane, a polygon with vertices in P is said to be empty if it contains no element of P in its interior. We show that every set of n points in general position on the plane determines at least $\Omega(n^{20/11})$ empty convex pentagons (also known as 5-holes). This result improves upon the previous bound of $\Omega(n\cdot(\log n)^{4/5})$ obtained by Aicholzer et al. [JCT A, 2020], and significantly narrows the gap with respect to the conjectured $\Omega(n^2)$ lower bound (which, if true, would be tight). Unlike some of the other works in this line of research, our proof does not require computer assistance.
Read the full abstract
Optimization and Control · Cross-listed from stat.ML
Precise Performance of Linear Denoisers in the Proportional Regime
In the present paper we study the performance of linear denoisers for noisy data of the form $\mathbf{x} + \mathbf{z}$, where $\mathbf{x} \in \mathbb{R}^d$ is the desired data with zero mean and unknown covariance $\mathbf{\Sigma}$, and $\mathbf{z} \sim \mathcal{N}(0, \mathbf{\Sigma}_{\mathbf{z}})$ is additive noise. Since the covariance $\mathbf{\Sigma}$ is not known, the standard Wiener filter cannot be employed for denoising. Instead we assume we are given samples $\mathbf{x}_1,\dots,\mathbf{x}_n \in \mathbb{R}^d$ from the true distribution. A standard approach would then be to estimate $\mathbf{\Sigma}$ from the samples and use it to construct an “empirical" Wiener filter. However, in this paper, motivated by the denoising step in diffusion models, we take a different approach whereby we train a linear denoiser $\mathbf{W}$ from the data itself. In particular, we synthetically construct noisy samples $\hat{\mathbf{x}}_i$ of the data by injecting the samples with Gaussian noise with covariance $\mathbf{\Sigma}_1 \neq \mathbf{\Sigma}_{\mathbf{z}}$ and find the best $\mathbf{W}$ that approximates $\mathbf{W}\hat{\mathbf{x}}_i \approx \mathbf{x}_i$ in a least-squares sense. In the proportional regime $\frac{n}{d} \rightarrow \kappa > 1$ we use the Convex Gaussian Min-Max Theorem (CGMT) to analytically find the closed form expression for the generalization error of the denoiser obtained from this process. Using this expression one can optimize over $\mathbf{\Sigma}_1$ to find the best possible denoiser. Our numerical simulations show that our denoiser outperforms the “empirical" Wiener filter in many scenarios and approaches the optimal Wiener filter as $\kappa\rightarrow\infty$.
Read the full abstract
Numerical Analysis
Resolving the Blow-Up: A Time-Dilated Numerical Framework for Multiple Firing Events in Mean-Field Neuronal Networks
In large-scale excitatory neuronal networks, rapid synchronization manifests as {multiple firing events (MFEs)}, mathematically characterized by a finite-time blow-up of the neuronal firing rate in the mean-field Fokker-Planck equation. Standard numerical methods struggle to resolve this singularity due to the divergent boundary flux and the instantaneous nature of the population voltage reset. In this work, we propose a robust {multiscale numerical framework based on time dilation}. By transforming the governing equation into a dilated timescale proportional to the firing activity, we desingularize the blow-up, effectively stretching the instantaneous synchronization event into a resolved mesoscopic process. This approach is shown to be physically consistent with the {microscopic cascade mechanism} underlying MFEs and the system's inherent fragility. To implement this numerically, we develop a hybrid scheme that utilizes a {mesh-independent flux criterion} to switch between timescales and a semi-analytical “moving Gaussian” method to accurately evolve the post-blowup Dirac mass. Numerical benchmarks demonstrate that our solver not only captures steady states with high accuracy but also efficiently reproduces periodic MFEs, matching Monte Carlo simulations without the severe time-step restrictions associated with particle cascades.
Read the full abstract
Optimization and Control
Modeling Adversarial Wildfires for Power Grid Disruption
Electric power infrastructure faces increasing risk of damage and disruption due to wildfire. Operators of power grids in wildfire-prone regions must consider the potential impacts of unpredictable fires. However, traditional wildfire models do not effectively describe worst-case, or even high-impact, fire behavior. To address this issue, we propose a mixed-integer conic program to characterize an adversarial wildfire that targets infrastructure while respecting realistic fire spread dynamics. We design a wind-assisted fire spread set based on the Rothermel fire spread model and propose principled convex relaxations of this set, including a new relaxation of the inner product over Euclidean balls. We present test cases derived from the recent Park, Eaton, and Palisades fires in California and solve models to identify the minimum time-to-outage of multiple-element contingencies and the maximum load shed associated with a sequence of element outages caused by a realistic wildfire. We use the minimum time-to-outage values to screen contingencies and construct security-constrained optimal power flow models that promote operational resilience against wildfire.
Read the full abstract
Combinatorics
A Generalized Supercongruence of Z.-W. Sun
In this paper, we employ the Wilf-Zeilberger (WZ) method to prove a supercongruence conjecture posed by Z.-W. Sun: for any prime $p$, \begin{align*} \sum_{k=0}^{\frac{p-3}{2}}\frac{92k^2+61k+9}{(2k+1)64^k}{2k \choose k}{3k \choose k}{4k \choose 2k}\equiv 6p+16p^2\left(\frac{-1}{p}\right) \pmod{p^3}, \end{align*} where $\left(\frac{\cdot}{p}\right)$ denotes the Legendre symbol. Our proof relies on combinatorial identities and symbolic summation techniques.
Read the full abstract
Optimization and Control
Axis-Aligned Relaxations for Mixed-Integer Nonlinear Programming
We present a novel relaxation framework for general mixed-integer nonlinear programming (MINLP) grounded in computational geometry. Our approach constructs polyhedral relaxations by convexifying finite sets of strategically chosen points, iteratively refining the approximation to converge toward the simultaneous convex hull of factorable function graphs. The framework is underpinned by three key contributions: (i) a new class of explicit inequalities for products of functions that strictly improve upon standard factorable and composite relaxation schemes; (ii) a proof establishing that the simultaneous convex hull of multilinear functions over axis-aligned regions is fully determined by their values at corner points, thereby generalizing existing results from hypercubes to arbitrary axis-aligned domains; and (iii) the integration of computational geometry tools, specifically voxelization and QuickHull, to efficiently approximate feasible regions and function graphs. We implement this framework and evaluate it on randomly generated polynomial optimization problems and a suite of 619 instances from MINLPLib. Numerical results demonstrate significant improvements over state-of-the-art benchmarks: on polynomial instances, our relaxation closes an additional 20–25% of the optimality gap relative to standard methods on half the instances. Furthermore, compared against an enhanced factorable programming baseline and Gurobi's root-node bounds, our approach yields superior dual bounds on approximately 30% of MINLPLib instances, with roughly 10% of cases exhibiting a gap reduction exceeding 50%.