Functional Analysis
Hyponormal contractions and analytic shifts
Sneha B, Neeru Bala and Jaydeb Sarkar
Hyponormal operators are known to be among the most difficult operators to analyze. In this work, we focus on two finite types of hyponormal operators. The first type becomes analytic shifts, while the second type admits analytic models. A basic model for hyponormal operators plays a key role in our analysis.
Read the full abstract ▾
Numerical Analysis · Cross-listed from cs.MS
TorchLean: Formalizing Neural Networks in Lean
Robert Joseph George, Jennifer Cruden, Will Adkisson et al. (+3 more)
Neural networks are increasingly deployed in scientific, safety critical, and mission critical pipelines, yet verification and analysis are often performed outside the programming environment that defines and runs the model. This creates a semantic gap between the executed network and the analyzed artifact: guarantees can depend on implicit conventions about operator semantics, tensor layouts, preprocessing, floating-point behavior, graph transformations, accelerated kernels, and external certificates. We present TorchLean, a unified framework for formalizing, executing, and verifying neural networks in Lean 4. TorchLean treats learned models as executable programs and mathematical objects with a shared semantics for computation, verification, and
theorem proving. The framework provides a PyTorch style API for typed tensors, layers, objectives, optimizers, automatic differentiation, and graph programs, with eager and compiled execution paths that lower to a common computation-graph representation. TorchLean supports exact and finite-precision tensor semantics, verified reverse-mode differentiation, interval and affine bound propagation, CROWN/LiRPA style certificate checking, import/export workflows, and CUDA-backed execution through explicit FFI boundaries. It also includes semantic layers for
attention and FlashAttention, state-space sequence models,
diffusion and sampling processes, probability kernels, reinforcement-learning objectives and Markov decision processes, and self-supervised objectives such as masked autoencoding, JEPA-style predictive views, and variance/correlation-based anti-collapse losses. Together, these components provide a semantic foundation for verified machine learning, where executable neural network artifacts, verification procedures, runtime boundaries, and mathematical claims can be stated and related inside one
theorem-proving environment.
Read the full abstract ▾
All authors Robert Joseph George, Jennifer Cruden, Will Adkisson, Xiangru Zhong, Huan Zhang, Anima Anandkumar
Dynamical Systems
Anchoring and Mixed-Norm Contractions in Averaging-Learning Dynamics
Ionel Popescu, Jeven Syatriadi and Tushar Vaidya
A single informed
agent can draw an arbitrarily large network to the ground truth. This is the sharpest consequence of the "Averaging plus Learning" framework studied here, where
agents update opinions by socially averaging neighbours while some receive private feedback at heterogeneous rates. The key is a graph-theoretic property we call condensely anchored, which implies convergence to the correct consensus on fixed networks. In the original framework of Popescu and Vaidya (2023), every
agent was required to learn. Removing that requirement changes the problem fundamentally: the underlying graph must now carry the signal from a handful of anchors to everyone else. When learning rates decay to zero, a persistence condition on the rates alone suffices, with no uniform connectivity or aperiodicity assumed. The hardest case is intermittent connectivity, where no single time step contracts in any standard norm. A mixed-operator-norm framework is developed that extracts two-step contraction from the interplay between aggregate learning mass and entrywise
diffusion of influence, a mechanism new to consensus literature. Finally, we demonstrate the framework's robustness: vanishing noise preserves convergence to the ground truth, whereas persistent noise drives the system to a limiting law.
Read the full abstract ▾
Rings and Algebras
Victor Zhelyabin and Andrey Mamontov
By analogy with the well-established notions of just-infinite groups and just-infinite
algebras, in particular $C^*$-
algebras, we initiate a study of just-infinite $JB$-
algebras, i.e. infinite dimensional $JB$-
algebras for which all proper quotients are finite dimensional. We investigate the connections between a just-infinite $C^*$-
algebra $A$ and its Jordan
algebra $H(A,*)$ of self-adjoint elements. We also show that any just-infinite $JB$-
algebra $J$ either is a infinite-dimensional
spin factor or there exists a $C^*$-
algebra $A$ and just-infinite norm-closed real $*$-subalgebras $A_1$ and $A_2$ of $A$ such that $H(A_1,*)\unlhd J \subseteq H(A_2,*).$
Read the full abstract ▾
Optimization and Control
Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets
Benjamin Grimmer and Ning Liu
We consider the oracle complexity of constrained convex optimization given access to a Linear Minimization Oracle (LMO) for the constraint set and a gradient oracle for the $L$-smooth, $L$-strongly convex objective. This model includes Frank-Wolfe methods and their many variants. Over the problem class of $\alpha$-strongly convex constraint sets $S$, we demonstrate that one can construct hard “zero-chain” instances in the classical style of Nemirovski and Yudin. From our new approach to
adversarial oracle construction, we prove that no such deterministic method can guarantee a final objective gap less than $\varepsilon$ in fewer than $\Omega(\sqrt{L\, \mathrm{diam}(S)^2/\varepsilon})$ iterations. Our lower bound partly matches the accelerated Frank-Wolfe theory of Garber and Hazan (2015) of $O(\sqrt{L(\mathrm{diam}(S)^2+1/\alpha^2)/\varepsilon})$. Second, we consider optimization over $\beta$-smooth sets, finding that in the modestly smooth regime of $\beta=\Omega(1/\sqrt{\varepsilon})$, no complexity improvement for span-based LMO methods is possible against either compact convex sets or strongly convex sets.
Read the full abstract ▾
Information Theory
A Thermodynamic Structure of Asymptotic Inference
Willy Wong
A thermodynamic framework for asymptotic inference is developed in which sample size and parameter variance define a state space. Within this description, Shannon information plays the role of
entropy, and an integrating factor organizes its variation into a first-law-type balance equation. The framework supports a cyclic inequality analogous to a reversed second law, derived for the estimation of the mean. A non-trivial third-law-type result emerges as a lower bound on
entropy set by representation noise. Optimal inference paths, global bounds on information gain, and a natural Carnot-like information efficiency follow from this structure, with efficiency fundamentally limited by a noise floor. Finally, de Bruijn's identity and the I-MMSE relation in the Gaussian-limit case appear as coordinate projections of the same underlying thermodynamic structure. This framework suggests that ensemble physics and inferential physics constitute shadow processes evolving in opposite directions within a unified thermodynamic description.
Read the full abstract ▾
Probability
Mean-field games with rough common noise: the compactification approach
Erhan Bayraktar, Xihao He, Xiang Yu et al. (+1 more)
We study mean-field game (MFG) problems with rough common noise, in which the representative state dynamics are governed by a controlled rough
stochastic differential equation driven by an idiosyncratic Brownian motion and a deterministic rough-path signal that affects the whole population. Within this new framework, we introduce a canonical weak formulation based on relaxed controls and rough martingale problems. We prove the existence of a pathwise mean-field
equilibrium by developing new compactification tools that accommodate rough integration and differ substantially from classical compactification arguments in the literature. Finally, we discuss the relationship between the pathwise problem and the classical MFG problem with randomized Brownian common noise. Using the notion of a pathwise admissible set, we recast mean-field game problems with common noise as optimization problems over an extended space of probability measures. We establish an equivalent characterization of Carmona-Delarue-Lacker's weak
equilibrium and, as an application, give an alternative proof of strong
equilibrium without first establishing pathwise uniqueness.
Read the full abstract ▾
All authors Erhan Bayraktar, Xihao He, Xiang Yu, Fengyi Yuan
Analysis of PDEs
Global three-dimensional subsonic Euler flows past an axisymmetric obstacle with large vorticity
Dehua Wang, Tian-Yi Wang and Weiqiang Wang
In this paper, we prove the existence and uniqueness of subsonic solutions to the steady Euler flows past a smooth, axisymmetric obstacle. Specifically, for a broad class of prescribed positive axial velocities in the upstream, the subsonic Euler flow exists provided that the upstream density exceeds a critical threshold. The non-degeneracy of the axial velocity is rigorously established by combining the strong maximum principle with a refined continuity argument. The asymptotic behavior of the flow is obtained from uniform integral estimates for the difference between the flow and the upstream state. In addition, this result accommodates flows with large vorticity under a structural condition, thereby differing from previous results in the two-dimensional case.
Read the full abstract ▾
Optimization and Control
Dantzig-Wolfe and Arc-Flow Reformulations: A Systematic Comparison
Daniel Yamin, Willem-Jan van Hoeve and Ted K. Ralphs
Dantzig-Wolfe reformulation is a widely used technique for obtaining stronger relaxations in the context of branch-and-bound methods for solving integer optimization problems. Arc-Flow reformulations are a lesser known technique related to dynamic programming that has experienced a resurgence as result of the recent popularization of decision diagrams as a tool for solving integer programs. Although these two reformulation techniques arose independently, the recently proposed solution paradigm known as column elimination has revealed that they are in fact closely connected. Building on a unified formulation and notation, this study clarifies the theoretical connections and computational trade-offs between these two reformulations. We first revisit the known fact that the LP relaxations of these two reformulations yield the same dual bound. We then dig deeper, establishing conditions under which valid inequalities in the original, Dantzig-Wolfe, or Arc-Flow spaces can be translated across reformulations without loss of strength, and reinterpreting iterative strengthening methods, such as decremental state-space relaxation and column elimination, through the lens of cutting planes. To assess the potential impact of these insights empirically, we
benchmark both reformulations under identical conditions on the vehicle routing problem with time windows using state-of-the-art column- and cut-generation techniques. The results identify clear contrasts: the Arc-Flow reformulation benefits from faster convergence and performs best when subproblems are highly relaxed or low-dimensional, whereas the Dantzig-Wolfe reformulation is more efficient when the master problem remains compact. Overall, our study provides a unified perspective and practical guidelines for choosing between Dantzig-Wolfe and Arc-Flow reformulations in large-scale integer optimization.
Read the full abstract ▾
Optimization and Control
Gradient Dominance in the Linear Quadratic Regulator: A Unified Analysis for Continuous-Time and Discrete-Time Systems
Yuto Watanabe and Yang Zheng
Despite its nonconvexity, policy optimization for the Linear Quadratic Regulator (LQR) admits a favorable structural property known as gradient dominance, which facilitates linear convergence of policy gradient methods to the globally optimal gain. While gradient dominance has been extensively studied, continuous-time and discrete-time LQRs have largely been analyzed separately, relying on slightly different assumptions, proof strategies, and resulting guarantees. In this paper, we present a unified gradient dominance property for both continuous-time and discrete-time LQRs under mild stabilizability and detectability assumptions. Our analysis is based on a convex reformulation derived from a common Lyapunov inequality representation and a unified change-of-variables procedure. This convex-lifting perspective yields a single proof framework applicable to both time models. The unified treatment clarifies how differences between continuous-time and discrete-time dynamics influence theoretical guarantees and reveals a deeper structural
symmetry between the two formulations. Numerical examples illustrate and support the theoretical findings.
Read the full abstract ▾
Classical Analysis and ODEs
Three-Term Recurrence Relations for Confluent Basic Hypergeometric Series with Applications to q-Bessel Functions
Yuka Yamaguchi
We establish three-term recurrence relations for the ${}_1\phi_1$ and ${}_0\phi_1$ basic hypergeometric series involving multiplicative shifts of the parameters and the variable by integer powers of q. The coefficients of these recurrence relations are shown to be uniquely determined by the shift indices and are given explicitly in terms of rational functions. These recurrence relations arise as confluent limits of previously established recurrence relations for the ${}_2\phi_1$ basic hypergeometric series. As an application, we derive three-term recurrence relations for Jackson's second and third q-Bessel functions. These recurrence relations involve additive shifts in the order and multiplicative q-shifts in the variable, and their coefficients include the known q-Lommel
polynomials as special cases.
Read the full abstract ▾
Optimization and Control
Directional first order approach for a class of bilevel programs
Kuang Bai, Wei Yao, Jane J. Ye et al. (+1 more)
In this paper, we study a class of bilevel optimization program, where the feasible set of the lower level program is independent of the upper level variable. For bilevel programs it is known that the first order reformulation of a bilevel program requires the convexity of the lower level program while reformulations involving the value function result in difficult optimization problems. In this paper we propose a directional first order approach which does not require convexity of the lower level program. First, we propose some conditions under which the lower level program can be equivalently characterized by its first order condition over a directional neighborhood around the local optimal condition. Next we give some conditions under which the classical first order optimality condition in the form of M-stationary condition still holds as a necessary optimality condition for the first order reformulation of the bilevel program even when the lower level program is nonconvex.
Read the full abstract ▾
All authors Kuang Bai, Wei Yao, Jane J. Ye, Jin Zhang
Dynamical Systems
Darboux-type center conditions for families of planar polynomial vector fields
Yovani Villanueva and Warwick Tucker
We study the center-focus problem for planar
polynomial vector fields, which can be viewed as a local version of
Hilbert's 16th problem. Based on a Lyapunov function approach, we establish novel results regarding the center-focus conditions for two families of differential systems. More precisely, we find an enclosure of the Bautin ideal generated by the Lyapunov constants of these systems. Our results hold for any degree $n \geq 2$.
Read the full abstract ▾
Optimization and Control
Computing Kurdyka-Łojasiewicz exponents via composition and symmetry
Cédric Josz and Wenqing Ouyang
We devise calculus rules for the Kurdyka-Łojasiewicz exponent using the rank
theorem and Lie group actions. They apply to a wide class of composite and invariant functions, and are particularly suitable for handling nonisolated local minima. Notably, smoothness plays no role, eschewing gradient and Hessian computations. This provides a unified framework for establishing linear convergence of various
algorithms in
matrix factorization, $\ell_1$-
matrix factorization,
matrix sensing, and linear neural networks.
Read the full abstract ▾
Optimization and Control
Identifying Multi-Hit Cancer Drivers Without Massive Parallelization: A CP, MIP, and Column Generation Framework
Rick S. H. Willemsen, Tenindra Abeywickrama and Ramu Anandakrishnan
Cancer is often driven by specific combinations of an estimated two to nine gene mutations, known as multi-hit combinations. Identifying these multi-hit combinations of gene mutations that drive cancer is critical for understanding carcinogenesis and designing targeted therapies. We formalize this challenge as the Multi-Hit Cancer Driver Set Cover Problem (MHCDSCP), optimizing the selection of gene combinations to maximize tumor coverage while strictly minimizing normal sample misclassification. While existing approaches rely on exhaustive enumeration and massive parallelization, we introduce fast heuristics based on constraint programming and mixed integer programming formulations. Evaluated on real-world cancer genomics data, our framework matches state-of-the-art supercomputing methods using a single commodity CPU in under a minute. We also propose a price-and-branch heuristic which, by solving the root node to optimality, provides the first provably optimal solutions for over half of the
benchmark instances, thereby verifying the near-optimality of our fast heuristics. These findings demonstrate that on real-world problem instances, the MHCDSCP is far less computationally demanding than previously believed, providing an accessible baseline that enables the exploration of previously intractable multi-hit modeling assumptions.
Read the full abstract ▾
Analysis of PDEs
The global well-posedness of the multi-dimensional compressible Euler system with damping in the $L^p$ critical Besov spaces for $p<2$
Jianzhong Zhang, Ying Sui and Xiliang Li
In this paper, we study the Cauchy's problem of the compressible Euler system with damping and establish the global-in-time well-posedness in $L^p$-type critical Besov spaces for $1\leq p<2$. To achieve it, a new product estimate is established in $L^2$-$L^p$ hybrid Besov spaces.
Mathematical Physics · Cross-listed from cs.CC
Dynamic Level Sets
Michael Stephen Fiske
A mathematical concept is identified and analyzed that is implicit in the 2012 paper Turing Incomputable Computation, presented at the Alan Turing Centenary Conference (Turing-100, Manchester). The concept, called dynamic level sets, is distinct from mathematical concepts in the standard literature on dynamical systems,
topology, and computability theory. A new mathematical object is explained and why it may have escaped prior characterizations, including the classical result of de Leeuw, Moore, Shannon, and Shapiro that probabilistic Turing machines (with bias $p$ where $p$ is Turing computable) compute no more than deterministic ones. A key mechanism underlying the concept is the Principle of Self-Modifiability, whereby the physical realization of an invariant logical level set is reconfigured at each computational step by an incomputable physical process.
Read the full abstract ▾
Combinatorics
On Arithmetic Cordial Labeling of Some Graphs
Jason D. Andoyo, Jemina Clarisse C. Prudencio and Ricky F. Rulete
Let $\eta$ be a fixed positive integer. Let $S$ be a subset of $\mathbb{Z}$, $\star:S\times S\to \mathbb{Z}$ be a binary function, and $\zeta_{\eta}:\{\xi\in \mathbb{Z}:\gcd(\xi,\eta)=1\}\to \{0,1\}$ be a function. For a simple connected graph $G$ of order $n$, a bijective function $f:V(G)\to S$ (where $|S|=n$) is called an arithmetic cordial labeling modulo $\eta$ under $\langle S,\zeta_\eta,\star\rangle$ if the induced function $f_\eta^*:E(G)\to \{0,1\}$, defined by $f_\eta^*(uv)=0$ whenever $\zeta_\eta(f(a)\star f(b))=0$ or $\gcd(f(a)\star f(b),\eta)\neq 1$, and $f_\eta^*(uv)=1$ whenever $\zeta_\eta(f(a)\star f(b))=1$, satisfies the condition $|e_{f_\eta^*}(0)-e_{f_\eta^*}(1)|\leq 1$, where $e_{f_\eta^*}(i)$ is the number of edges with label $i$ ($i=0,1$). In this paper, we explore the arithmetic cordial labeling of some graphs under conditions imposed on the function $\zeta_\eta$. The graphs included are
star graphs, ladder graphs, alternate cycle snake graphs, join graphs, corona graphs, and tensor product graphs.
Read the full abstract ▾
Information Theory · Cross-listed from cs.AI
A Mathematical Theory of Agency and Intelligence
Wael Hafez, Chenan Wei, Rodrigo Pena et al. (+2 more)
To operate reliably under changing conditions, complex systems require feedback on how effectively they use resources, not just whether objectives are met. Current AI systems process vast information to produce sophisticated predictions, yet predictions can appear successful while the underlying interaction with the environment degrades. What is missing is a principled measure of how much of the total information a system deploys is actually shared between its observations, actions, and outcomes. We prove this shared fraction, which we term bipredictability, P, is intrinsic to any interaction, derivable from first principles, and strictly bounded: P can reach unity in
quantum systems, P equal to, or smaller than 0.5 in classical systems, and lower once agency (action selection) is introduced. We confirm these bounds in a physical system (double pendulum), reinforcement learning
agents, and multi turn LLM conversations. These results distinguish agency from intelligence: agency is the capacity to act on predictions, whereas intelligence additionally requires learning from interaction, self-monitoring of its learning effectiveness, and adapting the scope of observations, actions, and outcomes to restore effective learning. By this definition, current AI systems achieve agency but not intelligence. Inspired by thalamocortical regulation in biological systems, we demonstrate a feedback architecture that monitors P in real time, establishing a prerequisite for adaptive, resilient AI.
Read the full abstract ▾
All authors Wael Hafez, Chenan Wei, Rodrigo Pena, Amir Nazeri, Cameron Reid
Number Theory
Multiplicative Diophantine Approximation on Planar Lines with Restricted Denominators
Lucas Tapia
We prove a Khintchine result for convergence of a multiplicative Diophantine set with restricted denominators on an arbitrary non-degenerate line. Specifically, given sequences of real numbers $\{a_n\}_{n\in\mathbb{N}},\, \{b_n\}_{n\in\mathbb{N}},\, \{c_n\}_{n\in\mathbb{N}},\, \{d_n\}_{n\in\mathbb{N}},$ we determine convergence conditions under which the set of $x\in [0,1]$ which satisfy $\left\lVert a_n x +c_n\right\rVert \cdot \left\lVert b_n x + d_n \right\rVert < \psi(n) $ for infinitely many $n\in\mathbb{N}$ has zero Hausdorff s-measure. We also obtain an upper bound for the Hausdorff dimension in the inhomogeneous setting.
Read the full abstract ▾
Probability
Fluctuations in the weakly coupled 4D Anderson Hamiltonian
Simon Gabriel and Tommaso Rosati
We study the weak coupling limit of the Anderson
Hamiltonian in the critical dimension $d=4$. In a perturbative sense, we prove Gaussian fluctuations about the Green's function of the
Laplacian. The fluctuations are described by an explicit effective variance, up to a critical value of the coupling constant at which we expect a phase transition in the structure of the fluctuations. The proof is based on a combinatorial analysis of Feynman diagrams, and on a detailed study of the BPHZ renormalisation of the model. We characterise the limiting distribution in terms of primitive blow-ups, and prove that no
Laplacian renormalisation is present. Our approach seems applicable to a broad class of equations.
Read the full abstract ▾
Representation Theory
Endoscopic transfer and the wavefront upper bound conjecture
Hiraku Atobe and Dan Ciubotaru
We verify the local analogue of Jiang's
conjecture for the upper bound of the
geometric wavefront sets of Arthur type representations of split classical $p$-adic groups with $p\gg 0$, under a certain condition. As a consequence, we also obtain the upper bound
conjecture of Kim and the second author, and Hazeltine–Liu–Lo–Shahidi, under the same assumptions. The proof uses Waldspurger's work on the endoscopic transfer supplemented by results of Konno and Varma, as well as the wavefront set computations in the unipotent case by Mason-Brown–Okada and the second author.
Read the full abstract ▾
Mathematical Physics · Cross-listed from hep-th
A Perfectoid Duality Between M-Theory and F-Theory
Arshid Shabir, Bobby Eka Gunara and Mir Faizal
We present a non-singular, definition-level formulation of F-theory by replacing the traditional shrinking-fiber limit of M-theory with compactification on a tower-completed circle described using perfectoid geometry and condensed mathematics. This construction provides an intrinsic eleven-dimensional carrier for modular data and admits a canonical tilting and comparison procedure that yields
elliptic geometry as an output rather than an auxiliary input. Using this framework, we establish a precise M-theory/Type IIB dictionary in the constant-coupling sector, showing how the physical axio-dilaton is fixed by eleven-dimensional
geometric and topological data. The correspondence is tested at the level of the ten-dimensional bosonic effective action, including its topological couplings inherited from eleven dimensions. The tower-completed geometry naturally organizes global sectors in generalized
cohomology, with charge data governed by K-theory and exhibiting a canonical
prime-power torsion structure. We further show how this framework extends to varying-coupling backgrounds and duality defects, admits a natural adelic completion with
prime-independence, and generalizes to higher-rank and U-duality geometries. We also discuss
holographic aspects and the anomaly-refined extension of the duality group beyond the bosonic truncation. Together, these results provide a coherent, non-singular foundation for F-theory and its extensions.
Read the full abstract ▾
Number Theory
Weakening the Legendre Conjecture
Marc Chamberland and Armin Straub
The world of
primes has many gaps between evidence and
theorems. Here, we review Legendre's
conjecture on
primes between consecutive squares and recent progress on the weaker question of
primes between consecutive larger powers. Assuming the Riemann hypothesis (RH), we observe that a recent result of Emanuel Carneiro, Micah Milinovich and Kannan Soundararajan, combined with a large-scale computation by Jonathan Sorenson and Jonathan Webster, implies the existence of
primes between $x^{2+\delta}$ and $(x+1)^{2+\delta}$ for all real $x \geq 1$ when $\delta \geq 1/4$. For smaller values of $\delta > 0$, we provide an explicit bound $x_0 = x_0 (\delta)$ such that
primes exist in these intervals whenever $x \geq x_0$ (again assuming RH). We conclude with an application to Mills-type
prime-generating constants.
Read the full abstract ▾
Mathematical Physics · Cross-listed from gr-qc
Periodic Analogs of Multiple Black Holes Solutions
Omar E. Ortiz and Javier Peraza
In this article, we extend the numerical studies developed in [arXiv:2210.12898] to construct periodic stationary axisymmetric solutions containing multiple horizons in each fundamental domain. As a direct application, we consider periodic stationary axisymmetric solutions with two identical equidistant counter-rotating horizons. These solutions can be parametrized by the period $L$, the mass $M$, and the absolute value of the angular momentum $|J| >0$. We provide strong numerical evidence for the existence of such configurations, without any restriction in terms of the distance between horizons. This is in sharp contrast with the non-zero total angular momentum case, as it was recently established in \cite{Peraza:2024uto} that static single-horizon periodic solutions cannot be put into rotation if $L < 4M$. It is shown that these solutions do not have any struts on the axis, and it is also explicitly shown that, by taking non-equidistant horizons, struts develop between the black holes. Other global properties of the solutions are also presented.
Read the full abstract ▾
Representation Theory
Subdivision and Runner Removal Theorems
Tao Qin
We develop a combinatorial framework for the subdivision map – introduced by Maksimau, Mathas and Tubbenhauer – between the KLR(W)
algebras of type $A^{(1)}_{e-1}$ and type $A^{(1)}_{e}$, which provides a partial categorification of the runner removal
theorems.
Algebraic Geometry
Syzygies and Koszul modules in geometry
Gavril Farkas
We describe the progress in the last 10 years related to Koszul modules and syzygies of algebraic varieties. Topics discussed include the general theory of Koszul modules and resonance varieties, applications to Chen ranks of Kähler and hyperplane arrangement groups (Suciu's
Conjecture) and connections related to syzygies of algebraic curves. Developments related to Green's
Conjecture, the Secant
Conjecture and the Gonality
Conjecture on the resolution of line bundles on algebraic curves are also presented. Open question are proposed throughout the text.
Read the full abstract ▾