History and Overview of Mathematics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Thursday 14 May
Sophie Germain (1776-1831) was the first woman we know who did important original research in mathematics, specifically in elasticity theory and number theory. Celebrating her semiquincentennial year, we outline Germain's recently unearthed number theory results on Fermat's Last Theorem, in the context of her life, work, and interactions with Lagrange, Legendre, and Gauss. For two centuries her accomplishment on Fermat's Last Theorem was thought to consist of a single theorem attributed to her in a publication by Legendre, the first general result towards proving Fermat's Last Theorem. But recent discoveries in her handwritten manuscripts and correspondence with Legendre and Gauss show that she accomplished much more, albeit forgotten. In particular, she had a grand plan for proving Fermat's Last Theorem in its entirety, and carried this plan a long way, using then new tools, e.g., congruence, modular primitive roots, and permutations.
Combinatorics
Hamiltonicity of regular sublinear expanders
We say that a $d$-regular graph is a $\gamma$-expander if for every not too large set of vertices $S$, there are at least $\gamma d |S|$ edges leaving $S$, and we say that a graph $G$ is $\gamma$-far from bipartite if at least $\gamma e(G)$ edges need to be removed to make it bipartite. We prove that there exists an absolute constant $K$ such that any $n$-vertex $d$-regular $\gamma$-expander with $d \ge (\gamma^{-1} \log n)^K$ is Hamiltonian, provided that it is bipartite or $\gamma$-far from bipartite. As applications, we obtain highly robust versions of recent important results on the Hamiltonicity of Cayley graphs and Kneser graphs. As part of our proof, we prove a random connecting lemma for sublinear expanders which might be of independent interest.
Read the full abstract
Combinatorics
A characterization of 4-connected graphs with no 6-wheel minor
For each integer $n\geq 3$, let $W_n$ denote the wheel graph obtained by connecting a single vertex to all vertices of a cycle of length $n$. In particular, $W_6$ is obtained from the Petersen graph by contracting three edges incident with a common vertex. In this paper, we determine all $4$-connected graphs that do not contain $W_6$ as a minor.
Read the full abstract
Differential Geometry
Liouville theorem for immersed minimal surfaces in any codimension
For a proper immersed minimal disk in $\bf{R}^N$ with quadratic area growth, we show that any harmonic function whose negative part grows at a slow sub-linear rate is constant. This leads to a higher codimensional Bernstein theorem for minimal disks contained in a sub-linearly growing cone. The catenoid, helicoid and Enneper's family of surfaces together show that this result is optimal. We also show uniform Hölder regularity of harmonic functions.
Read the full abstract
Category Theory
Sphericalization and the Universal Spherical Adjunction
For every adjunction of stable $\infty$-categories – or more generally, in any locally stable $(\infty,2)$-category – we give a simple procedure for inverting the twist and cotwist functors associated to this adjunction. As a consequence, we obtain an explicit construction for a left and right adjoint to the inclusion of the $(\infty,2)$-category of spherical adjunctions of stable $\infty$-categories into all adjunctions. We utilize these adjoints to give a description of the walking spherical adjunction, a locally stable $(\infty,2)$-category which classifies spherical adjunctions, and to provide a synthetic proof of the fact that every spherical functor admits infinitely many left and right adjoints.
Read the full abstract
Differential Geometry
Minimal submanifolds confined in space
Already in $\mathbb{R}^4$, there are many minimal hypersurfaces but few structural results. The half-space theorem fails there: higher-dimensional catenoids are among the many examples contained in a slab. Nevertheless, we show that in any dimension and codimension, the height of a minimal submanifold controls its volume growth: confinement to a narrow cone forces polynomial growth, and sublinear height forces Euclidean growth, the slowest possible. Thus volume bounds, which regularity theory assumes, follow from height alone. The key is a volume doubling theorem that converts geometric confinement into quantitative rigidity: if an $n$-dimensional stationary integral varifold lies in a thin slab at a given scale, then its volume doubling ratio at that scale is bounded by a universal constant. Iterating this gives the polynomial growth bounds above. Sublinear height is exactly the borderline for Euclidean growth: examples grow at least like $r^{n+4\epsilon^2/5}$ in cones of aperture $\epsilon$. From Euclidean volume growth, we obtain an optimal Bernstein theorem, in all dimensions, for stable minimal hypersurfaces with sublinear height growth, generalizing results of Moser, Bombieri–De Giorgi–Miranda, Trudinger, Caffarelli–Nirenberg–Spruck, and Ecker–Huisken.
Read the full abstract
Representation Theory
Chains of affine standard Lyndon words
In this note, we establish the periodicity of chains of affine standard Lyndon words in all types and determine tight bounds on that periodicity, greatly generalizing the $A$-type results of arXiv:2305.16299. Our approach crucially utilizes the convexity and monotonicity of arXiv:2505.15432 together with the new idea to consider the polarization of the root system given by increasing and decreasing chains.
Read the full abstract
Combinatorics
Local maximum of inducibility profiles
For a graph $G$ and $e\in [0,1]$, denote by $I_G(e)$ the supremum of induced density of $G$ over $n$-vertex graphs with edge density $e$ as $n$ goes to infinity. Liu, Mubayi and Reiher asked if there exists a graph $G$, where $I_G(e)$ has a non-trivial local maximum. In this paper, we answer this problem affirmatively. We first show that $I_{K_{2,2,1}}(e)$ has at least two local maxima in $(0,1)$. Part of this proof is using flag algebras. Additionally, we determine $I_{K_{2,2,1}}(e)$, when $e=(k-1)/k$ for every integer $k\ge 3.$ We also prove that $I_{K_t^-}(e)$ has a non-global local maximum for every $t\in\{5,8,11,\ldots,$ $74\}$. The proof combines a symmetrization theorem of Schelp and Thomason with Reiher's clique density theorem.
Read the full abstract
Combinatorics
Conformal Rigidity of Graphs: Subdifferentials and Orbit-Isometries
A connected undirected graph $G = (V,E)$ is lower conformally rigid if uniform edge weights maximize the second smallest Laplacian eigenvalue $\lambda_2(w)$ over all normalized edge weights $w$, and upper conformally rigid if uniform edge weights minimize the largest eigenvalue $\lambda_n(w)$ over all normalized edge weights; $G$ is conformally rigid if it is lower or upper conformally rigid. This paper establishes a new framework for conformal rigidity through the language of subdifferentials, unifying the variational perspective on eigenvalue optimization with the geometry of edge-isometric spectral embeddings, which are known to characterize conformal rigidity. This subdifferential framework lends itself naturally to techniques of symmetry reduction that motivate the notion of an orbit-isometric embedding - a weaker condition than edge-isometry that accounts for the symmetries of $G$ while remaining sufficient for conformal rigidity. The notion opens the door to tools from representation theory: for a large class of graphs, including all vertex-transitive ones, we show that conformal rigidity is certified by a single eigenvector, resolving an open question and explaining the conformal rigidity of previously unexplained graphs. This extra structure enables a new, algebraically exact certification method for conformal rigidity, bypassing the numerical difficulties of prior approaches. In many cases, the problem reduces to a check of linear feasibility, and in general, to solving a system of quadratic equations via Gröbner bases.
Read the full abstract
Analysis of PDEs
Weak Solutions and Inertial Limits for Quasi-static Filtrations
A quasi-static filtration system, comprising a poroelastic solid coupled to an incompressible free-flow, is considered in 3D. Across a flat 2D interface, the Beavers-Joseph-Saffman coupling conditions are taken. The system constitutes a doubly elliptic-parabolic coupling and can be seen as a degenerate case of the inertial Biot-Stokes dynamics. These dynamics cannot be easily recovered by simply sending the inertial parameters to zero; however, inserting a viscoelastic regularization of the inertial Biot system allows us to construct weak solutions in the inertial limit. Subsequently, we can pass to the limit in the regularization parameter to obtain quasi-static weak solutions. This addresses an open singular/degenerate limiting problem in the class of filtration models, and permits future analyses of uniqueness and regularity of solutions. This linear construction also provides a foundation for the later incorporation of physically-motivated nonlinear poroelastic effects via fixed point methods.
Read the full abstract
Operator Algebras
The separable case of Kadison's problem on orthonormal bases of unitaries for type $\mathrm{II}_1$ factors
In 1967, Kadison asked “does every type $\mathrm{II}_1$ factor have an orthonormal (with respect to the trace) basis consisting of unitaries?” Using a noncommutative Lyapunov theorem of Akemann and Weaver, we prove that if $M$ is a separable diffuse finite von Neumann algebra with a normal faithful trace $\tau$, then $L^2(M,\tau)$ admits an orthonormal basis consisting of self-adjoint unitaries in $M$. Consequently, we affirm the separable case of the Kadison problem.
Read the full abstract
Geometric Topology
Miyazawa's Invariant, Lefschetz Numbers, and Seifert Solids
We establish a formula expressing Miyazawa's 2-knot invariant $|\mathrm{deg}|$ in terms of the Lefschetz number of a map on ordinary (i.e., not real) monopole Floer homology. As an application, we deduce that $|\mathrm{deg}|=1$ for any 2-knot in $S^4$ which has a punctured $L$-space as a Seifert solid. In the course of the proof of the main theorem, we show how Francesco Lin's construction of monopole Floer homology with $\operatorname{Pin}(2)$-equivariant perturbations can be made to work with integer coefficients.
Read the full abstract
Combinatorics · Cross-listed from quant-ph
Sharp Bounds on the Eigenvalues of Kikuchi Graphs and Applications to Quantum Max Cut
We prove that the maximum eigenvalue of the (both signed and unsigned) Laplacian of level $k$ Kikuchi graph of any graph $G$ with $m$ edges is at most $m+k$. This confirms four recent conjectures of Apte, Parekh, and Sud. As applications, we obtain that tensor products of one and two qubit product states achieve an approximation ratio of $5/8$ for Quantum Max Cut and $5/7$ for the XY Hamiltonian. Moreover, combining our bounds with the algorithms analyzed by Apte, Parekh, and Sud, yields efficient algorithms achieving an approximation ratio of $0.614$ for Quantum Max Cut and $0.674$ for the XY Hamiltonian. Finally, we also make modest progress on Brouwer's conjecture and improve Lew's bound on the sum of the top-$k$ eigenvalues of a Graph Laplacian.
Read the full abstract
Differential Geometry
On the Ricci symmetries of a Kähler manifold
The main purpose of the present paper is to investigate the symmetry properties of a Kähler manifold involving the Ricci tensor. In this context, the most symmetric manifolds are Kähler-Einstein spaces, and their natural generalizations are Ricci-parallel Kähler manifolds, Ricci-semisymmetric Kähler manifolds and holomorphically Ricci-pseudosymmetric Kähler manifolds. Unlike their Riemannian counterparts, we prove that all these conditions also admit a characterization solely in terms of holomorphic planes, analogously to the symmetries related to the Riemannian curvature tensor in Kähler manifolds. A key finding is that the concept of holomorphic Ricci pseudosymmetry is distinct from the classical Ricci-pseudosymmetric condition introduced by Deszcz. By carefully analyzing the interplay between these definitions, we clarify the precise geometric role of the so-called Ricci curvature of Deszcz. Additionally, we also present a geometric interpretation of the complex Tachibana-Ricci tensor and we establish a new criterion for a Kähler manifold to be Einstein based on holomorphic planes.
Read the full abstract
Number Theory
Patterns on elliptic curves beyond Bremner's conjecture
In the late 1990's, Bremner conjectured that long arithmetic progressions among the $x$-coordinates of rational points of an elliptic curve $E$ over $\mathbb{Q}$ should force the rank of $E$ to be large. This conjecture (and a broad generalization of it) was proved by the authors two decades later, by combining Nevanlinna theory and the Uniform Mordell–Lang theorem of Gao–Ge–Kühne. The proof inspired subsequent work by the authors where a generalization of the Bogomolov–Fu–Tschinkel conjecture was proved by similar means. In this note we isolate a flexible pattern principle implicit in the latter work, obtaining rank-dependent (but otherwise uniform) bounds for more general patterns in the image of finite rank subgroups of elliptic curves under maps to the projective line. These patterns include, for instance, arithmetic progressions, geometric progressions, additive shifts, multiplicative shifts, and Möbius orbits.
Read the full abstract
Classical Analysis and ODEs
A new proof of maximal theorem on Heisenberg groups
Given $0\leq\alpha<1$, we define \[\begin{array}{lr} \mathbf{M}_\alpha f(u,v,t) = \sup_{ \mathbf{R} \ni (0,0,0)} {\rm vol} \{\mathbf{R}\}^{\alpha-1} \iiint_\mathbf{R}\left|f [(u,v,t)\odot(\xi,\eta,\tau)^{-1}]\right|d\xi d\eta d\tau \end{array}\] where $\mathbf{R}\subset\mathbb{R}^{2n+1}$ is a rectangle parallel to the coordinates. Moreover, $\odot$ denotes the multiplication law on a real Heisenberg group. The $\mathbf{L}^p$-boundedness of $\mathbf{M}_0$ has been previously proved by M. Christ. We show $\mathbf{M}_\alpha\colon\mathbf{L}^p(\mathbb{R}^{2n+1}) \to \mathbf{L}^q(\mathbb{R}^{2n+1})$ for $\alpha={1\over p}-{1\over q},~ 1<p\leq q<\infty$ by applying a geometric covering lemma due to Córdoba and Fefferman.
Read the full abstract
Combinatorics
On the Number of Rational Power Factors in a Finite Word
Let $w$ be a finite word of length $n$. In this paper, we study the maximum possible number of distinct rational power factors in a finite word. A rational power is a word of the form $u=p^kp'$, where $p$ is a nonempty finite word, $k$ is an integer larger than $1$, $p^k$ is a concatenation of $k$ copies of $p$ and $p'$ is a prefix of $p$. The rational powers can be recognized as a generalization of $k$-powers, and it is proved in [Li,Pachocki,Radoszewski 24] that, the number $C_k(w)$ of distinct $k$-powers in $w$ satisfies $C_k(w) \leq \frac{n-1}{k-1}$. However, the number of rational powers has not been studied in the literature. In this article, we prove that the number $\mathrm{RP}(w)$ of distinct rational power factors of $w$ satisfies $\mathrm{RP}(w)\le\frac18n^2+O(n)$. We also illustrate a novel approach to study pattern-counting problems: using a graph-theoretic representation of words and a few word equations, we transform the traditional pattern-counting problems into a constrained extremal problem.
Read the full abstract
Combinatorics
On zero-sum Ramsey numbers of cycles and wheels
For an integer $q\ge 2$ and a graph $F$ with $q\mid e(F)$, let $R(F,\Z_q)$ be the least integer $n$ such that every edge-labeling $w\colon E(K_n)\to \Z_q$ contains a copy of $F$ whose edge-label sum is zero in $\Z_q$. Write $C_{qk}$ for the cycle on $qk$ vertices. We prove that $R(C_{qk},\Z_q)\le \max\{R(C_{2q},\Z_q),qk+q-1\}$ via an insertion argument rooted in the classic Erdős-Ginzburg-Ziv theorem. Combined with Pikhurko's result, we obtain $R(C_{qk},\Z_q)\le \max\{35q^2,qk+q-1\}$ for every $q\ge 3$. We also show that $R(C_{qk},\Z_q)\ge qk+q-1$ for odd $q\ge 3$. Hence, for every fixed odd $q\ge 3$ and every $k\ge 35q$, we obtain the exact value $R(C_{qk},\Z_q)=qk+q-1$. For even $q\ge 4$, the same method gives $qk+\frac q2-1\le R(C_{qk},\Z_q)\le \max\{35q^2,qk+q-1\}$, leaving an additive gap of order $q/2$ when $k$ is large. Moreover, for the case $q=3$, we prove that \(R(C_{3k}, \mathbb{Z}_3) = 3k + 2\) for all \(k \ge 2\). Extending our techniques beyond cycles, we also resolve the zero-sum Ramsey number for wheel graphs \(W_m = C_m + K_1\), proving that \(R(W_{3k}, \mathbb{Z}_3) = 3k + 1\) for all \(k \ge 2\).
Read the full abstract
Numerical Analysis
Nyström Approximation on Manifolds
Computations on a manifold often involve constructing an operator on the tangent space and computing its inverse, which can be time-consuming in many applications. In order to reduce the computational costs and preserve the benign properties of tangent operators, we develop the Riemannian Nyström approximation on manifolds, a low-rank approximation of tangent operators through subspace projections onto the tangent space. The developed approximation is intrinsically constructed and inherits desirable properties from the classical Nyström approximation, e.g., positive semidefiniteness and approximation errors. Instead of the Gaussian sketching, we introduce the Haar–Grassmann sketching condition with a coordinate-free representation, which remains compatible under isometric vector transport across tangent spaces. Moreover, we propose a randomized Newton-type method for optimization on manifolds in which the linear system is constructed via the Riemannian Nyström approximation. Numerical experiments on the SPD and Grassmann manifolds, together with principal geodesic analysis on real data, illustrate that the proposed approximation reduces the computational cost of operators while maintaining comparable accuracy.
Read the full abstract
Differential Geometry
Spectral splitting theorem and ends of minimal hypersurfaces
In this paper, we give a new proof of the splitting theorem on manifolds with nonnegative spectral Ricci curvature proved in [APX24, CMMR24, HW26]. Furthermore, by constructing weighted minimizing geodesics at infinity, we show that minimal hypersurfaces with finite index in manifolds with nonnegative biRic curvature must have finite ends, generalizing the result of Li-Wang [LW04] on manifolds with nonnegative sectional curvature.
Read the full abstract
Combinatorics
Anchored Dyck Paths
We answer a question of Simental by providing a combinatorial interpretation of a formula which generalizes rational Catalan numbers and which appears in the study of Springer fibers. We provide an interpretation in terms of binary necklaces as well as anchored Dyck paths.
Information Theory · Cross-listed from cs.LG
A Mutual Information Lower Bound for Multimodal Regression Active Learning
Active learning for continuous regression has lacked an acquisition function that targets epistemic uncertainty when the predictive distribution is multimodal: variance misses modal disagreement, and information-theoretic targets like BALD are designed for discrete outputs. We introduce a Two-Index framework that makes this separation explicit: one stochastic index selects among competing model hypotheses (epistemic source), while a second governs within-hypothesis randomness (aleatoric source). An entropy decomposition within the framework identifies the mutual information between the output and the epistemic index as a principled acquisition objective, and we prove this quantity vanishes as the model is trained on growing datasets, confirming that it captures exactly the uncertainty data can resolve. Because this mutual information is intractable for continuous outputs, we derive the Mutual Information Lower Bound (MI-LB) acquisition function, a closed-form approximation for Mixture Density Network ensembles. On benchmarks featuring multimodal systems, MI-LB matches or beats every baseline evaluated and is the only method to do so consistently – geometric and Fisher-based baselines compete only when the input space already encodes the multimodality, and collapse otherwise.
Read the full abstract
Analysis of PDEs · Cross-listed from cond-mat.dis-nn
FKPP fronts in quenched random media
We study numerically the evolution of one-dimensional FKPP fronts initiated from steep initial conditions in the presence of a quenched random growth rate. Compared to both the homogeneous case (with velocity $v_0$) and deterministic disorder, quenched randomness increases the average propagation speed. We show that the velocity shift relative to the homogeneous case scales linearly with the disorder variance $\sigma^2$, with a universal prefactor – independent of the specific distribution of the disorder – such that $v = v_0 + a \sigma^2$, with $a \approx 0.02432 \pm 0.00002$. Moreover, the front position exhibits diffusive fluctuations across disorder realizations. The corresponding effective diffusion coefficient scales quadratically with $\sigma$, $D = \frac{b^2 \sigma^2}{2}$, with $b \approx 0.223 \pm 0.002$. These results suggest a universal statistical response of FKPP fronts to quenched heterogeneity.
Read the full abstract
Probability
Sharp Phase Transition for the Formation of Infinite Tubes
Classical bond percolation theory studies the conditions for a given point in a random graph to be connected to infinity, or "escape" to infinity, via a sequence of random edges. In this work, we present a higher-dimensional generalization of this question, asking whether a fixed loop (or, more generally, a topological sphere) can escape to infinity via a tube formed by random plaquettes. We refer to this phenomenon as tube percolation. We first compare tube percolation with previously studied higher-dimensional percolation phenomena, including face and cycle percolation. For tubes of codimension one, we further relate the critical probability for tube percolation to those for percolation of finite clusters and shielded percolation in the dual bond percolation model. Next, we introduce a tubular analogue of the classical one-arm event, the tubular one-arm event, and prove that it exhibits a sharp threshold at criticality: below criticality, its probability decays exponentially in scale, whereas above criticality, it admits a mean-field-type lower bound. The proof relies on the O'Donnell-Saks-Schramm-Servedio (OSSS) inequality together with an exploration algorithm adapted to the topology of tubes. Finally, we study the tubular box-crossing property. Unlike ordinary path connectedness, "tube connectedness" is not transitive, and thus there is no natural notion of clusters. Nevertheless, we establish an analogue of the uniqueness of the infinite cluster from classical bond percolation. Combining this result with the sharp threshold for the tubular one-arm event, we prove that the existence of a box-crossing tube also exhibits a sharp threshold.
Read the full abstract
Differential Geometry
$\kappa$-solutions with the round cylinder as an asymptotic shrinker
We show that $\kappa$-solutions to the Ricci flow in dimensions $n\geq 4$ whose asymptotic shrinking Ricci soliton is the round cylinder $\mathbb{S}^{n-1}\times\mathbb{R}$ must be uniformly PIC. Combined with earlier classification results, this implies that any such noncompact solution is either the round shrinking cylinder or the Bryant steady soliton, and any such compact solution is Perelman's ancient solution.
Read the full abstract
Algebraic Geometry
Realizations of exponential sheaves and Fourier transform
This note concerns exponential sheaves, their realizations, and Fourier transforms, in the setting of mixed Hodge modules and D-modules. For relative categories of exponential sheaves constructed out of regular/tame objects, we study realization functors to holonomic (not necessarily regular) D-modules and show that they are t-exact, faithful on the heart, and compatible with the usual functors (including Verdier duality). We also develop a "universal" Fourier transform: it is invertible, satisfies a Fourier miracle (commuting with Verdier duality up to a twist), and recovers classical Fourier transforms under realizations. The categories considered also admit weight structures that satisfy the standard formalism, and the "universal" Fourier transform preserves purity. The motivation is N. Katz's "analogies" between exponential sums over finite fields and differential equations.
Read the full abstract
Combinatorics
Twins and Co-Twins in Circulant graphs
Circulant graphs are a widely studied family of graphs whose members possess varying amounts of symmetry. Although considerable progress has been made in finding the automorphism groups of circulant graphs under certain restrictions, a complete classification is elusive. In general, the structure of the automorphism group of a graph with twins can be simplified by separating the effect of automorphisms that permute mutually twin vertices and those that operate on the twin quotient graph. Further simplification can be achieved in twin-free, vertex-transitive graphs that have co-twins, which we define to be vertices whose neighborhoods are complementary. In this paper, we demonstrate how the these simplifications can be used provide insight into the automorphism groups and symmetry parameters of vertex-transitive graphs in general and circulant graphs in particular.
Read the full abstract
Combinatorics
Optimal Bounds for the k-Disjoint Paths Problem
The Graph Minors Series of Robertson and Seymour forms the foundation of algorithmic structural graph theory, yielding fixed-parameter algorithms for problems such as Disjoint Paths, Rooted Minor Checking, and Folio. A key ingredient behind the fixed-parameter tractability of the $k$-Disjoint Paths problem is the irrelevant-vertex technique. This machinery is governed by the Vital Linkage Theorem and the so-called Linkage Function $\ell$. However, despite its foundational role, the best known bounds on the Linkage Function are enormous and are only implicitly understood. The quantitative bounds behind these results have traditionally been so large that the resulting algorithms are regarded as "galactic". Our main result is a general irrelevant-vertex theorem for a common generalisation of $k$-Disjoint Paths and Rooted Minor Checking for graphs of size at most $d,$ commonly called the $(k,d)$-Folio problem. Specifically, we show that for any graph $G$ in which the $k$ terminals are chosen from some set $R,$ if the treewidth of $G$ exceeds $\beta(k,b,d)\in$ $2^{{\bf poly}(b + d)}$ $\cdot {\bf poly}(k)$ then we can locate an irrelevant vertex for the $(k,d)$-Folio problem. Here, the quantity $b$ is the bidimensionality of $R,$ that is, the largest $b$ for which a $(b\times b)$-grid minor in $G$ can be rooted on $R$. Thus, the exponential component of the irrelevant-vertex threshold is driven by the bound on the bidimensionality, rather than by the number of terminals, and we argue that this dependence is essentially optimal up to polynomial factors. As a consequence, the Linkage Function satisfies $\ell(k) \in 2^{{\bf poly}(k)}$. Beyond its structural significance, our result yields improved parameter dependencies for algorithms for Disjoint Paths and Rooted Minor Checking}, and provides a quantitative improvement for a broad range of graph-minor-based algorithmic frameworks.
Read the full abstract
Optimization and Control
Non–exchangeable mean field games with moderate interactions and common noise
We study mean field games for large non–exchangeable populations with moderate local interactions and common noise. The finite–player system is driven by two complementary interaction mechanisms : a graphon–type structure, which encodes heterogeneous large–scale interactions between agents, and a rescaled local kernel, which produces a density-dependent interaction term in the limit. The limiting model is a non–exchangeable mean field game in which the representative player is indexed by a label \(u\in[0,1]\), interacts through a graphon–weighted local density, and is affected by a graphon–induced environment law. We introduce a relaxed formulation of the limiting mean field game, adapted to the presence of common noise, and prove existence under general continuity and non–degeneracy assumptions. Under additional convexity assumptions, relaxed equilibria can be realized in strict form. In the deterministic case without common noise, we obtain deterministic equilibria and provide a probabilistic characterization of strict equilibria through a nonlinear Feynman–Kac representation. We then establish the asymptotic connection with the finite–player game. We prove that every limit point of approximate closed–loop Nash equilibria is a relaxed solution of the limiting mean field game, and that the corresponding averaged equilibrium payoffs converge. Conversely, every relaxed mean field game equilibrium can be approximated by Markovian approximate Nash equilibria of the finite–player systems. These results give a complete asymptotic characterization of equilibrium behavior for non–exchangeable games with moderate interactions and common noise.
Read the full abstract
Combinatorics
Nonexistence results of generalized bent functions from $\mathbb{Z}_3^n$ to $ \mathbb{Z}_m$
In this paper, we investigate generalized bent functions (GBFs) from $\mathbb{Z}_3^n$ to $\mathbb{Z}_m$. We show that GBFs exist whenever $3$ divides $m$, while several nonexistence results are obtained when $3\nmid m$. In particular, we prove that no GBFs exist for $n=1,2$ when $m$ is odd and not divisible by $3$. For the case $n=3$, we establish the nonexistence of GBFs $f:\mathbb{Z}_3^3 \rightarrow \mathbb{Z}_{5\cdot11^r}$ for all nonnegative integers $r$. Finally, we show that no GBF exists from $\mathbb{Z}_3$ to $\mathbb{Z}_{2m'}$ and $\mathbb{Z}_3^2$ to $\mathbb{Z}_{2m'}$, where $m'$ is odd and not divisible by $3$.