Optimization and Control
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Friday 20 March
Many recent proposals for reducing tanking in draft lotteries share a common structure: losses improve draft position early in the season while wins improve draft position later. While such systems improve late-season incentives, they retain a predictable pivot point that tanking teams can exploit strategically. This paper proposes a simple modification that introduces uncertainty into the timing of the incentive switch. The proposed metric, the Realized Elimination Wins Determinant (REWIND), ranks teams according to the number of wins obtained after their ex post elimination date, which makes this a variation of the Gold Plan. Because the ex post elimination date cannot be known with certainty during the season, the mechanism weakens incentives for strategic losing while preserving incentives for competitive effort after elimination. Moreover, the ex post elimination date is typically earlier than other proposed pivot points, so there is a longer period where a tanking team's best strategy is to win. The Ex Post Gold plan uses the REWIND metric to create a simple system where every team will be incentivized to win at least half of their games in most seasons.
Analysis of PDEs
An eigenvalue problem for a nonlocal quasilinear anisotropic equation in fractional Orlicz Sobolev spaces without the $\Delta_2$–condition
In this paper we analyze an eigenvalue problem associated to fractional operators of the form \[ L_a^s u(x)=2 \text{p.v.}\int_{\mathbb{R}^n}a(x,y,D^su(x,y))\,\frac{dy}{|x-y|^{n+s}},\] which represents a generalization model for nonlocal, nonstandard growth diffusion problems. We study this problem in the context of the fractional Orlicz Sobolev spaces without assuming the so-called $\Delta_2$–condition on the Young functions involved. We show existence of a sequence of eigenpairs $(u_k,\lambda_k)\to (0,+\infty)$.
Read the full abstract
Number Theory
A Wasserstein metric approach to generalized Skewes' numbers. I. Prime number races
We study generalized Skewes' numbers, which are the locations of the first sign change between two comparable prime counting functions. In the context of the race between quadratic residues and quadratic nonresidues, we construct sequences of highly composite moduli $q$ such that those Skewes' numbers grow very rapidly in some sense. This disproves unconditionally a conjecture of Fiorilli. In the other direction, assuming the Generalized Riemann Hypothesis and an effective linear independence hypothesis, we establish conditional upper bounds for generalized Skewes' numbers. Our approach relies on a quantitative Kronecker-Weyl theorem formulated in terms of the $1$-Wasserstein metric to obtain explicit rates for the convergence to the limiting distributions in these races.
Read the full abstract
Numerical Analysis
A new comparison principle for discrete Volterra equations with an application to convex sweeping processes with infinite delays
Comparison principles for Volterra equations play a role analogous to maximum principles in PDEs: they provide positivity and stability information on the solution and allow one to control the output of bounded inputs. In the continuous setting, such results often rely on Laplace-transform or spectral methods (see Gripenberg, Londen, and Staffans, Volterra Integral and Functional Equations, 1990). However, these tools are not uniform in the discretization step $h$ hence fail in discrete or semi-discrete approximations. The present note introduces a resolvent-free argument yielding uniform $L^\infty(0,T)$-bounds for non-negative kernels. Compactness is a key ingredient in order to show existence of sweeping processes. While in the classical framework it is well established, adding an infinite distribution of delays complicates greatly the obtaining of such a result. In a first step we show a general energy decay estimate, which is then used to establish compactness. The argument is carried out in the discrete setting and that necessitates the introduction of the new comparison principle. In the classical sweeping process the previous position of the particle lies on the boundary of the constraint set, staying $O(h)$ close to the next projection point ($h$ is the discretization step). Our delay model projects the particle's averaged (by a unit measure kernel) past positions to the constraint set. Numerical simulations show that the projected point can lie at $O(1)$ distance from the convex set's boundary.
Read the full abstract
Combinatorics
Colouring bijections of finite $3$-groups
Let $G$ be a finite group. A bijection $\sigma\colon G\to G$ is a colouring bijection if the three maps \[ \Delta^{+}\colon x\mapsto x\,\sigma(x), \qquad \Delta^{-}\colon x\mapsto x^{-1}\sigma(x), \qquad \Delta^{c}\colon x\mapsto \sigma(x)^{-1}x\,\sigma(x) \] are again bijections of $G$. The first two conditions say that $\sigma$ is a strong complete mapping. The third is a genuinely nonabelian requirement. Our main theorem is that every noncyclic $3$-group not isomorphic to the modular group $M_{3^{r}}$ $(r\ge4)$ admits a colouring bijection. This is the exact analogue, for colouring bijections, of the theorem of Akhtar and Gagola on strong complete mappings. The notion has three equivalent readings. A colouring bijection properly colours the Cayley graph $\mathscr{G}_3(G)=Cay(G^{3},\mathbf S_3)$ with $|G|$ colours. It determines a triple of mutually orthogonal translation Latin squares based on $G$. In the orthomorphism graph of $G$ that triple is a triangle through the Cayley table. It also determines a common transversal of three arrays attached to $G$. These are the multiplication table, the division table, and the operation table of the conjugation quandle. The last of them is not a Latin square. Two consequences follow. Every noncyclic $3$-group $G\not\cong M_{3^{r}}$ $(r\ge4)$ carries three mutually orthogonal Latin squares of order $|G|$ based on $G$. Moreover $\chi(\mathscr{G}_3(G))=|G|$ for every such group.
Read the full abstract
Statistics Theory
Inference in high-dimensional logistic regression under tensor network dependence
We investigate the problem of statistical inference for logistic regression with high-dimensional covariates in settings where dependence among individuals is induced by an underlying Markov random field. Going beyond the pairwise interaction models such as the Ising model, we consider a framework to accommodate more general tensor structures that capture higher-order dependencies. We develop a two-step procedure for low-dimensional linear and quadratic functionals. The first step constructs a regularized maximum pseudolikelihood estimator, for which we establish consistency under high-dimensional features. However, as in other classical high-dimensional regression problems, this estimator is biased and cannot be directly used for valid statistical inference. The second step introduces a bias-correction that yields an asymptotically normal estimator from which one can construct confidence intervals and test hypotheses. Our results move beyond the existing literature, where only estimation guarantees were available or only for pairwise interaction models. We complement our theoretical analysis with simulation studies confirming the effectiveness of the proposed method.
Read the full abstract
Symplectic Geometry
Information Geometry via the Q-Root Transform
In this paper, we introduce \emph{$\ell^p$-information geometry}, an infinite-dimensional framework that shares key features with the geometry of the space of probability densities \( \mathrm{Dens}(M) \) on a closed manifold, while also incorporating aspects of measure-valued information geometry. We define the \emph{$\ell^2$-probability simplex} with a noncanonical differentiable structure induced via the \emph{$q$-root transform} from an open subset of the \( \ell^q \)-sphere. This choice makes the \(q\)-root transform an isometry and allows us to construct the \(\ell^2\)- and \(\ell^q\)-Fisher–Rao geometries, including \emph{Amari–Čencov \(\alpha\)-connections} and a Chern connection in the \(\ell^q\)-setting. We then apply this framework to an infinite-dimensional linear optimization problem. We show that the corresponding gradient flow with respect to the \(\ell^2\)–Fisher–Rao metric can be solved explicitly, converges to a maximizer under a natural monotonicity assumption, and admits an interpretation as the geodesic flow of an exponential connection. In particular, we prove that this \(e\)-connection is geodesically complete. We further relate these flows to a completely integrable Hamiltonian system through a momentum map associated with a Hamiltonian torus action on infinite-dimensional complex projective space. Finally, inspired by the \(\ell^2\)-theory, we outline an analogous Fisher–Rao geometry for \( \mathrm{Dens}(M) \) on possibly noncompact Riemannian manifolds, showing that, with a suitable spherical differentiable structure, the square-root transform remains an isometry.
Read the full abstract
Probability
Gated Infinite Server Queues in Light Traffic
We consider $M/G/\infty$ queues with gated service and obtain results on the distribution of the stage length and the number of customers served in a stage when the system is stationary. The stage length density is expressed as an infinite series of terms, involving the solution of an infinite system of linear equations. The convergence of a sequence of solutions arising from truncations of the infinite system is established in the light traffic case. Analogous results are established for a similar $GI/M/\infty$ gated system.
Read the full abstract
Statistics Theory · Cross-listed from stat.ME
Posterior inference via Hill's prediction model
This paper is concerned with the construction of prior free posterior distributions which rely on the use of one step ahead predictive distribution functions. These are typically more straightforward to motivate than prior distributions. Recent interest has been with Hill's $A_n$ prediction model through what has become known as conformal prediction. This model predicts the next observation to lie with equal probability in the intervals created by the observed data. The prediction model generates complete data sets which can be used to provide posterior inference on any statistic of interest.
Read the full abstract
Statistics Theory
The monotonicity of the Franz-Parisi potential is equivalent with Low-degree MMSE lower bounds
Over the last decades, two distinct approaches have been instrumental to our understanding of the computational complexity of statistical estimation. The statistical physics literature predicts algorithmic hardness through local stability and monotonicity properties of the Franz–Parisi (FP) potential \cite{franz1995recipes,franz1997phase}, while the mathematically rigorous literature characterizes hardness via the limitations of restricted algorithmic classes, most notably low-degree polynomial estimators \cite{hopkins2017efficient}. For many inference models, these two perspectives yield strikingly consistent predictions, giving rise to a long-standing open problem of establishing a precise mathematical relationship between them. In this work, we show that for estimation problems the power of low-degree polynomials is equivalent to the monotonicity of the annealed FP potential for a broad family of Gaussian additive models (GAMs) with signal-to-noise ratio $\lambda$. In particular, subject to a low-degree conjecture for GAMs, our results imply that the polynomial-time limits of these models are directly implied by the monotonicity of the annealed FP potential, in conceptual agreement with predictions from the physics literature dating back to the 1990s.
Read the full abstract
Mathematical Physics · Cross-listed from cond-mat.supr-con
Temperature-Bias Noise and Quantum Shot Noise as Probes of Pairing Symmetry in Iron Pnictides
Quantum noise has long served as a powerful probe of quantum transport in mesoscopic junctions. Recently, temperature-driven noise, or $\Delta_T$ noise, has attracted growing interest due to its presence even in the absence of average charge current. In this work, we investigate a normal metal-insulator-iron-pnictide junction and demonstrate how zero temperature quantum shot noise, finite temperature quantum noise and $\Delta_T$ noise can discriminate between $S_{++}$ and $S_{+-}$ pairing symmetries, which are relevant to iron-based superconductors. We introduce $\Delta_T$ noise as a novel probe for distinguishing between the two pairing symmetries. In contrast to conductance, which exhibits a single peak for both $S_{++}$ and $S_{+-}$ states with only a difference in magnitude, the $\Delta_T$ noise reveals qualitatively distinct features: a twin-peak structure for the $S_{++}$ pairing symmetry and a single-peak profile for the $S_{+-}$ state. A similar symmetry-dependent contrast is observed in both zero temperature quantum shot noise and finite temperature quantum noise, where the $S_{++}$ state consistently exhibits a twin-peak structure, while the $S_{+-}$ state shows a single-peak response. Our results demonstrate that noise-based measurements form a mutually reinforcing set of probes that enables reliable identification of superconducting gap symmetry in Iron Pnictide superconductors.
Read the full abstract
Analysis of PDEs
Asymptotic stability of shear flows for 2D Euler equations at Yudovich regularity
The nonlinear asymptotic stability of shear flows in the 2D Euler equations has traditionally been linked to inviscid damping in the periodic setting. Since Gevrey regularity is required to suppress the “echo” phenomenon, asymptotic stability is known to be impossible in Sobolev spaces. In this paper, we identify a distinct stabilizing mechanism available in the infinite channel: the advection of vorticity to spatial infinity. We establish nonlinear asymptotic stability for the 2D Euler equations in the infinite channel $\mathbb{R}\times[0,1]$ at the minimal regularity of the Yudovich class ($L^{\infty}$ vorticity). Specifically, for a class of non-negative shear flows with a curvature bound, any $L^\infty$-small, compactly supported vorticity perturbation leads to decay on compact subsets and weak convergence to zero.
Read the full abstract
Probability · Cross-listed from cs.DS
Power laws and power-of-two-choices
This paper analyzes a variation on the well-known "power of two choices" allocation algorithms. Classically, the smallest of $d$ randomly-chosen options is selected. We investigate what happens when the largest of $d$ randomly-chosen options is selected. This process generates a power-law-like distribution: the $i^{th}$-smallest value scales with $i^{d-1}$, where $d$ is the number of randomly-chosen options, with high probability. We give a formula for the expectation and show the distribution is concentrated around the expectation
Read the full abstract
Algebraic Geometry
Existence of minimal del Pezzo surfaces of degree 1 with conic bundles over finite fields
We study minimal del Pezzo surfaces of degree 1 with a conic bundle over a finite field $\mathbb{F}_q$ according to the action of the absolute Galois group on the singular fibers (which is known as their type). We give a lower bound on the size of the field over which they exist, and determine values of $q$ for which certain types cannot exist. In particular, we solve the inverse Galois problem for certain types of minimal del Pezzo surfaces of degree 1 over finite fields with a conic bundle structure. Additionally, we give bounds on the values of $q$ for which del Pezzo surfaces of degree 1 of index 8 exist over $\mathbb{F}_q$.
Read the full abstract
Combinatorics
On the $q$-multiplicity of sums of distinct simple roots of $\mathfrak{sl}_{r+1}(\mathbb{C})$
In combinatorial representation theory, Kostant's weight multiplicity formula $m(\lambda,\mu)$ is a tool that provides a means of determining the multiplicity of a weight $\mu$ in the adjoint representation of a simple Lie algebra $\mathfrak{g}$, and in this work we consider the case of $\mathfrak{g}=\mathfrak{sl}_{r+1}(\mathbb{C})$. In practice, performing calculations of Kostant's weight multiplicity formula is computationally intense, as the number of terms in this alternating sum grows factorially as the rank $r$ increases, of which most terms provide zero contribution to the overall sum. In this work, we determine the Weyl alternation set, that is the terms in the alternating sum with nonzero contribution, for integral weights $\lambda$ the highest root of $\mathfrak{sl}_{r+1}(\mathbb{C})$, and $\mu$ any nonempty collection of distinct simple roots. We show that the alternation set is enumerated by a product of Fibonacci numbers, with the product being dependent on the choice of distinct simple roots. Then we compute the weight $q$-multiplicity for any nonempty collection of distinct simple roots.
Read the full abstract
Classical Analysis and ODEs
Dominated sets, microscopic sets and Hausdorff measures
Let $S$ be a family of sequences of positive numbers that decrease to 0, let $X$ be a metric space and $A \subset X$. $A$ is said to be $S$-dominated if, for every $s\in S$, a countable cover $\{E_n\}$ of $E$ can be found such that $diam E_n < s_n$ for all $n$. We examine the family of all $S$-dominated sets, denoted by $\mathcal{D}(S)$. In particular, we examine the connections between $\mathcal{D}(S)$ and families of sets with zero Hausdorff measure for some gauges.
Read the full abstract
Numerical Analysis
On second-order optimality in the high-$\kappa$ regime of the Ginzburg-Landau model
We study energy minimizers of the Ginzburg-Landau (GL) free energy, a fundamental model of superconductivity. We address the high-$\kappa$ regime, the regime of a large GL parameter, in which energy minimizers exhibit vortex structures whose finite element approximations require a fine mesh resolution. This difficulty is reflected in the error analysis of discrete minimizers, which relies on a second-order optimality condition. The spectrum of the energy's second Fréchet derivative must be bounded away from zero up to symmetry. In practice, the associated spectral gap decreases rapidly with the GL parameter. This degrades the quality of the approximations because the GL parameter directly enters as an additional factor in the error estimates. Although a polynomial dependence of the spectral gap on the GL parameter has been conjectured, its precise behavior remains unclear. As a first step toward addressing this issue, we compute the spectral gap based on a finite element approximation for a range of GL parameters, providing numerical evidence for the conjectured polynomial dependence.
Read the full abstract
Combinatorics · Cross-listed from cs.CG
On the size of k-irreducible triangulations
A triangulation of a surface is k-irreducible if every non-contractible curve has length at least k and any edge contraction breaks this property. Equivalently, every edge belongs to a non-contractible curve of length k and there are no shorter non-contractible curves. We prove that a k-irreducible triangulation of an orientable surface of genus g has $O(k^2g)$ triangles, which is optimal. This is an improvement over the previous best bound $k^{O(k)} g^2$ of Gao, Richter and Seymour [Journal of Combinatorial Theory, Series B, 1996].
Read the full abstract
Statistics Theory · Cross-listed from stat.ML
Graph-Informed Adversarial Modeling: Infimal Subadditivity of Interpolative Divergences
We study adversarial learning when the target distribution factorizes according to a known Bayesian network. For interpolative divergences, including $(f,\Gamma)$-divergences, we prove a new infimal subadditivity principle showing that, under suitable conditions, a global variational discrepancy is controlled by an average of family-level discrepancies aligned with the graph. In an additive regime, the surrogate is exact. This closes a theoretical gap in the literature; existing subadditivity results justify graph-informed adversarial learning for classical discrepancies, but not for interpolative divergences, where the usual factorization argument breaks down. In turn, we provide a justification for replacing a standard, graph-agnostic GAN with a monolithic discriminator by a graph-informed GAN (GiGAN) with localized family-level discriminators, without requiring the optimizer itself to factorize according to the graph. We also obtain parallel results for integral probability metrics and proximal optimal transport divergences, identify natural discriminator classes for which the theory applies, and present experiments showing improved stability and structural recovery relative to graph-agnostic baselines.
Read the full abstract
Information Theory · Cross-listed from eess.SP
NCR vs. Passive/Active RIS: How Much NCR Amplification is Required to Beat RIS?
This paper investigates the fundamental tradeoff between reconfigurable intelligent surfaces (RISs) and network-controlled repeaters (NCRs) in terms of achievable signal-to-noise ratio (SNR). Considering an uplink system with a multi-antenna base station (BS) and a single-antenna user equipment (UE), we derive closed-form SNR expressions for passive RIS-, active RIS-, and NCR-assisted communication under line-of-sight propagation between the BS-RIS/NCR and RIS/NCR-UE. Both narrowband and wideband transmissions are analyzed, with and without the presence of a direct BS–UE link. Our analysis reveals a key structural difference: while the SNR achieved with RISs grows unboundedly with the number of RIS elements, the SNR provided by an NCR is fundamentally limited by the UE–repeater channel due to noise amplification. Nevertheless, we show that NCRs can outperform both passive and active RISs when deployed close to the UE, provided that sufficient amplification is available. Numerical results based on realistic path loss models quantify the amplification levels required for NCRs to outperform RISs across different deployment geometries and system dimensions. These findings provide clear design guidelines for the practical integration of RISs and NCRs in future wireless networks.
Read the full abstract
Algebraic Geometry
The log homotopy exact sequence
We show exactness of the homotopy sequence for the logarithmic fundamental group in the case of log smooth, finitely presented, proper and saturated morphisms of fs log schemes over a field. This generalizes earlier results of Hoshi in the log regular case. In passing, we also construct a "log Stein factorization" in some particular cases.
Read the full abstract
Dynamical Systems
Stability and limit theorems in random dynamical systems
The robust statistical description of dynamical systems under perturbations is a central problem in ergodic theory. In this paper, we investigate the statistical properties of skew-product maps driven by a subshift of finite type with contracting fiber maps, a setting that naturally encompasses Iterated Function Systems (IFS) and Random Dynamical Systems (RDS). Diverging from the classical perturbative frameworks that rely on the compact embedding of anisotropic Banach spaces, we employ a flexible operator approach based on the Lipschitz regularity of the invariant measure's disintegrations with respect to the Wasserstein metric. Our main results are threefold: first, we prove the quantitative statistical stability of the unique invariant measure under admissible deterministic perturbations, obtaining an explicit modulus of continuity of the form $O(R(\delta) \log \delta)$. Second, we establish the exponential decay of correlations on new pair of spaces of observables. Finally, leveraging this exponential decay and Gordin's method, we prove the Central Limit Theorem for the fluctuations of Birkhoff averages of Lipschitz observables.
Read the full abstract
Logic
The Ouroboros Goodstein Principle
In arXiv:2508.14768, a variant of Goodstein's original process was recently introduced which, given a set $B\subseteq \mathbb{N}$ of bases, writes each $n\in\mathbb{N}$ in $B$-normal form, namely $n=b^ea+r$, where $b\in B$ the greatest base below $n$. The numbers $e$ and $r$ are then recursively written in $B$-normal form, and finally each base of $B$ is replaced by a corresponding base of some other set $C\subseteq \mathbb{N}$. The resulting process was shown to terminate and to be independent of $\mathsf{KP}$, but the proofs relied on two different ordinal assignments: one monotone but not tight enough to establish independence, and another suitable for independence but not monotone and thus ineffective for proving termination. We introduce a new ordinal assignment that simultaneously yields termination and independence, thereby revealing the `true' ordinals associated with the numbers in the process. This assignment allows us to investigate which restrictions to impose on the process in order for the proof-theoretic strength of its termination to lie between the systems $\mathsf{RCA}_0$, $\mathsf{ACA}_0$, $\mathsf{ATR}_0$ and $\mathsf{KP}$.
Read the full abstract
Optimization and Control
Constrained Nonnegative Gram Feasibility is $\exists\mathbb{R}$-Complete
We study the computational complexity of constrained nonnegative Gram feasibility. Given a partially specified symmetric matrix together with affine relations among selected entries, the problem asks whether there exists a nonnegative matrix $H \in \mathbb{R}_+^{n\times r}$ such that $W = HH^\top$ satisfies all specified entries and affine constraints. Such factorizations arise naturally in structured low-rank matrix representations and geometric embedding problems. We prove that this feasibility problem is $\exists\mathbb{R}$-complete already for rank $r=2$. The hardness result is obtained via a polynomial-time reduction from the arithmetic feasibility problem ETR-AMI. The reduction exploits a geometric encoding of arithmetic constraints within rank-$2$ nonnegative Gram representations: by fixing anchor directions in $\mathbb{R}_+^2$ and representing variables through vectors of the form $(x,1)$, addition and multiplication constraints can be realized through inner-product relations. Combined with the semialgebraic formulation of the feasibility conditions, this establishes $\exists\mathbb{R}$-completeness. We further show that the hardness extends to every fixed rank $r\ge 2$. Our results place constrained symmetric nonnegative Gram factorization among the growing family of geometric feasibility problems that are complete for the existential theory of the reals. Finally, we discuss limitations of the result and highlight the open problem of determining the complexity of unconstrained symmetric nonnegative factorization feasibility.
Read the full abstract
Logic
Borel selection of dominating hyperplanes
We study a natural measurable selection problem for which the standard uniformisation theorems do not seem to apply directly, yet a Borel selector exists. More precisely, we consider families of finite dimensional functions that admit pointwise domination by affine functionals and ask whether such dominating functionals can be chosen in a Borel measurable way. We prove that this is indeed possible under semi-analytic regularity assumptions. The proof combines a one-dimensional Borel insertion result between an upper and a lower semi-analytic functions, derived from Lusin's separation theorem, with an induction on the dimension. As an application, we obtain Borel measurable selections of subgradients for parameter-dependent finite-dimensional convex functions, outside the scope of the standard normal integral framework.
Read the full abstract
Optimization and Control
Interpreting Reinforcement Learning Model Behavior via Koopman with Control
Reinforcement learning (RL) models have shown the capability of learning complex behaviors, but quantitatively assessing those behaviors - which is critical for safety assurance and the discovery of novel strategies - is challenging. By viewing RL models as control systems, we hypothesize that data-driven approximations of their associated Koopman operators may provide dynamical information about their behavior, thus enabling greater interpretability. To test this, we apply the Koopman with control framework to RL models trained on several standard benchmark environments and demonstrate that properties of the fit linear control models, such as stability and controllability, evolve during training in a task dependent manner. Comparing these metrics across different training epochs or across differently optimized RL models enables an understanding of how they differ. In addition, we find cases where - even when the reward achieved by the RL model is static - the stability and controllability is nonetheless evolving, predicting increased reward with further training. This suggests that these metrics may be able to serve as hidden progress measures, a core idea in mechanistic interpretability. Taken together, our results illustrate that the Koopman with control framework provides a comprehensive way in which to analyze and interpret the behavior of RL models, particularly across training.
Read the full abstract
Numerical Analysis
Semi-Lagrangian Discontinuous Galerkin Method with Adaptive Mesh Refinement for the Vlasov–Poisson System in 1X+3V
We extend the semi-Lagrangian discontinuous Galerkin (SLDG) method of Einkemmer to velocity grids with adaptive mesh refinement (AMR) and to three-dimensional velocity space. The original SLDG formulation assumes uniform cell widths, which permits the overlap matrices to be precomputed once per fractional shift and reused for every cell. On an adaptively refined mesh, neighboring cells may differ in size, invalidating this assumption. We develop a hybrid sweep strategy: conforming cells in the mesh interior use precomputed per-level overlap matrices (the fast path), while nonconforming cells at refinement boundaries evaluate generalized overlap integrals on the fly (the slow path). A compressed sparse row (CSR) pencil data structure organizes the dimensional splitting along each velocity coordinate, with weighted accumulation for coarse cells that appear in multiple pencils. The method is extended from one to three velocity dimensions using tensor-product DG elements on hexahedral cells provided by PETSc's PetscFE class. We verify the solver on the standard Landau damping benchmark in 1X+3V, demonstrating correct damping rates, exact mass conservation, and convergence behavior with polynomial degree and AMR refinement level.
Read the full abstract
Optimization and Control
Structural Controllability of Large-Scale Hypergraphs
Controlling real-world networked systems, including ecological, biomedical, and engineered networks that exhibit higher-order interactions, remains challenging due to inherent nonlinearities and large system scales. Despite extensive studies on graph controllability, the controllability properties of hypergraphs remain largely underdeveloped. Existing results focus primarily on exact controllability, which is often impractical for large-scale hypergraphs. In this article, we develop a structural controllability framework for hypergraphs by modeling hypergraph dynamics as polynomial dynamical systems. In particular, we extend classical notions of accessibility and dilation from linear graph-based systems to polynomial hypergraph dynamics and establish a hypergraph-based criterion under which the topology guarantees satisfaction of classical Lie-algebraic and Kalman-type rank conditions for almost all parameter choices. We further derive a topology-based lower bound on the minimum number of driver nodes required for structural controllability and leverage this bound to design a scalable driver node selection algorithm combining dilation-aware initialization via maximum matching with greedy accessibility expansion. We demonstrate the effectiveness and scalability of the proposed framework through numerical experiments on hypergraphs with tens to thousands of nodes and higher-order interactions.
Read the full abstract
Logic
An order-reversing embedding of Turing degrees into Arthur-Nimue-Merlin degrees
The Arthur-Nimue-Merlin degrees are a generalization of the Turing degrees introduced by Kihara as a tangible description of the partially ordered set of Lawvere-Tierney topologies on the effective topos (equivalently, subtoposes of the effective topos). They are defined in terms of a three-player game that introduces both angelic and demonic non-determinism into oracle queries. We construct an order embedding of the Turing degrees with their order reversed into the Arthur-Nimue-Merlin degrees, whose image we call the "co-Turing degrees"; we then study the order relationship of these co-Turing degrees with the (naturally embedded) Turing degrees within the Arthur-Nimue-Merlin degrees.
Read the full abstract
Analysis of PDEs
Regularity criterion for the 3D generalized Newtonian fluids
In this paper, we prove that a weak solution of the Cauchy problem for 3D unsteady flows of a generalized Newtonian fluid becomes a strong solution for $\frac{5}{3} <p<\frac{11}{5} $ provided that the gradient of velocity $\nabla \boldsymbol{u}$ belongs to the critical space $L^{\frac{2}{2-(3-p)a}}(0,T;\dot{B}^{-a}_{\infty,\infty}(\mathbb{R}^3))$, where $a\in(\frac{3}{2},\frac{2}{3-p})$ if $p\in(\frac{5}{3},2)$ and $a\in(\frac{1}{p},\frac{2}{3-p})$ if $p\in[2,\frac{11}{5})$.