Rings and Algebras
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Saturday 14 March
An implicit operation of a class of similar algebras $\mathsf{K}$ is a collection of first order definable partial functions on the members of $\mathsf{K}$ that is globally preserved by homomorphisms. For instance, "taking inverses" can be viewed as a unary implicit operation of the class of all monoids because its graph on a given monoid is defined by the equation $xy \thickapprox 1 \thickapprox yx$ and monoid homomorphisms preserve existing inverses. As this example demonstrates, the implicit operations of a class $\mathsf{K}$ need not be given by a term of $\mathsf{K}$. We show that an equational class of commutative monoids can be expanded with enough implicit operations so that every implicit operation can be interpolated by a family of terms if and only, in each of its members, for every $a$ there exists some $b$ such that $a = a^2b$, i.e., the class consists of inverse monoids. Our methods build on the interaction of the theory of implicit operations with Grillet's description of finitely generated subdirectly irreducible commutative semigroups and the combinatorics deriving from an extension of Isbell's Zigzag Theorem to all equational classes of commutative monoids.
Number Theory
Parity of parts and excludant statistics in partitions
In this paper, we study restricted excludant statistics depending on its parity in partitions where parts with same parity are distinct. Using $q$-series transformations, we show that generating functions of these partition statistics are related to the quantum modular forms $\s(q)$, its companion $\sigma^*(q)$ introduced by Ramanujan, and $v_2(q)$, a Nahm-type sum, introduced by Andrews. Utilizing Tauberian method, we obtain asymptotics of such sequences.
Read the full abstract
Information Theory
On the Non-existence of Perfect Sequences with the Array Orthogonality Property
For over three decades, the pursuit of perfect periodic autocorrelation sequences has been constrained by Mow's conjecture, which posits that no perfect sequence over an $n$-phase alphabet can exist with a length greater than $n^2$. While a proof across all conceivable sequence classes remains an open problem, this paper establishes bounds for a prominent class of constructions relying on the Array Orthogonality Property (AOP). We show that sequences generated by pure bivariate polynomial index functions cannot exceed the $n^2$ Frank-Heimiller bound due to algebraic periodicity. Furthermore, we extend this result to floored rational index functions, proving that attempts to geometrically expand the array dimensions inherently result in destructive fractional phase scattering. Neutralising this scattering strictly forces a collapse of the phase space, re-establishing the $n^2$ limit. Finally, we define the boundaries of these theorems, noting their fundamental reliance on commutative algebras, and contrast them with recent sequence constructions demonstrating the existence of unbounded perfect sequences over non-commutative unit quaternions.
Read the full abstract
Logic
Axiom Beta Implies Elementary Transfinite Recursion
We show that $\mathbf{C}$, a weak theory of sets with Axiom Beta, proves the scheme of Elementary, or $\Delta_0$ Transfinite Recursion and can generate, for every set, the corresponding relativized constructible hierarchy. We show that the theory $\mathbf{C}$ corresponds to Simpson's system $\mathbf{ATR}_0^\text{set}$ without the Axiom of Countability. In fact, $\mathbf{C}$ proves the totality of the Veblen function and of all primitive recursive set functions. In particular, this means our system $\mathbf{C}$ is equivalent to $\mathbf{PRS}\omega+\text{Axiom Beta}$. We also establish an upper bound, though not a sharp one, for the $\Sigma_1$-definable functions of $\mathbf{C}$. Finally, we show that the variant of $\mathbf{C}$ in which the Finite Powerset Axiom is replaced by the closure under the rudimentary functions is a strictly weaker theory and no longer ensures the existence of the relativized constructible hierarchy.
Read the full abstract
Analysis of PDEs
Global Well-Posedness for the Fourth-Order Nonlinear Schrödinger Equation with Potential in the Energy-Critical Case
We consider the defocusing fourth-order nonlinear Schrödinger equation with potential \[ i\partial_t u + \Delta^2 u + Vu + \lambda |u|^{p-1}u = 0 \qquad (x \in \mathbb{R}^n,\ t \in \mathbb{R}), \] in dimensions $n \ge 5$. In the energy-critical case $p = \frac{n+4}{n-4}$, under suitable assumptions on a radial real-valued potential $V$, we prove global well-posedness for radial initial data in $H^2(\mathbb{R}^n)$. We also show that every such solution scatters in $H^2$ to a free solution of the biharmonic Schrödinger equation. The proof relies on Strichartz estimates for fourth-order Schrödinger operators with potential, equivalence of Sobolev norms associated with $\Delta^2+V$ and $\Delta^2$, boundedness of wave operators, perturbative stability theory, and a Morawetz-type estimate adapted to the presence of a potential. This extends earlier results for the case without potential to a class of radial potentials.
Read the full abstract
Number Theory
A note on the invariants of the $L$-functions
We explain the exact meaning of a statement we made in a previous paper on invariants, namely that a complex-valued function of the data of the functional equation of an $L$-function is an invariant if and only if it is stable under the multiplication and factorial formulae. To this end, we show that every invariant has a so-called rational extension, having some desired invariance properties. The existence of such an extension, which enables to express formally the above heuristic concept, is not apparent and its construction is the main novelty of the paper.
Read the full abstract
Number Theory
Multiple standard twists of $L$-functions
The standard twist of $L$-functions plays a fundamental role in the Selberg class theory. It is defined as an absolutely convergent Dirichlet series and admits meromorphic continuation beyond the half-plane of absolute convergence. Nowadays, the analytic properties of the standard twist $F(s,\alpha)$ of an $L$-function $F$ are well-understood. For example, it has poles when the positive number $\alpha$ belongs to the so-called spectrum of $F$, and is entire otherwise. In this paper, for a given set ${\mathbf F}=\{F_1,\dots,F_N\}$ of $L$-functions and ${\mathbf s}\in{\mathbb C}^N$, we consider the multiple standard twist ${\mathbf F}({\mathbf s},\alpha)$. This is defined initially on a certain half-space of ${\mathbb C}^N$, and we describe its meromorphic continuation to the whole space. Results in the multidimensional case are, in many ways, analogous to those in the one-dimensional case. In particular, the spectrum of a multiple standard twist is relevant to the description of the set of poles of ${\mathbf F}({\mathbf s},\alpha)$. There are also significant differences; for instance, in the structure of the singularities.
Read the full abstract
Mathematical Physics
Optimal pinning control of directed hypergraphs
Identifying the nodes that must be directly controlled to steer a network along a desired trajectory remains an open problem for digraphs, and even more so for hypergraphs. In this manuscript, we investigate network systems coupled via directed hypergraphs and consider a broad class of individual dynamics and coupling configurations, extending the definition of type II networks originally formulated for digraphs. For this class of networks with higher-order interactions, we establish necessary and sufficient conditions under which a pinning selection locally ensures successful control. Building on these analytical results, we propose a greedy heuristic for pinning control selection, which demonstrably outperforms existing methods.
Read the full abstract
Probability
Solvability of BSDEs with possibly unbounded stochastic coefficients on a general weighted $L^p$ space
This paper is devoted to solving a multidimensional backward stochastic differential equation (BSDE for short) with a general random terminal time $\tau$ taking values in $[0,+\infty]$. The generator $g$ of such BSDE satisfies a stochastic monotonicity condition in the state variable $y$ and a stochastic Lipschitz condition in the state variable $z$ with possibly unbounded stochastic coefficients $\mu_\cdot\in\R$ and $\nu_\cdot\in\R_+$ satisfying $\int_0^\tau (|\mu_t|+\nu^2_t) {\rm d}t<+\infty$, along with a very general growth in $y$ that is more easily verified and weaker than existing ones. Let $p>1$ be a given constant and $\rho_\cdot\geq \mu_\cdot+\frac{\theta}{2[1\wedge(p-1)]}\nu_\cdot^2$ be a given real-valued process for some constant $\theta>1$ such that $\int_0^\tau |\rho_t|{\rm d}t<+\infty$. In a general weighted $L^p$ space with a weighted factor $e^{\int_0^t \rho_r{\rm d}r}$, we establish an existence and uniqueness result for the adapted solution of previous BSDE when the terminal value satisfies an associated weighted integrability condition, broadening the scope of the process $\rho_\cdot$ in the weighted factor and thereby unifying and strengthening some corresponding existing results obtained in \citet{DarlingandPardoux1997}, \citet{Briand2003}, \citet{LiFan2024SD} and \citet{Li2025}. Some innovative ideas are presented in order to address the general weighted space and the very general growth condition. As applications, we prove the existence of viscosity solutions for parabolic and elliptic PDEs linked with previous BSDEs under some general assumptions on their nonlinear terms, and establish a dual representation of an unbounded dynamic concave utility defined on a general weighted $L^p$ space via the weighted $L^p$ solutions of previous BSDEs.
Read the full abstract
Dynamical Systems · Cross-listed from cs.LG
On Interpolation Formulas Describing Neural Network Generalization
In 2020 Domingos introduced an interpolation formula valid for "every model trained by gradient descent". He concluded that such models behave approximately as kernel machines. In this work, we extend the Domingos formula to stochastic training. We introduce a stochastic gradient kernel that extends the deterministic version via a continuous-time diffusion approximation. We prove stochastic Domingos theorems and show that the expected network output admits a kernel-machine representation with optimizer-specific weighting. It reveals that training samples contribute through loss-dependent weights and gradient alignment along the training trajectory. We then link the generalization error to the null space of the integral operator induced by the stochastic gradient kernel. The same path-kernel viewpoint provides a unified interpretation of diffusion models and GANs: diffusion induces stage-wise, noise-localized corrections, whereas GANs induce distribution-guided corrections shaped by discriminator geometry. We visualize the evolution of implicit kernels during optimization and quantify out-of-distribution behaviors through a series of numerical experiments. Our results support a feature-space memory view of learning: training stores data-dependent information in an evolving tangent feature geometry, and predictions at test time arise from kernel-weighted retrieval and aggregation of these stored features, with generalization governed by alignment between test points and the learned feature memory.
Read the full abstract
Optimization and Control
When to Screen, When to Bypass: LLM-Judges in Resource-Scarce AI-Human Workflow
AI systems can generate outputs at scale, but most outputs require human approval before release. This creates a bottleneck: humans cannot keep pace with AI-generated volume. A natural response is to insert an LLM-judge that screens outputs before they reach humans, filtering errors and amplifying effective review capacity. But judges are imperfect. False rejections send correct outputs back for unnecessary rework; false acceptances consume judge capacity without relieving humans. When should outputs be routed through the judge, and when should they bypass it directly to human review? We model this workflow as a queueing network with three resource pools and use a fluid approximation to characterize optimal judge allocation. The analysis reveals that optimal allocation depends critically on which resource is the current bottleneck: screening amplifies human capacity when reviewers are scarce, yet generates a rework trap that crowds out new production when workers are stretched thin. For heterogeneous task classes with different error profiles, optimal priority can reverse across operating regimes, and classes with complementary error structures can be mixed to achieve throughput that neither class attains alone. We propose a policy that uses the fluid-optimal allocation fractions for routing and the fluid-optimal service levels for admission control, and establish its asymptotic optimality as system scale grows. Extensions incorporate human feedback that improves rework quality and joint capacity planning under budget constraints. Numerical experiments confirm rapid convergence to the fluid optimum and demonstrate that the policy significantly outperforms benchmarks that either always screen or never screen.
Read the full abstract
Algebraic Geometry
Localization and coalescence of condensed ringed spaces
Gillam proved that the category of locally ringed spaces admits a fully faithful embedding into a certain category, which has a right adjoint that maps some simple objects to the spectra of rings. In this paper, we use condensed mathematics to define an analogous category and its coreflective full subcategories, and prove that one of their coreflections maps certain simple objects to the adic spectra of certain Huber pairs.
Read the full abstract
Combinatorics
Rainbow trapezoids with given area
A well-known result by Graham in Euclidean Ramsey Theory states that, for every positive real number $A$, every coloring of the plane with finite number of colors contains a monochromatic triangle of area $A$. We consider canonical versions of this result. We show that every $3$-coloring of the plane integer lattice contains either a rainbow triangle of area $1/2$ or a monochromatic rectangle of any given area whose sides are parallell to the axes. We also show that, under natural conditions, there are numbers $A$ and $B$ such that every coloring of the plane integer lattice contains either a monochromatic rectangle of area $A$ or a rainbow trapezoid of area $B$. As usual, only vertex colors are considered: e.g., a monochromatic rectangle is a set of four points in the lattice which a) are the vertices of a rectangle and b) are assigned the same color.
Read the full abstract
Functional Analysis
Some Spectral Problems for First Order Normal Differential Operators in the Weighted Hilbert Spaces of Vector-Functions
In this article, in order to the minimal operator generated by the first-order differential-operator expression in the weighted Hilbert space of vector functions in the finite interval to be formal normal, the relationship between the variable operator coefficient of this differential-operator expression and the weight function is established. Afterwards, the general form of all normal extension of the minimal operator is found using the Glazman-Krein-Naimark Method. Then, the structure of spectrum of such extensions is investigated. Later on, the issue of belonging to Schatten von-Neumann classes is explored, as well as the asymptotic behaviour of the singular numbers of the inverse of such normal extensions. Lastly, an approach is developed on all normal extension expressed in the weighted Hilbert spaces.
Read the full abstract
Mathematical Physics · Cross-listed from quant-ph
Higher order Magnus expansions for driven two-level quantum dynamics
We investigate the Magnus expansion for a generic time-dependent two-level system under single-axis driving.By virtue of the su(2) Lie algebra, the expansion is decomposed into a commutator-free form. To illustrate the usefulness of the gained expression, we then revisit the Landau-Zener-Stückelberg-Majorana model, with a focus on non-adiabatic transitions as well as the Stokes phase. In addition, the semiclassical Rabi model is systematically treated by determining the Floquet quasienergy up to different orders. We demonstrate how to employ suitable picture transformations as well as on how to enforce the symmetry of the underlying model in order to guarantee convergence of the expansion as well as to achieve satisfactory agreement with the exact results. For both models that we studied it turns out that a third order approximation yields results that are in next to perfect agreement with exact analytical ones. Surprisingly, in the case of the semiclassical Rabi model, even the second order Magnus approximation in the adiabatic picture produces almost exact results for a large parameter range.
Read the full abstract
Analysis of PDEs
On singular $p$-Laplacian problems with discontinuous convection terms
The existence of positive strong solutions to a homogeneous Dirichlet $p$-Laplacian problem, with reaction sum of a both singular at zero and highly discontinuous nonlinearity and of a discontinuous convection term, is established. Locality arguments, based on suitable measure theoretical results (see Section 3), are employed.
Read the full abstract
Numerical Analysis
$N$-Dimensional curve following for solving numerically systems of nonlinear equations
This paper presents a methodology for finding numerically, by means of curve-following, all real solutions of a general system of $n$ nonlinear equations in $n$ unknowns, within a given $n$-dimensional box. The main idea behind our method is a) to locate all parts of the curves formed by a selected subset of $n-1$ equations of the initial system, b) follow these parts numerically within the given $n$-box and c) during this process, find all their intersection points with the hypersurface that represents the left-out equation of the initial system. With proper handling techniques, both stages (a) and (b) can be done with safety even when using a rapidly - but locally - convergent method such as Newton's method. Stage (c) on the other hand is theoretically straightforward and can be implemented by examining sign change and using bisection. However, improvement of performance with automatic step-size adaptation is also feasible. Since the choice of the left-out equation as well as the order of the unknowns, in some problems may affect the algorithm's performance, a secondary procedure for problem optimization has also been developed. This integrated algorithm has been successfully tested in all classical test-problems that are used in the literature (in total about 130 problems with dimension up to $n=10$) and achieved to locate approximations to all the known real solutions of each test-problem, with a user-provided accuracy. It has also proved to be more than 10 times quicker than Kuiken's 2D curve-following method, when compared in two-dimensional problems.
Read the full abstract
Differential Geometry
Nahm Poles and 0-Instantons
We study self-dual 0-connections, or 0-instantons, on asymptotically hyperbolic 4-manifolds. These connections develop a uniform singularity along the conformal infinity, and are asymptotic, at each point of the boundary, to a "Nahm pole" model solution on $H^4$. Examples include the Levi-Civita spin connections on $S^+$ over spin Poincaré-Einstein 4-manifolds. Inspired by the Fefferman-Graham expansion for Poincaré-Einstein metrics, we study the asymptotic expansion of these 0-instantons. We prove that the expansion is log-smooth, and that the coefficient of the first log term - which we call the 0-instanton obstruction tensor - is a conformal invariant related to the Weyl curvature of the ambient conformal metric. We then show that this invariant vanishes if and only if the 0-instanton is smooth modulo gauge. Finally, we study the renormalized Yang-Mills energy: we prove that, if the metric is asymptotically Poincaré-Einstein to third order, then this energy is a well-defined conformal invariant, and equals the negative Chern-Simons invariant of the conformal infinity.
Read the full abstract
Number Theory
Frobenius in $W(E_8)$ for $y^2=x^3+x+D(t)$ over $\mathbb F_q(t)$: ranks, Tate–Shafarevich groups and trace statistics
Let $q$ be a power of a prime $p\ge5$ and let $\mathcal F_5(q)$ be the set of curves $E_D\colon y^2=x^3+x+D(t)$ over $\mathbb F_q(t)$ with $D$ monic of degree $5$ and $4+27D^2$ squarefree. Each $E_D$ is the generic fibre of a rational elliptic surface with Mordell–Weil lattice $E_8$, Frobenius acts on it by some $w_D\in W(E_8)$, and $L(E_D,T)=\det(1-qw_DT)$ (Shioda, Oguiso–Shioda, Ulmer). From known results (Galois descent, Grothendieck's $\mathrm{Sha}\cong\mathrm{Br}$, Artin, Milne, Urabe) one reads off $E_D(\mathbb F_q(t))=E_8^{w_D}$, $\mathrm{Sha}(E_D)\cong(E_8/(1-w_D)E_8)_{\mathrm{tors}}$ and $|\mathrm{Sha}|\cdot\mathrm{Reg}=\det{}'(1-w_D)$; by the class tables of Urabe and Karras, $|\mathrm{Sha}|$ is not determined by $L(E_D,T)$ at positive rank. The main new result is that the monodromy of this $4$-parameter family is $ W(E_8)$ in every characteristic $p\ge5$ (computer-assisted). With Deligne's theorem, and Katz's Betti bounds for uniformity in $p$, $w_D$ is equidistributed in $ W(E_8)$ with error $O(q^{-1/2})$ as $q\to\infty$ through all prime powers; e.g. the mean degree-$1$ trace over the rank-$r$ curves, which equals $-\mathbb E[\operatorname{tr} w_D\mid\mathrm{mult}_1(w_D)=r]$, tends to $8/29$ at rank $0$. The constant is astronomical. We prove first-order ($1/q$) formulas for the moments of $\operatorname{tr} w_D$ of order $\le3$; their coefficients depend on $q$ through $\chi_q(-3)$ and, at order $3$, through a Frobenius trace on a $2$-dimensional $H^1$. We conjecture a first-order law for the whole class distribution; one of its four terms involves the CM newform $\eta(4z)^6$ (checked for all primes below $3000$). The law fits exact class counts at all prime powers $q\le41$, including out-of-sample predictions at $q=37,41$, some of which (rank statistics at $q=41$) missed.
Read the full abstract
Probability
Iterated Graph Systems (I): random walks and diffusion limits
This paper investigates random walks and diffusion limits on a broad class of fractals generated by Edge Iterated Graph Systems (EIGS), a generalisation of hierarchical lattices. We prove that the rescaled simple random walks converge in the Gromov–Hausdorff–Prokhorov–Skorokhod topology to the limiting diffusion, which coincides with Brownian motion when the resistance dimension is positive. The graph analysis underlying this convergence identifies the degree dimension as the natural correction term for on-diagonal heat-kernel estimates, yielding a unified formulation in the locally finite and locally infinite (scale-free) regimes. Using this framework, we solve the open problem on the diamond hierarchical lattice (DHL) percolation cluster posed by Hambly and Kumagai [Commun. Math. Phys. 295 (2010), 29–69]; this suggests that the Alexander–Orbach-type conjecture fails for the natural Brownian motion on the cluster. Sections 2 to 4 have been formalised in Lean.
Read the full abstract
Numerical Analysis
NEP_MiniMax: An approach for NEPs based on minimax approximation of the split coefficient vector
We propose NEP\_MiniMax, a novel computational method for solving nonlinear eigenvalue problems (NEPs) $T(\lambda)\mathbf{u} = \mathbf{0}$ on a Jordan domain $\Omega \subset \mathbb{C}$. For an NEP in split form $T(x)=\sum_{i=1}^s t_i(x)E_i$, the method applies the m-d-Lawson algorithm to the split coefficient vector-valued function $\mathbf{t}(x)=[t_1(x),\ldots,t_s(x)]^{\textrm{T}}$ on $\Omega$, rather than directly minimizing an error for the matrix-valued function $T$. The resulting rational minimax approximant ${\boldsymbol{\xi}}^*(x)=[r_1^*(x),\ldots,r_s^*(x)]^{\textrm{T}}$ induces the rational matrix surrogate $R^*(x)=\sum_{i=1}^s r_i^*(x)E_i=P^*(x)/q^*(x)\approx T(x)$. The method combines this coefficient-vector approximation with a structure-exploiting linearization technique. A matrix error bound transfers the uniform coefficient-vector approximation accuracy to $R^*$ and yields computable eigenpair residual estimates. Eigenpairs are then computed by solving a polynomial eigenvalue problem $P^*(\lambda) \mathbf{u} = \mathbf{0}$ via a strong linearization that exactly preserves eigenvalue multiplicities of $P^*$. Numerical experiments on some problems from the NLEVP collection demonstrate competitiveness with state-of-the-art methods (e.g., Beyn, NLEIGS, SV-AAA) in efficiency and accuracy, with theoretical error bounds directly relating eigenpair {residuals} to the {split coefficient-vector approximation} quality.
Read the full abstract
Dynamical Systems · Cross-listed from nlin.CD
Hierarchy of extreme-event predictability in turbulence revealed by machine learning
Extreme-event predictability in turbulence is strongly state dependent, yet event-by-event predictability horizons are difficult to quantify without access to governing equations or costly perturbation ensembles. Here we train an autoregressive conditional diffusion model on direct numerical simulations of the two-dimensional Kolmogorov flow and use a CRPS-based skill score to define an event-wise predictability horizon. Enstrophy extremes exhibit a pronounced hierarchy: forecast skill persists from $\approx 1$ to $> 4$ Lyapunov times across events. Spectral filtering shows that these horizons are controlled predominantly by large-scale structures. Extremes are preceded by intense strain cores organizing quadrupolar vortex packets, whose lifetime sharply separates long- from short-horizon events. These results identify coherent-structure persistence as a governing mechanism for the predictability of turbulence extremes and provide a data-driven route to diagnose predictability limits from observations.
Read the full abstract
Statistics Theory
Mixed difference integer-valued GARCH model for $ \mathbb{Z}$-valued time series
In this paper, we introduce flexible observation-driven $\mathbb{Z}$-valued time series models constructed from mixtures of negative and non-negative components. Compared to models based on the standard Skellam distribution or on a difference of two integer-valued variables, our specification offers greater versatility. For example, it easily allows for skewness and bimodality. Furthermore, the observation of one component of the mixture makes interpretation and statistical analysis easier. We establish conditions for stationarity and mixing, and develop a mixed Poisson quasi-maximum likelihood estimator with proven asymptotic properties. A portmanteau test is proposed to diagnose residual serial dependence. The finite-sample performance of the methodology is assessed via simulation, and an empirical application on tick prices demonstrates its practical usefulness.
Read the full abstract
Dynamical Systems · Cross-listed from cond-mat.dis-nn
Optimality and annealing path planning of dynamical analog solvers
Recently proposed analog solvers based on dynamical systems, such as Ising machines, are promising platforms for large-scale combinatorial optimization. Yet, given the heuristic nature of the field, there is very limited insight on optimality guarantees of the solvers, as well as how parameter schedules shape dynamics and outcomes. Here, we develop a dynamical mean-field framework to analyze Ising-machine dynamics for finding the ground state energy of the Sherrington-Kirkpatrick(SK) model of spin glasses and identify mechanisms that enable rapid convergence to provenly near-optimal energies. For a fixed target energy density Ec, we show that solutions are typically reached within O(1) matrix vector multiplications, indicating constant time complexity. We further delineate theoretical limitations arising from different parameter-scheduling trajectories and demonstrate a pronounced benefit of temperature-only annealing for the Coherent Ising Machine. Building on these insights, we propose a general framework for designing optimized parameter schedules, thereby improving the practical effectiveness of Ising machines for complex optimization tasks. The superior performance of the dynamical solvers is illustrated by the attainment of the ground state energy of the SK model.
Read the full abstract
Representation Theory
A note on the classification of simple $SL_2(\bar{\mathbb{F}}_p)$-modules admitting $\bf T$-stable lines in cross characteristic
Let $\bf T$ be the group of diagonal matrices in $SL_2(\bar{\mathbb{F}}_p)$, where $p$ is a prime number. Let $\Bbbk$ be an algebraically closed field of characteristic not equal to $2$ and $p$. We classify all the irreducible $\Bbbk$-representations of $SL_2(\bar{\mathbb{F}}_p)$ that admit $\bf T$-stable lines.
Read the full abstract
History and Overview of Mathematics
Celebrating the Day of $\pi$: Joyful Variations on Euler's Identity
This short essay celebrates the mathematical meaning of Pi Day through Euler's formula \[ e^{ix}=\cos x+i\sin x, \] from which Euler's identity \[ e^{i\pi}+1=0 \] follows immediately. We briefly note the historical background of the formula, usually traced to Euler's Introductio in analysin infinitorum (1748), while also mentioning Roger Cotes's earlier precursor of 1714. We compare Euler's identity, in an explicitly analogical way, with several famous formulas in physics in order to highlight its remarkable compactness and conceptual richness. We then consider a number of joyful variations arising from the same Eulerian source, including the negative-angle case, prime-number multiples, the substitution $x=\pi/2$, and a functional-equation variation of the form \[ f(i\pi x)+1=0. \] This last variation leads naturally to a contrast between rigidity in the holomorphic setting and freedom in the discrete interpolation setting. The central aim is to organize these observations into two simple families of variations: geometric-angle variations and functional-equation variations. The earlier part of the exposition is intended to be accessible to motivated high-school students, while the later discussion points toward more advanced ideas from complex analysis.
Read the full abstract
Combinatorics
Non-uniform Kahn-Kalai, spread, variants, and applications
Building on B.Park and Vondrak's recent generalization of the J.Park-Pham Theorem (formerly known as Kahn-Kalai conjecture) to non-uniform probability measures, this paper introduces the notion of "spread" for the non-uniform setting. This provides a framework to establish 1-statements for subgraph containment in inhomogeneous random graphs with or without a set of forced edges. Using this approach, we derived conditions for the emergence of perfect matchings in the Stochastic Block Model and the Chung-Lu model, and verified that these conditions are in general not tight, but they capture thresholds across a broad range of regimes. Finally, we bridge this non-uniform framework with $\mathcal{G}(n,\textbf{d})$, utilizing a coupling argument to demonstrate thresholds for perfect matchings in $\mathcal{G}(n,\textbf{d})$ for a broad range of degree sequences $\textbf{d}$.
Read the full abstract
Number Theory
Dirichlet Series and Asymptotics for Generalized Legendre Factorials
Let $K$ be a fixed number field, let $\Sigma$ be a finite set of nonzero prime ideals of $\mathcal{O}_K$, and let $f$ be a positive integer-valued function on the prime ideals outside $\Sigma$. We study the ideal-valued factorial defined by $v_{\mathfrak p}(n!_{K,f,\Sigma})=\sum_{k\geq 0}\left\lfloor \frac{n}{f(\mathfrak p)(\mathrm{N}\mathfrak p)^k}\right\rfloor$. Assume that $f(\mathfrak p)=c\,\mathrm{N}\mathfrak p+O((\mathrm{N}\mathfrak p)^{1-\delta})$ for some $c>0$ and $\delta>0$. We derive a Dirichlet series for the logarithmic increments and compare its local prime-power sequence with the ordinary prime-ideal von Mangoldt sequence. A prime-ideal theorem and a Dirichlet hyperbola argument then give $$\log \mathrm{N}_{\Sigma}(n!_{K,f,\Sigma})=c^{-1}n\log n+C_{K,f,\Sigma}n+O(ne^{-a\sqrt{\log n}})$$ for some $a>0$. The linear coefficient is explicit: $C_{K,f,\Sigma}=c^{-1}(\gamma+\kappa_{K,\Sigma}-\log c-1)+J_{K,f,\Sigma}(1)$, where $\kappa_{K,\Sigma}$ is the constant term in the Laurent expansion of $-\zeta'_{K,\Sigma}(s)/\zeta_{K,\Sigma}(s)$ at $s=1$, and $J_{K,f,\Sigma}$ is an absolutely convergent prime-ideal correction near $s=1$. The method also applies to factorial ideals of Legendre subsets whose local class numbers have the corresponding geometric form.
Read the full abstract
Information Theory
Multi-Agent SAC Enabled Beamforming Design for Joint Secret Key Generation and Data Transmission
Physical layer key generation (PLKG) has emerged as a promising solution for achieving highly secured and low-latency key distribution, offering information-theoretic security that is inherently resilient to quantum attacks. However, simultaneously ensuring a high data transmission rate and a high secret key generation rate under eavesdropping attacks remains a major challenge. In time-division duplex (TDD) systems with multiple antennas, we derive closed-form expressions for both rates by modeling the legitimate channel as a time-correlated autoregressive (AR) process. This formulation leads to a highly nonconvex and time-coupled optimization problem, rendering traditional optimization methods ineffective. To address this issue, we propose a multi-agent soft actor-critic (SAC) framework equipped with a long short-term memory (LSTM) adversary prediction module to cope with the partial observability of the eavesdropper's mode. Simulation results demonstrate that the proposed approach achieves superior performance compared with other benchmark algorithms, while effectively balancing the trade-off between secret key generation rate and data transmission rate. The results also confirm the robustness of the proposed framework against intelligent eavesdropping and partial observation uncertainty.
Read the full abstract
Algebraic Geometry
An algorithm for the minimal model program in dimension three
We construct an algorithm for the minimal model program in dimension three over a computable field of characteristic zero admitting a splitting algorithm, such as number fields and the field of algebraic numbers. As auxiliary results, we also construct algorithms for computing bigraded global Hom modules and for computing Stein factorization.