Peer Revenue Equity in science

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Saturday 21 February

Optimization and Control

Variational Sufficiency and Solution Stability in Optimization

Variational stability, in the sense of local good behavior of optimal values and solutions in problems of optimization under shifts in parameters, is important not only for validating model robustness in practical applications but also for confidence of outcomes in the design of solution algorithms. Fundamental results are presented here about how such stability relates to a recently developed sufficient condition for local optimality called strong variational sufficiency.
Read the full abstract

Analysis of PDEs

Statistical Error Bounds for Generative Solvers of Chaotic PDEs: Wasserstein Stability, Generalization, and Turbulence

Statistical solutions of incompressible Euler describe turbulent dynamics as time-parameterized laws on $L^2$ whose multi-point correlations satisfy an infinite hierarchy of weak identities. Modern generative samplers for PDE forecasting (flow matching, rectified flows, diffusion via probability-flow ODEs) are measure-transport mechanisms and therefore induce Markov operators on laws. We develop a law-level analysis compatible with the correlation-measure framework of Lanthaler–Mishra–Parés-Pulido (LM): convergence in $d_T(\mu,\nu)=\int_{0}^{T} W_{1}\!\bigl(\mu_t,\nu_t\bigr)\,\mathrm{d}t$, compactness controlled by structure functions, and identification of limits through hierarchy identities. Quantitatively, we prove a $W_2$ stability estimate whose growth rate is a distance-weighted average strain under optimal couplings, and a one-step error decomposition into a resolved mismatch term and an unavoidable high-frequency coverage tail controlled by structure-function (spectral) bounds. These inputs propagate through multi-step rollouts via a discrete Grönwall recursion with amplification governed by the average-strain exponent rather than a worst-case Lipschitz constant. On the qualitative side, sampler-native path controls yield LM time regularity; together with uniform energy and structure-function bounds this gives precompactness in $d_T$ and strong convergence of LM-admissible observables. If hierarchy residuals vanish along a sequence, every limit is an LM statistical solution, with residuals bounded by training-native drift/score regression errors. Finally, we show how common finite-grid diagnostics–proper distributional scores and likelihood-style certificates–admit principled interpretations as resolved observables within the same statistical-solution framework.
Read the full abstract

Probability

A note on the cooperative two-type SIR processes on Galton-Watson trees

In the standard SIR model on a graph, infected vertices infect their neighbors at rate $\alpha$ and recover at rate $\mu$. We consider a two-type SIR process where each individual in the graph can be infected with two types of diseases, $A$ and $B$. Moreover, the two diseases interact in a cooperative way so that an individual that has been infected with one type of disease can acquire the other at a higher rate. We prove that if the underlying graph is a Galton-Watson tree and initially the root is infected with both $A$ and $B$, while all others are susceptible, then the two-type SIR model has the same critical value for the survival probability as the classic single-type model.
Read the full abstract

All authors Ruibo Ma, Tai Heng Liu, Baghdadi Othmane, Dong Yao

Differential Geometry

Smooth relative connections on quiver bundles

We develop a theory of smooth relative connections over the real path algebra $\mathbb{R}Q$ on smooth twisted quiver bundles. We give obstructions to the existence of a smooth relative connection on twisted quiver bundles. For tree-type quiver bundles, we establish a necessary and sufficient condition for the existence of a smooth relative connection. Additionally, we provide a framework for the representation theory of flat quiver bundles, relating the existence of flat relative connections to the underlying quiver representations.
Read the full abstract

Algebraic Geometry

Algebraic realization of stable Poincaré-Reeb graphs

We introduce the notion of domain of finite type $\mathscr{D}\subset\mathbb{R}^n$ generalizing an earlier work of Bodin, Popescu-Pampu and Sorea. Then, we prove that every finite graph admitting a good orientation whose vertices have degree 1 or 3 can be realized as the Poincaré-Reeb graph of a stable (globally) algebraic domain of finite type $\mathscr{D}\subset\mathbb{R}^n$, for every $n\geq 2$. If in addition $n\geq 3$, we construct a class of graphs allowing vertices of degree $2$ also. Algebraic approximation techniques à la Nash-Tognoli and stable Morse functions are fundamental tools in our approach. In particular, the recent extensions over $\mathbb{Q}$ of such algebraic approximation techniques developed by Ghiloni and the author allow us to reduce the coefficients of the describing polynomials over $\mathbb{Q}$ and to extend our constructions over real closed fields.
Read the full abstract

History and Overview of Mathematics

From Ponzi Schemes to Benign Investment Dynamics: modelling Collapse, Stability, and a Path to Sustainability

The population and capital dynamics of three stylized investment systems are mathematically described using discrete-time difference equations with closed-form solutions. The models share a common capital budget equation but differ in their demographic laws, which are geometric, quasi-logistic, or epidemiologic (SIR-based). The quasi-logistic model is designed as an analytically tractable non-Ponzi investment system: it generalizes the geometric model (and, in the limit of a constant growth rate, reproduces classical Ponzi dynamics) while closely mirroring the behaviour of an SIR-based model with decreasing effective growth. In all cases, promised returns are modeled as fixed per-period payouts on initial investment with principal repaid upon exit, so that aggregate liabilities depend only on the current number of active investors. Within this unified framework, classical Ponzi schemes arise as special cases that inevitably collapse, while suitable parameter choices in the quasi-logistic and SIR-based versions generate finite-horizon, legally benign "no-Ponzi game" investment schemes with analytically transparent conditions for collapse, stability, and sustained operation.
Read the full abstract

Combinatorics

A $B$-Restricted Clique Polynomial and Connections to Tanner's Inequality

Let $G$ be a finite simple graph and $B \subseteq V(G)$. We study the \emph{$B$-restricted clique polynomial} $C_B(G;x)$, including its weighted version allowing vertex multiplicities, as a versatile tool to capture structural properties of vertex subsets. First, we develop a complete deletion theory for $C_B(G;x)$, including vertex and edge recurrences that generalize classical clique polynomial results. These recurrences yield monotonicity principles for the largest negative root $\zeta_G(B)$: it is monotone under induced subgraphs and reverse-monotone under spanning subgraphs. Consequently, we derive explicit bounds on $B$-independence numbers, chromatic numbers, $B$-girth, and Hamiltonicity constraints, showing that $\zeta_G(B)$ serves as a unifying local invariant. Next, we connect $B$-clique polynomials to spectral graph theory. For $(n,d,\lambda)$-graphs, spectral techniques, including the Expander Mixing Lemma and Tanner's inequality, provide uniform bounds on $B$-restricted clique coefficients, demonstrating that clique growth within $B$ is naturally controlled by the spectral gap. Finally, we show that weighted $B$-clique polynomials encode homomorphism constraints. Specifically, if $f: G \to H$ is a surjective homomorphism mapping $B_G$ onto $B_H$, then $\zeta_G(B_G) \ge \zeta_H(B_H)$, yielding a local no-homomorphism criterion based on $B$-roots. Overall, $C_B(G;x)$ provides a unified framework capturing combinatorial, spectral, and homomorphic information in vertex-restricted analysis, highlighting its power for both global and local structural insights.
Read the full abstract

Combinatorics

Locating-dominating coalitions in graphs

A set $D$ of vertices in a graph $G = (V, E)$ is a locating-dominating set (LD-set) if it is dominating and every two vertices $u$, $v$ of $V\setminus D$ satisfy $N(u) \cap D \neq N(v) \cap D$. Two disjoint sets $A,B\subset V(G)$ form a locating-dominating coalition (for short, an LD-coalition) in $G$ if none of them is an LD-set in $G$ but their union $A\cup B$ is an LD-set. A locating-dominating coalition partition (for short, an LDC-partition) is a vertex partition $\Pi$ such that every set of $\Pi$ is not an LD-set in $G,$ but forms an LD-coalition with another set of $\Pi$. The locating-domination coalition number of $G$, denoted by $C_{L}(G),$ equals the maximum cardinality of an LDC-partition of $G$. Our purpose in this paper is to initiate the study of locating-dominating coalitions in graphs. We first investigate the existence of LDC-partitions. We also obtain lower and upper bounds on $C_{L}(G)$. We characterize connected graphs $G$ of order $n\ge 3$ satisfying $C_L(G) = n,$ as well as those trees $T$ such that $C_L(T)=n-1$. In addition, we determine the exact values of $C_L(G)$ for some classes of graphs. Moreover, we investigate the computational complexity of the decision problem associated with locating-dominating coalition partitions. To the best of our knowledge, this is the first work that addresses the algorithmic complexity of a decision problem related to coalition partitions, not only for this locating-dominating model but for coalition partitions in general.
Read the full abstract

All authors M. Chellali, A. A. Dobrynin, F. Foucaud, H. Golmohammadi, J.C. Valenzuela-Tripodoro

Optimization and Control

Multiunit I.I.D. Prophet Inequalities via Extreme Value Asymptotics

We study the i.i.d. $k$-selection prophet inequality problem, where a decision-maker sequentially observes $n$ independent nonnegative rewards and may accept at most $k$ of them without knowledge of future realizations. The objective is to maximize the expected total reward relative to that of a prophet who observes all rewards in advance. This problem captures the performance limits achievable in online resource allocation and underlies posted-price mechanisms in online marketplaces. We characterize the optimal welfare achievable relative to the prophet in terms of $k$ and the extreme value index of the reward distribution, in the asymptotic regime where the number of offers $n$ grows large. This optimal performance ratio turns out to be at least $1-\frac{\log k}{8k}[1+\epsilon]$ for any $\epsilon > 0$ and sufficiently large $k$, improving upon the respective, tight $1 - \frac{1}{\sqrt{2\pi k}}$ guarantee of static-threshold algorithms. We additionally analyze the certainty-equivalent (CE) heuristic, a widely used online allocation algorithm known to yield optimal regret growth in $n$ when evaluated under the fluid scaling assumption. Even in the absence of the fluid scaling, the CE heuristics's performance improves with $k$ to eventually match the leading order terms of the optimal dynamic program's performance ratio. A finer analysis nevertheless reveals that regret can be divergent and large relative to the optimal dynamic program when $n/k \to \infty$. This highlights the sensitivity in viewing the CE heuristic's performance under the commonly adopted, though subjective, fluid scaling assumption.
Read the full abstract

Mathematical Physics · Cross-listed from cond-mat.mes-hall

FQH Liquids with Flux-Expulsion Islands allow Nonabelian Anyons

The idea that topologically protected quantum states, such as anyons, may be attached to super/semiconductor heterostructures has received enormous attention, but experimental signatures in 1D systems remain elusive. Here we revisit theoretical underpinnings of anyons in 2D fractional quantum Hall (FQH) systems, whose signatures have been experimentally observed by independent groups. Invoking novel theorems about the Hopfion or $\mathbb{C}P^1$-model understood as flux quantization in 2-Cohomotopy, which retrodicts abelian FQH anyon properties in fine detail. Examining this theoretical model further, we find that islands of expelled (surplus) flux enlarge the ground-state monodromy from an abelian group to a (framed spherical) braid group, nonabelian for two or more islands, so that nonabelian anyonic states become topologically admissible; superconducting islands are one candidate realization of such flux expulsion.
Read the full abstract

2602.18748 · 21 Feb · 7 pages, 2 figures; v2 (published version): wording adjusted to clarify, first, that (surplus) flux-expulsion is the required condition, while superconductivity is just the canonical candidate realization, and, second, that the result is lifting of the topological obstruction for nonabelian anyons and classification of their reps, not prediction of a specific braiding rep

Analysis of PDEs

Green representations and global Hölder continuity for solutions of elliptic equations

Let $N\in\mathbb{N}$ and $u$ be a weak solution of equation $\displaystyle Lu\equiv - \sum_{i,j=1}^{N}\frac{\partial}{\partial x_{j}}(\frac{\partial u}{\partial x_{i}}b^{ij})= f$ in $\Omega\subset \mathbb{R}^{N}$. We obtain functions $G$ and $H_{l}$ on $\Omega\times \Omega$ for every $l\in\{1,\cdots,N\}$ having following properties: if $f$ is in $L^{1}(\Omega)$, then $\int_{\Omega}G(x,y)f(x)dx = u(y)$, $\int_{\Omega}H_{l}(x,y)f(x)dx = -\frac{\ \partial u}{\partial x_{l}}(y)\quad a.e~y\in \Omega, \forall~l\in\{1,\cdots,N\}.$
Read the full abstract

Optimization and Control

Synchronization of Unbalanced Dynamical Optimal Transport across Multiple Spaces

Many biological systems are observed through heterogeneous modalities, requiring transport models that couple dynamics across spaces while allowing mass variation. To address this challenge, we introduce Unbalanced Synchronized Optimal Transport (UnSyncOT), a novel dynamical framework that synchronizes transport-reaction flows between spaces via either geometric embeddings (Monge type) or Markov kernels (Kantorovich type). For both cases we prove that UnSyncOT can be reduced to a single-space problem: the Monge model becomes a Benamou-Brenier problem with a metric-modified kinetic energy, and the Kantorovich model yields a nonlocal action induced by the synchronization operator, both of which fit within a dissipation-distance formulation. We also analyze the pure transport (Wasserstein) and pure reaction (Fisher-Rao) limits and derive structural properties. For the Kantorovich case we propose an approximate UnSyncOT by introducing a Hellinger-Kantorovich based trapezoidal time discretization of the secondary action for efficient computation. Finally we present staggered-grid discretizations and primal-dual solvers, validate the convergence, stability, and efficiency, and demonstrate coherent dynamics reconstructions across spaces.
Read the full abstract

All authors Zixuan Cang, Jingfeng Wang, Xiaoqi Wei, Yanxiang Zhao

Numerical Analysis

Finite element methods for isometric embedding of Riemannian manifolds

The isometric embedding problem for Riemannian manifolds, which connects intrinsic and extrinsic geometry, is a central question in differential geometry with deep theoretical significance and wide-ranging applications. Despite extensive analytical progress, the nonlinear and degenerate nature of this problem has hindered the development of rigorous numerical analysis in this area. As the first step toward addressing this gap, we study the numerical approximation of Weyl's problem, i.e., the isometric embedding of two-dimensional Riemannian manifolds with positive Gaussian curvature into $\mathbb{R}^3$, by establishing a new weak formulation that naturally leads to a numerical scheme well suited for high-order finite element discretization, and conducting a systematic analysis to prove the well-posedness of this weak formulation, the existence and uniqueness of its numerical solution, as well as its convergence with error estimates. This provides a foundational framework for computing isometric embeddings of Riemannian manifolds into Euclidean space, with the goal of extending it to a broader range of cases and applications in the future. Our framework also extends naturally to the isometric embedding of the Ricci flow, with rigorous error estimates, enabling the visualization of geometric evolutions in intrinsic curvature flows. Numerical experiments support the theoretical analysis by demonstrating the convergence of the method and its effectiveness in simulating isometric embeddings of given Riemannian manifolds as well as Ricci flows.
Read the full abstract

All authors Guangwei Gao, Kaibo Hu, Buyang Li, Ganghui Zhang

Numerical Analysis

Constructive discretization and approximation in reproducing kernel Hilbert spaces

We generalize the sparsification algorithm of Batson, Spielman and Srivastava, making one part of the result dimension-independent. In particular, we recover discretization inequalities in $L_2$- and sup-norms on general finite-dimensional subspaces, prove a suitable infinite-dimensional variant, and discuss the implications for the error of least-squares approximation based on samples. This gives a more constructive version of several recently established approximation bounds, some of which relied on the stronger and less constructive result of Marcus, Spielman and Srivastava. We also improve the constants and oversampling factors in these results.
Read the full abstract

All authors Abdellah Chkifa, Matthieu Dolbeault, David Krieg, Mario Ullrich

Optimization and Control · Cross-listed from stat.ML

Stochastic Gradient Variational Inference with Price's Gradient Estimator from Bures-Wasserstein to Parameter Space

For approximating a target distribution given only its unnormalized log-density, stochastic gradient-based variational inference (VI) algorithms are a popular approach. For example, Wasserstein VI (WVI) and black-box VI (BBVI) perform gradient descent in measure space (Bures-Wasserstein space) and parameter space, respectively. Previously, for the Gaussian variational family, convergence guarantees for WVI have shown superiority over existing results for black-box VI with the reparametrization gradient, suggesting the measure space approach might provide some unique benefits. In this work, however, we close this gap by obtaining identical state-of-the-art iteration complexity guarantees for both. In particular, we identify that WVI's superiority stems from the specific gradient estimator it uses, which BBVI can also leverage with minor modifications. The estimator in question is usually associated with Price's theorem and utilizes second-order information (Hessians) of the target log-density. We will refer to this as Price's gradient. On the flip side, WVI can be made more widely applicable by using the reparametrization gradient, which requires only gradients of the log-density. We empirically demonstrate that the use of Price's gradient is the major source of performance improvement.
Read the full abstract

All authors Kyurae Kim, Qiang Fu, Yi-An Ma, Jacob R. Gardner, Trevor Campbell

Category Theory · Cross-listed from quant-ph

Higher-order circuits

We write down a series of basic laws for (strict) higher-order circuit diagrams. More precisely, we define higher-order circuit theories in terms of: (a) nesting, (b) temporal and spatial composition, and (c) equivalence between lower-order bipartite processes and higher-order bipartite states. In category-theoretic terms, these laws are expressed using enrichment and cotensors in symmetric polycategories, along with a frobenius-like coherence between them. We describe how these laws capture the salient features of higher-order quantum theory, and discover an upper bound for higher-order circuits: any higher-order circuit theory embeds into the theory of strong profunctors.
Read the full abstract

Analysis of PDEs

A new family of solitons for nonlinear Schrödinger equations with non-vanishing boundary conditions in high dimension

In space dimensions $N \geq 4$, we introduce a new minimization procedure to construct traveling wave solutions to nonlinear Schrödinger equations with non-vanishing boundary conditions at spatial infinity. We denote the family of solitons obtained using this construction by $\mathscr{J}$. Mariş (Ann. of Math. 178:107-182, 2013) obtained a family of solitons by minimizing the action functional subject to a Pohozaev constraint; we use $\mathscr{P}$ to denote this family of solitons. Chiron and Mariş (Arch. Rational Mech. Anal. 226:143-242, 2017) used minimizing energy at fixed momentum to obtain a family of solitons; we denote this family of solitons by $\mathscr{Q}$. We show that, under some conditions, we have $\mathscr{Q} \subset \mathscr{J} \subset \mathscr{P}$. In addition, we show that $\mathscr{P} \subset \mathscr{J}$ under specific conditions.
Read the full abstract

Differential Geometry

Parametrizations of minimal timelike surfaces in the four-dimensional pseudo-Euclidean space of index two

We construct representation formulas for local null curves in the four-dimensional pseudo-Euclidean space of index two and derive corresponding parametrizations for local minimal timelike surfaces without integration. As a special case of the representation formula, we construct a representation formula for local null curves in the three-dimensional pseudo-Euclidean space of index one that involves integration. Our results provide examples of minimal timelike surfaces.
Read the full abstract

Mathematical Physics · Cross-listed from physics.optics

Extended scattering channels for random matrix simulations of polarized light transport

Modeling the propagation of light through disordered media is central to understanding and controlling wave transport in diverse optical and mesoscopic applications. Here, we present a random matrix simulation framework for modeling the transport of polarized light through random media composed of arbitrary particulate scatterers. Our approach employs extended scattering channels applied to angular spectral decompositions of the underlying fields, enabling flexible representations of arbitrary illumination and detection profiles. In contrast to previous work, this framework provides a rigorous treatment of scattering matrix correlations and offers novel geometric insights into the optical memory effect. We provide a detailed exposition of the underlying theory and illustrate several key features through numerical simulations. Our work is supported by a free accompanying codebase.
Read the full abstract

Algebraic Topology

Ganea decompositions of classifying spaces

We study homotopy decompositions of the classifying spaces $BG$ of compact connected Lie groups obtained by (relative) fiber-cofiber construction. Given a pair of Borel fibrations $ F \to E \to BG $ and $F' \to E' \to BG $, this construction yields a tower (telescope) of spaces $ X_{m}(F,F') $ over $BG$ indexed by $ \mathbb{Z}_+ $ that converges in the sense that $\text{hocolim} \,(X_{m})\,$ is weakly homotopy equivalent to $BG$. We determine cohomological conditions on the fibrations that produce the spaces $X_{m}(F,F')$ with properties similar to those of the spaces of quasi-invariants of Weyl groups constructed by the first and third authors. We prove that, under these conditions, the resulting homotopy decompositions of $BG$ are sharp (over $\mathbb{Q}$), the spaces $X_{m}(F,F')$ are rationally formal and Cohen-Macaulay, their cohomology rings being finite rank free modules over $H^*(BG, \mathbb{Q})$. We construct many examples which include the fundamental (maximal torus) fibration $ G/T \to BT \to BG $ as well as the universal fibration $\, E_{\rm com}G_{\bf 1} \to B_{\rm com}G_{\bf 1} \to BG \,$ for the classifying space $B_{\rm com}G$ of commuting elements in $G$ introduced by Adem and Gómez, as the first fibration in the pair. In most cases, we give an explicit presentation for the (equivariant) cohomology rings in terms of characteristic classes and compute the (equivariant) $K$-theory of the spaces involved. The paper contains an Appendix, where we re-examine the topological fiber-cofiber construction in an abstract setting, proving an $\infty$-categorical extension of the classical Ganea Theorem.
Read the full abstract

Algebraic Topology

The Bredon equivariant cohomology of a point for cyclic groups

We study the $RO(G)$-graded Bredon cohomology of a point in the case where $G$ is a cyclic group of odd order, expanding on the information provided by previous studies. Our methods center on the purely algebraic aspects of this matter, which interpret it as the "stable homotopy groups of spheres" problem for the derived category of modules over the constant-coefficient Mackey ring.
Read the full abstract

Algebraic Topology

Mackey homological algebra over cyclic groups

Let $C_n$ denote a cyclic group of order $n$. In this paper we investigate modules and chain complexes over the constant integral Mackey functor $\underline{\mathbb{Z}}$ and perform some related homological calculations. Along the way we develop a number of foundational tools for working with these categories. These results are useful for the study of $RO(C_n)$-graded Bredon cohomology, though such applications are delegated to a sequel paper.
Read the full abstract

Mathematical Physics · Cross-listed from gr-qc

Ultraviolet Fixed Point in Covariant Loop Quantum Gravity

We investigate the ultraviolet behavior of 4-dimensional Lorentzian covariant Loop Quantum Gravity (LQG) and address the problem of infinite ambiguities relating to the triangulation dependence of spinfoam amplitudes. We consider the complete LQG amplitude that summing spinfoam amplitudes over 2-complexes. By introducing spin-network stacks and their covariant extension, spinfoam stacks, the summation over complexes is partitioned into distinct families. We demonstrate that the theory exhibits a condensation phenomenon, where quantum geometry condenses to a dominant small spin configuration. We identify a candidate fixed point controlling the ultraviolet (small spin) regime of covariant LQG. At this fix point, the complete LQG amplitude dynamically reduces to a topological theory at leading order, and the infinite ambiguities of triangulation dependence reduces to a finite set of boundary coefficients associated with a finite basis of 3-dimensional boundary blocks. These results provide a definition for the continuum limit of spinfoam theory at the fundamental level.
Read the full abstract

Friday 20 February

Statistics Theory · Cross-listed from cs.LG

RACER: Risk-Aware Calibrated Efficient Routing for Large Language Models

Efficiently routing queries to the optimal large language model (LLM) is crucial for optimizing the cost-performance trade-off in multi-model systems. However, most existing routers rely on single-model selection, making them susceptible to misrouting. In this work, we formulate LLM routing as the $\alpha$-VOR problem to minimize expected set size while controlling the misrouting risk, and propose a novel method – RACER, extending base routers to output model sets that can be subsequently aggregated for improved output. In particular, RACER constructs nested model sets via augmented scoring and utilizes finite-sample concentration bounds to calibrate a threshold that allows for both variable set sizes and abstention. We theoretically prove that RACER achieves rigorous distribution-free risk control on unseen test data in a post-hoc and model-agnostic manner. Extensive experiments verify our theoretical guarantees and demonstrate that RACER consistently enhances downstream accuracy across a wide range of benchmarks.
Read the full abstract

All authors Sai Hao, Hao Zeng, Hongxin Wei, Bingyi Jing

Algebraic Topology

The Adams differentials on the $e$-family

The New Doomsday Conjecture (Minami, Amer. J. Math., 1995) states that, for any nonzero $\mathrm{Sq}^0$-family, only finitely many terms in this family survive to the $E_\infty$-page. On the Adams $1$ and $2$-line, the conjecture, which corresponds to the Hopf invariant problem and the Kervaire invariant problem, were solved by Adams (Ann. of Math., 1960) and Hill-Hopkins-Ravenel (arXiv:0908.3724), respectively. On the Adams $3$-line, Burklund and Xu (arXiv:2302.11869) established a family of nontrivial differentials on the $h_j^3$ family, and in particular developed the Burklund-Xu Spectral Sequence, to study the non-triviality of its target on the Adams $E_2$-page. In this paper, we use the Burklund-Xu Spectral Sequence to establish the non-triviality of a product on the Adams $6$-line. Combining this with Bruner's formula by Bruner et al. (LNM 1176, 1986), we prove the New Doomsday Conjecture for the $e$-family on the Adams $4$-line.
Read the full abstract

General Mathematics

Quantile-Based Skewness for Fuzzy Numbers with Probabilistic Foundations: With an Application in Portfolio Optimization

This paper introduces a novel parameter free skewness coefficient for fuzzy numbers, addressing a critical gap in quantifying asymmetry under imprecision. Existing fuzzy literature substitutes membership functions for probability density functions in moment-based skewness, lacking rigorous theoretical grounding. Our coefficient, however, rigorously establishes a probabilistic foundation, making it both probabilistically meaningful and fully compliant with the semantics of fuzzy set theory. Our approach interprets a fuzzy number's left and right membership function components as cumulative and survival probability functions of associated random variables. This provides a robust probabilistic foundation for its $\alpha$-cuts as generalized quantiles representing values that are "at least $\alpha$-probable", thereby instantiating the well-grounded dualism between probability and possibility theory. As a quantile-based measure, the proposed coefficient offers invariance under scale and location transformations. Crucially, its superior computational efficiency, empirically demonstrating an almost logarithmic reduction in portfolio optimization processing time with increasing assets, enables significant scalability for real-world applications. The coefficient comprises two complementary constituents: an "inner" measure quantifying the intrinsic skewness of the underlying probabilistic distributions, and an "outer" measure capturing the fuzzy number's overall profile asymmetry. This dual structure offers nuanced insights into a fuzzy number's asymmetry. We demonstrate its practical utility and computational advantages within a fuzzy mean-variance-skewness portfolio optimization framework, comparing its performance with two of the most highly cited original moment-based fuzzy skewness coefficients from the literature.
Read the full abstract

All authors Jan Schneider, Kaja Bilińska, Paul Schneider, Tomasz Szandała

Combinatorics

Recursive Patterns in the Chocolate Game

We study the recursive structure of P-positions in the chocolate game $C_{m,m}$, an impartial game played on an $m \times m$ chocolate bar. We show that the set of P-positions exhibits self-similar patterns that can be described and enumerated recursively. We further establish a correspondence between these patterns and the cross-sections of a three-dimensional Sierpiński octahedron. Finally, we show that the P-positions can be generated by a second-order cellular automaton, analogous to the onedimensional Rule-60 automaton. Our results reveal deep connections between combinatorial games, fractal geometry, and discrete dynamical systems.
Read the full abstract

Number Theory

Arithmetic properties of DSOME function

Recently, Andrews and Ghosh Dastidar (Ramanujan J. 69, Art. No. 26, 2026) studied two interesting functions $SOME(n)$ and $DSOME(n)$, where $SOME(n)$ is the sum of all the odd parts in the partitions of $n$ minus the sum of all even parts and $DSOME(n)$ is the sum of all the odd parts in the partitions of $n$ into distinct parts minus sum of all the even parts. They expressed the generating functions of $SOME(n)$ and $DSOME(n)$ in terms of $q$-series and found several interesting congruences modulo 4 and 5. In this paper, we express the generating function of $DSOME(n)$ in a closed form, which allows us to find some new congruences and internal congruences modulo 4 and 8 for $DSOME(n)$.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Minimally Discrete and Minimally Randomized p-Values

In meta analysis, multiple hypothesis testing and many other methods, p-values are utilized as inputs and assumed to be uniformly distributed over the unit interval under the null hypotheses. If data used to generate p-values have discrete distributions then either natural, mid- or randomized p-values are typically utilized. Natural and mid-p-values can allow for valid, albeit conservative, downstream methods since under the null hypothesis they are dominated by uniform distributions in the stochastic and convex order, respectively. Randomized p-values need not lead to conservative procedures since they permit a uniform distributions under the null hypotheses through the generation of independent auxiliary variates. However, the auxiliary variates necessarily add variation to procedures. This manuscript introduces and studies “minimally discrete” (MD) natural p-values, MD mid-p-values and “minimally randomized” (MR) p-values. It is shown that MD p-values dominate their non-MD counterparts in the stochastic and convex order, and hence lead to less conservative, yet still valid, downstream methods. Likewise, MR p-values dominate their non-MR counterparts in that they are still uniformly distributed under the null hypotheses, but the added variation attributable to the independently generated auxiliary variate is smaller. It is anticipated that results here will facilitate the construction of new meta-analysis and multiple testing methods via more efficient p-value construction, and facilitate theoretical study of existing and new methods by establishing gold standards for addressing the unavoidable detrimental “discreteness effect”.
Read the full abstract