Peer Revenue Play credits. Real papers.

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Friday 10 April

Complex Variables

The second and third Hankel determinants for starlike MA–Minda subclass associated to quadratic polynomials

Let $\mathcal{A}$ denote the class of analytic functions such that $f(0)=0$ and $f'(0)=1$ in the unit disk $\mathbb{D}:=\{z \in \mathbb{C}: |z|<1\}$. In this paper, we discuss the properties of a starlike subclass and compute its second and third Hankel determinants; where the class is defined as $\mathcal{S}^*(\varphi):=\{f\in\mathcal{A}:{zf'(z)}/{f(z)}\prec \varphi(z):=1+z+{m}/{n}\,\, z^2,\text{ such that } 2m \le n, \text{ where } m,n\in\mathbb{N}\}.$ Furthermore, we show that the bounds are sharp by determining the extremal functions for the Hankel determinants.
Read the full abstract

Algebraic Topology

Cross effects for functors from posets

We establish a precise relationship between functor calculus and the projective dimension of multipersistence modules. Specifically, we develop a new notion of functor calculus for functors from posets, which detects vanishing total fibers of cubes. We give an explicit construction of the universal approximation functors of this functor calculus. We then use these approximations to prove two new theorems, providing necessary and sufficient conditions for an $n$-parameter multipersistence module to have projective dimension at most $n-1$ and at most $n-2$.
Read the full abstract

Optimization and Control

Natural Riemannian gradient for learning functional tensor networks

We consider machine learning tasks with low-rank functional tree tensor networks (TTN) as the learning model. While in the case of least-squares regression, low-rank functional TTNs can be efficiently optimized using alternating optimization, this is not directly possible in other problems, such as multinomial logistic regression. We propose a natural Riemannian gradient descent type approach applicable to arbitrary losses which is based on the natural gradient by Amari. In particular, the search direction obtained by the natural gradient is independent of the choice of basis of the underlying functional tensor product space. Our framework applies to both the factorized and manifold-based approach for representing the functional TTN. For practical application, we propose a hierarchy of efficient approximations to the true natural Riemannian gradient for computing the updates in the parameter space. Numerical experiments confirm our theoretical findings on common classification datasets and show that using natural Riemannian gradient descent for learning considerably improves convergence behavior when compared to standard Riemannian gradient methods.
Read the full abstract

All authors Nikolas Klug, Michael Ulbrich, André Uschmajew, Marius Willner

Optimization and Control

A Unified Control-Theoretic Framework for Saddle-Point Dynamics in Constrained Optimization

This paper studies equality-constrained minimization problems through the lens of feedback control. We introduce a unified control-theoretic framework by showing that a PID feedback law acting on the dual variable induces the PID saddle-point flow (PID-SPF), a broad class of saddle-point dynamics associated with the augmented Lagrangian. This framework recovers several classical primal-dual flows as special cases. We prove that the equilibria of the proposed flow coincide with the stationary points of the original problem. Our analysis reveals how the feedback gains affect the optimization: integral action enforces constraint satisfaction, proportional action introduces the augmented Lagrangian structure, and derivative action modifies the geometry of the primal dynamics by inducing a state-dependent Riemannian metric. Moreover, for convex problems with affine constraints, we establish global exponential convergence by leveraging contraction theory for all admissible PID gains, providing in the process explicit bounds on the convergence rate. Finally, we validate our theoretical results on numerical examples including an application to bilevel optimization.
Read the full abstract

All authors Veronica Centorrino, Rawan Hoteit, Efe C. Balta, John Lygeros

Probability

Limit laws for longest edges in empty region graphs

Empty region graphs are graphs whose vertices are points in $\mathbb{R}^d$ and where two vertices are connected by an edge whenever some associated region does not contain any other vertices. We investigate the asymptotic behaviour of long edges in empty region graphs generated by a stationary Poisson process in $\mathbb{R}^d$. {Letting} the intensity of the underlying Poisson process tend to infinity, we consider the associated point process of edge midpoints, suitably transformed edge lengths, and directions of the edges. We prove that it converges in distribution to a Poisson process on $\mathbb{R}^d \times \mathbb{R}\times\mathbb{L}^d$, where $\mathbb{L}^d$ is the space of lines in $\mathbb{R}^d$ through the origin, and that the suitably transformed length of the longest edge with midpoint in an observation window converges in distribution to a Gumbel distributed random variable. Our approach yields explicit error bounds in Kantorovich–Rubinstein distance for the point process convergence {when restricting to an observation window} and in Kolmogorov distance for the maximal edge length. The results apply uniformly to a broad class of empty region graphs, including the Gabriel graph, the relative neighbourhood graph, the beta-skeleton graph, the Mastercard graph, and the Pacman graph.
Read the full abstract

Optimization and Control

A Nesterov-Accelerated Primal-Dual Splitting Algorithm for Convex Nonsmooth Optimization

We investigate the integration of Nesterov-type acceleration into primal-dual methods for structured convex optimization. While proximal splitting algorithms efficiently handle composite problems of the form $\min_x f(x) + g(x) + h(K x)$, accelerating their convergence with respect to the smooth term $f$ is notoriously challenging, due to the rotational dynamics in the primal-dual space. Our guiding principle is that Nesterov acceleration exploits the strong convexity of the dual problem. We first revisit accelerated proximal gradient descent and give a unified analysis of its convex and strongly convex regimes, including the weak convergence of its iterates. We then propose the Accelerated Proximal Alternating Predictor-Corrector algorithm (APAPC) for the setting where $g(x) = (\mu_g/2)\|x\|^2$. APAPC is fully split: it only calls $\nabla f$, $K$, $K^*$ and the proximity operator of $h$, and never solves a linear system. From a single Lyapunov inequality, we derive optimal $O(1/t^2)$ convergence rates, as well as accelerated linear rates when $\mu_g > 0$, in three regimes where the dual problem is strongly convex: when $h$ is smooth, when $K^*$ is bounded below, and for linearly constrained problems. In the last two regimes, the $O(1/t^2)$ rates without strong convexity of the primal problem are, to our knowledge, the first for fully split algorithms. Finally, leveraging recent results on accelerated gradient descent, we establish the weak convergence of the primal iterates and the strong convergence of the dual iterates to a saddle point.
Read the full abstract

Analysis of PDEs

The backward problem for a multi-term time-fractional diffusion equation

This paper is devoted to the investigation of the backward problem for a multi-term time-fractional diffusion equation. Backward problems for fractional diffusion equations are typically studied using regularization methods due to their ill-posedness in the sense of Hadamard; that is, a small change in u(T) may lead to large changes in the initial data. Nevertheless, we show that if sufficiently smooth current data are considered, then the solution exists, is unique, and is stable. A principal difficulty in the analysis of the backward problem stems from the structure of the solution, in which the multinomial Mittag-Leffler function appears in the denominator. Accordingly, a precise characterization of the asymptotic behavior of this function is required. Such asymptotic properties are nontrivial and have been rigorously established in the authors' recent work, which serves as a fundamental basis for the present study. In addition, we investigate the conditional stability of the backward problem. It is shown that, although the problem is ill-posed in general, stability can be restored under an appropriate a priori bound imposed on the initial data. The main novelty of the paper lies in proving the best smoothing property of the solution, showing that it belongs to the domain of the operator A for any positive time.
Read the full abstract

Algebraic Geometry

Fast Isotopy Computation for T-Curves

A T-curve of degree $d$ is given by a regular unimodular triangulation of $d \cdot \Delta_2$ together with a sign distribution on its lattice points. By Viro's Patchworking Theorem, this determines the ambient isotopy type (a.k.a. real scheme) of a smooth real plane projective algebraic curve of the same degree. We present a near-quadratic time algorithm for extracting that isotopy type from the triangulation and the signs. Through a GPU-accelerated implementation, this allows one to compute billions of real schemes per second, enabling exhaustive enumeration at scale. This algorithm was essential for our recent construction of all 121 real schemes of degree seven by T-curves.
Read the full abstract

All authors Zoe Geiselmann, Michael Joswig, Lars Kastner, Konrad Mundinger, Sebastian Pokutta, Christoph Spiegel, Marcel Wack, Max Zimmer

Optimization and Control

A priority-driven constructive heuristic for assigning and scheduling spontaneous volunteers in disaster response

Large-scale disaster response operations frequently involve spontaneous volunteers who arrive independently at disaster sites and must be coordinated under severe time pressure. Assigning such volunteers to relief activities constitutes a complex workforce assignment and scheduling problem with heterogeneous capabilities, dynamic arrivals, and operational constraints. Recent work formulated the spontaneous volunteer coordination problem (SVCP) as a lexicographic multi-objective mixed-integer optimization model. However, solving this model to optimality becomes computationally challenging in large-scale and rolling-horizon disaster response settings. This paper proposes a problem-specific constructive heuristic for the SVCP that explicitly leverages the lexicographic objective hierarchy, capability scarcity among volunteers, and workload balancing across activities. A large-scale computational study based on empirically grounded disaster response scenarios derived from the 2013 flood response in Halle (Germany) evaluates the proposed approach. Across 3200 simulated instances with up to 10000 volunteers and more than 4000 activity-time combinations, the heuristic closely approximates optimal solutions for the primary objectives while achieving a median runtime speedup of approximately 28x. Whereas the exact solver exceeds operational decision time limits in more than 60% of instances, the heuristic consistently produces solutions within minutes, enabling real-time decision support for spontaneous volunteer coordination.
Read the full abstract

Algebraic Geometry

Surfaces with canonical map of odd degree

Let $S$ be a smooth complex minimal surface of general type with $p_g:=h^0(K_S)\ge 4$ whose canonical map is generically finite of odd degree $d>1$ onto a surface $\Sigma$. We assume that the general canonical curve of $S$ is smooth and that $\Sigma$ is ruled by lines, and we prove: - $p_g\le d+2$ - $\Sigma$ is a cone over the rational normal curve of degree $p_g-2$ in ${\mathbb P}^{p_g-1}$ - $p_g=d+2$ can occur only for $d=3,9,11$. As a byproduct, we refine previous results by Beauville and Xiao by proving that if one drops the assumption that $\Sigma$ is ruled by lines then $d\le 5$ if $p_g\ge 112$. The case $d=3$ being completely classified by the first two named authors, we focus on $d=5$, showing that $p_g\le 5$ and that for $p_g=5$ the surface $S$ has a pencil $|C|$ with $C^2=1$ and $K_SC=5$. These results suggest that the answer to the question whether the surfaces with canonical map of odd degree $d>1$ have bounded invariants could be positive, in sharp contrast with the case of even degree.
Read the full abstract

Mathematical Physics · Cross-listed from hep-ph

A Levinson's theorem for particle form factors

We present and demonstrate a version of Levinson's theorem especially dedicated to the asymptotic behavior of form factor phases. Indeed, as required by analyticity, form factors are multi-valued complex functions of a square four-momentum defined in the complex plane with a cut along the positive real axis. Their phases evaluated on the upper edge of this cut, i.e., on the time-like region, tend asymptotically to integer multiples of $\pi$ radians. The Levinson's theorem establishes a univocal relation between such multiples and properties of form factors related to the dynamics of the electromagnetic interaction of the corresponding hadrons.
Read the full abstract

Group Theory

Inertial 2-blocks with abelian defect groups

L. Puig defined inertial blocks. In this paper, we prove that 2-blocks with defect group $C_{2^{n_1}}\times C_{2^{n_2}}\times...\times C_{2^{n_t}}$ are inertial, where $n_i\geq 2$ for all $i$.

Numerical Analysis

Restoring Convergence Order in Explicit Runge-Kutta Integration of Hyperbolic PDE with Time-Dependent Boundary Conditions

Explicit Runge-Kutta (RK) integration of hyperbolic initial-boundary value problems with time-dependent Dirichlet data often displays order reduction: the observed convergence order falls below the nominal order because the stage structure interacts with asymmetric near-boundary spatial closures. This paper develops a purely spatial remedy that preserves the time integrator while redesigning only the first two boundary-adjacent derivative operators. For an arbitrary explicit $s$-stage RK method applied to linear advection, the one-step truncation error at the boundary-adjacent nodes is shown to admit a tableau-dependent decomposition whose cancellation yields explicit algebraic conditions on the boundary weights. A solvability coefficient $R(\mathbf{b},\mathbf{c},A)$ determines whether a spatial compensation mechanism exists; the result is specialised to SSP-RK3, for which closed-form conditions are derived. Constrained differential evolution then identifies 5-point closures that, coupled to a 5th-order upwind interior stencil, recover third-order convergence from the degraded second-order behaviour of classical Taylor closures. A stability-aware variant augments the optimisation with an eigenvalue penalty, exposing the trade-off between order recovery and CFL robustness. Validation covers linear advection, manufactured-solution Burgers flow, and dimensionally split two-dimensional advection. The analysis clarifies why weak-stage-order temporal fixes do not resolve the finite-difference boundary problem, and indicates how the framework extends to non-uniform meshes.
Read the full abstract

Dynamical Systems · Cross-listed from eess.SY

Discrete-Time Model of a Two-Speed PowerShift suitable for Real-Time Control and Simulation

In this paper, a new discrete-time approach to model the clutches engagement/disengagement in a two-speed powershift is proposed. The core idea is the development of a model for the computation of the exact torque needed to achieve the clutches engagement, including both the cases of single clutch engagement and of simultaneous clutch engagement (full lock condition). Based on this, the control logic for the clutches engagement and disengagement phases is also developed. The advantages in terms of real-time applicability with respect to the continuous-time version are shown through extensive simulation results.
Read the full abstract

Combinatorics

Sharp threshold for reconstructing points on the line

For a set of $n$ points $V \subseteq \mathbb{R}$ let $G(V, p)$ be the random graph on $V$ where each possible edge is present independently with probability $p$. We call a subset $U \subseteq V$ {reconstructible} if every injection $\varphi:V\to \mathbb{R}$ that preserves the distances along the edges of $G(V, p)$ also preserves all pairwise distances in $U$. How large is the size $\mathsf{R}$ of a largest reconstructible subset? Girão, Illingworth, Michel, Powierski and Scott conjectured that the answer is linear whp when $p = (1+\varepsilon)/n$ for every $\varepsilon > 0$. In this paper, we show that for every $\varepsilon>0$ whp there exists a reconstructible subset $U$ of the largest component $\mathcal{C}$ of the 2-core satisfying $|U| = |V(\mathcal{C})|(1-o(1))$, proving a stronger form of the conjecture. The bound is asymptotically best possible, since for $V \subseteq \mathbb{R}$ linearly independent over $\mathbb{Q}$ it is straightforward to verify that $\mathsf{R} \leq \max(2, |V(\mathcal{C})|)$. Furthermore, we extend these results to every $\varepsilon:= \varepsilon(n)$ satisfying $\varepsilon = \omega(1/\ln n)$.
Read the full abstract

Statistics Theory · Cross-listed from cs.LG

Generalization and Scaling Laws for Mixture-of-Experts Transformers

We develop a theory of generalization and scaling for Mixture-of-Experts (MoE) Transformers that cleanly separates active per-input capacity from routing combinatorics. By conditioning on fixed routing patterns and union-bounding across them, we derive a sup-norm covering-number bound whose metric entropy scales with the active parameter budget and incurs a MoE-specific routing overhead. Combined with a standard ERM analysis for squared loss, this yields a generalization bound under a $d$-dimensional manifold data model and $C^\beta$ targets, showing that approximation and estimation trade off as in dense networks once active parameters are accounted for appropriately. We further prove a constructive approximation theorem for MoE architectures, showing that, under the approximation construction, error can decrease either by scaling active capacity or by increasing the number of experts, depending on the dominant bottleneck. From these results we derive neural scaling laws for model size, data size, and compute-optimal tradeoffs. Overall, our results provide a transparent statistical reference point for reasoning about MoE scaling, clarifying which behaviors are certified by worst-case theory and which must arise from data-dependent routing structure or optimization dynamics.
Read the full abstract

Group Theory

Blocks with a single automorphism orbit of irreducible Brauer characters

Fix a prime $p$. Let $G\trianglelefteq\tilde G$ be finite groups such that $|\tilde G:G|$ is a power of $p$, and let $\tilde b$ be a block of $\tilde G$ with abelian defect groups covering a block $b$ of $G$. We prove that $\tilde b$ is inertial whenever $\IBr(b)$ is a single $\Aut(G)_b$-orbit. This verifies the abelian-defect case of the Kessar–Linckelmann conjecture. As a key ingredient, we further show that a block of a finite quasisimple group with a single automorphism orbit of irreducible Brauer characters has abelian defect groups. As applications, we prove the blockwise Alperin weight conjecture for blocks with exactly one irreducible Brauer character and establish Puig's nilpotency conjecture.
Read the full abstract

Dynamical Systems · Cross-listed from cs.RO

On the Terminology and Geometric Aspects of Redundant Parallel Manipulators

Parallel kinematics machines (PKM) can exhibit kinematic as well as actuation redundancy. While the meaning of kinematic redundancy has been clarified already for serial manipulators, actuation redundancy, that is only possible in PKM, is differently classified in the literature. In this paper a consistent terminology for general redundant PKM is proposed. A kinematic model is introduced with the configuration space (c-space) as central part. The notion of kinematic redundancy is recalled for PKM. C-space, output, and input singularities are distinguished. The significance of the c-space geometry is emphasized, and it is pointed out geometrically that input singularities can be avoided by redundant actuation schemes. In order to distinguish different actuation schemes of PKM a non-linear control system is introduced whose dynamics evolves on the c-space. The degree of actuation (DOA) is introduced as the number of independent control vector fields, and PKM are classified as full-actuated and underactuated. Relating this DOA to the degree of freedom (DOF) allows to classify the actuation redundancy.
Read the full abstract

Numerical Analysis

Hybrid hierarchical matrices with adaptive mixed precision storage

Hierarchical matrices are data-sparse approximations of dense matrices that are widely used for fast matrix computations. Hierarchical matrices are built using a tree data structure, with low-rank blocks identified by various admissibility conditions, such as standard admissibility and weak admissibility. This paper introduces a novel hierarchical matrix framework, namely $\mathcal{H}_h$, based on a hybrid admissibility condition: we use the standard admissibility at the coarser levels (larger blocks) and the weak admissibility at the finer levels (smaller blocks). This hybrid strategy confines dense blocks only along the diagonal. We provide a criterion that ensures lower storage cost for $\mathcal{H}_h$-matrices compared to $\mathcal{H}$-matrices under the standard admissibility condition. We carry out a rounding error analysis of $\mathcal{H}_h$-matrices and show that the admissible blocks of $\mathcal{H}_h$-matrices can be represented in low precision (precision lower than the working precision) without degrading the overall approximation quality. We provide an explicit rule for dynamically selecting the precision of a given admissible block, thereby proposing an adaptive mixed precision algorithm for constructing and storing $\mathcal{H}_h$-matrices. Furthermore, we show that the use of mixed precision does not compromise the numerical stability and accuracy of the resulting $\mathcal{H}_h$-matrix-vector product. We perform a range of numerical experiments to validate our theoretical findings. Our numerical results show that the proposed adaptive mixed precision $\mathcal{H}_h$-matrices achieve significant storage reductions (up to $11 \times$) compared with uniform double precision standard admissibility-based $\mathcal{H}$-matrices, without compromising accuracy.
Read the full abstract

Representation Theory

The K_+-fixed vectors of Iwahori-spherical GL_n-representations: connections with Zelevinsky's segments

We study the space of K_+-fixed vectors of Iwahori-spherical representations of GL_n over a non-archimedean local field. For a generic Iwahori-spherical representation, we show that its decomposition into irreducible modules of the finite Lie group K/K_+ is controlled by a partition determined by the representation: an irreducible module occurs only if its partition is dominated by that partition, and when it occurs the multiplicity is a Kostka number. For an arbitrary irreducible Iwahori-spherical representation, we attach a partition from its data and prove a necessary condition: any occurring module must correspond to a partition dominated by this one, and the module attached to the partition itself occurs exactly once. We also give a combinatorial algorithm which, by further computation, determines precisely which modules actually occur and with what multiplicities. This answers a question of Prasad.
Read the full abstract

Statistics Theory · Cross-listed from stat.ML

Identifying Causal Effects Using a Single Proxy Variable

Unobserved confounding is a key challenge when estimating causal effects from a treatment on an outcome. In this work, we assume that we observe a single, potentially multi-dimensional proxy variable of the unobserved confounder and that we know the mechanism that generates the proxy from the confounder. Under an assumption called Single Proxy Identifiability of Causal Effects or simply SPICE, we prove that this error mechanism is complete and causal effects are identifiable. We extend the proxy-based causal identifiability results by Kuroki and Pearl (2014); Pearl (2010) to multi-dimensional continuous settings, more flexible functional relationships and a broader class of distributions. Further, we develop a neural network based estimation framework, SPICE-Net, to estimate causal effects, which is applicable to both discrete and continuous treatments.
Read the full abstract

Functional Analysis

An extension of Phelps theorem to spaces of vector-valued functions

In this paper, our main aim is to extend a classical theorem of Phelps on norm-attaining functionals from the space of scalar-valued continuous functions $C(\Omega)$ to its vector-valued counterpart $C(\Omega, X)$. One of our main results provides a complete characterization of norm-attaining functionals on $C(\Omega, X)$ under the assumption that $X^*$ has the Radon-Nikodým property (RNP). For a general Banach space $X$, we further investigate norm attainment at points of weak$^*$-to-weak continuity for the identity map $Id : (C(\Omega, X)_1^*, w^*) \to (C(\Omega, X)_1^*, w)$.
Read the full abstract

Optimization and Control

Pareto Set Characterization in Constrained Multiobjective Optimization and the COBI Problem Generator *

Benchmark problems play a central role in assessing the performance of numerical optimization algorithms. However, many existing constrained multiobjective optimization benchmark problems rely on overly restricted constructions or lack formal analysis of their optimal solution sets, limiting their relevance for systematic algorithm evaluation. In this work, we introduce a class of analytically tractable constrained multiobjective optimization problems whose Pareto sets can be formally characterized. The construction is based on convex-quadratic functions with positive definite Hessians, combined through multipeak formulations in which each objective is defined as the minimum over several convex-quadratic components. This approach preserves analytical structure while enabling multimodality (non-convexity), ill-conditioning and non-separability. The constraints are built as sublevel sets of multipeak functions giving rise to problems with potentially disconnected feasible regions. Building on these results, we propose COBI, a scalable generator of constrained bi-objective test problems designed for benchmarking derivative-free optimization algorithms. We provide a reference Python implementation that enables straightforward integration of COBI instances into benchmarking workflows.
Read the full abstract

All authors Anne Auger, Dimo Brockhoff, Luka Opravš, Tea Tušar

Algebraic Geometry

Picard-Fuchs Equations of Twisted Differential forms associated to Feynman Integrals

Dimensionally or analytically regulated Feynman integrals lead to relative twisted period integrals. We present a recent extension of the Griffiths-Dwork pole reduction algorithm for deriving the D-module of differential operators acting on the twisted differential forms from Feynman integrals. We illustrate the application of this algorithm by providing twisted Picard-Fuchs operators for hypergeometric, elliptic and Calabi-Yau differential motives arising from families of Feynman integrals.
Read the full abstract

Rings and Algebras

Triality and the Magic Square of Hans Freudenthal

We study real triality structures through their intrinsic tensor algebra. Starting from a single triality symbol, we construct the associated Lie algebra of two-triality operators, prove the Jacobi identity, and identify the resulting algebra uniformly with the corresponding entry of the magic square. We then examine the natural invariant bilinear forms and the Clifford-theoretic structures arising from this construction. In low dimension, the triality formalism also recovers classical arithmetic data: in the \(2\times2\times2\) case, the associated binary quadratic forms have a common discriminant and fit naturally into the Bhargava cube picture.
Read the full abstract

Combinatorics

Menger's theorem for ends of digraphs

Polat generalised Menger's theorem – the maximum number of vertex-disjoint paths between two sets $A$ and $B$ equals the minimum size of an $A$-$B$ separator – to ends of undirected graphs. In this paper we extend Menger's theorem to ends of digraphs. As an application, we characterise the combined degree of ends of digraphs.
Read the full abstract

Number Theory

Differential operators on locally analytic Shimura varieties

We investigate infinite-level Shimura varieties within the framework of analytic stacks of Clausen-Scholze, developing their smooth, completed, locally analytic, and de Rham realizations. We formulate a Grothendieck-Messing-Hodge-Tate period map, and establish a Grothendieck-Messing theory for locally analytic infinite-level Shimura varieties. This theory, combined with a reformulation of Riemann-Hilbert correspondence, implies that the locally analytic infinite-level Shimura variety can be fully reconstructed purely from its perfectoid counterpart and its $\mathbb{B}_{\mathrm{dR}}^{+}$-thickening. Building upon this geometric structure, we systematically construct differential operators generalizing those of Pan, and we introduce a Bernstein-Gelfand-Gelfand-Fontaine complex based on dual BGG complexes, conjecturing its automorphic properties. These constructions will be used to establish a locally analytic Jacquet-Langlands correspondence in a companion paper ([Jia26a]).
Read the full abstract

Numerical Analysis

A ROM-based BDDC solver for unfitted p-FEM level-set-based two-dimensional lattice structures

We present a domain decomposition method for the fast simulation of large two-dimensional lattice structures described by level set functions. The method does not rely on homogenization or multiscale techniques, and therefore avoids their underlying assumptions such as scale separation and periodicity. Individual cells are defined through level set functions and mapped into physical space using arbitrary order mappings, which allows the creation of complex graded designs with varying geometries and topologies. The discretization is based on unfitted p-FEM, where each cell is approximated by a single high order element. This choice naturally handles the implicit geometric description and provides high accuracy with a moderate number of degrees of freedom. The solver is built on the Balanced Domain Decomposition by Constraints method, where each cell corresponds to one subdomain. To accelerate the assembly of the cell stiffness matrices, we combine a fast assembly technique that separates the contributions of the geometric mapping from the trimmed domain with a reduced order model based on the matrix discrete empirical interpolation method. The ROM surrogate is trained offline and can be reused for any geometric mapping, restricting the expensive quadrature on cut elements to the training stage. A stabilization term is introduced to ensure the scalability of the solver when using the ROM approximation, at the cost of a small and controllable error. We validate the method through a series of numerical experiments and demonstrate its performance on a 2D problem with more than 17,000 cells of varying geometry, which is solved in approximately 30 seconds on a standard laptop. The number of solver iterations grows only mildly as the number of subdomains increases, provided the ratio between subdomain and mesh sizes is kept constant, consistent with the scalability properties of BDDC methods.
Read the full abstract

Optimization and Control

Portfolio Exponential Utility Maximization with Jump Signals

In this paper, we study the portfolio utility maximization in the case where the risky asset is driven by a Brownian motion and an independent homogeneous Poisson measure, with strategies that may include jump signals. This means that the allowed strategies are no longer predictable but also include the information given by a process driven by the Poisson measure. Using the results of Bank and Körber [1], we first express the considered portfolio as semi-martingale processes. We then present the martingale optimality principle for the exponential utility maximization. This allows to derive an original BSDE with jumps and to express the optimal value and an optimal strategy using the solution to this original BSDE. We then prove existence of a solution to the considered BSDE. We finally present some numerical experiments to quantify the gain of utility given by the information from the jump signals.
Read the full abstract

Analysis of PDEs

Vanishing conductivity limit for the 1D compressible Navier-Stokes system

The present article studies solutions to the compressible Navier-Stokes equations for ideal gases in one dimension when thermal conductivity is present but very weak, while viscosity is positive and constant. The main novelty is the establishment of bounds that do not explode when the conductivity coefficient approaches zero. The conductivity coefficient is assumed to be constant and the framework is that of ”à la Hoff” solutions. More precisely, the velocity is initially assumed to be regular, while the density and temperature are only in L^infini and far from zero. A new proof of a stability result for cases without conductivity is given. Then, the proof of the zero-conductivity limit to the Navier-Stokes system without conduction is established in the ”à la Hoff” framework.
Read the full abstract