Representation Theory
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Tuesday 12 May
We determine all orthogonal transformations of a quadratic space over reals such that any orthogonal transformation which is conjugate to one of them in the linear group is conjugate in the orthogonal group.
Numerical Analysis
Finite element and box-method discretizations for fractional elliptic problems with quadrature and mass lumping
We analyze numerical approximation of the fractional elliptic problem $L^{\beta}u=f$, ${\beta>0}$, where $L$ is a second-order self-adjoint elliptic operator with homogeneous Dirichlet or Neumann boundary conditions. The paper develops a unified conforming piecewise linear framework that covers both the standard finite element discretization and the box-method discretization of fractional powers. The key point is that the discrete fractional operator is defined with respect to an admissible inner product on the trial space. This includes, in particular, the standard $L^{2}$ inner product and the quadrature-based mass-lumped inner product, and we also identify a broader family of admissible inner products interpolating between these two realizations. Within this framework, we show that the mass-lumped choice yields the intrinsic fractional box discretization, namely the one obtained by taking fractional powers of the nonfractional box solution operator. For both the finite element and box-method realizations, we establish error estimates under natural consistency assumptions, making explicit the effect of load quadrature in the box case. The analysis applies directly to practical schemes and is supported by numerical experiments in one and two space dimensions.
Read the full abstract
Information Theory
On Capacity and Delay of Wireless Networks with Node Failures
One key challenge in designing resilient large-scale wireless ad hoc networks is to understand how random node failures affect fundamental network performance. In this work, we show that both network capacity and delay scale as \scalebox{0.65}{$\textstyle \Theta\left(\sqrt{\frac{n(1-q)}{\log n}}\right)$}, where $n$ is the total number of nodes and $q$ is the node failure probability. The network capacity degenerates to the classical result given by P. Gupta and P. R. Kumar when $q=0$. Based on these results, we find that even with the same number of non-faulty nodes, a network with $n$ nodes and node failure probability $q$ has lower network capacity than a failure-free network with $n(1-q)$ nodes. To compensate for the network capacity loss caused by random node failures, at least $\epsilon(n,q) nq$ redundant nodes are required, where $\epsilon(n,q)>1$. We further prove that the optimal trade-off between network capacity and delay remains $O(1)$ regardless of node failures, implying that high network capacity and low delay cannot be achieved simultaneously. These results demonstrate robustness against stochastic variations in wireless channels.
Read the full abstract
Combinatorics
Conflict-Free Cuts in Planar and 3-Degenerate Graphs with 1-Regular Conflicts
A conflict-free cut $F$ on a simple connected graph $G = (V, E)$ is defined as a set of edges $F \subseteq E$ such that $G-F$ is disconnected, and no two edges in $F$ are conflicting. The notion of conflicting edges is represented using an associated conflict graph $\widehat{G} = (\widehat{V}, \widehat{E})$ where $\widehat{V} = E$. Deciding if a given planar graph $G$, with an associated conflict graph $\widehat{G}$, has a conflict-free cut is known to be NP-complete, when $G$ has maximum degree four and $\widehat{G}$ is a line graph of $G$ [Bonsma, JGT 2009]. In this paper, we prove the following for the case when $\widehat{G}$ is 1-regular. * We completely resolve the complexity of the decision problem when $G$ is planar. Towards this end, we show that (a) there always exists a conflict-free cut when the graph is planar and 4-regular unless it is the octahedron graph and (b) the decision problem is NP-complete, even in the case when $G$ is planar with maximum degree 5. * We also show that the decision problem is NP-complete when $G$ is a 3-degenerate graph with maximum degree 5. This completely resolves the complexity status of the problem when $G$ is 3-degenerate. * We construct families of graphs with 1-regular conflict graphs that do not have a conflict-free cut. Our results answer the questions posed in [Rauch, Rautenbach and Souza, IPL 2025].
Read the full abstract
Information Theory
Memory Constrained Adversarial Hypothesis Testing
We study adversarial binary hypothesis testing under memory constraints. The test is a time-invariant randomized finite state machine (FSM) with S states. Associated with each hypothesis is a set of distributions. Given the hypothesis, the distribution of each sample is chosen from the set associated with the hypothesis by an adversary who has access to past samples and the history of states of the FSM so far. We obtain upper and lower bounds on the minimax asymptotic error probability that are tight to within one state. These bounds determine the exact error exponent in S, and coincide under a weak least-favourability condition. For time-invariant deterministic FSMs, we also extend known achievable error-exponent bounds from the non-adversarial Bernoulli setting to the adversarial case with parameters in two separated intervals.
Read the full abstract
Differential Geometry
Criteria and Curvatures for Singularities of Finite Multiplicities of Curves in $\boldsymbol{R}^N$
First, this paper presents a systematic procedure for constructing criteria for singularities of curves of finite multiplicities in $\boldsymbol{R}^N$. Based on this method, we provide explicit criteria for singularities of multiplicities two, three, and four, including specific cusps appearing only in dimensions three or higher. Furthermore, we generalize the normalized curvature functions and the cuspidal curvature to singular curves in $\boldsymbol{R}^N$. Using these generalized curvatures, we reinterpret the existence and uniqueness theorem given by Fukui for curves in $\boldsymbol{R}^N$ of finite multiplicities.
Read the full abstract
Analysis of PDEs
A new class of nonlocal operators: the fractional logarithmic $p$-Laplacian and its properties
In this paper, we introduce and investigate the fractional logarithmic $p$-Laplacian $(-\Delta)_{p}^{s+\log}$, defined as the first-order derivative with respect to the parameter $t$ of the fractional $p$-Laplacian $(-\Delta)_{p}^{t}$ evaluated at $t=s$. We establish that this operator admits the following integral representation \[ \begin{aligned} (-\Delta)_{p}^{s+\log} u(x) &= B(N,s,p)(-\Delta)_{p}^{s}u(x)\\ &\quad -p\, C(N,s,p)\mathrm{P.V.}\int_{\mathbb{R}^{N}}\frac{|u(x)-u(y)|^{p-2}(u(x)-u(y))\ln |x-y|}{|x-y|^{N+sp}}dy, \end{aligned} \] where $C(N,s,p)$ denotes the standard normalization constant associated with the fractional $p$-Laplacian, and $B(N,s,p)=\frac{d}{ds}\left(\ln C(N,s,p)\right)$. As a consequence of this representation, it follows that the operator is nonlocal and of logarithmic type, and may be viewed as a nonlinear analogue of the fractional logarithmic Laplace operator recently introduced by Chen et al. \cite{Chen-Chen-Hauer}. We further develop the associated functional framework in both $\mathbb{R}^{N}$ and bounded Lipschitz domains by introducing the natural energy spaces adapted to problems driven by $(-\Delta)_{p}^{s+\log}$. Within this framework, fundamental functional inequalities are established, in particular Pohozaev-type identities and Díaz-Saa inequalities, which are of independent interest and applicable to a broader class of problems. Moreover, we derive results concerning density, continuity, and compact embedding properties. We emphasize that the compactness of the embedding is proved at the critical exponent $p^{*}_{s}=\frac{Np}{N-sp}$, which distinguishes the present setting from the classical Sobolev and fractional Sobolev frameworks. Finally, as an application, we investigate the associated Dirichlet eigenvalue problem and derive existence, uniqueness, and boundedness results for the corresponding solutions.
Read the full abstract
Information Theory · Cross-listed from cs.LG
Scaling Laws and Tradeoffs in Recurrent Networks of Expressive Neurons
Cortical neurons are complex, multi-timescale processors wired into recurrent circuits, shaped by long evolutionary pressure under stringent biological constraints. Mainstream machine learning, by contrast, predominantly builds models from extremely simple units, a default inherited from early neural-network theory. We treat this as a normative architectural question. How should one split a fixed parameter budget $P$ between the number of units $N$, per-unit effective complexity $k_e$, and per-unit connectivity $k_c$? What controls the optimal allocation? This calls for a model in which per-unit complexity can be tuned independently of width and connectivity. Accordingly, we introduce the ELM Network, whose recurrent layer is built from Expressive Leaky Memory (ELM) neurons, chosen to mirror functional components of cortical neurons. The architecture allows for individually adjusting $N$, $k_e$, and $k_c$ and trains stably across orders of magnitude in scale. We evaluate the model on two qualitatively different sequence benchmarks: the neuromorphic SHD-Adding task and Enwik8 character-level language modeling. Performance improves monotonically along each of the three axes individually. Under a fixed budget, a clear non-trivial optimum emerges in their tradeoff, and larger budgets favor both more numerous and more complex neurons. A closed-form information-theoretic proxy captures these tradeoffs and attributes the diminishing returns at two ends to: per-neuron signal-to-noise saturation and across-neuron redundancy. A hyperparameter sweep spanning three orders of magnitude in trainable parameters traces a near-Pareto-frontier scaling law consistent with the proxy. This suggests that the simple-unit default in ML is not obviously optimal once this tradeoff surface is probed, and offers a normative lens on cortex's reliance on complex spatio-temporal integrators.
Read the full abstract
Numerical Analysis
Efficient TV regularization of large-scale linear inverse problems via the SCD semismooth* Newton method with applications in tomography
In this paper, we consider the efficient numerical minimization of Tikhonov functionals resulting from total-variation (TV) regularization of linear inverse problems. Since the TV penalty is non-smooth, this is typically done either via smooth approximations, which are inexact, or using non-smooth optimization techniques, which can often be numerically expensive, in particular for large-scale problems. Here, we present a numerically efficient minimization approach based on the recently proposed semismooth* Newton method, which employs a novel concept of graphical derivatives and exhibits locally superlinear convergence. The proposed approach is specifically tailored to TV regularization, suitable for large-scale inverse problems, and supported by strong mathematical convergence guarantees. Furthermore, we demonstrate its performance on two (large-scale) tomographic imaging problems and compare our results to those obtained via other state-of-the-art TV regularization approaches. Finally, an open-source Matlab implementation of the proposed method is made available online at https://github.com/HGfrerer/TVReg-2D-Semismoothstar-Newton.
Read the full abstract
Optimization and Control
Stochastic control with self-exciting processes
We analyze the problem of stochastic optimal control of SDEs where the driver includes a self-exciting stochastic process. Due to the non-Markovian nature of the problem, we apply the stochastic maximum principle approach. We derive a sufficient stochastic maximum principle under this framework. We also derive an expression via martingales of both the self-exciting process and its quadratic covariation. Furthermore, we derive a necessary maximum (equivalence principle) for the self-exciting stochastic control problem. Finally, we look at an application to log-utility.
Read the full abstract
Optimization and Control
Analysis and funnel control for nonlinear drill strings
We study the output tracking problem for a vertically driven drill string system described by a nonlinear boundary-coupled PDE-ODE model. Solvability analysis of the drill string model is achieved by first casting the model in an abstract boundary value problem involving set-valued operators on an appropriate Hilbert space. The governing equation here consists of evolution and the damping part. Existence of solutions is established within the framework of maximal monotone operators where one first proves that the evolution operator is a linear skew-adjoint operator and the distributed damping term is a Nemytskii relation which is then proven to be maximal monotone. Maximal monotonicity of the combined operator is then a consequence of Rockafellar's theorem. Furthermore, we propose a novel funnel control design that ensures the angular velocity of the drill bit follows a dynamically adjusted reference trajectory, while the tracking error remains confined within a pre-specified performance funnel. The reference adjustment mechanism adapts in response to large wave traveling times that may cause performance degradation. The corresponding feasibility result is illustrated by some simulations.
Read the full abstract
Combinatorics
A note on the chromatic number of Kneser graphs on chambers of projective planes and incidence-free sets
Let $D=(\mathcal{P},\mathcal{B})$ be a symmetric $(v,k,\lambda)$-design and let $(X,Y)$ be an equinumerous incidence-free pair, with $X\subseteq \mathcal{P}$ and $Y\subseteq \mathcal{B}$. In this note, we give an elementary proof which shows the existence of a perfect matching between $\mathcal{P} \setminus X$ and $\mathcal{B}\setminus Y$ in the incidence graph of $D$. This recovers a result of Spiro, Adriaensen and Mattheus, who already showed this using different arguments for $k\geq 36$. We use this to connect some dots in the literature and prove that finding the chromatic number of the Kneser graph on chambers of a projective plane is equivalent to finding the incidence-free number of the incidence graph of the plane. Furthermore, we construct an incidence-free pair for PG$(2,q^2)$ of size roughly $q^3/2+3q^2/4$.
Read the full abstract
Information Theory
CR^2: Cost-Aware Risk-Controlled Routing for Wireless Device-Edge LLM Inference
As large language models (LLMs) move from centralized clouds to mobile edge environments, efficient serving must balance latency, energy consumption, and accuracy under constrained device-edge resources. Query-level routing between lightweight on-device models and stronger edge models provides a flexible mechanism to navigate this trade-off. However, existing routers are designed for centralized cloud settings and optimize token-level costs, failing to capture the dynamic latency and energy overheads in wireless edge deployments. In this paper, we formulate mobile edge LLM routing as a deployment-constrained, cost-aware decision problem, and propose CR^2, a two-stage device-edge routing framework. CR^2 decouples a lightweight on-device margin gate from an edge-side utility selector for deferred queries. The margin gate operates on frozen query embeddings and a user-specified cost weight to predict whether local execution is utility-optimal relative to the best edge alternative under the target operating point. We further introduce a conformal risk control (CRC) calibration procedure that maps each operating point to an acceptance threshold, enabling explicit control of the marginal false-acceptance risk under the full-information utility reference. Experiments on the routing task show that CR^2 closely matches a full-information reference router using only device-side signals before deferral. Compared with strong query-level baselines, CR^2 consistently improves the deployable accuracy-cost Pareto frontier and reduces normalized deployment cost by up to 16.9% at matched accuracy.
Read the full abstract
Information Theory
Conditioning Strengthens Classical Entropy and Matrix Inequalities: A Submodular Approach
Dembo, Cover, and Thomas (1991) developed an elegant information-theoretic framework for proving determinantal inequalities for positive definite matrices, which relies on the structural inequalities of differential entropy. Submodular functions, which subsume entropy, inherently satisfy these structural inequalities because they obey generalized forms of the fundamental properties of entropy – a chain rule and the property that conditioning reduces the function's value (under an appropriate definition of conditioning). Applying subadditivity, Han's inequality (1978), and partition subadditivity (i.e., subadditivity over a partition) yields Hadamard's, Szász's, and Fischer's inequalities, respectively. Furthermore, this framework recovers Ky Fan's inequality (1955), a strengthening of Hadamard's inequality. We highlight a previously unnoticed information-theoretic insight behind this improvement: conditioning yields a tighter upper bound on the joint entropy than the unconditional one. In this paper, we establish conditional strengthenings of Han's inequality and partition subadditivity in the general setting of submodular functions. We derive equality conditions for these strengthened bounds and characterize when they strictly improve their unconditional counterparts. We specialize these results to differential entropy and apply them to establish strengthened versions of Szász's and Fischer's inequalities. The strengthening of Szász's inequality recovers Ky Fan's inequality as a special case, and is strictly stronger than the classical Szász's inequality for any non-diagonal positive definite matrix. We also derive an inequality concerning eigenvalues, which generalizes and strictly strengthens a corresponding eigenvalue inequality of Ky Fan. We provide numerical examples to explicitly illustrate the tightness of our proposed matrix determinantal bounds.
Read the full abstract
Probability
Intrinsic volumes of $\ell_p$-balls and a continuum of Maxwell–Poincaré–Borel laws for their curvature measures
For $p>1$, we derive explicit formulas for the intrinsic volumes $V_0(\mathbb B_p^n),\dots,V_{n-1}(\mathbb B_p^n)$ of the $n$-dimensional $\ell_p$-balls $$ \mathbb B_p^n = \{x\in\mathbb R^n:\ |x_1|^p+\ldots+|x_n|^p\le 1\} $$ and, more generally, of their coordinate-weighted analogues. The formula is given in terms of a one-dimensional integral involving the special function $$ \mathcal F_p(t;\nu) = \int_{\mathbb R}|u|^\nu e^{-|u|^p-t|u|^{2p-2}}\,du. $$ Previously known formulas for the intrinsic volumes of ellipsoids, weighted crosspolytopes, and rectangular boxes arise as special or limiting cases. We also obtain asymptotic formulas for $V_{j(n)}(\mathbb B_p^n)$ in the high-dimensional regime $n\to\infty$, where the index $j(n)$ is allowed to depend on $n$. We further investigate the curvature measures of $\mathbb B_p^n$. These are finite measures $$ \Phi_0(\mathbb B_p^n,\cdot),\dots,\Phi_{n-1}(\mathbb B_p^n,\cdot) $$ on $\partial\mathbb B_p^n$ that localize the intrinsic volumes. We prove a Maxwell–Poincaré–Borel type limit theorem: if $X_n$ is a random boundary point of $\mathbb B_p^n$ distributed according to the normalized curvature measure $\Phi_{j(n)}(\mathbb B_p^n,\cdot)/V_{j(n)}(\mathbb B_p^n)$, where $j(n)/n\to\alpha\in[0,1]$ as $n\to\infty$, then for every fixed $r\in\mathbb N$, the joint distribution of the first $r$ coordinates of $n^{1/p}X_n$ converges weakly to the product measure $\nu_{p,\alpha}^{\otimes r}$. Here $\nu_{p,\alpha}$ is an explicit probability measure on $\mathbb R$ depending on $p>1$ and $\alpha\in[0,1]$. The main tool underlying these results is an explicit characterization of the curvature measures of coordinate-weighted $\ell_p$-balls, and in particular an explicit formula for their mixed moments.
Read the full abstract
Numerical Analysis
The SiMPL Method for Multi-Material Topology Optimization
We introduce an efficient and scalable method for density-based multi-material topology optimization, integrating classical mirror descent techniques with point-wise polytopal design constraints. Such constraints arise naturally in this class of problems, wherein the vertices of convex polytopes correspond to distinct design states, only one of which should be occupied at each point in space. The framework generates a descending sequence of iterates by penalizing the design space around the previous iterate with a generalized distance function tailored to the convex geometry of the $n$-dimensional polytope. This distance function, called a Bregman divergence, smooths the optimization landscape, ensuring that each iterate strictly satisfies the point-wise constraints. Subsequently, global constraints (e.g., bounds on the structural mass) can be enforced easily by solving a small, finite-dimensional dual problem. The resulting method is simple to implement and demonstrates robustness and efficiency when combined with an Armijo-type line search algorithm. We validate the method in structural design problems involving the optimal arrangement of both isotropic and anisotropic materials, as well as magnetic flux optimization in electric motors.
Read the full abstract
Optimization and Control
Securing the Flow: Strategic Storage and Corridor Design for Maritime Energy Security under Chokepoint Disruptions
Maritime disruption planning requires joint strategic storage and transport capacity decisions under uncertainty. We develop a two-stage stochastic multi-commodity network-design model for national energy security that integrates corridor commitments, port–commodity inventories, storage expansion, and scenario-dependent routing for crude oil, LNG, LPG, and fertilizer. The formulation incorporates decision-dependent probabilities, corridor concentration limits, and mean–CVaR risk, admitting an exact MILP reformulation. In a data-anchored India-inspired case study, stochastic modeling outperforms the expected-value policy by 1.35%, with decision-dependent probabilities worth 0.67%. Service levels are heterogeneous: crude and fertilizer maintain full coverage, while LNG and LPG drop to 34.6% and 33.3% under worst-case scenarios. Storage expansion adds 1,775 capacity units across seven port–commodity pairs and reduces active corridor commitments. Sensitivity analyses demonstrate that dependence alters economic exposure while preserving policy optimality, though cost stresses modify first-stage decisions with a maximum regret of 1.1673%.
Read the full abstract
Representation Theory
Alperin's Main Problem of Block Theory
This paper proposes a conjectural framework for Alperin's Main Problem of Block Theory from 1976. The character sets considered here are defined by nonvanishing at given elements, not only by degree conditions. From this point of view, McKay's conjecture is usually recovered as a first degree-level consequence. The guiding idea is that the right local objects governing character values are not, in general, the sets ${\rm Irr}_{p'}(G)$ and the normalizers of Sylow $p$-subgroups, but rather the sets ${\rm Irr}^x(G)$ of irreducible characters not vanishing at a given element $x$, together with the subnormalizer subgroup ${\rm Sub}_G(x)$. I state the basic conjectures of this theory, propose stronger versions, and verify the main conjectures in several families, including the simple groups with TI Sylow $p$-subgroups. I also show how this perspective reorganizes several classical questions in character theory.
Read the full abstract
Numerical Analysis
Optimized Two-Step Coarse Propagators in Parareal Algorithms
In this work, we propose a novel framework for accelerating the parareal algorithm, in which the coarse propagator is formulated as a two-step method and optimized with respect to the convergence factor.} We derive a rigorous error estimate for the proposed two-step parareal algorithm, yielding an explicit bound on the linear convergence factor. This estimate is not only of theoretical interest: it provides a quantitative guideline for selecting and designing coarse propagators. Guided by this estimate, we {consider the linear parabolic equation as an illustrative example and }construct an optimized two-step coarse propagator~(O2CP) that delivers very fast convergence in practice. The resulting method attains an optimized convergence factor of approximately $0.0064$, substantially smaller than that of commonly used practical coarse propagators in the classical parareal setting, while keeping the computational cost moderate. Numerical experiments on linear and nonlinear parabolic equations fully support the theoretical analysis and demonstrate rapid convergence of the two-step parareal algorithm equipped with the O2CP.
Read the full abstract
Analysis of PDEs
An H-convergence-based implicit function theorem for homogenization of nonlinear non-smooth elliptic systems
We consider homogenization of Dirichlet problems for semilinear elliptic systems with non-smooth data. We suppose that the diffusion tensors H-converge if the homogenization parameter tends to zero. Our result is of implicit function theorem type: For small homogenization parameter there exists exactly one weak solution close to a given non-degenerate weak solution to the homogenized problem. For the proofs we use gradient estimates of Meyers (if the space dimension is two) or Morrey (if the diffusion tensors are triangular) type for solutions to linear elliptic systems.
Read the full abstract
Statistics Theory
Stochastic Ordering under Weaker Likelihood-Ratio Shape Conditions
We show that the shape hypothesis on a likelihood ratio can be weakened while retaining endpoint criteria for the hazard-rate and usual stochastic orders. The endpoint reduction persists under unimodality of the likelihood ratio and under a sign-pattern condition on the likelihood ratio minus one, with at most two sign changes and a negative right tail. It also follows from a direct superlevel-set criterion involving the same expression, which is useful in particular for discontinuous likelihood ratios.
Read the full abstract
Mathematical Physics · Cross-listed from gr-qc
The choice of variables in cosmological dynamical systems
Dynamical systems techniques are a powerful tool to analyse systems of ordinary differential equations, written in an appropriate form. For a given theory of gravity, the cosmological field equations typically lead to a system of ordinary differential equations. Casting these cosmological equations into the form of a dynamical system requires a careful choice of the dynamical variables. Despite this being a critical step, relatively little is said about this process in the literature. We discuss how different variable choices affect the information that can be extracted from the Friedmann equations. We begin by reviewing the standard cosmological model with dark matter, radiation, and dark energy, and include quintessence models. We revisit well-known models with an exponential potential using new variables. This discussion is then extended to models with scalar fields and more intricate coupling terms.
Read the full abstract
Number Theory
Weil-Moore anima
The Weil group of a number field is a refinement of its absolute Galois group arising from class field theory. The passage from Galois to Weil is important in several places in number theory. However, we will argue that while from the Galois perspective, a number field is a “K($\pi$,1)”, from the Weil perspective it is not. Thus we are led to further refine the Weil group, by constructing an object, the Weil-Moore anima, which has the Weil group as its fundamental group, but with nontrivial higher homotopy groups. Our motivation is that the cohomological properties of Weil-Moore anima are in several ways nicer than those of the Weil or Galois groups.
Read the full abstract
Combinatorics
Sharp asymptotic bounds for uniform union-free hypergraphs
An $r$-uniform hypergraph is called $t$-union-free if any two distinct subsets of at most $t$ edges have distinct union. The study of union-free hypergraphs has multiple origins and a long history, dating back to the works of Kautz and Singleton (1964) in coding theory, Bollobás and Erdős (1976) in combinatorics, and Hwang and Sós (1987) in group testing. Let $U_t(n,r)$ denote the maximum number of edges in an $n$-vertex $t$-union-free $r$-uniform hypergraph. In this paper, we determine the asymptotic behavior of $U_t(n,r)$, up to a lower order term, for almost all $t\ge 3$ and $r\ge 3$. This significantly advances the understanding of this extremal function, as previously, only the asymptotics of $U_2(n,3)$ and $U_2(n,4)$ were known. As a key ingredient of our proof, we establish the existence of near-optimal locally sparse induced hypergraph packings, which is of independent interest.
Read the full abstract
Optimization and Control
Generative Transfer for Entropic Optimal Transport with Unknown Costs
This paper addresses the practical challenge in Entropic Optimal Transport (EOT) where the underlying ground cost function is typically latent and unobserved. Rather than assuming a fixed geometric cost, we adopt a data-driven approach where a shared cost is revealed only through samples from a reference optimal coupling. The question is then: given samples from a reference optimal coupling, can we recover the optimal coupling for new marginals under the same latent cost? We introduce a generative transfer framework that recovers the optimal coupling for new marginals by utilizing an iterative path-wise tilting algorithm. Unlike static importance reweighting, this method evolves the coupling jointly with a marginal transport path, allowing mass to move beyond the reference support. We derive sample-level learning rules for these infinitesimal updates, which yield covariance-type evolution equations for the associated transport vector fields. By integrating this dynamics with Conditional Flow Matching (CFM), we produce a practical sampler for paired data. Finally, we provide theoretical guarantees establishing a global convergence rate of \mathcal{O}(\delta), ensuring the generated coupling converges to the target EOT plan in W_1 distance.
Read the full abstract
Commutative Algebra
Bass numbers of graded components of local cohomology modules
Let $R=\bigoplus_{n\in \NN_0}R_n$ be a standard graded ring, $R_+=\bigoplus_{n\in \NN}R_n$ its irrelevant ideal, and $M$ a finitely generated graded $R$-module. In this paper, we study the asymptotic behavior of the sequence $\{\mu^i(\p_0, H^j_{R_+}(M)_n)\}_{n\in \Z}$ of Bass numbers of graded components of local cohomology modules with respect to an ideal $\p_0\in \Spec(R_0)$ in each of the following cases: (1) $i=0$ or $i= 1$ and $j\leq f_{R_+}(M)$, (2) $R_0$ is regular, $i= \hei(\p_0)$ or $i= \hei(\p_0)- 1$ and $j= \cd_{R_+}(M)$, (3) $M$ is relative Cohen-Macaulay with respect to $R_+$. Here, $\cd_{R_+}(M)$ and $f_{R_+}(M)$ denote the cohomological dimension and finiteness dimension of $M$ with respect to $R_+$, respectively.
Read the full abstract
Analysis of PDEs
A variational approach to the derivation of reduced models for bubbly flows
In this paper, we derive reduced models for the motion of gas bubbles in an ambient inviscid liquid, using Hamilton's least action principle. We first explain how to recover from this principle the classical sharp interface model, in which the pressure is continuous across the surfaces of the bubbles. We then show how to reduce the complexity of the model, by simplifying the description of those surfaces. Namely, we impose them to evolve within a subclass of hypersurfaces described by a finite number of parameters (the simplest example being spheres, that is neglecting deviation of the bubbles from sphericity). The difficulty from a mathematical and modeling point of view is to determine the interface conditions that substitute to pressure continuity. We complete the derivation of the reduced models by some well-posedness analysis, in the case of curl-free liquid flow and homogeneous pressure in the bubbles.
Read the full abstract
Analysis of PDEs
On the existence and nonexistence of global solutions of the semilinear heat equation
We consider the semilinear heat equation $$ u_t-\Delta u=|u|^{p-1}u,\ \ (t,x)\in\mathbb{R}^+\times\mathbb{R}^n. $$ The well-known difficulty with this problem is that the potential well method cannot be applied directly, due to the scaling invariance which leads to a potential well of zero depth. We employ the forward similarity transform to convert the equation into a new parabolic equation, so that we can apply the potential well method in weighted Sobolev spaces. As a result, we obtain a new criterion that establishes whether solutions to the heat equation blow up in finite time or exist globally. This work extends the partial results of Ikehata et al. (Ann. Inst. H. Poincaré Anal. Non Linéaire, 27 (2010) 877-900) from critical Sobolev exponent to the case $p_F<p<p_S$, where $p_F=1+2/n$ is the Fujita exponent and $p_S=(n+2)/(n-2)$ (for $n\ge3$) is the critical Sobolev exponent.
Read the full abstract
Algebraic Geometry
Double Veronese cones with singularities
We study double Veronese cones – three-dimensional del Pezzo varieties of degree one – with terminal Gorenstein singularities. We prove sharp bounds for the number of nodes, determine the structure of the automorphism group, and establish criteria for rationality and unirationality. In particular, we exhibit a $\mathbb{Q}$-factorial nodal double Veronese cone with $21$ nodes.
Read the full abstract
Optimization and Control
Convergence of zeroth-order proximal point algorithms in the high-temperature regime
Efficient methods for non-convex black-box optimization largely rely on sampling. In this context, the Zeroth-Order Proximal Operator (ZOPO) and the corresponding Zeroth-Order Proximal Point Algorithm (ZOPPA) have attracted significant interest, as they combine the advantage of requiring only objective evaluations with the powerful theoretical framework of proximal point algorithms. ZOPO depends on a temperature parameter which, when going to zero, reduces ZOPO to the exact proximal operator. By exploiting this property, the vanishing-temperature regime has been leveraged in several works to obtain theoretical guarantees via inexact proximal methods. However, this regime is computationally unsustainable when sampling is used to estimate ZOPO, since the corresponding Monte Carlo estimators suffer from severe variance issues. We therefore propose a comprehensive analysis of ZOPO for any fixed positive temperature, and prove convergence of ZOPPA under minimal assumptions on the objective function. We do so by demonstrating that ZOPPA can be interpreted as an exact proximal point method applied to an auxiliary smoothed objective, rather than an inexact method on the original function. Importantly, we further derive explicit guarantees connecting this smoothed problem back to the original objective and establish convergence results for the sampled method (S-ZOPPA) at a fixed temperature.