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 18 March

Quantum Algebra

Open-Closed String Field Theory from Calabi-Yau Categories and its Applications to Enumerative Geometry

The overarching goal of this thesis was to develop categorical methods that connect enumerative geometry, as studied in mirror symmetry, with large $N$ gauge theories. In the first part, we established a relation between graph complexes, Calabi-Yau $A_\infty$-categories, and Kontsevich's cocycle construction. The next main result is the construction of a formality $L_\infty$-morphism relating algebraic structures built from a Calabi-Yau category and one of its objects; this morphism depends on a splitting of the non-commutative Hodge filtration. This generalizes the approach of categorical enumerative invariants from the closed to the open-closed setting. From a physics perspective, closed categorical enumerative invariants are encoded by the partition function of the associated closed string field theory (SFT). We explain how our open-closed morphism is an ingredient in quantizing the large N open SFT associated to an object of a Calabi-Yau category. In the final part of this thesis, based on an algebraic approach to open and closed backreacted SFT, we propose ideas towards a categorical formulation of 'Twisted Holography' at the level of partition functions, given as input a Calabi-Yau category and one of its objects.
Read the full abstract

Mathematical Physics

Critical coupling thresholds for tilted Kuramoto-Vicsek models with a confining potential

We study a Kuramoto-Vicsek model of self-propelled particles with periodic boundary conditions subject to a constant angular tilt and a confining potential, and its mean-field (Fokker-Planck) behaviour. In the absence of confinement, the uniform density is stationary and we compute the critical coupling for four normalisation variants of the interaction kernel, showing that the leading instability is always spatially homogeneous. When the confining field is present, the uniform state is no longer stationary. We construct the new steady state perturbatively and apply eigenvalue perturbation theory to derive an explicit formula for the critical coupling as a function of the field strength. The threshold increases quadratically with confinement strength, and the tilt enters through the steady-state correction despite having no effect on the threshold in the absence of confinement. We verify the prediction numerically and derive self-consistency equations for stationary states with general multichromatic potentials.
Read the full abstract

Group Theory

Around Gromov's injectivity lemma and applications to post-injunctive groups

Gottschalk's surjunctivity conjecture states that for all group universes and finite alphabets, every equivariant and continuous selfmap of the full shift, known as cellular automaton, cannot be a strict embedding. Not all surjective cellular automata are injective. However, if the surjectivity condition is replaced by a certain strengthened property called post-surjectivity then all post-surjective cellular automata must be bijective whenever the universe is a sofic group. A group universe is said to be post-injunctive if every post-surjective cellular automaton with finite alphabet over this group universe must be bijective. Gromov's injectivity lemma states each injective cellular automaton over a subshift can be extended to an injective cellular automaton over every subshift which is close enough to the initial subshift. In this paper, we obtain analogous results where injectivity is replaced by other fundamental dynamical properties namely post-surjectivity and pre-injectivity. We also study various stable properties of the class of post-injunctive groups in parallel to properties of surjunctive groups. Among the results, we show that semidirect extensions of post-injunctive groups with residually finite kernels must be post-injunctive.
Read the full abstract

Combinatorics

On Rado's single equation theorem

We show that for non-zero integers $a$ and $b$ there is a natural number $N < \exp(r^{2+o_{a,b;r\rightarrow \infty}(1)})$ such that in any $r$-colouring of $\{1,\dots,N\}$ there are $x,y,z$, all in the same colour class, such that $ax-ay=bz$.

Optimization and Control

A Hybrid Decomposition Approach for Stochastic Unit Commitment with Combined-Cycle Generators

The U.S. power grid is undergoing a paradigm shift as energy demand grows in scale and volatility. In response to this growing need, the U.S. has increased adoption of combined-cycle generators (CCs). CCs are fast-ramping generators that utilize variable configurations of combustion turbines (CTs) and steam turbines (STs) to achieve higher efficiency than traditional CTs. For schedule optimization, modeling these CCs requires the addition of a large number of binary constraints and variables to Unit Commitment (UC) problem formulations. This paper presents a novel hybrid Benders' (BD) and Dantzig-Wolfe (DW) decomposition algorithm, called CRG, for stochastic UC problems with CCs. CRG exploits the separability of the linear constraints in UC through BD and the integer CC constraints through DW. A novel set of valid inequalities are proposed for significantly tightening the lower bound produced by CRG. CRG is tested on the 935-generator FERC test data set, modified to include CC mode data. Results demonstrate better primal solutions than BD on cases with at least 20 load scenarios. CRG scales computationally better than Gurobi's branch-and-bound solver, which exceeds 64GB RAM allocations at 45 scenarios. Results show that the proposed algorithm is a scalable approach for solving large-scale stochastic UC with CCs.
Read the full abstract

All authors Rosemary Barrass, Harsha Nagarajan, Mathieu Tanneau, Russell Bent, Pascal Van Hentenryck

Probability · Cross-listed from stat.ML

ResNets of All Shapes and Sizes: Convergence of Training Dynamics in the Large-scale Limit

We establish convergence of the training dynamics of residual neural networks (ResNets) to their joint infinite depth L, hidden width M, and embedding dimension D limit. Specifically, we consider ResNets with two-layer perceptron blocks in the maximal local feature update (MLU) regime and prove that, after a bounded number of training steps, the error between the ResNet and its large-scale limit is O(1/L + sqrt(D/(L M)) + 1/sqrt(D)). This error rate is empirically tight when measured in embedding space. For a budget of P = Theta(L M D) parameters, this yields a convergence rate O(P^(-1/6)) for the scalings of (L, M, D) that minimize the bound. Our analysis exploits in an essential way the depth-two structure of residual blocks and applies formally to a broad class of state-of-the-art architectures, including Transformers with bounded key-query dimension. From a technical viewpoint, this work completes the program initiated in the companion paper [Chi25] where it is proved that for a fixed embedding dimension D, the training dynamics converges to a Mean ODE dynamics at rate O(1/L + sqrt(D)/sqrt(L M)). Here, we study the large-D limit of this Mean ODE model and establish convergence at rate O(1/sqrt(D)), yielding the above bound by a triangle inequality. To handle the rich probabilistic structure of the limit dynamics and obtain one of the first rigorous quantitative convergence for a DMFT-type limit, we combine the cavity method with propagation of chaos arguments at a functional level on so-called skeleton maps, which express the weight updates as functions of CLT-type sums from the past.
Read the full abstract

Analysis of PDEs

Nonlinear Kirchhoff–Love shell models derived from the Ciarlet–Geymonat energy: modelling and existence of minimizers

Starting from a three-dimensional model based on the Ciarlet–Geymonat energy, we derive nonlinear shell models within the classical elasticity theory of compressible isotropic materials. The Neo-Hookean term involving the norm of the deformation gradient leads to an energy depending on the first, the second, and the third fundamental forms of the deformed midsurface. The coefficients appearing in the resulting shell models depend on the classical Lamé coefficients of the three-dimensional material, on the thickness of the shell, and on the mean and Gaussian curvatures of the reference configuration. This shows that the behavior of the shell is influenced not only by the elastic coefficients but also by the initial geometry of the three-dimensional thin body. Since a purely asymptotic derivation may lead to nonlinear terms for which the lower semicontinuity of the resulting functionals is not clear, we combine the asymptotic reduction through the thickness with positive-weight quadrature rules for selected purely volumetric contributions. After deriving the models, we establish variational well-posedness in the sense of existence of minimizers. More precisely, we prove coercivity and weak lower semicontinuity of the reduced functionals and establish the existence of minimizers in appropriate Sobolev spaces. A key ingredient is a polyconvexity concept for shells together with compensated compactness results identifying the weak limits of the area-weighted mean and Gaussian curvatures. An important consequence of the convexity analysis is that Models I and II require no additional restriction on the thickness beyond the local geometric regularity condition ensuring the regularity of the shell parametrization. Only Model III, in which the quadratic volumetric contribution is treated by a Taylor expansion, requires an additional explicit thickness condition in our existence result.
Read the full abstract

Commutative Algebra

Castelnuovo-Mumford regularity of toric varieties with at most one singular point

We establish upper bounds for the Castelnuovo–Mumford regularity of the coordinate ring of a simplicial projective toric variety with at most one singular point. In the smooth case, our results recover the bound of Herzog and Hibi [Proc. Amer. Math. Soc. 131 (2003), 2641–2647], and therefore the Eisenbud–Goto bound. Furthermore, when the variety has exactly one singular point and dimension at least $3$, we prove that its regularity also satisfies the Eisenbud–Goto bound. The proof combines combinatorial and homological methods: we study the asymptotic behavior of the sumsets associated to the toric variety and relate it to Castelnuovo–Mumford regularity via a Hochster-like formula.
Read the full abstract

Numerical Analysis

On the equivalence of semi-discrete Active Flux and Discontinuous Galerkin methods and a comparison of their performance

The Active Flux (AF) method employs a globally continuous approximation, like continuous Finite Element methods. This is achieved through the placement of point values at cell interfaces which are shared between adjacent cells. With, on average, K+1 degrees of freedom per cell, Active Flux achieves a polynomial approximation of degree K+1, while the Discontinuous Galerkin (DG) method uses only polynomials of degree K, i.e. one degree less with the same number of degrees of freedom. Despite all the differences, in this paper we show, however, that for linear problems in one and several dimensions as well as – in some sense – for nonlinear ones, semi-discrete AF and DG are the same method. We identify a mapping between their respective degrees of freedom, upon which the updates of these degrees of freedom turn out to agree. On the one hand, AF therefore seems more economical then DG for a given value of the error, and we confirm this in numerical experiments. On the other hand, this is a way to understand superconvergence of DG in a natural way, and we show how Radau polynomials and their zeros appear in the mapping between DG and AF: In the Radau points, AF "shines through" as the background high-order scheme behind DG.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Moments in the CFT Landscape

We develop a novel numerical bootstrap for unitary, crossing-symmetric conformal field theories, focusing on moment observables defined as weighted averages over conformal data. Providing a global and coarse-grained probe of the operator spectrum, this framework yields numerically rigorous bounds on the operator distribution using standard semidefinite programming techniques. In the heavy correlator regime, these bounds remain robust and converge rapidly towards analytically-derived power laws. At finite external dimensions, low-lying moments capture corrections to analytic heavy limit results, while reproducing familiar bootstrap solutions such as Ising-model kinks on the boundary of moment space. Most importantly, the moment bootstrap reveals new features in previously unexplored regions of the bootstrap landscape. The lower bounds on moment variables exhibit two continuous families of kinks persisting across $2 < d < 6$, reflecting nontrivial spectral reorganizations connected to underlying operator decoupling phenomena. These results demonstrate that moment variables uncover bootstrap solutions and collective structures that are difficult to access within traditional numerical approaches.
Read the full abstract

Information Theory · Cross-listed from quant-ph

What resources are needed for optimal learning of bosonic Gaussian states?

Continuous-variable systems enable key quantum technologies in computation, communication, and sensing. Bosonic Gaussian states emerge naturally in various such applications, including gravitational-wave and dark-matter detection. A fundamental question is how to characterize an unknown bosonic Gaussian state from as few samples as possible. Despite decades-long exploration, the ultimate efficiency limit remains unclear. In this work, we study the necessary and sufficient number of copies to learn an $n$-mode Gaussian state, with energy less than $E$, to $\varepsilon$ trace distance with high probability. We prove a lower bound of $\Omega(n^3/\varepsilon^2)$ for Gaussian measurements, matching the best known upper bound up to doubly-log energy dependence, and ${\Omega}(n^2/\varepsilon^2)$ for arbitrary measurements. We further show an upper bound of $\widetilde{O}(n^2/\varepsilon^2)$ given that the Gaussian state is promised to be either pure or passive. Interestingly, while Gaussian measurements suffice for nearly optimal learning of pure Gaussian states, non-Gaussian measurements are provably required for optimal learning of passive Gaussian states. Finally, focusing on learning single-mode Gaussian states via non-entangling Gaussian measurements, we provide a nearly tight bound of $\widetilde\Theta(E/\varepsilon^2)$ for any non-adaptive schemes, showing adaptivity is indispensable for nearly energy-independent scaling. As a byproduct, we establish sharp bounds on the trace distance between Gaussian states in terms of the total variation distance between their Wigner distributions, and obtain a nearly tight sample complexity bound for learning the Wigner distribution of any Gaussian state to $\varepsilon$ total variation distance. Our results significantly advance quantum learning theory in the bosonic regimes and have practical impact in quantum sensing and benchmarking applications.
Read the full abstract

All authors Senrui Chen, Francesco Anna Mele, Marco Fanizza, Alfred Li, Zachary Mann, Hsin-Yuan Huang, Yanbei Chen, John Preskill

Number Theory

One one type of ud-preserving mapping

In this paper a class of mappings on unit interval is constructed. These mapping preserve uniform distribution and theirs iterations form a sequence which is Buck uniformly distributed. In the third part some prorties of these mappings are proven.

Number Theory

Bounded Representations by $x^2+y^2-z^2$

We prove that every sufficiently large integer $n$ can be written in the form $n=x^2+y^2-z^2$ with $\textrm{max}(x^2,y^2,z^2)\le n$. The proof converts the problem into finding a primitive binary quadratic form of positive discriminant $4n$ inside a fixed relatively compact open patch of the real hyperboloid $b^2-4ac=4n$. This is then supplied by Duke's theorem in the precise point-counting form deduced from the measure-theoretic duality of Einsiedler-Lindenstrauss-Michel-Venkatesh. A finite parity correction returns to the original ternary variables. This settles Erdős Problem 1148.
Read the full abstract

Information Theory

Growing Alphabets in Canonical Shuffle Experiments: Likelihood-Ratio Laws, Estimation Bounds, and Low-Budget Equivariant Design

We study canonical one-step neighboring shuffle experiments for finite-output epsilon_0-LDP d-ary channels along growing alphabets, with frequency estimation and mechanism design under a pairwise chi-squared budget. The pairwise likelihood-ratio law nu_{ab,d} (pushforward of the row ratio under the null row) is the governing invariant: the canonical shuffled histogram experiment is exactly equivalent to the quotient multinomial experiment generated by nu_{ab,d}. Alphabet growth improves canonical shuffled privacy iff the worst pairwise law collapses to delta_1. We prove a sharp pure-LDP endpoint principle for the pairwise chi-squared, construct full-support obstruction families saturating it, and establish a diluting/persistent dichotomy with explicit finite-n hockey-stick bounds. The worst-case pairwise budget chi_*(W) governs a two-regime Assouad lower bound for arbitrary estimators in the i.i.d. multinomial model. Symmetrization reduces the uniform-point Fisher criterion to permutation-equivariant channels. Calibrated GRR is not optimal; in the low-budget regime, augmented GRR is optimal among permutation-equivariant channels.
Read the full abstract

Information Theory

A New Approach to Code Smoothing Bounds

Code smoothing is a phenomenon in which an error distribution makes a code statistically close to the uniform distribution over the ambient space. This closeness is measured by the total variation distance. Recently, Debris-Alazard et al.\ introduced a smoothing bound, which is an upper bound on this total variation distance. Although the smoothing bound evaluates how the error distribution smooths a code, this bound applies only to linear codes. In this paper, we generalize this bound to not only linear codes but also specific non-linear codes. While the smoothing bound in previous work was obtained by Fourier analysis over finite abelian groups, we derive this bound using a graph-theoretic approach. To derive the smoothing bound, we consider code smoothing as the mixing of random walks on a specific graph, and use the concept of equitable partitions, which is well-studied in graph theory.
Read the full abstract

General Mathematics

An Algebraic Structure for the Central Mexican Ritual Calendar

This article develops an algebraic model of the 260-day Central Mexican ritual calendar, the Tonalpohualli. We represent the calendar as the cyclic group $\mathbb{Z}_{13}\oplus\mathbb{Z}_{20}$, where each day name is encoded by a numeral-sign pair. From this model, we derive explicit correspondences between day numbers and day names through group actions. We also characterize, in algebraic terms, the twenty 13-day periods, the thirteen 20-day periods, and the partition of days into oriented tetrads. In addition, we describe how these structures relate to a subgroup generated by permutations of the starts of 13-day periods, and we show its connection with a cyclic group of order four and with square rotations. These results formalize and extend previous arithmetic and structural interpretations of the Tonalpohualli, and they provide a framework for codex analysis.
Read the full abstract

Analysis of PDEs · Cross-listed from physics.flu-dyn

SIREN Residual Error as a Regularity Diagnostic for Navier-Stokes Equations

We introduce a method for detecting regularity loss in solutions to the three-dimensional Navier-Stokes equations using the approximation error of Sinusoidal Representation Networks (SIRENs). SIRENs use sin() activations, producing C-infinity outputs that cannot represent non-smooth features. By classical spectral approximation theory, the SIREN error is bounded by O(N^{-s}) where s is the local Sobolev regularity. At a singularity (s to 0), the error is O(1) and localizes via the Gibbs phenomenon. We decompose the velocity field into a cheap analytical baseline (advection-diffusion) and a learned residual (pressure correction), training a compact SIREN (4,867 parameters). We validate on the 3D Taylor-Green vortex, where error concentration increases from 4.9x to 13.6x as viscosity decreases from 0.01 to 0.0001, localizing to the stagnation point – the geometry matching the singularity proven by Chen and Hou (2025) for 3D Euler. On axisymmetric equations, we reproduce blowup signatures (T* converging across resolutions) and identify a critical viscosity nu_c = 0.00582 for the regularization transition.
Read the full abstract

Combinatorics

The Ferrers bound for spanning trees in bipartite graphs

We prove Ehrenborg's conjecture that every connected bipartite graph $G$ with parts of size $m$ and $n$ has at most $\frac{1}{mn}\prod_{v\in V(G)} \operatorname{deg}(v)$ spanning trees, and that equality holds if and only if $G$ is a Ferrers graph.

Statistics Theory · Cross-listed from stat.ME

On min-Storey estimators for multiple testing and conformal novelty detection

In a multiple testing task, finding an appropriate estimator of the proportion $\pi_0$ of non-signal in the data to boost power of false discovery rate (FDR) controlling procedures is a long-standing research theme, sometimes referred to as 'adaptive FDR control'. The interest in this theme has been reinforced in the recent years with conformal novelty detection, for which it turns out that similar tools can be used in combination with any 'blackbox' machine learning algorithm. Nevertheless, perhaps surprisingly, finding a solution for 'adaptive FDR control' that is optimal in a broad sense is still an open problem. This paper fills this gap by introducing new $\pi_0$-estimators, referred to as min-Storey (MS) and interval-min-Storey (IMS), which are built upon the so-called 'Storey estimator'. Plugging these estimators in the adaptive Benjamini-Hochberg (BH) procedure is shown to deliver FDR control both in the independent and conformal settings. In addition, these methods satisfy an optimal power property over any (regular) alternative distribution. The excellent behaviors of the new adaptive procedures are illustrated with numerical experiments both in the independent and conformal models for various distribution structures.
Read the full abstract

Classical Analysis and ODEs

A new class of orthogonal polynomials

We consider random walk polynomial sequences $(P_n(x))_{n\in\mathbb{N}_0}\subseteq\mathbb{R}[x]$ given by recurrence relations of the form $P_0(x)=1$, $P_1(x)=x$ and $x P_n(x)=a_n P_{n+1}(x)+c_n P_{n-1}(x)\;(n\in\mathbb{N})$, where $a_n$ and $c_n$ are positive and sum up to $1$. $(P_n(x))_{n\in\mathbb{N}_0}$ is said to satisfy nonnegative linearization of products if the product of any two polynomials $P_m(x)$, $P_n(x)$ is a convex combination of $P_{|m-n|}(x),\ldots,P_{m+n}(x)$. This property gives rise to a hypergroup structure and a sophisticated harmonic analysis. We are interested in examples such that both the original sequence $(P_n(x))_{n\in\mathbb{N}_0}$ and the sequence $(\widetilde{P_n}(x))_{n\in\mathbb{N}_0}$ which corresponds to switched roles of $(a_n)_{n\in\mathbb{N}}$ and $(c_n)_{n\in\mathbb{N}}$ satisfy nonnegative linearization of products. Such considerations were recently started by Lasser and Obermaier and can be motivated from a harmonic analytic, combinatorial or probabilistic point of view. However, Lasser and Obermaier left open the question whether examples besides the trivial example of the Chebyshev polynomials of the first kind $(T_n(x))_{n\in\mathbb{N}_0}$ (with $a_n\equiv c_n\equiv1/2$) actually exist. We provide a sufficient criterion and explicitly construct such nontrivial examples. Moreover, we provide characterizations of $(T_n(x))_{n\in\mathbb{N}_0}$ by additionally involving properties of the duals and Haar measures. Our criterion also enables us to solve open problems concerning the Haar measure of polynomial hypergroups stated by Kahler and Szwarc.
Read the full abstract

Optimization and Control

A Convex Formulation of the Multi-Commodity Dynamic Traffic Assignment

We consider a multi-commodity Dynamic Traffic Assignment (DTA) problem formulated as a network flow control problem on the Cell Transmission Model (CTM). The objective is to design optimal control policies using variable speed limits, ramp metering, and dynamic routing to regulate traffic evolution over time on a given limited-capacity transportation network. Even simple instances of DTA problems on the CTM are known to give rise to non-convex optimal control formulations. Nevertheless, a single-commodity DTA formulation has recently been proposed that admits a tight convex relaxation, thereby enabling tractable optimal control synthesis. The single-commodity formulation, however, is structurally restrictive, as it effectively allows only a single destination. To address this limitation, we develop a multi-commodity CTM model in which each commodity is associated with potentially distinct sets of off-ramps. By extending the convexification approach developed for the single-commodity case, we establish a tight convex relaxation of the multi-commodity DTA problem on the CTM model. This relaxation relies on concave, commodity-specific demand functions and concave aggregate supply functions for every cell, which ensure convexity of the resulting optimal control problem. Our proposed formulation requires commodity-dependent implementation of variable speed limits and dynamic routing policies.
Read the full abstract

Number Theory

On rank $2$ hypergeometric motives

Hypergeometric motives are family of motives associated to hypergeometric local systems. Their special features, in particular their rigidity, makes them more tractable than general motives. In the present article we prove most of the properties that they are expected to satisfy in the rank $2$ case.
Read the full abstract

Numerical Analysis · Cross-listed from cs.LG

Beyond Muon: MUD (MomentUm Decorrelation) for Faster Transformer Training

Orthogonalized-momentum optimizers such as Muon improve transformer training by approximately whitening/orthogonalizing matrix-valued momentum updates via a short polar-decomposition iteration. However, polar-factor approximations typically require multiple large matrix multiplications, and the resulting overhead can be substantial and hardware-dependent. We introduce MUD (MomentUm Decorrelation), a complementary whitening approach that replaces Muon's polar update with a triangular (Cholesky-like) whitening surrogate inspired by classical Gram–Schmidt and Gauss-Seidel ideas. We show that row-orthonormal matrices are fixed points of the MUD map, relate the inner step to symmetric Gauss-Seidel preconditioning of the Gram matrix, and prove quadratic local convergence near the fixed point. In terms of time-to-perplexity, MUD yields consistent 10-50% wall-clock improvements over tuned AdamW and Muon in time-to-perplexity, typically converging slightly slower per step than Muon but with substantially lower optimizer overhead – relative to Muon, MUD improves peak tokens/s by roughly $1.3-2.6\times$ across most settings and up to nearly $3\times$ on GPT-2 large on an A100. We also demonstrate training a ESM-2 150M protein language model, where MUD matches Muon-level validation perplexity in significantly less wall-clock time.
Read the full abstract

Symplectic Geometry

Topological constraints on clean Lagrangian intersections via microlocal sheaf theory

Fix a knot $K_0$ in $\mathbb{R}^3$ and consider a Lagrangian submanifold $L$ of $T^*\mathbb{R}^3$ that is isotopic to the conormal bundle of $K_0$ by a compactly supported Hamiltonian isotopy and intersects the zero section $\mathbb{R}^3$ cleanly along a knot. In this paper, using microlocal sheaf theory and some results in $3$-manifold theory, we prove that the knot type of $K_1 := L\cap \mathbb{R}^3$ in $\mathbb{R}^3$ is strictly constrained from the knot type of $K_0$. Specifically, we deduce the existence of a surjective group homomorphism $\pi_1(\mathbb{R}^3\setminus K_0) \to \pi_1(\mathbb{R}^3\setminus K_1)$ preserving the longitude and meridian with respect to the Seifert framing. Moreover, combining with a previous work by the second author, we obtain a rigidity result which was only known for the unknot: If $K_0$ is the $(2,q)$-torus knot or the figure-eight knot, $K_1$ must have the same knot type as $K_0$.
Read the full abstract

Combinatorics

Outer and inner medians in some small lattices

By median we mean a scheme that inputs three element of a lattice, and outputs an element that is an average of the three inputs in a certain sense. The medians of a given finite lattice form a new lattice that is usually larger than the original, but generates a (not necessarily strictly) smaller variety. A median is called inner if it is a term function. The inner median lattice is closely related to the symmetric part of the equational basis of the lattice. We determine the outer and inner median lattices of all lattices of at most six elements.
Read the full abstract

Probability · Cross-listed from q-fin.RM

Robust quasi-convex risk measures and applications

This paper develops a unified framework for the robustification of risk measures beyond the classical convex and cash-additive setting. We consider general risk measures on Lp spaces and construct their robust counterparts through families of uncertainty sets that capture ambiguity. Two complementary mechanisms generate robust quasi-convex measures: in the first, quasi-convexity is inherited from the initial risk measure under convex uncertainty sets; in the second it comes from the quasi-convex (or c-quasi-convex) structure of the uncertainty sets themselves. Building on Cerreia-Vioglio et al. (2011); Frittelli and Maggis (2011), we derive dual (penalty-type) representations for robust quasi-convex and cash-subadditive risk measures, showing that the classical convex cash-additive case arises as a special instance. We further analyze acceptance families and capital allocation rules under robustification, highlighting how ambiguity affects acceptability and the distribution of capital.
Read the full abstract

All authors Francesca Centrone, Asmerilda Hitaj, Elisa Mastrogiacomo, Emanuela Rosazza Gianin

Logic

Homogeneous forcing

Assume $\kappa = \kappa^{< \kappa}$ (usually $\aleph_0$ or an inaccessible). We shall deal with iterated forcings preserving ${}^{\kappa>}{\rm Ord}$ and not collapsing cardinals along a linear order $L$. A sufficient condition for this, which we will focus on, is for the forcings to have support $<\kappa$ and the $\kappa^+$-cc, and be strategically $<{\kappa}$-complete. The aim is to have homogeneous forcings, so that the iteration has many automorphisms. In addition to the inherent interest, such iterations are helpful for considering some natural ideals on ${}^\kappa2$, in order to get a model of ${\rm ZF} + {\rm DC}_\kappa\ +$ “modulo this ideal, every set is equivalent to a $\kappa$-Borel one." But here we only have many automorphisms of the index set $L$ and therefore of the iteration of iterands $\mathbb{Q} $; we do not necessarily have homogeneity of $\mathbb{Q} $, and we do not have automorphisms mapping other names of $\mathbb{Q} $-reals onto each other. %\notemgrimes{What are the other names? Where do they come from?} However, for some reasonable forcing notions, there are no other $\mathbb{Q} $-reals! This was the reason for introducing and investigating saccharinity in earlier works with Jakob Kellner and with Haim Horowitz.
Read the full abstract

Complex Variables

On the logarithmic coefficients of Ma-Minda type convex functions

In this paper, we investigate three specific subclasses of Ma-Minda type convex functions: namely, convex functions of order $\alpha$, Janowski convex functions, and Robertson functions of normalized analytic functions defined in the open unit disk. For these classes, we establish logarithmic coefficient inequalities concerning both individual coefficient estimates and weighted series. The results presented here correct some earlier erroneous results and extend several previously known ones.
Read the full abstract