Peer Revenue Past citations are no guarantee of future returns

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Sunday 10 May

Optimization and Control · Cross-listed from cs.LG

Learning-Augmented Scalable Linear Assignment Problem Optimization via Neural Dual Warm-Starts

The Linear Assignment Problem is a fundamental combinatorial optimization task where classical exact solvers ensure optimality but suffer from an $\mathcal{O}(N^{3})$ bottleneck, while recent neural approximations struggle with scalability and exactness. We propose a learning-augmented framework that accelerates exact solvers by predicting dual variables to warm-start the search, backed by a fallback mechanism to preserve worst-case guarantees. Central to our approach is RowDualNet, a lightweight, row-independent architecture that avoids the $\mathcal{O}(N^{2})$ memory bottleneck of graph models, enabling scalable neural warm-starting up to $N=16{,}384$. Feasibility is guaranteed by construction via the Min-Trick mechanism, completely eliminating the need for costly iterative projections. Empirically, our method drastically reduces the search effort of the Jonker-Volgenant (LAPJV) algorithm, yielding robust zero-shot generalization with strict optimality and end-to-end speedups of over 2x on complex synthetic data, 1.25x on real-world tracking, and 1.5x on transportation networks.
Read the full abstract

All authors Ilay Yavlovich, Jad Agbaria, Muhamed Mhamed, Nir Weinberger, Jose Yallouz

Differential Geometry

On the generalised ideal flow of closed planar curves

For each integer $m\ge0$ we study the $m$-ideal energy \[ E_m[\gamma]:=\frac12\int_\gamma k_{s^m}^2\,ds \] on closed immersed planar curves, where $k$ is signed curvature and $s$ is arclength; $k^2_{s^m} := (k_{s^m})^2$. The $m$-ideal energies contain Euler's elastic energy and the Dirichlet energy for the curvature scalar as special cases ($m=0,1$). We completely classify the closed smooth critical points of $E_m$ for all $m\ge1$: they are precisely the round multiply-covered circles. For the steepest descent $L^2(ds)$-gradient flow of $E_m$, the \emph{$m$-ideal flow}, we prove that for each nonzero turning number there is a curvature-oscillation threshold such that every canonical relaxed flow starting from $W^{2,2}$ initial data below this threshold is immortal and exponentially asymptotic in the smooth topology to a round multiply-covered circle. We also prove that every immortal canonical relaxed trajectory with bounded unnormalised length converges to the corresponding circle. We furthermore treat rough initial data of class $W^{2,2}$; such data typically has infinite $E_m$ energy when $m\ge1$. In the small-curvature-oscillation basin, every such curve generates a unique canonical relaxed length-normalised flow, smooth for every positive time, continuously dependent on the initial data, and smoothly convergent to the multiply-covered circle. These results are known in the $m=0$ case, substantially strengthen existing work in the $m=1$ case, and are new for $m>1$.
Read the full abstract

Probability

A factorization formula for the partition function in the semi-discrete parabolic Anderson model

We consider a continuous-time simple symmetric random walk on the integer lattice $\mathbb{Z}^d$ in dimension $d \geq 3$, subject to a random potential given by a field of two-sided Wiener processes. In the high-temperature regime, we prove the existence of the $L^2$- and almost sure limits of the partition function as time $t \to \pm \infty$, and show that these limiting partition functions are positive almost surely. Our main result is a factorization formula for the point-to-point partition function, which is shown to be valid up to any sub-ballistic scale.
Read the full abstract

Optimization and Control

Extended MF-FBSDEs with nonlinear domination-monotonicity conditions and stochastic optimal controls of Linear System with quadruple controls

This paper extends the domination-monotonicity conditions, which guarantee the well-posedness of extended mean-filed forward-backward stochastic differential equations (extended MF-FBSDEs), from the previously studied linear framework to a nonlinear setting by incorporating nonlinear adjoint functions. Utilizing this generalized well-posedness result for extended MF-FBSDEs in conjunction with other refined analytical techniques, we address two classes of stochastic quadruple optimal controlled problems: a linear-convex problem and a linear-quadratic problem with input constraints that are permitted to be time-dependent and random. For each problem, we establish the existence and uniqueness of optimal controls and derive their explicit closed-form representations.
Read the full abstract

Probability

Sharp weighted norm estimates for martingale square functions

This paper is devoted to the study of quantitative weighted norm estimates for martingale square functions in both scalar-weighted and matrix-weighted settings. In particular, we introduce the martingale square functions $S_W$ via matrix weights $W$, and then use the matrix $A_p$ condition, introduced in our previous work \cite{ChenQuanJiaoWu}, to characterize the $L_p$ estimate for $S_W$. Our proof mainly relies on the idea of sparse dominations, which leads to the explicit information on the characteristic of the matrix weight involved. For the range $1<p\leq 2$, our result is sharp in terms of the characteristic of the matrix weight. With some modification on the arguments, we can further improve the result in scalar settings by obtaining the optimal exponent of the characteristic of the weight involved for all indices $1<p<\infty$, addressing a fundamental problem from the classical martingale theory.
Read the full abstract

All authors Wei Chen, Yong Jiao, Xingyan Quan, Lian Wu

Information Theory

Secure and Private Structured-Subset Retrieval: Fundamental Limits and Achievable Schemes

This work introduces the Secure and Private Structured-Subset Retrieval (SPSSR) problem. In SPSSR, a user wishes to retrieve one subset from an arbitrary family of size-$D$ subsets from $K$ messages replicated across $N$ non-colluding servers that share randomness unknown to the user. The privacy requirement ensures that no server learns which subset is requested, while the security requirement ensures that the user learns nothing about the messages outside the requested subset. This generalizes Symmetric Multi-message Private Information Retrieval (SMPIR), where the candidate demand sets consist of all size-$D$ subsets. We show that, for every candidate demand family, the maximum achievable retrieval rate is equal to ${1-1/N}$. We also show that the minimum ratio between the size of the shared randomness and the message size required to achieve this rate is ${D/(N-1)}$, and that, for balanced linear SPSSR schemes, the minimum required subpacketization level is ${(N-1)/\gcd(D,N-1)}$; both quantities are independent of the demand family. Our converse proof for the maximum achievable retrieval rate applies to arbitrary demand families, unlike the existing proof for SMPIR, which is tailored to the full demand family. For achievability, we construct a single SPSSR scheme that applies uniformly to every demand family, achieves the optimal retrieval rate with the optimal shared-randomness ratio, and requires the optimal subpacketization level among balanced linear schemes. This subpacketization level is no larger than that of known SMPIR schemes in any parameter regime and is smaller in some regimes.
Read the full abstract

Optimization and Control

Newton Method for Soft Quadratic Surface Support Vector Machine with 0-1 Loss Function

A nonlinear kernel-free soft quadratic surface support vector machine model with 0-1 loss function ($L_{0/1}$-SQSSVM) is proposed for binary classification problems, which is non-convex discontinuous. We are devoted to establishing the first and the second-order optimality conditions for the $L_{0/1}$-SQSSVM. We establish a stationary equation using the properties of proximal operator of 0-1 loss function. We design a Newton method based on the stationary equation to solve $L_{0/1}$-SQSSVM model and prove that the Newton method has local quadratic convergence under the second-order sufficient condition. Numerical experience on artificial datasets and benchmark datasets demonstrate that the Newton method for $L_{0/1}$-SQSSVM achieves higher classification accuracy with less CPU time cost than other state-of-the-art methods.
Read the full abstract

Operator Algebras

On the spectral radius of operator tuples

In recent work, Shalit and Shamovich associated to every operator space structure $\mathcal{E}$ on $\mathbb{C}^d$ a spectral radius function $\rho_{\mathcal{E}}$ on $d$-tuples of operators. The main goal of this paper is to elucidate how this spectral radius depends on the operator space structure. Let $V = (\mathbb{C}^d, \|\cdot\|_V)$ be a normed space and let $\mathcal{E}$ be a quantization of $V$. We show that for a commuting operator tuple $X$, the spectral radius depends only on the underlying normed space; more precisely, \[ \rho_{\mathcal{E}}(X) = \max\{ \|\lambda\|_V : \lambda \in \sigma(X)\}, \] where $\sigma(X)$ denotes the joint spectrum of $X$. In contrast, we prove that if $\dim V \geq 3$, then $\rho_{\min(V)}(X) \neq \rho_{\max(V)}(X)$ already for some matrix tuple $X$. When $\mathcal{E}_1$ and $\mathcal{E}_2$ are selfadjoint operator spaces, we show that $\rho_{\mathcal{E}_1}(X) = \rho_{\mathcal{E}_2}(X)$ for all tuples $X$ implies $\mathcal{E}_1 = \mathcal{E}_2$. We present two proofs of this result; a key ingredient in one of them is a characterization, of independent interest, of $\rho_{\mathcal{E}}(A)$ in terms of the invertibility domain of the linear pencil associated with $A$. Finally, we prove that if two operator spaces give rise to the same spectral radius function, then the algebras of locally uniformly bounded NC functions on the corresponding NC unit balls coincide.
Read the full abstract

Information Theory

Covert Capacity of Degraded Broadcast Channels

We derive the capacity region of the degraded broadcast channel (DBC) subject to the constraint that the communication is not detected by an adversary, the Warden. Our capacity result is in a computable form and numerical results show that time-sharing is suboptimal in general, and improved rates can be obtained through superposition coding.
Read the full abstract

Optimization and Control

Mutual Information Optimal Density Control of Linear Systems and Generalized Schrödinger Bridges with Reference Refinement

We consider a mutual information (MI) regularized optimal density control of a discrete-time linear system. MI optimal control has been utilized for exploration in reinforcement learning and privacy protection in control. MI regularization induces stochasticity in the policy, which poses challenges for applications of MI optimal control in safety-critical scenarios. To remedy this situation, we impose Gaussian density constraints at specified times to directly control state uncertainty. For this MI optimal density control problem, we propose an alternating optimization algorithm and investigate its convergence properties. In addition, we reveal a relationship between the MI optimal density control problem and a so-called generalized Schrödinger bridge problem associated with the discrete-time linear system. Based on the results of MI optimal density control and this relationship, we also investigate alternating optimization for the Schrödinger bridge problem and its convergence properties.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Adversary-Robust Learning from Fully Asynchronous Directional Derivative Estimates

We propose FAR-SIGN (Fully Asynchronous Robust optimization via SIGNed directional projections) for adversary-resilient learning in parameter-server–worker systems. FAR-SIGN achieves robustness through sign-based updates along carefully designed directions and mitigates the resulting bias via a two-timescale mechanism. It admits both first-order and zeroth-order implementations and enables fully asynchronous execution without requiring a private reference dataset at the server. We establish almost-sure convergence of FAR-SIGN to the set of stationary points for smooth, nonconvex objectives. Moreover, we prove the near-optimal rate of $O(n^{-1/4+\epsilon})$ in the first-order setting and the standard $O(n^{-1/6+\epsilon})$ in the zeroth-order setting, where $n$ is the iteration count and $\epsilon>0$ can be chosen arbitrarily small. Experiments on MNIST show that FAR-SIGN outperforms robust aggregation-based methods in both accuracy and wall-clock time.
Read the full abstract

All authors Anik Kumar Paul, Nibedita Roy, Nagesh Talagani, Swetha Ganesh, Gugan Thoppe, Alexandre Reiffers-Masson

Classical Analysis and ODEs

Strichartz estimates for orthonormal systems on compact manifolds: the non-sharp region

We establish new Strichartz estimates for orthonormal systems on compact Riemannian manifolds in the non-sharp admissible region of exponents, covering wave, Klein-Gordon, and fractional Schrödinger equations. Our approach combines the result of Wang-Zhang-Zhang \cite{wang2025strichartz} on the sharp admissible line with a Lieb-Sobolev inequality derived from a recent Cwikel estimate due to Sukochev-Yang-Zanin \cite{sukochev2025singular}, along with an alternative globalization method based on localized weak Lorentz estimates. Our results extend the Euclidean results of Bez-Hong-Lee-Nakamura-Sawano \cite{bez2019strichartz} and Bez-Lee-Nakamura \cite{bez2021strichartz}, as well as the classical single-function estimates on manifolds due to Kapitanski \cite{kapitanski1989some}, Burq-Gérard-Tzvetkov \cite{MR2058384}, and Dinh \cite{dinh2016strichartz}.
Read the full abstract

Metric Geometry

The Mahler Conjecture in Three Dimensions

The Mahler conjecture dates back to 1938. This paper solves the conjecture for general convex bodies in three dimensions by developing a method called the shadow flow. The equality case is characterized as well. This method is also applied to give a new proof of the three-dimensional symmetric case, which was first proved by Iriyeh–Shibata.
Read the full abstract

All authors Shibing Chen, Yuanyuan Li, Dongmeng Xi, Zhe-Feng Xu

2605.09334 · 10 May · This version combines two earlier papers into one: the paper on the non-symmetric Mahler conjecture for general convex bodies and the symmetric Mahler inequality paper (arXiv:2605.13795). Full equality characterizations are included. The symmetric paper (arXiv:2605.13795) will not be submitted separately and is unlikely to be updated further

Rings and Algebras

Integral elements of Okubo algebra and the E8-lattice

In this work we study the interplay between the Coxeter-Dickson $E_{8}$-order, the para-octonions, and the real Okubo algebra. We first explain why a usual rotation presentation of the order-three automorphism, although algebraically correct, does not preserve the classical integral orders. We then introduce an integral order-three automorphism and prove that its Petersson isotope is the compact real Okubo algebra. The four octonionic orders with lattices $C_{8}$, $A_{2}^{4}$, $D_{4}^{2}$, and $E_{8}$ are preserved by the new realisation of the Okubo product. In particular, the same Coxeter-Dickson $E_{8}$ lattice supports octonionic, para-octonionic, and Okubo integral structures, although the resulting multiplicative systems are not isomorphic.
Read the full abstract

Mathematical Physics

Crystallographic Torus Bundles: Obstructions, Elastic Sectors, and Global Acoustic Modes

We formulate the global translational order parameter of a crystal with a fixed finite orientational background as a section of an affine torus bundle induced by the crystallographic extension $1\to\Pi\to\Gamma\to P\to1$. For a principal $P$-bundle $Q$, the configuration bundle is $Y_\Pi=Q\times_P T_\Pi$. We identify two distinct global conditions associated with the same extension class: smooth configurations exist precisely when the pulled-back class $f_Q^*[c]\in H^2(X;\Pi_Q)$ vanishes, whereas parallel configurations exist precisely when the restriction of $[c]$ to the monodromy subgroup vanishes. Thus a global translational configuration may exist even when a parallel reference configuration is topologically obstructed. For phase-independent quadratic first-order theories, the affine torsor structure yields an exact global fluctuation identity and a background-independent Hessian about every stationary configuration, without requiring a parallel reference state. We realize the distinction explicitly on a compact flat three-manifold with half-turn holonomy and a nonsymmorphic $C_2$-extension. Although no parallel configuration exists, smooth strained equilibria do. Their homotopy sectors form a torsor for $\mathbb Z^5\oplus(\mathbb Z/2\mathbb Z)^2$. We determine the minimizers and minimum energy in every sector, derive a strictly positive lower energy bound over all configurations of the quadratic model, and compute the complete isotropic elastic spectrum, including the kernel and first positive eigenvalue. For fixed macroscopic quotient, flat linear bundle, and constitutive coefficients, changing the microscopic affine extension can therefore change the global configuration space and sector energies while leaving the quadratic fluctuation operator unchanged.
Read the full abstract

Number Theory

On the exponent of distribution for convolutions of $\operatorname{GL}(2)$ coefficients to smooth moduli

Let $(\lambda_f(n))_{n\geqslant1}$ be the Hecke eigenvalues of a holomorphic cusp form $f$. We prove that the exponent of distribution of $\lambda_f*1$ in arithmetic progressions is as large as $\frac{1}{2}+\frac{1}{70}$ when the modulus $q$ is square-free and has only sufficiently small prime factors.
Read the full abstract

Rings and Algebras

A Gröbner–Shirshov Basis for Nilpotent Rota–Baxter Algebras of Weight Zero

We construct an explicit Gröbner–Shirshov basis for free associative Rota–Baxter algebras of weight zero with nilpotent operator $R^n=0$, where $n\ge 2$. First, we define a monomial order on the standard linear basis $RS(X)$ of the free algebra $R\mathrm{As}\langle X\rangle$ and establish fundamental identities for Rota–Baxter operators. For the case $n=2$, the basis consists of the Rota–Baxter relation $R(u)R(v)\to R(uR(v))+R(R(u)v)$ and the nilpotency relation $R(R(w))\to 0$. For general $n\ge 3$, we prove that the Gröbner–Shirshov basis is finite and consists of six families of relations $(R1)$–$(R6)$ derived from resolving all composition ambiguities. Using the Composition-Diamond Lemma, we describe the corresponding irreducible basis $\operatorname{Irr}(S)$, which provides normal forms for elements in the quotient algebra. This result gives a complete solution to the word problem for nilpotent Rota–Baxter algebras and establishes their operadic Gröbner–Shirshov basis.
Read the full abstract

2605.09309 · 10 May · This paper is a special case of the more general work "A Gröbner–Shirshov Basis for Nilpotent Rota–Baxter Algebras of {0, -{\lambda}}" (arXiv:2507.01614). The results presented here are fully contained in that article. Therefore, the authors wish to withdraw this version to avoid duplication. Readers should refer to the more comprehensive article for the complete results

Functional Analysis

Weyl asymptotic formulas in the nilpotent Lie group setting

The asymptotic properties of negative order pseudo-differential operators have been an important part of the spectral theory since H.Weyl's classical results. In this paper, we derive a spectral asymptotic formula for the negative fractional powers of hypoelliptic operators on graded Lie groups. Such operators have anisotropically homogeneous principal symbols; for these, our results generalize known results of Birman and Solomyak from 1977. Additionally, our work implies a version of Connes' integration formula for hypoelliptic operators on graded Lie groups. Our methods allow us to extend results from constant-coefficient operators to those with smoothly varying coefficients. The principal technique is to adapt the singular value perturbation arguments of Birman and Solomyak to the setting of nilpotent Lie groups. The decomposing of graded Lie groups is inspired by Folland and Stein in their development of harmonic analysis on homogeneous groups.
Read the full abstract

All authors Shiqi Liu, Edward McDonald, Fedor Sukochev, Dmitriy Zanin

Combinatorics

On two conjectures of Hoàng

A graph $G$ is said to be perfectly divisible if for every induced subgraph $H$ of $G$ with at least one edge, the vertex set $V(H)$ can be partitioned into two sets $A, B$ such that $H[A]$ is perfect and $\omega(B) < \omega(H)$. It is easy to see that the chromatic number of a perfectly divisible graph is at most $\binom{\omega(G)+1}{2}$. Hoàng conjectured that every graph $G$ with $\alpha(G) \le 3$ is perfectly divisible. We disprove this conjecture. In the same vein, a graph $G$ with at least one edge is $k$-divisible if for every induced subgraph $H$ of $G$ with at least one edge, the vertex set $V(H)$ can be partitioned into $k$ sets, none of which contains a largest clique of $H$. It is easy to see that the chromatic number of a $k$-divisible graph is at most $k^{\omega-1}$. Hoàng conjectured that every even-hole-free graph is 3-divisible. We confirm this conjecture.
Read the full abstract

Numerical Analysis · Cross-listed from cs.LG

MC$^2$: Monte Carlo Correction for Fast Elliptic PDE Solving

Partial differential equation (PDE) solvers underpin modern computer graphics, geometry processing, and scientific computing. Classical Monte Carlo PDE solvers such as Walk-on-Spheres (WoS) provide mesh-free estimations that are unbiased, but with accuracy limited by sampling and numerical approximation. Learned solvers are fast but biased and brittle under distribution shift. We therefore present MC$^2$, a hybrid Neural Network-Monte Carlo PDE solver that treats a low-budget Monte Carlo solution as a structured estimator of the true field and learns a single-pass neural correction to recover a high-fidelity solution. MC$^2$ matches the accuracy of solutions using over $1000\times$ more Monte Carlo samples, outperforming all evaluated mesh-free classical, denoising, and neural-operator baselines. To enable reproducible study of finite-compute PDE solving, we additionally release PDEZoo, the largest standardized elliptic PDE benchmark to date: 2 million PDEs spanning 5 elliptic families and unlimited geometric compositions, with analytic ground truth and multi-budget Monte Carlo trajectories. Together, MC$^2$ and PDEZoo (1) empirically establish that finite-sample Monte Carlo error is structured, learnable, and correctable in a single forward pass, (2) show that we can solve PDEs $\sim$218$\times$ faster than WoS at matched accuracy and achieve a $\sim$171$\times$ reduction in inference time relative to state-of-the-art diffusion methods while attaining higher accuracy, and (3) provide the reproducible evaluation infrastructure the field has so far lacked. Code & Data: https://mc-error-correction.github.io
Read the full abstract

Commutative Algebra

Matrix equivalence to Smith normal form: new theoretical results for multivariate polynomial matrices

This paper investigates the Smith normal form equivalence problem for multivariate polynomial matrices. Using methods from matrix theory and polynomial ideal theory, we prove that Frost and Storey's 1978 conjecture holds for a broad class of matrices: such a matrix is equivalent to its Smith normal form if and only if its reduced minors of each order generate the unit ideal. Moreover, by extending the original matrix class via automorphisms of the polynomial ring, we show that our framework applies in a substantially more general setting.
Read the full abstract

All authors Dong Lu, Yuanyuan Ruan, Dingkang Wang, Fanghui Xiao

Number Theory

Low-Lying Zeros on the Critical Line for Families of Dirichlet $L$-Functions

In this paper, we establish a new lower bound for the number of low-lying zeros of Dirichlet $L$-functions $L(s, \chi)$ on the critical line within extremely short intervals. Specifically, for a sufficiently large prime $P$ and real number $T \in [a_1/\sqrt{\log P}, 1]$, we prove that the sum of the number of zeros on the critical line $N_0(T, \chi)$ over characters $\chi \bmod P$ satisfies $$ \sum_{\chi \bmod P} N_0(T, \chi) \gg T^2 P\sqrt{\log P} .$$ Traditional approaches encounter significant technical barriers in this short-interval regime. The Levinson method fails due to its own inherent limitations in handling such restricted intervals , while standard applications of the Selberg mollifier are hindered by the emergence of complex, inseparable cross-terms that are difficult to evaluate. To overcome these obstacles, we introduce a novel analytic framework utilizing high-dimensional Mellin transforms. This approach systematically manages the multi-variable series generated by the mollifier calculations. By explicitly resolving these cross-term obstructions, we extract the localized lower bound, providing a robust method that circumvents the short-interval bottleneck and offers potential applicability to the zero statistics of higher-rank $L$-function families.
Read the full abstract

Numerical Analysis

Efficient Multiscale Methods for Highly Heterogeneous Spatial Network Models

Modeling complex spatial networks with multiscale heterogeneity poses significant mathematical and computational challenges. Lacking explicit PDE discretizations and facing excessive degrees of freedom, conventional methods often become computationally prohibitive. To address these challenges, we propose an efficient multiscale modeling for highly heterogeneous spatial networks. We construct multiscale basis functions tailored to spatial network models with heterogeneous edge weights and node degrees. A key novelty is that the proposed method doesn't introduce geometric parameters (such as Dirichlet nodes, distances, or mesh sizes), thereby preserving its purely algebraic nature and ensuring broad applicability. By incorporating a subgraph-wise estimate, we define a Poincaré constant $C_{\mathrm{po}}$ that renders the method independent of the underlying graph geometry. Then through an appropriate choice of the number of graph oversampling layers, we establish an $O(C_{\mathrm{po}})$ convergence independent of the local heterogeneity contrast. Notably, our scheme operates entirely within an algebraic framework, eliminating the need for Dirichlet nodes and positive-definiteness on specific matrices arising in the model. This flexibility enables the simulation of a wider range of physical models and accommodates various boundary conditions. Rigorous theoretical analyses are provided under suitable assumptions, and extensive numerical experiments validate the effectiveness of the proposed approach.
Read the full abstract

All authors Yingjie Zhou, Xiang Zhong, Changqing Ye, Eric T. Chung

Representation Theory

BGG resolutions, Koszulity, and stratifications, part II: the Jacobi-Trudi algebra

We categorify the Jacobi-Trudi determinant formula for Schur functions as a shadow of a highest-weight phenomenon by considering certain quasi-hereditary quotients of certain cyclotomic KLR algebras, which we call “Jacobi-Trudi algebras”. These algebras come equipped with a map from $\mathbb{C} S_n$, and we show that the dominant simple modules for these algebras admit BGG resolutions which, when restricted to $\mathbb{C} S_n$, become resolutions of Specht modules by permutation modules. We establish these BGG resolutions by showing that these Jacobi-Trudi algebras, as well as the Soergel calculi to which they are Morita equivalent, are “nil-Koszul”, meaning that they have “lower half subalgebras” which are Koszul. We also show that Koszul duality with respect to this half subalgebra can be used to recover the differentials of the BGG resolutions. Hence this paper gives another example of a nil-Koszul algebra appearing naturally in categorification and gives another demonstration of the intricate connection between nil-Koszulity and BGG resolutions.
Read the full abstract

Algebraic Topology

Highly connected non-formal Milnor fibers via polyhedral products

We show that the realization theorem of Fernández de Bobadilla, which identifies the Milnor fiber of a weighted-homogeneous polynomial with the complement of a germ of analytic set, can be combined with the systematic Massey product constructions of Grbić-Linton for moment-angle complexes $\mathcal{Z}_K = \mathcal{Z}_K(D^2, S^1)$ to produce weighted-homogeneous polynomials whose Milnor fibers are arbitrarily highly connected and non-formal. The original application of this strategy, due to Fernández de Bobadilla, used the Denham-Suciu classification of lowest-degree triple Massey products and yielded only 2-connected non-formal Milnor fibers. The Grbić-Linton framework, which constructs non-trivial $n$-fold Massey products in $H^*(\mathcal{Z}_K;\mathbb{Q})$ for arbitrary $n$ and in arbitrary cohomological degrees, removes this connectivity restriction entirely.
Read the full abstract

Number Theory

On the coefficients of the Taylor expansion of $L$-functions of elliptic curves

In this paper, we investigate the coefficients of the Taylor expansion of the complex $L$-series of any elliptic curve over $\mathbb{Q}$. We prove that, in the family of quadratic twists by all the discriminants $d$, these coefficients are nonvanishing under GRH when $d$ is sufficiently large. Unconditionally, we obtain a general lower bound for the number of nonvanishing coefficients in the family of quadratic twists, through a series of results from the moments of the central values of the derivatives of quadratic twists of modular $L$-function.
Read the full abstract

Combinatorics

A product version of the Hilton-Milner Theorem II

Two families $\mathcal{F},\mathcal{G}$ of $k$-subsets of $\{1,2,\ldots,n\}$ are called non-trivial cross-intersecting if $F\cap G\neq \emptyset$ for all $F\in \mathcal{F}, G\in \mathcal{G}$ and $\cap \{F\colon F\in \mathcal{F}\}=\emptyset=\cap \{G\colon G\in\mathcal{G}\}$. In this note, we establish the product version of the Hilton-Milner Theorem for $k\geq 8$ in the full range. That is, if $\mathcal{F},\mathcal{G}\subset \binom{[n]}{k}$ are non-trivial cross-intersecting, $n\geq 2k+1$ and $k\geq 8$, then \[ |\mathcal{F}||\mathcal{G}|\leq \left(\binom{n-1}{k-1}- \binom{n-k-1}{k-1} +1\right)^2. \]
Read the full abstract

Saturday 9 May

Rings and Algebras

Mock-pre-Lie bialgebras

In this paper, we systematically develop the theory of mock-pre-Lie bialgebras from multiple perspectives. We introduce the notion of a phase space of a mock-Lie algebra, and show that a mock-Lie algebra admits a phase space if and only if it is sub-adjacent to a mock-pre-Lie algebra. We introduce the notions of Manin triples of mock-pre-Lie algebras and mock-pre-Lie bialgebras, and prove the equivalences between mock-pre-Lie bialgebras, Manin triples of mock-pre-Lie algebras, certain matched pairs of mock-pre-Lie algebras, certain matched pairs of mock-Lie algebras and phase spaces of a mock-Lie algebra, which lays a theoretical foundation for subsequent research. Next, we investigate coboundary mock-pre-Lie bialgebras, and derive an analogue of the classical Yang-Baxter equation. In addition, we introduce two important special classes of mock-pre-Lie bialgebras: quasi-triangular mock-pre-Lie bialgebras and factorizable mock-pre-Lie bialgebras. We show that quasi-triangular mock-pre-Lie bialgebras naturally induce relative Rota-Baxter operators of weight -1. Finally, we provide a new perspective for the study of triangular and factorizable mock-pre-Lie bialgebras by introducing the concept of quadratic Rota-Baxter mock-pre-Lie algebras of arbitrary weight.
Read the full abstract

Group Theory

Bornological Metrics on Groups

Let $G$ be a countable group. We study left-invariant metrics on $G$ that are not necessarily proper, introducing the notion of a bornological metric: a metric $\rho$ such that for every $C>0$ there exists $S_C>0$ with the property that $\rho(x,y)<C$ implies $\rho(gx,gy)<S_C$ for all $g\in G$. We show that each coarse equivalence class of bornological metrics is determined by a bornology on $G$, and that every such class contains a canonical left-invariant representative. The metrizability of a bornology is characterized in terms of countable generation of the associated coarse structure, and a criterion for strong $G$-invariance of a coarse structure is established. As an application, we construct families of improper left-invariant metrics on finitely generated groups that are pairwise non-equivalent and not coarsely equivalent to any proper left-invariant metric.
Read the full abstract