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)

Tuesday 17 March

Spectral Theory

On spectral stability for self-adjoint extensions

We prove that given a symmetric completely non-selfadjoint operator $B$ with finite deficiency indices $(n,n)$ on a Hilbert space and a boundary triplet $\left(\mathbb{C}^{n},\Gamma_{1},\Gamma_{2}\right)$ for $B^{*}$, the set of points in the spectrum of $A_{1}$ (the self-adjoint extension with domain $Ker\;\Gamma_{1}$) which are not eigenvalues of maximum multiplicity for any self-adjoint extension of $B$ disjoint of $A_{1}$, is a dense $\textit{G}_{\delta}$ set in $\sigma(A_{1})$. Furthermore, a proof of a Malamud's theorem that generalizes a well-known result of the Aronszajn-Donoghue theory on the characterization of eigenvalues is offered.
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

Linear-Quadratic Gaussian Games with Distributed Sparse Estimation

Linear-quadratic Gaussian games provide a framework for modeling strategic interactions in multi-agent systems, where agents must estimate system states from noisy observations while also making decisions to optimize a quadratic cost. However, these formulations usually require agents to utilize the full set of available observations when forming their state estimates, which can be unrealistic in large-scale or resource-constrained settings. In this paper, we consider linear-quadratic Gaussian games with sparse interagent observations. To enforce sparsity in the estimation stage, we design a distributed estimator that balances estimation effectiveness with interagent measurement sparsity via a group lasso problem, while agents implement feedback Nash strategies based on their state estimates. We provide sufficient conditions under which the sparse estimator is guaranteed to trigger a corrective reset to the optimal estimation gain, ensuring that estimation quality does not degrade beyond a level determined by the regularization parameters. Simulations on a formation game show that the proposed approach yields a significant reduction in communication resources consumed while only minimally affecting the nominal equilibrium trajectories.
Read the full abstract

All authors Tianyu Qiu, Filippos Fotiadis, Xinjie Liu, Christian Ellis, Jesse Milzman, Wesley Suttle, Ufuk Topcu, David Fridovich-Keil

Optimization and Control

Information Revelation and Alignment Faking in Stochastic Differential Games

In competitive games with private objectives, actions can reveal information about hidden parameters. However, quantifying such information revelation is nontrivial, since it depends not only on the opponent's hidden parameter but also on the opponent's model of the game. We study this problem via a two-player linear-quadratic stochastic differential game under partial information, in which each player knows its own coupling parameter and models the opponent's hidden parameter through a prior. Starting from the full-information game, we characterize the Nash equilibrium by coupled Riccati equations. We then define baseline implementable controls by averaging the equilibrium under each player's prior. Building on this baseline, we formulate an alignment faking control problem in which one player trades off fidelity to its implementable policy against information acquisition about the opponent's hidden parameter. The information incentive is constructed from a proxy Fisher information matrix based only on the player's available model. This leads to a tractable saddle-point formulation with semi-explicit control characterization through Riccati systems. Numerical illustrations show that alignment faking can substantially improve information gain over baseline play when the faker's model is accurate, but often at the cost of greater detectability. They also show that the proxy Fisher information can systematically differ from the true information under model misspecification.
Read the full abstract

Optimization and Control

Voluntary Renewable Programs: Optimal Pricing and Revenue Allocation

This paper develops a multi-period optimization framework to design a voluntary renewable program (VRP) for an electric utility company, aiming to maximize total renewable energy deployments. In the business model of VRP, the utility must ensure it generates renewable energy up to the total amount of contract during each market episode (i.e., a year), while all the revenue collected from the VRP must either be used to invest in procuring renewable capacities or to maintain the current renewable fleet and infrastructure. We thus formulate the problem as an optimal pricing problem coupled with revenue allocation and renewable deployment decisions. We model the demand function of voluntary renewable contracts as an exponential decay function based on survey data. We analytically derive the optimal pricing policy of the VRP as a function of the current grid carbon intensity. We prove that a myopic policy is conditionally optimal, which maximizes renewable capacity in each period, attains the long-run optimum due to the utility's revenue-neutral constraint. We show different binding conditions and marginal values of decision variables correspond to different phases of the energy transition, and that the utility should strategically design its revenue-sharing decisions, balancing investments in renewable expansion and subsidizing existing renewable fleets. Finally, we show that voluntary renewable programs can only extend renewable penetration but cannot achieve net-zero emissions or a fully renewable grid. This pricing-allocation-expansion framework highlights both the potential and limitations of voluntary renewable demand, providing analytical insight into optimal policy design and the qualitative shifts occurring during the energy transition process.
Read the full abstract

Dynamical Systems

Sequential densities of rational languages

We introduce the notion of density of a rational language with respect to a sequence of probability measures. We prove that if $(\mu_n)$ is a sequence of Bernoulli measures converging to a positive Bernoulli measure $\overline{\mu}$, the sequential density is the ordinary density with respect to $\overline{\mu}$. We also prove that if $(\mu_n)$ is a sequence of invariant probability measures converging in the strong sense to an invariant probability measure $\overline{\mu}$, then the sequential density of every rational language exists for this sequence.
Read the full abstract

Probability

Discrete RG flow of a hierarchical singular SPDE

This paper illustrates the Renormalisation Group (RG) approach to singular SPDEs following a framework introduced by Kupiainen \cite{Kupiainen2016}. We study a linear elliptic SPDE with a hierarchical Laplace operator and multiplicative noise, in two dimensions. Although this model is a significant simplification, it captures the core mechanisms of the RG method in a transparent setting. Particular emphasis is placed on the dynamical system governing the flow of the effective force coefficients, the central object of the RG method.
Read the full abstract

Optimization and Control · Cross-listed from cs.NE

Quadratic Surrogate Attractor for Particle Swarm Optimization

This paper presents a particle swarm optimization algorithm that leverages surrogate modeling to replace the conventional global best solution with the minimum of an n-dimensional quadratic form, providing a better-conditioned dynamic attractor for the swarm. This refined convergence target, informed by the local landscape, enhances global convergence behavior and increases robustness against premature convergence and noise, while incurring only minimal computational overhead. The surrogate-augmented approach is evaluated against the standard algorithm through a numerical study on a set of benchmark optimization functions that exhibit diverse landscapes. To ensure statistical significance, 400 independent runs are conducted for each function and algorithm, and the results are analyzed based on their statistical characteristics and corresponding distributions. The quadratic surrogate attractor consistently outperforms the conventional algorithm across all tested functions. The improvement is particularly pronounced for quasi-convex functions, where the surrogate model can exploit the underlying convex-like structure of the landscape.
Read the full abstract

Statistics Theory · Cross-listed from stat.ML

Self-Regularized Learning Methods

We introduce a general framework for analyzing learning algorithms based on the notion of self-regularization, which captures implicit complexity control without requiring explicit regularization. This is motivated by previous observations that many algorithms, such as gradient-descent based learning, exhibit implicit regularization. In a nutshell, for a self-regularized algorithm the complexity of the predictor is inherently controlled by that of the simplest comparator achieving the same empirical risk. This framework is sufficiently rich to cover both classical regularized empirical risk minimization and gradient descent. Building on self-regularization, we provide a thorough statistical analysis of such algorithms including minmax-optimal rates, where it suffices to show that the algorithm is self-regularized – all further requirements stem from the learning problem itself. Finally, we discuss the problem of data-dependent hyperparameter selection, providing a general result which yields minmax-optimal rates up to a double logarithmic factor and covers data-driven early stopping for RKHS-based gradient descent.
Read the full abstract

Information Theory

Coded Information Retrieval for Block-Structured DNA-Based Data Storage

We study the problem of coded information retrieval for block-structured data, motivated by DNA-based storage systems where a database is partitioned into multiple files that must each be recoverable as an atomic unit. We initiate and formalize the block-structured retrieval problem, wherein $k$ information symbols are partitioned into two files $F_1$ and $F_2$ of sizes $s_1$ and $s_2 = k - s_1$. The objective is to characterize the set of achievable expected retrieval time pairs $\bigl(E_1(G), E_2(G)\bigr)$ over all $[n,k]$ linear codes with generator matrix $G$. We derive a family of linear lower bounds via mutual exclusivity of recovery sets and develop a nonlinear geometric bound via column projection that holds for every linear code. For codes with no mixed columns, this yields the hyperbolic constraint $s_1/E_1 + s_2/E_2 \le 1$, which we conjecture to hold universally whenever $\max\{s_1,s_2\} \ge 2$. We analyze explicit codes, such as the identity code, file-dedicated MDS codes, and the systematic global MDS code, and compute their exact expected retrieval times. For file-dedicated codes, we prove MDS optimality within the family and verify the hyperbolic constraint. For global MDS codes, we establish dominance by the proportional local MDS allocation via a convex-ordering argument for hypergeometric distributions, simplifying and extending prior work to the asymmetric case. Finally, we characterize the limiting achievability region as $n \to \infty$: the hyperbolic boundary is asymptotically achieved by file-dedicated MDS codes, and is conjectured to be the exact boundary of the limiting achievability region.
Read the full abstract

Classical Analysis and ODEs

Finner-like inequalities in the Heisenberg group

We completely characterize the range of $L^p$-boundedness of certain multilinear Radon-like transforms involving vertical projections in the Heisenberg group.

Analysis of PDEs

Periodic Homogenization of Local/Nonlocal Systems

In this paper, we study the homogenization of elliptic equations that combine a local part, given by the Laplacian with Neumann boundary conditions, and its nonlocal version, defined through an integral operator with a smooth kernel. These two components are coupled through an additional nonlocal operator also given by a smooth kernel. We consider a sequence of partitions of a fixed spatial domain into two regions - local and nonlocal - which are periodically distributed in space (with one of the regions consisting of small, periodically arranged holes). Depending on the relative location of the local and nonlocal regions, we obtain qualitatively different limit behaviors. When the local part of the equation is confined to the small periodic holes, the sequence of solutions converges to the unique solution of a limit system in which the local component vanishes, while the nonlocal part persists and splits into two distinct components. On the other hand, when the local part of the problem lies outside the holes, the limit system exhibits a homogenized local diffusion operator coupled with a nonlocal equation. Finally, we analyze an intermediate regime in which only part of the local diffusion survives in the limit, by considering configurations consisting of parallel thin strips instead of holes.
Read the full abstract

Numerical Analysis

On the role of relaxation and acceleration in the non-overlapping Schwarz alternating method for coupling

The purpose of this paper is to study the influence of relaxation and acceleration techniques on the convergence behavior of the non-overlapping Schwarz algorithm with alternating Dirichlet-Neumann transmission conditions in the context of domain decomposition- (DD-) based coupling. After demonstrating that the multiplicative Schwarz scheme can be formulated as a fixed-point iteration, we explore, both theoretically and numerically, two promising techniques for speeding up the method: (i) Aitken acceleration and (ii) Anderson acceleration. In the process, we derive a robust and efficient adaptive variant of Anderson acceleration, termed "Anderson with memory adaptation". We compare the proposed acceleration strategies to the well-known classical relaxed Dirichlet-Neumann Schwarz alternating method. Our results suggest that, while Aitken-accelerated Schwarz is the best approach in terms efficiency and robustness when considering two sub-domain DDs, Anderson-accelerated Schwarz is the method of choice in larger multi-domain setting.
Read the full abstract

Statistics Theory

Identifiability and Estimation in Continuous Lyapunov Models

Cross-sectional observations from a dynamical system can be modeled via steady-state distributions of Markov processes. The major challenge is then to determine whether the process parameters can be identified and estimated from the steady-state distributions. We study this problem for continuous Lyapunov models that arise as steady-state distributions of the solution to a multivariate stochastic differential equation, whose linear drift matrix is parametrized by a directed graph. We derive equations for the cumulant tensors of any order for this distribution, which generalize the well-known covariance Lyapunov equation. Under a non-Gaussianity assumption we prove generic identifiability of the drift matrix for any connected graph using the equations for the higher-order cumulants. Based on the identifiability result, we propose a new semiparametric estimator of the drift matrix, and we derive its asymptotic distribution. A simulation study demonstrates the asymptotic validity of the estimator but shows that it is only accurate for relatively large sample sizes, illustrating the hardness of the unconstrained estimation problem.
Read the full abstract

Category Theory

Separation and Gluing of Explanations on Sites of Dynamical Systems

We construct a Grothendieck site whose objects are Mealy machines over definable sets in an o-minimal structure and whose coverings are jointly surjective families of definable open immersions. On this site, we define presheaves of explanations – systems equipped with an interpretable interface, parameterised by a “judge.” We prove that the behavioral presheaf (quotienting by observable output equivalence) is separated: a global explanation is determined by its local restrictions. We show that gluing fails in general – locally consistent explanations need not assemble globally – and give, for stateless explanatory systems of the restricted-interface presheaf, a necessary and sufficient topological condition for the sheaf property in terms of robust disconnection of fibers of the judge.
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

Neural-NPV Control: Learning Parameter-Dependent Controllers and Lyapunov Functions

This paper presents Neural-NPV Control, a learning-based framework for joint synthesis of a parameter-dependent (PD) controller and a PD Lyapunov function using neural networks for an NPV system under input constraints. At the first stage, the proposed framework utilizes a gradient-based counterexample-guided procedure to synthesize a PD controller and a PD Lyapunov function candidate. The second stage relies on a level-set guided procedure to refine the controller and Lyapunov function candidate while maximizing the robust region of attraction (R-ROA). The learned controller, Lyapunov function, and R-ROA are empirically evaluated. We demonstrate the advantages of Neural-NPV over SOS-based methods in terms of applicability, performance, and scalability through numerical experiments involving a simple inverted pendulum with one scheduling parameter and a quadrotor system with three scheduling parameters.
Read the full abstract

All authors MD Abul Kashem Niloy, Adam Hallmark, Yikun Cheng, Pan Zhao

Number Theory

Sieving with square conditions and applications to Hilbert cubes in arithmetic sets

The purpose of this paper is twofold: 1) Applications of Gallagher's larger sieve modulo prime squares do not work. In some relevant cases we can transform the residue class information modulo $p^2$ to more suitable residue information modulo $p$, so that we can successfully apply the sieve. 2) The applications to Hilbert cubes are of interest in their own right: We study the maximal dimension of Hilbert cubes in various multiplicatively defined sets. For the squareful numbers in $[1,N]$ we achieve an upper bound of the dimension of $d=O(\log N)$. The same upper bounds follow for multiplicative semigroups of integers defined by a positive proportion of the primes, and the set of integers representable by an irreducible positive definite binary quadratic form. Eventually, making use of the sun flower lemma we give an improvement on the maximal dimension $d$ of subset sums in the set of pure powers in $[1,N]$.
Read the full abstract

Optimization and Control

Combinatorial Admissibility in Control-Affine Networks

We study synchronization of heterogeneous control-affine nonlinear agents interconnected through diffusive (relative-output) measurements. We separate the design into an edge-space step, specifying a stabilizing model evolution for relative outputs, and a lift step, realizing the prescribed edge motion using the agents' allowable input directions, constrained by the control-affine geometry of the agents. We introduce an admissibility notion that characterizes when an edge-driven diffusive design is feasible. We derive checkable combinatorial certificates that connect graph topology and actuation limits directly to admissibility, so that feasible edge dynamics can be verified in a practical and transparent way. The results are illustrated on synchronization of nonlinear oscillators.
Read the full abstract

Information Theory · Cross-listed from cs.LG

Topology-Preserving Deep Joint Source-Channel Coding for Semantic Communication

Many wireless vision applications, such as autonomous driving, require preservation of global structural information rather than only per-pixel fidelity. However, existing Deep joint source-channel coding (DeepJSCC) schemes mainly optimize pixel-wise losses and provide no explicit protection of connectivity or topology. This letter proposes TopoJSCC, a topology-aware DeepJSCC framework that integrates persistent-homology regularizers to end-to-end training. Specifically, we enforce topological consistency by penalizing Wasserstein distances between cubical persistence diagrams of original and reconstructed images, and between Vietoris–Rips persistence of latent features before and after the channel to promote a robust latent manifold. TopoJSCC is based on end-to-end learning and requires no side information. Experiments show improved topology preservation and peak signal-to-noise ratio (PSNR) in low signal-to-noise ratio (SNR) and bandwidth-ratio regimes.
Read the full abstract

All authors Omar Erak, Omar Alhussein, Fang Fang, Sami Muhaidat

Algebraic Topology

The Chordal Distance Transform of Geometric Loops and its Persistent Homology

We present an isometry and parametrisation invariant of embeddings of $S^1$ into Euclidean space. We do so by representing the distance between pairs of points on the embedded circle as a function on a Möbius band, the two-point finite subset space of $S^1$. We call this function the chordal distance transform of the embedding. We show that the sublevel set persistent homology of the chordal distance transform satisfies the desired isometry and parametrisation invariance, and is a continuous transform with respect to the Whitney topology on the space of circle embeddings and the bottleneck distance in the space of persistence diagrams. We then considered the generic behaviour of the chordal distance transform for $C^2$ and finite piecewise linear embeddings. In the $C^2$-case, we show that non-boundary critical points of the chordal distance transform are finite and non-degenerate on an open and dense subset of circle embeddings. Consequently, its persistent homology is pointwise finite dimensional for generic $C^2$-embeddings. In the finite piecewise linear case, we also find piecewise-continuous analogues of non-degenerate critical points, and give generic conditions for the homological critical points of the chordal distance transform to be non-degenerate. In order to gain a geometric interpretation of the chordal distance transform and its persistent homology, we give a geometric characterisation of the $C^2$ and finite piecewise linear non-degenerate critical points. Finally, we consider how the chordal distance transform can be generalised to capture geometric features involving $n\geq 2$ points on an embedded shape, as a function on the $n$-point finite subset space.
Read the full abstract

Combinatorics

Orthogonality between acyclic subdigraphs and paths in digraphs

Let $D$ be a digraph. A collection of disjoint sets of vertices (respec., collection of disjoint subdigraphs) $\mathcal{H}$ of $D$ and a vertex subset (or subdigraph) $Q$ of $D$ are orthogonal if every set (respec., subdigraph) $H \in \mathcal{H}$ contains exactly one vertex of $Q$. A well-known result of Gallai and Milgram shows that for every minimum path partition of a digraph there is a stable set orthogonal to it. Similarly, Gallai, Hasse, Roy and Vitaver independently proved that for every longest path of a digraph there is a vertex partition into stable sets (i.e, vertex-coloring) orthogonal to it. Berge showed that no analogous statements hold when optimality is required for the stable set or the vertex coloring. In this paper, we show that this holds if we replace stable sets by induced acyclic subdigraphs. In 1981, Linial proposed two generalizations of Gallai-Milgram and Gallai-Hasse-Roy-Vitaver results using a positive integer $k$ as a measure of optimality for the path partition and the coloring, respectively. These generalizations have led to two conjectures that remain open. Using the same strategy of replacing stable sets by induced acyclic subdigraphs, we prove relaxations of both conjectures.
Read the full abstract

Combinatorics

Closing Trees into Unicyclic Counterexamples

We develop a family-based route to unicyclic graphs whose independence polynomials are unimodal but not log-concave. The paper is organized around one flagship statement: for the explicit KL-closure family $U_{k,r}$, with $r\in\{0,1,2\}$ and admissible $k$, the independence polynomial is unimodal but not log-concave. The proof separates the closure polynomial into a dominant convolution term and a real-rooted correction term. On the non-log-concavity side, we prove symbolically that the penultimate log-concavity inequality fails for every admissible parameter. On the unimodality side, we prove that the main convolution term $H_{k,r}=G_kF_{k+r}$ is unimodal with a controlled mode, using a combination of exact coefficient formulas, Ibragimov's strong-unimodality principle, and a residue-class growth argument. Darroch localization and an adjacent-mode bridge lemma then transfer that mode statement to the full KL closure polynomial. This yields an explicit infinite family of unicyclic graphs with unimodal but non-log-concave independence polynomials. In the exact range $k\le 400$, we further verify that the penultimate break is unique and determine exact mode formulas for $H_{k,r}$, the binomial correction term, and $I(U_{k,r};x)$ itself. The paper also places the KL family inside a broader reservoir program involving Galvin, Ramos-Sun, and Bautista-Ramos trees, from which we obtain substantial universal exact theorems for finite ranges.
Read the full abstract

Combinatorics

A Brooks-type theorem for the k-choosability of graphs with maximum local edge-connectivity k

For a graph $G$ with at least two vertices, the maximum local edge-connectivity of $G$ is the maximum number of edge-disjoint $(u,v)$-paths over all distinct pairs of vertices $(u,v)$ in $G$. Stiebitz and Toft (2018) proved a Brooks-type theorem for graphs with maximum local edge-connectivity $k$, showing that a graph with maximum local edge-connectivity $k$ is not $k$-colourable if and only if it has a block in $\mathcal{H}_k$, which is the class of graphs that can be obtained by taking Hajós joins of copies of $K_{k+1}$ and, when $k=3$, odd wheels. We prove that a $2$-connected graph with maximum local edge-connectivity $k$ is $k$-choosable if and only if it is not in $\mathcal{H}_k$. On the other hand, deciding $k$-choosability when restricted to graphs with maximum local edge-connectivity $k$ (that might not be $2$-connected) is $\Pi_2$-complete. To prove the former result, we first prove several generalisations of a well-known characterisation of degree-choosability; these may be of independent interest.
Read the full abstract

Optimization and Control

On Big-M Reformulations of Bilevel Linear Programs: Hardness of A Posteriori Verification

A standard approach to solving optimistic bilevel linear programs (BLPs) is to replace the lower-level problem with its Karush-Kuhn-Tucker (KKT) optimality conditions and reformulate the resulting complementarity constraints using auxiliary binary variables. This yields a single-level mixed-integer linear programming (MILP) model involving big-$M$ parameters. While sufficiently large and bilevel-correct big-$M$s can be computed in polynomial time, verifying a priori that given big-$M$s do not cut off any feasible or optimal lower-level solutions is known to be computationally difficult. In this paper, we establish two complementary hardness results. First, we show that, even with a single potentially incorrect big-$M$ parameter, it is $coNP$-complete to verify a posteriori whether the optimal solution of the resulting MILP model is bilevel optimal. In particular, this negative result persists for min-max problems without coupling constraints and applies to strong-duality-based reformulations of mixed-integer BLPs. Second, we show that verifying global big-$M$ correctness remains computationally difficult a posteriori, even when an optimal solution of the MILP model is available.
Read the full abstract

Optimization and Control

Quantitative asymptotic regularity and $T$-asymptotic regularity for the inexact generalized Halpern iteration

We apply proof mining techniques to obtain quantitative and qualitative results on asymptotic and T-asymptotic regularity for the inexact generalized Halpern iteration, a viscosity-type extension of an iteration recently studied by Kanzow and Shehu. Specializing our results to the Kanzow-Shehu iteration and the sequential averaging method (SAM) yields analogous results for these iterations. Furthermore, we compute rates of (T-)asymptotic regularity for particular choices of the parameter sequences, and for one of them, we obtain linear rates as an application of a lemma due to Sabach and Shtern.
Read the full abstract

Optimization and Control

Intrinsic Decentralized Stochastic Riemannian Optimization on Manifolds with Bounded Sectional Curvature

Decentralized optimization on Riemannian manifolds is foundational for many modern machine learning and signal processing applications in which data are non-Euclidean and generated and processed in a distributed manner. Although intrinsic Riemannian methods exploit manifold geometry without relying on Euclidean embeddings, existing decentralized Riemannian optimization algorithms typically use constant step sizes and therefore converge only to a neighborhood of steady-state error. In this paper, we study the decentralized stochastic Riemannian gradient method in the diminishing step-size regime on manifolds with (possibly positive) bounded sectional curvature. We prove an $O(1/T)$ bound for the network consensus error and an $O(\log T/\sqrt{T})$ ergodic bound for the global optimality gap. To the best of our knowledge, this is the first exact, non-asymptotic optimality-gap guarantee for an intrinsic decentralized stochastic Riemannian method in the geodesically convex setting. Furthermore, the diminishing step-size schedule allows substantially larger initial gradient steps than fixed-step baselines, leading to better performance in practice. We illustrate this on the problem of distributed PCA over a Grassmann manifold.
Read the full abstract

Dynamical Systems

On quantization and the classical variational principle for the metric mean dimension

This paper investigates the relationship between quantization of measures and metric mean dimension of topological dynamical systems. We introduce the concept of mean quantization dimension for invariant probability measures and establish a classical variational principle: the metric mean dimension of a dynamical system is equal to the maximum mean quantization dimension among all invariant measures. This approach effectively characterizes the complexity of systems with infinite entropy by identifying a measure that captures information across all scales; and yields a fundamental property that allows for the exchange of limits and suprema in the Lindenstrauss-Tsukamoto variational principles, a feat that most known entropy-like maps fail to achieve due to convexity. Nevertheless, we show that the Katok and Shapira entropies do satisfy this property and, therefore, a classical variational principle for the metric mean dimension, for which maximizing measures always exist.
Read the full abstract

Optimization and Control

On Debreu-Koopmans Theorem for Additively Decomposed Quasiconvex Functions with Applications

The Debreu Koopmans theorem restricts separable aggregation to at most one nonconvex component. We solve this by proving that a separable, additive or multiplicative, function is star quasiconvex, those with star shaped sublevel sets about minimizers, if and only if each component is star quasiconvex. This immediately yields star quasiconvexity of separable sums of quasiconvex functions, formally bridging diversification theory with the S shaped value functions of Prospect Theory. Furthermore, we develop a complete calculus, monotonic composition, pointwise minima, quasi arithmetic means, and we apply it to Cobb-Douglas functions, multifactor risk models, and constant function market makers in decentralized finance. Star quasiconvexity thus provides a unified framework for applications in optimization and economic modeling beyond the classical Debreu Koopmans constraint. The introduction discuss economic motivations.
Read the full abstract

Group Theory

On the model theory of the Free Factor Complex of rank 2

We begin the investigation of the free factor complex of a free group of finite rank. For the case of rank 2 we axiomatize its theory and show that it is $\omega$-stable with prime model $AF_2$.

Optimization and Control

A quadratic Grassmann manifold optimization problem arising from quantum embedding methods

This article presents a mathematical analysis and numerical strategies for solving the optimization problem of minimizing the quadratic function $J(P) = \text{Tr}(BP)- \frac{1}{2} \text{Tr}(A P A P)$, where $A,B \in \mathbb R^{M \times M}_{\rm sym}$, with $A \succeq 0$, over the Grassmann manifold ${\rm Gr}(m,\mathbb R^M)$. While this problem is non-convex and typically admits non-global local minima - posing challenges for Riemannian optimization and self-consistent field (SCF) algorithms - we identify cases where the global minimizer can be obtained by solving an auxiliary convex problem. When this approach is not directly applicable, the solution to the auxiliary problem still serves as an effective initialization for Riemannian optimization methods and SCF algorithms, significantly improving their performance. This work is motivated by applications in quantum embedding methods, particularly in the construction of bath orbitals, where such optimization problems naturally arise.
Read the full abstract

All authors Thomas Ayral, Eric Cancès, Fabian M. Faulstich, Lin Lin, Alicia Negre

Functional Analysis

$q$-Numerical Radius Estimates in Semi-Hilbertian Spaces and Their Relations with Matrix Means for Sectorial Matrices

In this paper, the $q$-numerical radius of operators in semi-Hilbertian spaces is studied. New characterizations are established, and sharp upper and lower bounds for the $q$-numerical radius are derived. Moreover, several inequalities involving operator monotone functions and matrix means for the $q$-numerical radius of sectorial matrices are obtained.
Read the full abstract