Functional Analysis
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Thursday 19 February
In this paper we combine topological and functional analysis methods to prove that a non-locally trivial quasi-linear map defined on a $C(K)$ must be nontrivial on a subspace isomorphic to $c_0$. We conclude the paper with a few examples showing that the result is optimal, and providing an application to the existence of nontrivial twisted sums of $\ell_1$ and $c_0$.
Information Theory · Cross-listed from quant-ph
Tight any-shot quantum decoupling
Quantum information decoupling is a fundamental primitive in quantum information theory, underlying various applications in quantum physics. We prove a novel one-shot decoupling theorem formulated in terms of quantum relative entropy distance, with the decoupling error bounded by two sandwiched Rényi conditional entropies. In the asymptotic i.i.d. setting of standard information decoupling via partial trace, we show that this bound is ensemble-tight in quantum relative entropy distance and thereby yields a characterization of the associated decoupling error exponent in the low-cost-rate regime. Leveraging this framework, we derive several operational applications formulated in terms of purified distance: (i) single-letter expressions for the exact error exponents of quantum state merging in the low-entanglement-cost and high-entanglement-distillation-rate regimes, in terms of Petz-Rényi conditional entropies, and (ii) regularized expressions for achievable error exponents of entanglement distillation and quantum channel coding in terms of Petz-Rényi coherent informations. We further prove that these achievable bounds are tight for maximally correlated states and generalized dephasing channels, respectively, for the high distillation-rate/coding-rate regimes.
Read the full abstract
Optimization and Control · Cross-listed from cs.LG
Convergence Analysis of Two-Layer Neural Networks under Gaussian Input Masking
We investigate the convergence guarantee of two-layer neural network training with Gaussian randomly masked inputs. This scenario corresponds to Gaussian dropout at the input level, or noisy input training common in sensor networks, privacy-preserving training, and federated learning, where each user may have access to partial or corrupted features. Using a Neural Tangent Kernel (NTK) analysis, we demonstrate that training a two-layer ReLU network with Gaussian randomly masked inputs achieves linear convergence up to an error region proportional to the mask's variance. A key technical contribution is resolving the randomness within the non-linear activation, a problem of independent interest.
Read the full abstract
Number Theory
Computing class groups and gonalities of algebraic curves over finite fields
We give practical algorithms for computing the divisor class group and the gonality of a curve over a finite field, achieving several orders of magnitude speedup over existing methods for sufficiently large genus or residue field. The approach relies on introducing a precomputation step involving power series-expansions, which allows for an efficient amortized computation of large numbers of Riemann-Roch spaces.
Read the full abstract
Analysis of PDEs
Isoperimetric inequalities for the lowest magnetic Steklov eigenvalue
This paper studies the optimization of the lowest eigenvalue of the magnetic Steklov problem on planar domains. In the bounded domain setting and for magnetic fields of moderate strengths, we prove that among all simply-connected smooth domains of given area, the disk maximises the lowest magnetic Steklov eigenvalue. For exterior domains, we establish a similar isoperimetric inequality for magnetic fields of moderate strength under fixed perimeter constraint and additional geometric and symmetry assumptions. The proofs rely on the method of torsion-type trial functions in the bounded domain case and on the method of trial functions dependent only on the distance to the boundary in the exterior domain case.
Read the full abstract
Combinatorics
On problems of Erdős and Baumann-Briggs on minimising the density of $s$-cliques in graphs with forbidden subgraphs
Using flag algebras, we prove that the minimum density of $8$-cliques in a large graph without an independent set of size $3$ is $491411/268435456+o(1)$, thus resolving a new case of an old problem of Erdős [Magyar Tud. Akad. Mat. Kutató Int. Közl. 7 (1962) 459-464]. Also, we establish some other results of this type; for example, we show that the minimum $s$-clique density in a large graph with no independent set of size 3 nor an induced 5-cycle is $2^{1-s}+o(1)$ when $s=4,5,6$. For each of these results, we also describe the structure of all extremal and almost extremal graphs of large order $n$. These results are applied to give an asymptotic solution to a number of cases of the problem of Baumann and Briggs [Electron. J. Combin. 32 (2025) P1.22] which asks for the minimum number of $s$-cliques in an $n$-vertex graph in which every $k$-set spans a $t$-clique.
Read the full abstract
Group Theory
Cohomological and quasi-isometric diversity of groups with property $R_\infty$
How rich is the collection of groups with a given prominent property? In this work we approach this question for property~$R_\infty$, which says that every automorphism $\varphi$ of a given group has infinitely many orbits under the $\varphi$-twisted conjugation action $(g,x) \mapsto gx\varphi(g)^{-1}$. Generalising the soluble groups of Herbert Abels to a large family over many integral domains, we prove that most such groups have property~$R_\infty$ drawing from a classical result of Levchuk and a swift observation by Jabara. Within the broad programme of cataloguing finitely generated groups up to quasi-isometry, our groups can then be separated by finiteness properties and cohomological dimension whilst having~$R_\infty$. Abandoning finite presentability, we establish that property~$R_\infty$ is very abundant in a strong sense: there are uncountably many finitely generated groups (which can all be chosen to be amenable or non-amenable) that have~$R_\infty$ and are pairwise not quasi-isometric. The proofs vary in flavour. On the amenable side we use carefully constructed quotients of Abels' groups and a general strategy for quasi-isometric diversity established by Minasyan, Osin, and Witzel. For the non-amenable constructions we rely on modifications of Leary's type $\mathtt{FP}$ groups, further cohomological arguments, and recent powerful criteria for~$R_\infty$ due to Iveson, Martino, Sgobbi, Wong, and Fournier-Facio.
Read the full abstract
Analysis of PDEs
Wave front set of solutions to the fractional Schrödinger equation
In this paper, we characterize the wave front sets of solutions to fractional Schrödinger equations \(i\partial_{t}u =(-\Delta)^{\theta/2}u + V(x)u\) with $0<\theta <2$ via the wave packet transform (short-time Fourier transform). We clarify the relationship between the order \(\theta\) of the fractional Laplacian and the growth rate of the potential in the problem of propagation of singularities. In particular, we present a theorem that bridges the propagation mechanisms of singularities for the Schrödinger and wave equations.
Read the full abstract
Optimization and Control
Optimization Problems with Difference of Tangentially Convex Functions under Uncertainty
This paper investigates a specific class of nonsmooth nonconvex optimization problems in the face of data uncertainty, namely, robust optimization problems, where the given objective function can be expressed as a difference of two tangentially convex (DTC) functions. More precisely, we develop a range of nonsmooth calculus rules to establish relationships between Frechet and limiting subdifferentials for a particular maximum function and the tangential subdifferential of its constituent functions. Subsequently, we derive optimality conditions for problems involving DTC functions, employing generalized constraint qualifications within the framework of the tangential subdifferential concept. Several illustrative examples are presented to demonstrate the obtained results.
Read the full abstract
Combinatorics
On a Quadratic Relation Between Stanley-Wilf Limits and Füredi-Hajnal Limits
For a permutation matrix $P$, let $s_P$ denote its Stanley-Wilf limit, the exponential growth rate of the number of $n\times n$ permutation matrices avoiding $P$. Let $c_P$ denote its Füredi-Hajnal limit, which is the limit $\displaystyle \lim_{n \to \infty} \text{ex}(n,P)/n$ where $\text{ex}(n,P)$ is the maximum number of ones in an $n\times n$ $0$-$1$ matrix avoiding $P$. Cibulka proved the universal quadratic bound $s_P\leq 2.88\,c_P^2$. In this note we improve the constants in Cibulka's result through a so-called “block contraction" argument. Defining \[ F(c)=\inf_{t\in\mathbb{N}} \frac{(t!)^{1/t}\,15^{\,c/t}}{c}, \] for $c>0$, this leads us to the revised inequality $s_P\leq F(c_P)\,c_P^2$. In particular, $F(c)=\log 15+o(1) \approx 2.70805\ldots +o(1)$ as $c\to\infty$, and the constant improves $2.88$ once $c_P \geq 17$.
Read the full abstract
Optimization and Control
Stackelberg Dynamic Location Planning under Cumulative Demand
Dynamic facility location problems predominantly suppose a monopoly over the service or product provided. Nonetheless, this premise can be a severe oversimplification in the presence of market competitors, as customers may prefer facilities installed by one of them. The monopolistic assumption can particularly worsen planning performance when demand depends on prior location decisions of the market participants, namely, when unmet demand from one period carries over to the next. Such a demand behaviour creates an intrinsic relationship between customer demand and location decisions of all market participants, and requires the decision-maker to anticipate the competitor's response. This work studies a novel competitive facility location problem that combines cumulative demand and market competition to devise high-quality solutions. We propose bilevel mixed-integer programming formulations for two variants of our problem, prove that the optimistic variant is $\Sigma^{p}_{2}$-hard, and develop branch-and-cut algorithms with tightened value-function cuts that significantly outperform general-purpose bilevel solvers. Our results quantify the severe cost of planning under a monopolistic assumption (profit drops by half on average) and the gains from cooperation over competition (6% more joint profit), while drawing managerial guidelines on how instance attributes and duopolistic modelling choices shape robust location schedules.
Read the full abstract
Analysis of PDEs
Anisotropic Maximal $L^p$-regularity Estimates for a Hypoelliptic Operator
We consider the maximal regularity of a specific Vlasov-Fokker-Planck equation $\mathcal{A}u=f$ in the Euclidean space. The operator $\mathcal{A}=\Delta_{y}u-y\cdot \nabla_x{u}$ is an example of the Ornstein-Uhlenbeck operators. We prove the existence of a solution that satisfies the anisotropic maximal regularity estimates. To prove this we also show a similar estimates and a weak (1, 1) estimate for $L=\partial_t-\mathcal{A}$, which is of independent interest. Moreover, we show a maximal regularity estimate containing a fractional transport operator. These results rely on the pointwise estimates of the fundamental solution of $L$.
Read the full abstract
Analysis of PDEs
Asymptotic analysis for heterogeneous elastic energies with material voids
We study the effective behavior of heterogeneous energies arising in the modeling of material voids in geometrically linear elastic materials. Specifically, we consider functionals featuring bulk terms depending on the symmetrized gradient of the displacement and terms comparable to the surface area of the material voids inside the material. Under suitable growth conditions for the bulk and surface densities we prove that, as the microscale $\varepsilon$ tends to zero, the $\Gamma$-limit admits an integral representation that contains an additional surface term expressed by jump discontinuities of the displacement outside of the void region. This term is related to the phenomenon of collapsing of voids in the effective limit. Under a continuity assumption of the surface density at the $\varepsilon$-scale, we show that the limiting density related to jumps is twice the energy density for voids.
Read the full abstract
Representation Theory
Fukaya categories of orbifold surfaces in representation theory
We give an introduction to partially wrapped Fukaya categories of surfaces with orbifold singularities. Dissecting an orbifold surface $\mathbf S$ into polygons, certain dissections give rise to formal generators, inducing a triangulated equivalence between the derived Fukaya category of $\mathbf S$ and the perfect derived category of a graded associative algebra. This provides a geometric means for obtaining associative algebras – conjecturally all – which are derived equivalent to skew-gentle algebras. We include a new perspective on the partially wrapped Fukaya category of an orbifold disk which serves as a local model for the Fukaya categories of general orbifold surfaces. This perspective yields an equivalence between the perfect derived category of a quiver of type $\mathrm D_{n+1}$ and the perfect derived category of a graded quiver of type $\widetilde{\mathrm A}_{n-1}$, the latter being equipped with quadratic zero relations and a nontrivial A$_\infty$ structure. This equivalence elucidates the relationship between skew-gentle algebras and orbifold surfaces, and the role of deformation theory in this relationship.
Read the full abstract
Probability
Variance renormalisation in regularity structures – the case of $2d$ gPAM
We consider the variance renormalisation of a singular SPDE for which a Da Prato-Debussche trick is not applicable. The example taken is the $2$-dimensional generalised parabolic Anderson model (gPAM), driven by a much rougher than white noise, necessitating both a multiplicative and an additive renormalisation. To handle the discrepancy between the regularity structures of the approximate and the limiting equations, we consider models that lift $0$ noises to nontrivial models, in analogy with “pure area” from rough paths. The convergence to such a model is shown for the BPHZ model over the vanishing noise via graphical computations.
Read the full abstract
Differential Geometry
Robinson manifolds and the Chern-Robinson connection
Category Theory
Generalized inverse diagrams in tribes
Starting from a generalized direct category $R$, we construct an absolutely dense functor $\mathbf{D}_r \to R$ with domain a strict direct category. Given any tribe $\mathcal{T}$, we leverage this construction to provide a tribe structure on a subcategory of fibrant diagrams in $\mathcal{T}^{R^{op}}$, assuming some finiteness condition on $R$.
Read the full abstract
Numerical Analysis
Application and Evaluation of the Common Circles Method
We investigate the application of the common circle method for estimating sample motion in optical diffraction tomography (ODT) of sub-millimeter sized biological tissue. When samples are confined via contact-free acoustical force fields, their motion must be estimated from the captured images. The common circle method identifies intersections of Ewald spheres in Fourier space to determine rotational motion. This paper presents a practical implementation, incorporating temporal consistency constraints to achieve stable reconstructions. Our results on both simulated and real-world data demonstrate that the common circle method provides a computationally efficient alternative to full optimization methods for motion detection.
Read the full abstract
Numerical Analysis
Raster Scan Diffraction Tomography
Diffraction tomography is a widely used inverse scattering technique for quantitative imaging of weakly scattering media. In its conventional formulation, diffraction tomography assumes monochromatic plane wave illumination. This assumption, however, represents a simplification that often fails to reflect practical imaging systems such as medical ultrasound, where focused beams are used to scan a region of interest of the human body. Such measurement setups, combining focused illumination with scanning, have not yet been incorporated into the diffraction tomography framework. To bridge this gap, we extend diffraction tomography by modeling incident fields as Herglotz waves, thereby incorporating focused beams into the theory. Within this setting, we derive a new Fourier diffraction relation, which forms the basis for quantitative tomographic reconstruction from scanning data. Using this result, we systematically analyze how different scan geometries influence the reconstruction.
Read the full abstract
Geometric Topology · Cross-listed from cs.LG
Shortcut learning in geometric knot classification
Classifying the topology of closed curves is a central problem in low dimensional topology with applications beyond mathematics spanning protein folding, polymer physics and even magnetohydrodynamics. The central problem is how to determine whether two embeddings of a closed arc are equivalent under ambient isotopy. Given the striking ability of neural networks to solve complex classification tasks, it is therefore natural to ask if the knot classification problem can be tackled using Machine Learning (ML). In this paper, we investigate generic shortcut methods employed by ML to solve the knot classification challenge and specifically discover hidden non-topological features in training data generated through Molecular Dynamics simulations of polygonal knots that are used by ML to arrive to positive classifications results. We then provide a rigorous foundation for future attempts to tackle the knot classification challenge using ML by developing a publicly-available (i) dataset, that aims to remove the potential of non-topological feature classification and (ii) code, that can generate knot embeddings that faithfully explore chosen geometric state space with fixed knot topology. We expect that our work will accelerate the development of ML models that can solve complex geometric knot classification challenges.
Read the full abstract
Numerical Analysis
Analysis of an exponential integrator for stochastic PDEs driven by Riesz noise
We present and study an explicit exponential integrator for parabolic SPDEs in any dimension driven by a Gaussian noise which is white in time and with spatial correlation given by a Riesz kernel. Under assumptions on the coefficients of the SPDE, we prove strong error bounds and exhibit how the rate of convergence depends on the exponent in the Riesz kernel. Finally, numerical experiments in spatial dimensions $1$ and $2$ are provided in order to confirm our convergence results.
Read the full abstract
Category Theory
Flat functors in the context of fibration categories
We investigate the connection between left exact $\infty$-functors between finitely complete quasicategories and exact functors between fibration categories, describing a procedure to approximate flat $\infty$-functors of the former type by exact functors of the latter type. As an application, we recover a proof of the DK-equivalence between the relative category of fibration categories and that of finitely complete quasicategories.
Read the full abstract
Numerical Analysis
Invertibility of the Fourier Diffraction Relation in Raster Scan Diffraction Tomography
Diffraction tomography aims to recover an object's scattering potential from measured wave fields. In the classical setting, the object is illuminated by plane waves from many directions, and the Fourier diffraction theorem provides a direct relation between the Fourier transform of the object's scattering potential and the Fourier transform of the measurements. In many practical imaging systems, however, focused beams are used instead of plane waves. These beams are then translated across the object to bring different regions of interest into focus. This article discusses what information about the scattering potential can be extracted from such measurements. As in the classical case, the analysis is based on a recently derived Fourier diffraction relation that relates the measurements to the Fourier coefficients of the scattering potential. However, this relation does not immediately provide an explicit reconstruction formula, but instead leads to a linear equation system for the Fourier coefficients. We therefore prove in this work that all Fourier coefficients appearing in these relations are in dimensions higher than two generically uniquely determined. In the two-dimensional case, on the other hand, only a particular subset of the Fourier coverage is uniquely recoverable, while on the remaining region distinct coefficients may produce identical data.
Read the full abstract
Probability
Stochastic homogenization of diffusions in turbulence driven by non-local symmetric Lévy operators
We investigate the stochastic homogenization of a class of turbulent diffusions generated by non-local symmetric Lévy operators with divergence-free drift fields in ergodic random environments, where neither the drift fields nor their associated stream functions are assumed to be bounded. A pivotal step in our proof is the establishment of $W_{loc}^{1,q}$ estimates with $q\in (1,2)$ for the corresponding correctors, under mild prior regularity conditions imposed on the Lévy measure and the stream function.
Read the full abstract
Logic
Towards a theory of symmetric extensions
The technique of symmetric extensions is derived from forcing and it is one of the most important tools for studying models without the Axiom of Choice. Despite being incredibly successful since the 1960s, our understanding of the technique remained fairly limited compared to the theory of forcing. Whereas forcing developed products and iterations, no serious attempts at developing any general framework for iterating symmetric extensions were presented before [10], where only finite support iterations are treated. In this paper we develop the theory of symmetric extensions including different types of iterations, quotients, equivalents, and the structural results that can be described in this language. In particular, we give a modern exposition to some of the important theorems of Grigorieff [3], study Kinna–Wagner Principles in symmetric extensions, and show that it is provable from $\mathsf{ZF}$ that every set lies in a symmetric extension of $\operatorname{HOD}$.
Read the full abstract
Functional Analysis
Algebraic structures featuring graph dimensions, Hölder regularity, and fractional differentiability
We investigate the algebraic genericity of various families of continuous functions exhibiting extreme irregularity, focusing on fractal dimensions, Hölder regularity, and fractional differentiability. Our first main result shows that for every $s \in (1,s]$, the set of continuous functions on $[0, 1]$ whose graph has Hausdorff and box dimensions equal to s is strongly $\mathfrak{c}$-algebrable, thereby tackling an open question by Bonilla et al., and complementing recent findings by Liu et. al and Carmona et al. We then extend the analysis to Hölder spaces: although the pointwise Hölder exponent of a generic function in $C^{\alpha}[0, 1]$ is constant, we prove that the collection of functions realizing this behavior is $\mathfrak{c}$-lineable but cannot form an algebra. Nevertheless, we construct strongly $\mathfrak{c}$-algebrable families of functions that exhibit Hölder exponent $\alpha$ outside a set of Hausdorff dimension zero. Finally, as a consequence of the relation between strongly monoHölder functions and fractional differentiability, we analyze the strong $\mathfrak{c}$-algebrability of nowhere (Riemann-Liouville) fractional differentiable functions.
Read the full abstract
Analysis of PDEs
On the classical Reinforcement problem and Optimisation
In the present survey, we consider the classical reinforcement problem for elliptic boundary value problems originally studied by Sanchez-Palencia in 1969. We focus on the seminar papers by Brezis, Caffarelli, & Friedman, and by Acerbi & Buttazzo, and discuss the related optimisation problems proposed by Friedman and by Buttazzo.
Read the full abstract
Rings and Algebras
Frobenius extensions about centralizer matrix algebras
This paper investigates the conditions under which the centralizer algebra $S_n(c,R)$ of a matrix $ c\in M_n(R)$ is a (separable) Frobenius extension of the base algebra $R$. For an algebra $R$ over an integral domain $\mathbb{k}$, we provide necessary and sufficient conditions for $S_n(c,R)/R$ to be a (separable) Frobenius extension when $c$ is in Jordan canonical form with eigenvalues in $\mathbb{k}$. We extend this analysis to arbitrary matrices over a field and derive conditions for matrix diagonalizability through Frobenius extensions.
Read the full abstract
Representation Theory
Iterated mutations of symmetric periodic algebras
Following methods used by A. Dugas for investigating derived equivalent pairs of (weakly) symmetric algebras, we apply them in a specific situation, obtaining new deep results concerning iterated mutations of symmetric periodic algebras. More specifically, for any symmetric algebra $\Lambda$, and an arbitrary vertex $i$ of its Gabriel quiver, one can define mutation $\mu_i(\Lambda)$ of $\Lambda$ at vertex $i$ via silting mutation of the stalk complex $\La$. Then $\mu_i(\Lambda)$ is again symmetric, and we can iterate this process. We want to understand the order of $\mu_i$, in case the vertex $i$ is $d$-periodic, i.e. the simple module $S_i$ associated to $i$ is periodic of period $d$ (with respect to the syzygy). The main result of this paper shows that then $\mu_i$ has order $d-2$, that is $\mu_i^{d-2}(\Lambda)\cong\Lambda$ (modulo socle), under some additional assumption on the (periodic) projective-injective resolution of $S_i$. Besides, we present briefly some consequences concerning arbitrary periodic vertex and give few sugestive examples showing that this property should hold in general, i.e. without restrictions on the periodic projective resolution.
Read the full abstract
Probability
Quenched large deviations for randomly weighted geodesic random walks
We consider weighted geodesic random walks in a complete Riemannian manifold $(M,g)$. We show that for almost all sequences of weights (with respect to a suitable measure), these weighted geodesic random walks satisfy, when suitably scaled, a large deviation principle with a universal rate function. This extends the results from [3], where this was shown for the real-valued case. It turns out the argument is also valid for general vector spaces. This allows us to use the methodology of [9], in which large deviations for geodesic random walks are obtained from large deviation estimates for associated random walks in tangent spaces.