Peer Revenue Returns subject to peer review

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Wednesday 11 March

Algebraic Geometry

Constructing Maximal Cohen-Macaulay Sheaves on Symplectic Singularities

In this paper, we study maximal Cohen-Macaulay sheaves on symplectic singularities. These sheaves generate the singularity categories and thus measure how far a singularity is from being smooth. We lift maximal Cohen-Macaulay sheaves on a singular variety to reflexive sheaves on its resolution and use Grothendieck duality to study their cohomological vanishing. We work this out in detail for the resolution $T^*\mathbb{P}^2 \rightarrow \mathcal{N}_{3,1}$, where $\mathcal{N}_{j,k}$ denotes the variety of nilpotent $j\times j$ matrices of rank at most $k$. In this case, we characterize the reflexive sheaves on $T^*\mathbb{P}^2$ whose pushforwards are maximal Cohen-Macaulay, and use vanishing results on $\mathbb{P}^2$ to construct many indecomposable maximal Cohen-Macaulay sheaves on $\mathcal{N}_{3,1}$. We also extend this construction to the resolution $T^*\mathbb{P}^n \to \mathcal{N}_{n+1,1}$.
Read the full abstract

Category Theory · Cross-listed from quant-ph

Higher-Order Quantum Objects are Strong Profunctors

We explore the sense in which the existing constructions for higher-order maps on quantum theory based on causality constraints and compositionality constraints respectively, coincide. More precisely, we construct a functor F : Caus(C) -> StProf(C1) from higher-order causal categories to the category of strong profunctors over first-order causal processes that is lax-lax duoidal, full, faithful, and strongly closed whenever C is additive. When C = CP this embedding is furthermore strong on the sequencer for duoidal categories, expressing the possibility to interpret one-way signalling (but not general non-signalling) constraints in terms of the coend calculus for profunctors. We conclude that insofar as compositional constraints can be used to express causality constraints, the profunctorial approach generalises higher-order quantum theory to a construction over general symmetric monoidal categories.
Read the full abstract

Rings and Algebras

Pre-Lie Structures for Semisimple Lie Algebras

We address the problem of admissibility of pre-Lie structures associated with a given Lie algebra, particularly, semisimple Lie algebras over ${\mathbb C}$. Such structures are collectively referred to as Lie-admissible algebras, which are a class of nonassociative algebras such that the commutator bracket over these algebras satisfies the Jacobi identity. Among the five classes of nonassociative Lie-admissible algebras, left-symmetric algebras (LSAs) and right-symmetric algebras (RSAs), are known to be non-admissible by semisimple Lie algebras of finite dimension $n \geq 3$. Here, we examine the remaining classes starting with those corresponding to the subgroup generated by permutations of order 2: $(1 \; 3)$. These appear in the literature as anti-flexible algebras (AFAs). We discuss properties of AFAs and provide examples of finite-dimensional representations. AFAs geometrically correspond to richer structures than the flat torsion-free affine connections associated with left-symmetric algebras (LSAs) or right-symmetric algebras (RSAs). We compute Lie-admissibility criteria for AFAs and determine a few simple solution classes. Not surprisingly, solvable Lie algebras admit AFAs. Concerning semisimple ones, we report an explicit counterexample demonstrating an AFA admissible by ${\mathfrak sl(2, \, {\mathbb C})}$. We then discuss the remaining two classes of nonassociative Lie-admissible algebras, the $A_3$-associative and $S_3$-associative types. Finally, we prove that $S_3$-associative algebras are universal pre-Lie structures for any Lie algebra over ${\mathbb C}$, including semisimple ones.
Read the full abstract

Metric Geometry

Quasiconformal and Sobolev distortion of dimension

We review a selection of the literature on the distortion of metric notions of dimension under quasiconformal, quasisymmetric, and Sobolev mappings. Our story begins with Gehring's landmark 1973 higher integrability theorem for quasiconformal maps, along with its implications for the distortion of Hausdorff dimension. Astala's 1994 solution to the planar higher integrability conjecture led to renewed interest in the subject in two dimensions. We continue with results from the 2000s and 2010s on the distortion of dimension by Sobolev maps, including estimates for dimension increase for generic elements in parameterized families of subsets. In the abstract metric setting, Pansu's notion of conformal dimension provides a key quasisymmetric invariant which has been useful in a wide range of applications. We briefly review relevant facts about conformal dimension, highlighting results of interest in the Euclidean setting. We conclude with recent work of the author in collaboration with Chrontsios Garitsis and with Fraser, extending the previous theory to interpolating dimensions and providing new insight into both quasiconformal classification and conformal dimension.
Read the full abstract

Algebraic Geometry

Refined enumerative invariants and mixed Welschinger invariants

For real toric surfaces and conjugation invariant point conditions with all conjugate pairs on the boundary divisors, we prove that the signed count of real curves of arbitrary genus in the linear system through the given points is invariant under variation of the points, provided the reduced tropicalization is in general position. The proof is based on a new relative refined tropical invariant, which is invariant under variation of the point conditions and specializes at $y\to -1$ to this signed count; at $y\to 1$ the same invariant recovers the count of complex curves with prescribed tangency to the boundary. We extend the invariant to allow arbitrary tangency orders along the boundary and identify its $y\to 1$ limit with the corresponding complex count. Finally, we show that in positive genus the signed real count is not invariant when conjugate pairs are allowed in the interior, even under strong genericity assumptions.
Read the full abstract

Algebraic Geometry

Microlocal index theorems and analytic torsion invariants in the geometric theory of partial differential equations

We develop a microlocal and derived-geometric framework for index theory and analytic torsion of nonlinear PDEs. By integrating Spencer hypercohomology, microlocal sheaf theory, and factorization algebras, we establish new connections between classical index theorems, BCOV invariants of Calabi-Yau manifolds, and the geometry of configuration spaces. We prove sheaf-theoretic index formulas for families of formally integrable PDEs, a microlocal index theorem for D-algebras generalizing Atiyah-Singer, and a mixed-type index theorem via microlocal stratification. We construct Ray-Singer analytic torsion for involutive systems and show that the BCOV invariant equals the Spencer torsion of the de Rham system. A categorical trace interpretation leads to a virtual index theory for derived moduli spaces of solutions. Finally, we extend the theory to configuration spaces using factorization algebras, with applications to renormalization and QFT. These results unify geometric perspectives on PDEs, torsion invariants, and moduli theory, with implications for mirror symmetry, quantum fields, and Calabi-Yau degenerations.
Read the full abstract

All authors Jacob Kryczka, Vladimir Rubtsov, Artan Sheshmani, Shing-Tung Yau

Number Theory · Cross-listed from cs.CR

Arithmetic limiting laws over shifted primes: Hausdorff dimension zero, Fourier decay, and absolute continuity

We study the classical limiting laws of $\varphi(n)/n$ and $\sigma(n)/n$ over integers and shifted primes $p-1$. Let $\mu_G$ denote the shifted-prime totient law and $\mu_f$ its image under $x\mapsto-\log x$. The law $\mu_G$ has Hausdorff dimension zero, while every Borel set of positive $\mu_G$-measure has packing dimension one. All four ratio laws and their logarithmic images have lower and upper Shannon information dimensions satisfying $0.550<\underline{d}_1\le\overline{d}_1<0.571$. The law $\mu_G$ gives full mass to absolutely normal Liouville numbers. Both $\mu_G$ and $\mu_f$ have quantitative Fourier decay. For $\mu_f$, we obtain sharp concentration asymptotics and localize maximizing intervals. For $U_T$ uniform on $[0,T]$, $(\log T)\widehat{\mu_f}(U_T)$ converges in distribution to a random Euler product with an independent uniform phase. For a uniform square matrix over $\mathbb{F}_p$, the probability of a primitive-root determinant tends, as the matrix size grows, to $c(p)=\frac{\varphi(p-1)}{p-1}\prod_{j\ge1}(1-p^{-j})$. Over primes, $c(p)$ has limiting law $\mu_G$. In every fixed reduced progression, the empirical laws of $c(p)$ and $\varphi(p-1)/(p-1)$ over primes $p\le x$ converge to their common progression law with sharp Kolmogorov order $1/\log x$. We also obtain transport estimates in growing progressions. Strongly additive functions with prime values $(\log\ell)^{-A}$ have absolutely continuous integer and shifted-prime laws for every $A>0$, disproving the Erdős–Kátai singularity conjecture for $A>2$. Applications include extremal determinant bounds and certified prime selection without complete factorization of $p-1$. These results are unconditional; further quantitative refinements assume the generalized Riemann hypothesis for Dirichlet $L$-functions.
Read the full abstract

Spectral Theory

A counterexample to Fermi isospectral rigidity for two dimensional discrete periodic Schrödinger operators

Using numerical certification, we prove the existence of a nontrivial real-valued two dimensional periodic potential whose associated discrete Schrödinger operator is Fermi isospectral to the zero potential. This provides a negative answer to a question posed by the third author concerning the rigidity of Fermi isospectrality in dimension two. This example also disproves a conjecture of Gieseker, Knörrer, and Trubowitz in the 1990s stating that for any nontrivial real-valued periodic potential in dimension two, the Fermi variety is irreducible at all energy levels.
Read the full abstract

Algebraic Geometry · Cross-listed from hep-th

Holes in Calabi-Yau Effective Cones

Motivated by their role in non-perturbative potentials in string theory, we study divisors in effective cones of Calabi-Yau threefolds. We give examples of geometries for which some divisor classes in the effective cone are not themselves effective: i.e., they have no global sections. We call these non-holomorphic divisor classes "holes," and characterize their behavior in an ensemble of toric hypersurface Calabi-Yau threefolds. We prove some necessary and sufficient conditions for the existence of holes, show consequences of holes that follow from the minimal model program, and demonstrate that a class of holes come in semigroups (with this class conjectured to constitute all holes). Furthermore, we provide moduli-dependent bounds on the volumes of four-cycles representing holes.
Read the full abstract

All authors Naomi Gendler, Elijah Sheridan, Michael Stillman, David H. Wu

Mathematical Physics · Cross-listed from nlin.SI

Bootstrapping Fermionic $R$-operators with Decorated Yang–Baxter Equations

Integrating infinitesimal generators of local dynamics into finite-time evolution is generally harder than extracting a local Hamiltonian from a quantum gate. For integrable one-dimensional quantum many-body systems, a recent bootstrap constructs one-parameter $R$-operators directly from Hamiltonians satisfying the Reshetikhin condition. However, this condition excludes important models such as the Hubbard model, whose two-parameter $R$-operator was obtained by Shastry from a decorated Yang–Baxter equation obeyed by its free-fermion sector. Here, I extend the bootstrap to $R$-operators constrained by both the ordinary and decorated Yang–Baxter equations. Their joint expansion produces additional Hamiltonian-level necessary conditions and recursively determines candidate higher-order terms, subject to two-site locality at each order. I also derive compatibility and factorization conditions under which a Shastry-type superposition solves the $RLL$ relation after deformation by an onsite involution. The construction recovers the known two-parameter $R$-operators of the Hubbard and XYh models, whose full Yang–Baxter equations follow from established tetrahedral Zamolodchikov algebra relations. For a superconducting Hubbard deformation, the scalar equations are generically incompatible, placing it outside this framework. These results provide diagnostics and a systematic route to fermionic $R$-operators beyond the Reshetikhin condition. General sufficiency, convergence of the formal bootstrap, and sufficiency of the deformation conditions remain open.
Read the full abstract

Information Theory · Cross-listed from cs.CR

A systematic review of secure coded caching

In a content delivery network (CDN), resources are strained during peak-time and underutilised in off-peak times when supplying digital content to users. Caching can help balance this. At the off-peak time some content is delivered to users' local caches. During peak time, the use of cached data to serve users' requests relieves strain on the network by reducing repeated transfer of popular content. In coded caching, the cache content placement is designed in conjunction with the delivery techniques to optimise network throughput. Since dissemination of information, as well as the delivery of entertainment, is reliant on CDNs, the security and privacy of cache placement, user demand, and content delivery, are paramount. In much of the literature in secure coded caching, security is built on top of solutions that have efficiency in mind, and most current proposals focus on the security of individual parts of the process. A lack of a unifying network model also makes it difficult to compare or combine solutions. In this survey we analyse the security and privacy requirements of secure coded caching, and evaluate existing schemes in terms of the security provided and the cost of this security provision. We also review the techniques used to achieve secure coded caching and analyse their limitations. In addition, we contextualise secure coded caching in the landscape of other secure content delivery primitives. As a result, we identify and prioritise open security and privacy challenges for the future.
Read the full abstract

Statistics Theory · Cross-listed from stat.ML

Deep regression learning from dependent observations with minimum error entropy principle

This paper considers nonparametric regression from strongly mixing observations. The proposed approach is based on deep neural networks with minimum error entropy (MEE) principle. We study two estimators: the non-penalized deep neural network (NPDNN) and the sparse-penalized deep neural network (SPDNN) predictors. Upper bounds of the expected excess risk are established for both estimators over the classes of Hölder and composition Hölder functions. For the models with Gaussian error, the rates of the upper bound obtained match (up to a logarithmic factor) with the lower bounds established in \cite{schmidt2020nonparametric}, showing that both the MEE-based NPDNN and SPDNN estimators from strongly mixing data can achieve the minimax optimal convergence rate.
Read the full abstract

Algebraic Geometry

Enumerative geometry of $K3$ surfaces

The aim of these notes is to explain various enumerative results about $K3$ surfaces without assuming familiarity with Gromov–Witten theory. The enumerative results in question are due to Beauville, Bryan and Leung, Pandharipande, Maulik, Thomas, and others, and confirm conjectures made by Yau–Zaslow, Göttsche, and Katz–Klemm–Vafa.
Read the full abstract

Statistics Theory

Conformal e-prediction in the presence of confounding

This note extends conformal e-prediction to cover the case where there is observed confounding between the random object $X$ and its label $Y$. We consider both the case where the observed data is IID and a case where some dependence between observations is permitted.

Probability

An inequality involving alternating binomial sums

In this letter, we prove an inequality involving alternating binomial logarithmic sums by exploiting the variance of the logarithm of the maximum of independent and identically distributed exponential random variables. This inequality was introduced in our recent work [On the minimum of independent collecting processes via the Stirling numbers of the second kind, Statist. Probab. Lett., 185 (2022)].
Read the full abstract

Numerical Analysis

On the energy dissipation rate of ensemble eddy viscosity models of turbulence: Shear flows

Classical eddy viscosity models add a viscosity term with turbulent viscosity coefficient developed beginning with the Kolmogorov-Prandtl parameterization. Approximations of unknown accuracy of the unknown mixing lengths and turbulent kinetic energy are typically constructed by solving associated systems of nonlinear convection-diffusion-reaction equations with nonlinear boundary conditions. Often these over-diffuse so additional fixes are added such as wall laws or using different approximations in different regions (which must also be specified). Alternately, one can solve an ensemble of NSE's with perturbed data, compute the ensemble mean and fluctuation and simply compute directly the turbulent viscosity parameterization. This idea is recent, seems to be of lower complexity and greater accuracy and produces parameterizations with the correct near wall asymptotic behavior. The question then arises: Does this ensemble eddy viscosity approach over-diffuse solutions? This question is addressed herein.
Read the full abstract

Information Theory · Cross-listed from cs.NI

Initialization and Rate-Quality Functions for Generative Network Layer Protocols

Generative AI (GenAI) creates full content based on compact encodings. While GenAI has been used for applications where the generated content is returned to the encoding sender, it can also extend the capacity of communication networks by transmitting compact encodings through capacity-limited links, then generating and forwarding approximations from the GenAI node to the destination. This poses the challenge of evaluating approximation quality as a function of the rate between the source and GenAI node, while accounting for the communication overhead of learning. We present a method- and modality-agnostic initialization protocol for learning rate-quality functions in GenAI-aided networks, defining three variants: source-, node-, and destination-oriented, each with different messaging flows based on where quality is measured. The protocol augments node discovery protocols (e.g., MCP, A2A) when sources lack confidence in advertised model performance. We illustrate operation via a minimum estimation budget calculated using a distribution-free tolerance limit , and validate using a case study on image transmission under quality constraints. Results confirm the calculated budget meets the target quality requirement, with positive gains over JPEG after around 20 post-learning transmissions for a perceptual metric and more than 100 for a goal-oriented metric, providing a practical foundation for GenAI-based network compression.
Read the full abstract

Probability · Cross-listed from cs.LG

A Learning-Based Superposition Operator for Non-Renewal Arrival Processes in Queueing Networks

The superposition of arrival processes is a fundamental yet analytically intractable operation in queueing networks when inputs are general non-renewal streams. Classical methods either reduce merged flows to renewal surrogates, rely on computationally prohibitive Markovian representations, or focus solely on mean-value performance measures. We propose a scalable data-driven superposition operator that maps low-order moments and autocorrelation descriptors of multiple arrival streams to those of their merged process. The operator is a deep learning model trained on synthetically generated Markovian Arrival Processes (MAPs), for which exact superposition is available, and learns a compact representation that accurately reconstructs the first five moments and short-range dependence structure of the aggregate stream. Extensive computational experiments demonstrate uniformly low prediction errors across heterogeneous variability and correlation regimes, substantially outperforming classical renewal-based approximations. When integrated with learning-based modules for departure-process and steady-state analysis, the proposed operator enables decomposition-based evaluation of feed-forward queueing networks with merging flows. The framework provides a scalable alternative to traditional analytical approaches while preserving higher-order variability and dependence information required for accurate distributional performance analysis.
Read the full abstract

Group Theory

$\mathbb{R}$–trees and accessibility over arc-stabilisers

Let $G\curvearrowright T$ be a minimal action on an $\mathbb{R}$–tree with $G$ finitely presented. Assuming that $G$ is accessible over the family of arc-stabilisers of $T$, we give a description of the point-stabilisers of $T$ in terms of simplicial trees. In particular, these point-stabilisers are finitely generated. This has applications to the study of automorphisms of right-angled Artin groups and special groups.
Read the full abstract

Group Theory

Automorphism growth and group decompositions

Let $G$ be a finitely generated group with an automorphism $\varphi\in{\rm Aut}(G)$, or an outer automorphism $\phi\in{\rm Out}(G)$. Suppose that $G$ decomposes into simpler pieces on which the growth behaviour of $\varphi$ and $\phi$ is known, particularly as a direct product, free product, or graph of groups. This article is devoted to the (often not entirely straightforward) problem of deducing information about the growth rates of $\varphi$ and $\phi$ on the whole $G$.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Partition-Based Functional Ridge Regression for High-Dimensional Data

This paper proposes a partition-based functional ridge regression framework to address multicollinearity, overfitting, and interpretability in high-dimensional functional linear models. The coefficient function vector \( \boldsymbol{\beta}(s) \) is decomposed into two components, \( \boldsymbol{\beta}_1(s) \) and \( \boldsymbol{\beta}_2(s) \), representing dominant and weaker functional effects. This partition enables differential ridge penalization across functional blocks, so that important signals are preserved while less informative components are more strongly shrunk. The resulting approach improves numerical stability and enhances interpretability without relying on explicit variable selection. We develop three estimators: the Functional Ridge Estimator (FRE), the Functional Ridge Full Model (FRFM), and the Functional Ridge Sub-Model (FRSM). Under standard regularity conditions, we establish consistency and asymptotic normality for all estimators. Simulation results reveal a clear bias–variance trade-off where FRSM performs best in small samples through strong variance reduction, whereas FRFM achieves superior accuracy in moderate to large samples by retaining informative functional structure through adaptive penalization. An empirical application to Canadian weather data further demonstrates improved predictive performance, reduced variance inflation, and clearer identification of influential functional effects. Overall, partition-based ridge regularization provides a practical and theoretically grounded method for high-dimensional functional regression.
Read the full abstract

Optimization and Control

From Global Optimization to Exact Coordinates: Heilbronn's Triangle Problem on the Unit Square Using Mixed-Integer Nonlinear Optimization

We develop a mixed-integer nonlinear programming (MINLP) approach for the Heilbronn triangle problem on the unit square. The formulation exploits the boundary structure of optimal configurations, which we establish rigorously, to fix coordinates and orientation variables a priori. With this formulation, a general-purpose global solver solves the case $n=9$ to global optimality within its numerical tolerances in about eight minutes on a laptop and without any precomputation, compared with about 23 hours of total computation for the best previous approach. The same model also solves $n=10$ for the first time, in under seven hours, and confirms the configuration of Comellas and Yebra (2002). The numerical solutions then guide an exact symbolic reconstruction, and the minimum triangle area of every reconstructed configuration is verified in exact arithmetic. This yields exact coordinates for all $n\le 10$, including the configurations of Comellas and Yebra (2002) for $n=9$ and $n=10$, together with rigorous lower bounds. Finally, we derive structural properties of optimal configurations, formulate a conjecture on the number of critical triangles, and pose an open question. All code and data are publicly available.
Read the full abstract

Combinatorics

On an Overpartition Analogue of $SOME(n)$

Recently, Andrews and Dastidar introduced the partition function $SOME(n)$, defined as the sum of all the odd parts in the partitions of $n$ minus the sum of all the even parts in the partitions of $n$. They derived its generating function and established some congruences satisfied by \(SOME(n)\). In this paper, we introduce an overpartition analogue of $SOME(n)$, denoted by $\overline{SOME}(n)$, the sum of all the odd parts in the overpartitions of \(n\) minus the sum of all the even parts in the overpartitions of \(n\). We derive the generating function for $\overline{SOME}(n)$ and obtain congruences modulo \(3, \ 5\) and powers of \(2\). Our method is based on classical $q$-series identities and manipulations of infinite products and sums.
Read the full abstract

Combinatorics

Combinatorial designs and the Prouhet–Tarry–Escott problem

This is the first paper that provides a systematic treatment of the $r$-dimensional PTE problem in additive number theory, abbreviated by PTE$_r$, through its connection with combinatorial design theory, the branch of combinatorial mathematics that deals with finite set systems or arrangements with the ^^ balancedness' conditions. We first propose a combinatorial reconsideration of the definition of nontrivial solution introduced by Alpers and Tijdeman (2007), and then prove a fundamental lower bound for the size of such solutions. We exhibit high-dimensional minimal solutions with respect to the fundamental bound, which inherently have the structure of distinctive block designs or orthogonal arrays (OAs). Next, we develop a powerful method for constructing PTE$_r$ solutions via various classes of combinatorial designs such as block designs and OAs. Furthermore, we explore two dimension-lifting methods for constructing PTE$_r$ solutions: one is a combinatorial composition that produces PTE$_r$ solutions by embedding lower-dimensional solutions into OAs with $r$ columns, and the other is a recursive technique in which a PET$_r$ solution is constructed by taking the Cartesian product of two lower-dimensional solutions. It is emphasized that our results generalize many previous works, including a measure-theoretic construction by Lorentz (1949) and its geometric analog by Alpers and Tijdeman (2007), a key lemma in Jacroux's work (1995) on the construction of sets of integers with equal power sums, and the famous Borwein solution and its two-dimensional extension by Matsumura and Sawa (2025). In addition, we prove a characterization theorem for ideal solutions of the PTE$_1$ and discuss the connection with a curious phenomenon, called half-integer design, that is rarely reported in the combinatorial design theory or spherical design theory.
Read the full abstract

All authors Munenori Inagaki, Hideki Matsumura, Masanori Sawa, Yukihiro Uchida

Analysis of PDEs

Far field refraction problem with loss of energy in negative refractive index material

This paper studies the far field refraction problem in negative refractive index material with loss of energy, which is a remaining problem in E. Stachura, Nonlinear Anal. 2017;157:76-103. The analysis is divided into two cases according to the relative refractive index $\kappa$, that is, $\kappa<-1$ and $-1<\kappa<0$. For each case, we use the Minkowski method to establish the existence of the weak solution when the target measure is either discrete or a finite Radon measure. Eventually, the inequality involving a Monge-Ampère type operator satisfied by the solution of the problem is derived, which is useful to understand this complex optical phenomenon.
Read the full abstract

Number Theory

The M öbius Disjointness Conjecture on infinite-dimensional torus

Let $\mathbb{T}^\omega$ be the infinite-dimensional torus, and $T: \mathbb{T}^\omega\to \mathbb{T}^\omega$ be defined by \[ T: (x_1, x_2, \dots, x_k, \ldots) \mapsto (x_1 + \alpha, x_2 + h(x_1), \dots, x_k + h(x_1 + (k-2)\beta), \dots) \] with $\alpha\in \mathbb{R}, \beta\in \mathbb{R}\backslash\mathbb{Q},$ and $h: \mathbb{R}\to \mathbb{R}$ being $1$-period and $C^{1+\varepsilon}$-smooth. This flow $(\mathbb{T}^\omega, T)$ is distal, and is also irregular in the sense that its Birkhoff average does not exist for all $x\in \mathbb{T}^\omega$. The main result of this paper is that the M öbius Disjointness Conjecture of Sarnak holds for $(\mathbb{T}^\omega, T)$.
Read the full abstract

Probability · Cross-listed from cs.LO

Probabilistic Disjunctive Normal Forms in Temporal Logic and Automata Theory

This article introduces probabilistic disjunctive normal forms (PDNFs) as a framework for representing and reasoning about uncertainty in logical systems. Unlike classical DNFs, PDNFs assign real-valued weights to variables, encoding probabilistic information about their presence, absence, or negation. Then we construct a vector space of PDNFs that allows algebraic evidence combination. PDNFs are interpreted as probability distributions over venjunctions (temporal logic constructs) and as integrable functions over partitioned intervals, where the integrals determine variable probabilities. This dual perspective allows for a Banach space structure and the application of functional analysis. We demonstrate that, under exponential parametrisation, PDNF addition aligns with Bayesian evidence fusion and derive bounds for outcome identification from random samples. The formalism thus bridges logic, numerical methods, and continuous probability.
Read the full abstract

Optimization and Control

On Utility Maximization under Multivariate Fake Stationary Affine Volterra Models

This paper is concerned with Merton's portfolio optimization problem in a Volterra stochastic environment described by a multivariate fake stationary Volterra–Heston model. Due to the non-Markovianity and non-semimartingality of the underlying processes, the classical stochastic control approach cannot be directly applied in this setting. Instead, the problem is tackled using a stochastic factor solution to a Riccati backward stochastic differential equation (BSDE). Our approach is inspired by the martingale optimality principle combined with a suitable verification argument. The resulting optimal strategies for Merton's problems are derived in semi-closed form depending on the solutions to time-dependent multivariate Riccati-Volterra equations, while the optimal value is expressed using the solution to this original Riccati BSDE. Numerical results on a two dimensional fake stationary rough Heston model illustrate the impact of stationary rough volatilities on the optimal Merton strategies.
Read the full abstract