Peer Revenue Play credits. Real papers.

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Thursday 16 April

Mathematical Physics

Blocking of 2D bistable reaction-diffusion fronts by obstacles

We investigate numerically the blocking of two-dimensional bistable reaction diffusion fronts by geometric obstacles. Our goal is to derive quantitative criteria for front propagation in the presence of spatial heterogeneities. Using a conservation law approach, we show that the integral of the reaction term acts as an effective driving force for the front. Combining this insight with the exact one-dimensional traveling wave solution, we construct a reduced analytical model that predicts blocking thresholds. In particular, we obtain explicit conditions for front propagation in a waveguide connected to a conical region of angle theta, valid for widths w less than 4. The model captures the influence of both geometry and nonlinearity, and shows good agreement with numerical simulations. Finally, we extend the analysis to more complex geometries, including checkerboard-like obstacles, and derive simple heuristic rules governing front propagation. ~
Read the full abstract

All authors J.-G. Caputo, G. Cruz-Pacheco, J. Gatlik, B. Sarels

Group Theory

Classifying spaces for families of virtually abelian subgroups of surface braid groups

Given a group $G$ and an integer $n \geq 0$, let $\mathcal{F}_n$ denote the family of all virtually abelian subgroups of $G$ of rank at most $n$. In this article, we show that for each $n \geq 1$, the minimal dimension of a model for the classifying space $E_{\mathcal{F}_n}G$ for the pure braid group of a surface of non-negative Euler characteristic with at least one boundary component or one puncture is equal to the virtual cohomological dimension of $G$ plus $n$. We prove an analogous result for the full braid group of the sphere. As an application, we compute the minimal dimension of a model for the classifying space associated to the family of amenable subgroups of pure surface braid groups.
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

A Nonlinear Separation Principle via Contraction Theory: Applications to Neural Networks, Control, and Learning

This paper establishes a nonlinear separation principle based on contraction theory and derives sharp stability conditions for recurrent neural networks (RNNs). First, we introduce a nonlinear separation principle that guarantees global exponential stability for the interconnection of a contracting state-feedback controller and a contracting observer, alongside parametric extensions for robustness and equilibrium tracking. Second, we derive sharp linear matrix inequality (LMI) conditions that guarantee the contractivity of both firing rate and Hopfield neural network architectures. We establish structural relationships among these certificates-demonstrating that continuous-time models with monotone non-decreasing activations maximize the admissible weight space-and extend these stability guarantees to interconnected systems and Graph RNNs. Third, we combine our separation principle and LMI framework to solve the output reference tracking problem for RNN-modeled plants. We provide LMI synthesis methods for feedback controllers and observers, and rigorously design a low-gain integral controller to eliminate steady-state error. Finally, we derive an exact, unconstrained algebraic parameterization of our contraction LMIs to design highly expressive implicit neural networks, achieving competitive accuracy and parameter efficiency on standard image classification benchmarks.
Read the full abstract

All authors Anand Gokhale, Anton V. Proskurnikov, Yu Kawano, Francesco Bullo

Statistics Theory

On a Probability Inequality for Order Statistics with Applications to Bootstrap, Conformal Prediction, and more

“Behind every limit theorem, there is an inequality” said Kolmogorov. We say “for every inequality, there is an approximate inequality under approximate regularity conditions.” Suppose $X, X'$ are independent and identically distributed random variables. Then $X \le X'$ with a probability of at least $1/2$, irrespective of the underlying (common) distribution. One can ask what happens to the probability if $X, X'$ are independent but not identically distributed. It should be approximately $1/2$ if the distributions are approximately equal. Similarly, what if the random variables are dependent? It should, again, be approximately $1/2$ if the random variables are approximately independent. We explore an extension of this probability inequality involving order statistics and develop approximate versions of such an inequality under violations of independence and identical distribution assumptions. We further show that this inequality can be used as a basis to prove asymptotic validity of bootstrap/subsampling, finite-sample validity of conformal prediction, permutation tests, and asymptotic validity of rank tests without group invariance. Specifically, in the context of resampling inference, our results can be seen as a finite-sample instantiation of some results by Peter Hall and yield an alternative “cheap bootstrap” that applies to high-dimensional data.
Read the full abstract

Optimization and Control

Pricing Electric Vehicle Charging and Station Access via Copositive Duality

Optimized charging of electric vehicles (EVs) at public locations consists of two decisions: how much energy to deliver at what times, which is continuous, and where to plug in, which is binary. This makes optimizing EV charging a mixed-integer linear program (MILP). This discreteness undermines traditional marginal pricing methods. In this paper, we develop the first marginal-price-based mechanism for pricing EV charging with binary station access constraints. Using the result of Burer (2009), we express the EV charging as a completely positive program (CPP), whose dual is a copositive program (COP). This convex dual admits valid shadow prices even though the original allocation problem is discrete and nonconvex. By interpreting the COP dual variables as marginal prices, we construct a pricing mechanism that captures EV supply equipment (EVSE) congestion as well as charging-capacity limits. We prove that the resulting mechanism is revenue-adequate for the operator and individually rational for every EV user, in the strong sense that each user maximizes their own welfare by accepting their assigned charging plan rather than deviating to any alternative option. We further develop problem-specific inner-approximation and dimension-reduction techniques that substantially improve the computational tractability of solving the COP in our setting. Numerical experiments on both small and large scale charging instances demonstrate that our pricing mechanism captures discrete congestion effects and aligns user incentives with the system-optimal assignment, outperforming time-of-use (TOU) and convex relaxation benchmarks.
Read the full abstract

All authors Nanfei Jiang, Yi Zhou, Josh A. Taylor, Mahnoosh Alizadeh

Probability

Nonlinear Schrödinger equations with spatial white noise potential on full space for $d\le 3$

In this paper, we prove existence and uniqueness of energy solutions for nonlinear Schrödinger equations with a multiplicative white noise on $R^d$ with $d\le3$. We rely on an exponential trans-form and conserved quantities for existence of energy solutions. Using paracontrolled calculus, we prove Strichartz inequalities which encode the dispersive properties of the solutions. This allows to obtain local well-posedness for low regularity solutions and uniqueness of energy solutions for various equations. In particular, our results are the first results of propagation without loss of both regularity and localization for such equations in full space as well as the first results on $R^3$ for such singular dispersive SPDEs. We are also obtain local well-posedness in two dimensions for deterministic initial data.
Read the full abstract

Dynamical Systems

A Microeconomic Finance Model with a Multi-Asset Market and a Multi-Investor Heterogeneous Groups

We present a mathematical model of a market with $m$ shares traded across $n$ investor groups, each one with similar motivations and trading strategies. The market of each asset consists of a fixed amount of cash and shares (no additions are allowed over time, so the system is closed), and the trading groups are influenced by trend and valuation motivations when buying or selling each asset, but follow a strategy where the purchase of one asset depends on the price of another, while the sale does not. Using these assumptions and basic microeconomic principles, the mathematical model is derived using a dynamic systems approach. We analyze the stability of the model's equilibrium points and determine the parameter conditions for such stability. First, we show that all equilibria are stable in the absence of a clear emphasis on trend-based valuation for each share. Secondly, for systems where the trading group prioritizes the valuation of each stock and the trend of the other for trading purposes, we establish stability conditions and demonstrate with numerical examples that when instability occurs, it manifests as price oscillations in the stocks. Furthermore, we argue for the existence of periodic solutions via a Hopf bifurcation, taking the momentum coefficient as the bifurcation parameter. Finally, we present examples and numerical simulations to support and expand upon the analytical results. One finding in economics and finance is the existence of cyclical behavior in the absence of exogenous factors, as determined by the momentum coefficient. In particular, a stable equilibrium price becomes unstable as trend-based trading increases.
Read the full abstract

Information Theory

Explicit Constant-Alphabet Subspace Design Codes

The subspace design property for additive codes is a higher-dimensional generalization of the minimum distance property. As shown recently by Brakensiek, Chen, Dhar and Zhang, it implies that the code has similar performance as random linear codes with respect to all "local properties". Explicit algebraic codes, such as folded Reed-Solomon and multiplicity codes, are known to have the subspace design property, but they need alphabet sizes that grow as a large polynomial in the block length. Constructing explicit constant-alphabet subspace design codes was subsequently posed as an open question in Brakensiek, Chen, Dhar and Zhang. In this work, we answer their question and give explicit constructions of subspace design codes over constant-sized alphabets, using the expander-based Alon-Edmonds-Luby (AEL) framework. This generalizes the recent work of Jeronimo and Shagrithaya, which showed that such codes share local properties of random linear codes. Our work obtains this consequence in a unified manner via the subspace design property. In addition, our approach yields some improvements in parameters for list-recovery.
Read the full abstract

Analysis of PDEs

$L^p$-Hodge decomposition and global integral estimates on the Cartan group

The study of Sobolev and Poincaré inequalities for differential forms in Carnot groups and in the more general sub-Riemannian setting is still an open problem in its full generality. One may conjecture that, for general Carnot groups, these inequalities are expressed in terms of suitable graded Lebesgue norms. In recent years, many results have been obtained, both in the Euclidean setting and in the Heisenberg groups, as well as for contact manifolds with bounded geometry. There are also some results for general Carnot groups; however, these do not cover the problem in its full generality. In this paper, we consider a particular Carnot group, the so-called Cartan group (a free Carnot group, of step $3$ with $2$ generators), which provides a natural testing ground for these questions, since its step-three structure already exhibits several phenomena that do not occur in the Heisenberg groups. In this setting, we are able to prove global Poincaré and Sobolev-Gaffney inequalities for differential forms. With the aim of obtaining sharp estimates, we replace the de Rham complex of differential forms with the Rumin complex. The case $p>1$ is carried out after establishing an $L^p$-Hodge decomposition with homogeneous Sobolev classes. We are able to consider also the endpoint case $p=1$; however, as in Euclidean setting, when $p=1$, the operator we deal with provides only weak-type estimates which do not yield a Hodge decomposition analogous to the case $p>1$. Therefore, in this situation the proof follows a different approach, relying on a recent result proved in \cite{BT}.
Read the full abstract

Combinatorics

On the m-point convexity

Let $S\subset \mathbb{R}^d$ $(d\geq 2)$. A set $S$ is said to be $m$-point convex, if for every $m$ distinct points in $S$, at least one of the line-segments determined by them lies in $S$. We also say that $S$ has property $P_m$. Let ${x,y,z}\in \mathbb{R}^{d}$. If $\mathrm{conv}\{x,y,z\}$ is a right triangle, then $\{x,y,z\}$ is called a right triple. A set $S$ is said to have the right-$3$-point property,if, for every right triple of $S$, at least one of the line-segments determined by them belongs to $S$. In particular, it has the double right-$3$-point property, if, for every right triple in $S$, at least two of the line-segments determined by them belong to $S$. In this paper, we further investigate $m$-point convex sets and establish the relationship between the sets with the double right-$3$-point property and convex sets in $\mathbb{R}^d$.
Read the full abstract

All authors Wenzhi Liu, Wei Wang, Liping Yuan, Tudor Zamfirescu

Optimization and Control · Cross-listed from cs.RO

Benchmarking Classical Coverage Path Planning Heuristics on Irregular Hexagonal Grids for Maritime Coverage Scenarios

Coverage path planning on irregular hexagonal grids is relevant to maritime surveillance, search and rescue and environmental monitoring, yet classical methods are often compared on small ad hoc examples or on rectangular grids. This paper presents a reproducible benchmark of deterministic single-vehicle coverage path planning heuristics on irregular hexagonal graphs derived from synthetic but maritime-motivated areas of interest. The benchmark contains 10,000 Hamiltonian-feasible instances spanning compact, elongated, and irregular morphologies, 17 heuristics from seven families, and a common evaluation protocol covering Hamiltonian success, complete-coverage success, revisits, path length, heading changes, and CPU latency. Across the released dataset, heuristics with explicit shortest-path reconnection solve the relaxed coverage task reliably but almost never produce zero-revisit tours. Exact Depth-First Search confirms that every released instance is Hamiltonian-feasible. The strongest classical Hamiltonian baseline is a Warnsdorff variant that uses an index-based tie-break together with a terminal-inclusive residual-degree policy, reaching 79.0% Hamiltonian success. The dominant design choice is not tie-breaking alone, but how the residual degree is defined when the endpoint is reserved until the final move. This shows that underreported implementation details can materially affect performance on sparse geometric graphs with bottlenecks. The benchmark is intended as a controlled testbed for heuristic analysis rather than as a claim of operational optimality at fleet scale.
Read the full abstract

Differential Geometry

The Yang-Mills equation near instanton-anti-instanton configurations

We study the question of whether a sequence of non-instanton Yang-Mills connections can limit to a bubbling configuration composed only of instantons. In the case that the Uhlenbeck limit and the bubbles are of opposite charge, we determine an obstruction coming from deformations of the Uhlenbeck limit. As an application, we prove that instantons are the only solutions of the $\mathrm{SU}(2)$ Yang-Mills equation on $\mathbb{R}^4$ with energy less than $4\pi^2 \left( |\kappa| + 2 \right) + \varepsilon_\kappa,$ where $\kappa$ is the charge. We also prove discreteness of the energy spectrum on the trivial $\mathrm{SU}(2)$-bundle in the range $\left[ 0, 16 \pi^2 \right).$
Read the full abstract

Differential Geometry

Integrable Deformations and Stability of the Ricci Flow

We provide a comparatively simple proof of the dynamical stability of Ricci flow near a linearly stable Ricci-flat ALE metric with integrable deformations. Our proof relies on the equivalence between integrability and an "almost-orthogonality" property of the Ricci-DeTurck tensor, allowing us to analyze the latter directly. We obtain our main results in weighted Holder spaces and then show how to recover the $L^p$-stability theorems of Deruelle-Kroncke and Kroncke-Petersen.
Read the full abstract

Mathematical Physics · Cross-listed from gr-qc

Static Tidal Perturbations of Relativistic Stars: Corrected Center Expansion and Love Numbers-I

We revisit static tidal perturbations of relativistic stars with emphasis on two technical issues in the standard quadrupolar formulation. First, we derive the regular-center Frobenius expansion of the interior even-parity master function and obtain a corrected subleading coefficient, which differs from the expression commonly used in the literature. Second, we derive the static even-parity master equation on a Schwarzschild-de Sitter background, extending the usual asymptotically flat problem to a two-horizon geometry. To place these results on a common footing, we also show how the general interior even-parity system in Regge-Wheeler gauge reduces to the standard quadrupolar equation used in Love-number calculations. Numerical integrations for polytropic equations of state show that the corrected center coefficient affects only subleading initial data and leaves the extracted Love number $k_2$ unchanged within numerical accuracy. Taken together, these results fix the regular-center input to the standard quadrupolar problem and extend the static even-parity formalism to Schwarzschild-de Sitter backgrounds.
Read the full abstract

All authors Emel Altas, Ercan Kilicarslan, Onur Oktay, Bayram Tekin

Algebraic Geometry

Rational analytic syntomic cohomology

We define and study the rational analytic syntomification $X^{\mathrm{Syn}}$ of a partially proper rigid-analytic variety $X$ over $\mathbb{Q}_p$. We establish Poincaré duality and a theory of first Chern classes for the resulting cohomology theory, identify vector bundles on $X^{\mathrm{Syn}}$ with de Rham bundles on the Fargues–Fontaine curve of $X^{\diamondsuit}$ and recover several classical comparison theorems in $p$-adic Hodge theory. We also develop analogues of our results and constructions over $\mathbb{C}_p$.
Read the full abstract

Probability

Quantitative Stability of Many-Marginal Schrodinger Bridge

In this paper, we explore quantitative stability of multi-marginal Schrödinger bridges with respect to the marginal constraints. We focus on the case where the number of marginal constraints is large (i.e. “many-marginals"). When this number increases, we show that the Kullback–Leibler (KL) divergence between two multi-marginal Schrödinger bridges, as measures on the path space, can be asymptotically bounded by the terminal marginal KL divergence and a time-integrated squared discrepancy {that combines} Wasserstein-2 geodesic velocity fields with a log-density gradient term. Our stability upper bound is also asymptotically tight: it converges to zero as the number of marginal constraints increases with unperturbed marginal constraints. To the best of our knowledge, this is the first such stability result that addresses the many-marginal regime, giving error estimates that are asymptotically independent of the number of marginals. To achieve our result, the key step is to derive an asymptotic expansion (of order $k\ge 2$) of Schrödinger potentials with respect to a diminishing regularization coefficient. This result can also be applied to deriving asymptotic expansions of entropic Brenier maps in entropic optimal self-transport problems. As byproducts of our analyses, we also establish the asymptotic expansion of entropic optimal transport cost with respect to the diminishing regularization coefficient when two marginal constraints are sufficiently close. We also prove a stability property of the Schrödinger functional.
Read the full abstract

Number Theory

Counting Theorems for Algebraic Relations

Let X be a set definable in a sharply o-minimal structure. We consider the problem of counting the number of points where X intersects algebraic varieties V over Q of dimension k < codim X, as a function of T := deg(V) + h(V), where h(V) is the log-height of V. In particular, we conjecture that after removing a suitable "algebraic part", this number grows polynomially in T – a generalization of Wilkie's conjecture. We show that this full conjecture implies some open problems in algebraic independence theory. We also formulate a weaker conjecture stating that all intersections above are contained in a poly(T) amount of balls of radius e^{-T}. We then consider the case where X (subset of C^n) is a (compact piece of a) trajectory of a polynomial differential equation satisfying a variant of Nesterenko's D-property. Our main theorem is a proof of the weakened conjecture for such curves when k < sqrt(n) - 1.
Read the full abstract

All authors Gal Binyamini, Noriko Hirata-Kohno, Makoto Kawashima, Yuval Salant

Analysis of PDEs

Combined effect of homogenization and dimension-reduction in the random Neumann sieve problem

We investigate the asymptotic behavior of the solutions to the Neumann sieve problem for the Poisson equation in a thin, randomly perforated domain. The perforations (sieve-holes) are generated by a stationary marked point process. According to the scaling between the domain thickness and the typical hole size, three distinct limiting regimes emerge. We also identify the optimal stochastic integrability condition on the random hole radii that guarantees stochastic homogenization, even in the presence of clustering holes.
Read the full abstract

Dynamical Systems · Cross-listed from cs.LG

One-shot learning for the complex dynamical behaviors of weakly nonlinear forced oscillators

Extrapolative prediction of complex nonlinear dynamics remains a central challenge in engineering. This study proposes a one-shot learning method to identify global frequency-response curves from a single excitation time history by learning governing equations. We introduce MEv-SINDy (Multi-frequency Evolutionary Sparse Identification of Nonlinear Dynamics) to infer the governing equations of non-autonomous and multi-frequency systems. The methodology leverages the Generalized Harmonic Balance (GHB) method to decompose complex forced responses into a set of slow-varying evolution equations. We validated the capabilities of MEv-SINDy on two critical Micro-Electro-Mechanical Systems (MEMS). These applications include a nonlinear beam resonator and a MEMS micromirror. Our results show that the model trained on a single point accurately predicts softening/hardening effects and jump phenomena across a wide range of excitation levels. This approach significantly reduces the data acquisition burden for the characterization and design of nonlinear microsystems.
Read the full abstract

All authors Teng Ma, Luca Rosafalco, Wei Cui, Lin Zhao, Attilio Frangi

Optimization and Control

Lightweight Real-Time ALADIN for Distributed Optimization

This paper presents a real-time computational framework for multi-node distributed optimization by extending the Augmented Lagrangian Alternating Direction Inexact Newton (ALADIN) algorithm. Our approach integrates adjoint sequential quadratic programming (SQP) techniques to enable efficient approximation of Jacobian information within the ALADIN embedded quadratic program, thereby reducing communication overhead. Furthermore, to decrease computational complexity, we design an event-triggered update strategy that avoids updating Hessian and Jacobian matrices at every iteration. The proposed method achieves local convergence and enhanced communication efficiency, making it well suited for time-critical applications. Numerical experiments demonstrate that our approach achieves competitive performance while exhibiting superior computational efficiency in real-time scenarios, validating its practical applicability for time-sensitive distributed optimization challenges.
Read the full abstract

All authors Yifei Wang, Xuhui Feng, Shimin Pan, Liangfan Zhu, Xu Du, Apostolos I. Rikos

Combinatorics

Evaluations of some series via the WZ method

In this paper, we evaluate some series via the WZ method, and confirm several previous conjectures. For example, we prove the following two identities conjectured by the second author: $$\sum_{k=0}^{\infty} \frac{(28k^2 + 10k + 1) \binom{2k}{k}^5}{(6k + 1)(-64)^k \binom{3k}{k} \binom{6k}{3k}} = \frac{3}{\pi}$$ and $$\sum_{k=1}^\infty \frac{d^4}{dk^4}\left(\frac{(21k-8)\Gamma(k+1)^2}{k^3\Gamma(2k+1)}\right)=\frac{1959}2\zeta(6)-432\zeta(3)^2. $$
Read the full abstract

Number Theory

Gelfand–Kirillov dimension and mod $p$ cohomology for inner forms of $\mathrm{GL}_2$

Under standard assumptions, we compute the GK-dimension of Hecke eigenspaces in the mod $p$ cohomology of an inner form $D^\times$ of $\mathrm{GL}_2$ over a totally real field unramified at $p$, allowing $D$ to be a division algebra at $p$. Our arguments also apply when $D$ is a matrix algebra at $p$, in which case they give a simplified proof of a theorem of Breuil–Herzig–Hu–Morra–Schraen.
Read the full abstract

Optimization and Control

A Robust Optimization Approach for Scheduling with Uncertain Start-Time Dependent Costs

In this work, we study a single-machine scheduling problem that aims at minimizing the total cost of a schedule subject to start-time dependent costs. This framework naturally captures scenarios where costs fluctuate throughout the day, such as time-varying energy or labor prices. To model more realistic scenarios, we assume that these costs lie within a budgeted uncertainty set and propose a two-stage robust optimization approach. In a first stage, the order in which activities should be executed is decided. After a cost scenario has been revealed, the starting times for each activity are established, subject to the ordering from the first stage. We demonstrate that the proposed problem is NP-hard and not approximable, implying the complexity of its robust counterpart. Furthermore, we show that already evaluating a first-stage solution is NP-hard when the uncertainty set is discrete. We develop models and solution methods for both continuous and discrete budgeted uncertainty. In computational experiments, we compare these approaches and demonstrate the advantages of including uncertainty beforehand.
Read the full abstract

All authors Sofía Rodríguez-Ballesteros, Javier Alcaraz, Laura Anton-Sanchez, Marc Goerigk, Dorothee Henke

Differential Geometry

On the existence of toric ALE and ALF gravitational instantons

We establish existence and uniqueness results for asymptotically locally Euclidean (ALE) and asymptotically locally flat (ALF) gravitational instantons. In particular, we prove the existence of a unique, Ricci-flat, toric ALE and ALF gravitational instanton, for every admissible rod structure, that is smooth up to possible conical singularites. We also give an elementary proof that any toric ALE or ALF self-dual instanton is a multi-Eguchi-Hanson or multi-Taub-NUT solution.
Read the full abstract

Rings and Algebras

Projector additive group codes

Let $F=\mathbb{F}_q$ and let $K=\mathbb{F}_{q^m}$ be a finite extension of $F$. An additive left group code is a left $FG$-submodule of the group algebra $KG$. Classical idempotent group codes describe images of $KG$-linear projectors and are necessarily $K$-linear. They therefore do not provide a sufficiently broad framework for additive group codes, which need not be $K$-linear. In this paper, we develop a projector-based approach for the study of additive left group codes. We distinguish between restricted idempotent additive group codes of the form $FGe$, where $e\in KG$ is an idempotent, and projector additive left group codes, which are images of arbitrary $FG$-linear projectors on $KG$. While $KG$-linear projector group codes coincide with classical idempotent group codes, their additive counterparts do not, in general, coincide. We show that projector additive group codes provide constructions beyond the restricted idempotent setting, and we give examples in both the semisimple and non-semisimple cases with parameters not attained by restricted idempotent additive group codes. The projector framework also provides effective algebraic tools for studying duality. We relate trace-Euclidean and trace-Hermitian duality to adjoints of $FG$-linear projectors, characterize LCD additive group codes through self-adjoint projectors, and obtain sufficient conditions for self-duality. We further study Murray–von Neumann equivalence of projectors and show that it characterizes isomorphism of their images as left $FG$-modules, thereby providing a module-theoretic classification tool for projector additive group codes. Finally, we interpret quotients by orthogonal codes in terms of module duals.
Read the full abstract

Number Theory

Another factor of integer polynomials with minimal integrals

Let $N$ be a positive integer and let $S_N$ be the set of polynomials with integer coefficients, degree less than $N$, and minimal positive integral over $[0,1]$. D. Bazzanella initiated the study of $S_N$ because of its relation to the distribution of prime numbers. Indeed, it is possible to prove that $\sum_{p^m \leq N} \log p = -\log \int_0^1 P(x) \mathrm{d} x$ for every $P \in S_N$, where the sum runs over prime numbers $p$ and positive integers $m$ such that $p^m \leq N$. For each real number $t$, let $\lfloor t \rfloor$ denote the maximal integer not exceeding $t$. The main result of this paper states that there exist infinitely many polynomials $P \in S_N$ such that $\big(x^3(1 - x)^2\big)^{\lfloor N / 6 \rfloor}$ divides $P(x)$ in $\mathbb{Z}[x]$. This improves upon a similar result of Sanna, who proved the same claim but with the lower-degree polynomial $\big(x(1-x)\big)^{\lfloor N / 3 \rfloor}$ in place of $\big(x^3(1 - x)^2\big)^{\lfloor N / 6 \rfloor}$.
Read the full abstract

Number Theory

Computer vision and converse theorems

Random matrices provide a well-established statistical model for a range of arithmetic phenomena. In this paper, we investigate the extent to which one- and two-dimensional convolutional neural networks (CNNs) can distinguish between arithmetic data arising from elliptic curves with conductor in a fixed interval and random matrix data drawn from the same Sato-Tate distribution. Inspired by converse theorems in the Langlands program, we represent each elliptic curve together with its twists as a vector field and, subsequently, encode that vector field as a digital image. We observe that a two-dimensional CNN trained on this image data is better able to separate conductor families from random matrix data than a one-dimensional CNN trained on vectors of Frobenius traces without twisting data. We also observe that the same two-dimensional architecture can predict the analytic rank of an elliptic curve, and it does so by factoring through the (untwisted) Frobenius traces.
Read the full abstract

All authors Yang-Hui He, Kyu-Hwan Lee, Thomas Oliver, Yidi Qi

Probability

The Multinomial Allocation Model and the Random Box Load

We revisit the random allocation model in which $n$ balls are independently placed into $N$ boxes with probabilities $q_1,\ldots,q_N$. A classical asymptotic result due to Kolchin, Sevastyanov, and Chistyakov for the expectations, variances, and covariances of the occupancy counts is reformulated in a compact and transparent form in terms of the load of a randomly selected box. We further derive explicit two-sided bounds for the associated remainder terms, obtained under weaker assumptions than those previously required.
Read the full abstract