Information Theory
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Wednesday 8 April
Tag-based physical layer authentication (PLA) has garnered significant attention due to its low complexity and enhanced security. However, existing PLA schemes encounter two challenges. First, unintended user interference, which overlaps with the authentication signal, corrupts the tag and degrades authentication performance. Second, the vulnerability introduced by direct embedding of the raw tag exposes the tag to the adversary and degrades the security. To address these challenges, this paper proposes a novel frozen-tag-based PLA framework. Different from typical schemes that directly embed the uncoded tag into the signal, a well-designed frozen tag is inserted for authentication, where the frozen tag is generated based on the concept of polar codes with the anchor information as information bits and raw tags as frozen bits. Accordingly, the proposed PLA framework offers two principal advantages. First, the authentication performance is improved since the legitimate receiver can decode the frozen tag and mitigate unintended user interference. Second, the authentication process becomes indecipherable to the illegitimate receiver due to the concealment of the raw tags. Furthermore, we conduct a comprehensive analysis of the proposed framework in terms of robustness, security, and compatibility. Theoretical analysis and simulation demonstrate that the proposed frozen-tag-based PLA framework not only enhances the detection performance but also significantly degrades Eve's capability to estimate the raw tags.
Dynamical Systems
Curves of tangencies of foliation pairs and normalizing transformations
In this work we give a complete description of the collection of curves of tangencies induced by germs of foliation pairs – non dicritical and dicritical – given by analytic differential equations with degenerated non dicritical and dicritical singularities, satisfying some genericity assumptions. To this purpose we use local models and analytic normalizing transformations. Moreover, for each natural number $k$ we obtain $k$-normal forms for the normalizing transformations. These normal forms are used to give parametrizations, up to a finite jet, of the branches of the curves of tangencies. We also prove that under natural genericity assumptions any germ of analytic curve having pairwise transversal smooth branches is realized as curve of tangencies of a – non dicritical and dicritical – foliation pair.
Read the full abstract
Algebraic Geometry
Differential graded categories in holomorphic symplectic geometry
Let $(\mathrm{X},\sigma)$ be a holomorphic symplectic manifold. We study the differential graded category of canonical Lagrangian $\mathrm{D}$-branes $\mathcal{D}_\mathrm{Lag}(\mathrm{X},\sigma)$ along with its deformation quantisation, spanned by quantised orientations, $\mathcal{DQ}(\mathrm{X},\sigma)$, and the virtual de Rham category $\mathcal{DR}^{\mathrm{vir}}(\mathrm{X},\sigma)$. We prove the formality of these dg categories when localised at a countable collection of orientable compact Kähler Lagrangian submanifolds with pairwise clean intersections. Along the way, we define Kaledin classes of minimal $\mathrm{A}_\infty$-categories and show that they are the obstructions to formality. In addition, we obtain a formality criterion for flat weakly proper Calabi-Yau dg categories.
Read the full abstract
Analysis of PDEs
Blow-up and sharp lifespan estimates for a weakly coupled system of semilinear wave equations on a compact Lie group
In this paper, we investigate the blow-up in finite time and the corresponding lifespan estimates for a weakly coupled system of wave equations on a compact Lie group. In particular, we show how the Cauchy data and the presence of lower order terms affect the lifespan of local in-time solutions.
Read the full abstract
Functional Analysis
The Bishop-Phelps-Bollobás property for the numerical radius: a Zizler-type approach
We investigate the Bishop-Phelps-Bollobás property for the numerical radius (BPBp-nu) through a Zizler-type perspective on the classical Bishop-Phelps-Bollobás property (BPBp). This approach allows us to establish two new results: the real Banach space $\ell_\infty$ satisfies the BPBp-nu, while the complex space $\ell_1 \oplus_\infty c_0$ does not. Note that the latter provides the first natural example (constructed without renorming techniques) of a Banach space where the numerical radius attaining operators are dense but the BPBp-nu fails. Along the way, we strengthen the main results of the paper [Kim et al, On the Bishop-Phelps-Bollobás theorem for operators and numerical radius, Studia Math., 2016] concerning the interplay between the BPBp for the pair $(X,Y)$ and the BPBp-nu for a direct sum $X\oplus Y$ of Banach spaces. We further explore the validity of the Zizler-type BPBp across different pairs of Banach spaces, and how this property relates to the classical BPBp and the BPBp-nu. Finally, we specialize our analysis to the framework of compact operators.
Read the full abstract
Number Theory
Reduced Unitary Whitehead Groups over Function Fields of p-adic Curves
Let $F_0$ be the function field of a curve over a $p$-adic field $K,$ and let $F$ be a quadratic extension over $F_0$. Let $A$ be a central simple algebra over $F$ of period $2,$ and let $\tau$ be a $F/F_0$-involution on $A$. We show the triviality of the reduced unitary Whitehead group $SK_1U( A, \tau)$ if $p\neq 2$.
Read the full abstract
Combinatorics
Newton polytopes of immanants of some combinatorial matrices
The immanants of combinatorial matrices have many significant properties, including m-positivity and Schur positivity. While the immanants of Jacobi-Trudi matrices are known to be both m-positive and Schur positive, those of Giambelli matrices have only been proven to be m-positive, with Schur positivity remaining a conjecture. These positivity properties rely heavily on lattice path interpretations. In this paper, we study the Newton polytopes of immanants for these two classes of matrices. Using the lattice path method, we verify the saturation property for the Newton polytopes of Jacobi-Trudi matrices in special cases. For Giambelli matrices, we prove that this property holds for all immanants. To achieve this, we obtain the explicit coefficients of the largest monomial (in the dominance order) in the monomial expansion of the immanants of Giambelli matrices.
Read the full abstract
Information Theory · Cross-listed from cs.CL
The Detection-Extraction Gap: Models Know the Answer Before They Can Say It
Modern reasoning models continue generating long after the answer is already determined. Across five model configurations, two families, and three benchmarks, we find that 52–88% of chain-of-thought tokens are produced after the answer is recoverable from a partial prefix. This post-commitment generation reveals a structural phenomenon: the detection-extraction gap. Free continuations from early prefixes recover the correct answer even at 10% of the trace, while forced extraction fails on 42% of these cases. The answer is recoverable from the model state, yet prompt-conditioned decoding fails to extract it. We formalize this mismatch via a total-variation bound between free and forced continuation distributions, yielding quantitative estimates of suffix-induced shift. Exploiting this asymmetry, we propose Black-box Adaptive Early Exit (BAEE), which uses free continuations for both detection and extraction, truncating 70–78% of serial generation while improving accuracy by 1–5pp across all models. For thinking-mode models, early exit prevents post-commitment overwriting, yielding gains of up to 5.8pp; a cost-optimized variant achieves 68–73% reduction at a median of 9 API calls. Code is available at https://github.com/EdWangLoDaSc/know2say.
Read the full abstract
Numerical Analysis
Neural parametric representations for thin-shell shape optimisation
Shape optimisation of thin-shell structures requires a flexible, differentiable geometric representation suitable for gradient-based optimisation. We propose a neural parametric geometry representation (NRep) for shells based on a neural network with periodic activation functions. The NRep is defined using a multi-layer perceptron (MLP), which maps the parametric coordinates of mid-surface vertices to their physical coordinates. A structural compliance optimisation problem is posed to optimise the shape of a thin-shell parameterised by the NRep subject to a volume constraint, with the network parameters as design variables. The resulting shape optimisation problem is solved using a gradient-based optimisation algorithm. Benchmark examples with classical solutions and comparisons with the free-form deformation method demonstrate that the proposed NRep is capable of representing shell geometries with local geometric features using a small set of network parameters. The robustness of the approach has been demonstrated with different initial geometries, boundary conditions and neural network hyperparameters. The approach also exhibits potential for complex lattice-skin structures, owing to the compact and expressive geometry representation afforded by the NRep.
Read the full abstract
Combinatorics
Short proofs in combinatorics, probability and number theory II
We give a quintet of proofs resulting from questions posed by Erdős. These questions concern ordinary lines in planar point sets, sequences with uniformly small exponential sums, $K_4$-free $4$-critical graphs with few chords in any cycle, a counterexample to a "fewnomial" version of the Erdős–Turán discrepancy bound, and a finiteness theorem for integers $n$ such that $n-a k^2$ is prime for all $k\leq \sqrt{n/a}$ coprime to $n$ (for fixed $a\in\mathbb Z_+$). Each proof is due to an internal model at OpenAI.
Read the full abstract
Differential Geometry
Universal gradient estimates for solutions of $\Delta_{p,f}u+au^{\sigma}\ln u=0$ on complete Riemannian manifolds
In this paper, we consider the weighted $p$-Laplacian equation $$ \Delta_{p,f}u+au^{\sigma}\ln u=0$$ defined on a complete smooth metric measure space under the conditon that the $m$-Bakry-Émery Ricci curvature has a lower bound, where $a$, $\sigma$ are two nonzero real constants. By applying the Nash-Moser iteration, we obtain sharp gradient estimates and thereby establish Liouville theorems for the above equation.
Read the full abstract
Algebraic Geometry
Cohomological aspects of power ideals
We show that the space of sections of any line bundle on the augmented wonderful variety of a hyperplane arrangement has the structure of a coalgebra. These coalgebras correspond to the hyperplane arrangement power ideals of Ardila and Postnikov, which include zonotopal algebras as a special case. By proving cohomology vanishing results on augmented wonderful varieties, we recover many results about zonotopal algebras. We also interpret the "superspace" zonotopal algebras of Rhoades, Tewari, and Wilson in terms of the sections of vector bundles on the augmented wonderful variety, and we use this interpretation to prove a formula that they conjectured for the Hilbert series of the superspace version of the central zonotopal algebra.
Read the full abstract
Algebraic Geometry
Finite-Node Perverse Schobers and Corrected Extensions for Conifold Degenerations
We study one-parameter conifold degenerations whose central fiber has finitely many ordinary double points. Working within a deliberately minimal finite-node bulk/localized-sector formalism, we identify the first categorical layer suggested by the corrected finite-node perverse extension and its mixed-Hodge-module package. Assuming that the local ordinary-double-point coupling pattern admits categorical realization in this finite-node setting, we formalize the corresponding local and finite-node data over a chosen bulk category, prove compatibility of their specified shadows with the corrected finite-node perverse extension established in earlier work, and isolate one localized categorical sector per node. We also extract a first finite combinatorial skeleton encoding the nodewise coupling pattern. The paper does not claim a universal perverse-schober theory for arbitrary singular Calabi–Yau degenerations, nor a categorical wall-crossing theory. Rather, it provides the foundational finite-node categorical formalization layer above the corrected perverse and mixed-Hodge-module packages in the conifold degeneration.
Read the full abstract
Optimization and Control
Hot Standby in Ammonia Synthesis Reshapes Market Equilibrium in Renewable P2A Systems: A Potential Game Approach
Integrating renewable generation, hydrogen production, and renewable ammonia (RA) synthesis into power-to-ammonia (P2A) systems creates interactions across electricity and hydrogen markets. Limited operational flexibility, however, places RA at a disadvantage at the Nash equilibrium (NE). Recent advances in ammonia synthesis reactor design enable hot standby (HSB) operation, improving flexibility but introducing integer decision variables that complicate market equilibrium analysis. To address this challenge, we develop a potential game model and derive a convergent {\epsilon}-approximate equilibrium via an iterative best-response approach. Case studies show that HSB reduces RA's reliance on hydrogen purchases and increases its profit by 20.14%. More importantly, HSB shifts the market equilibrium toward a more mutually beneficial outcome.
Read the full abstract
Numerical Analysis
A Semi-Lagrangian Spherical Essentially Non-Oscillatory (SENO) Scheme for Advection Equations of S2-valued Functions
We develop a numerical scheme for solving the advection equation of $\mathbb{S}^2$-valued functions of real variables, which models the time-evolution of a $\mathbb{S}^2$-valued mapping on the real line by a known velocity field. The idea is to extend the semi-Lagrangian method for the linear scalar advection equation. We first construct the backward flow map between two adjacent time levels and then interpolate the discrete ordered data of $\mathbb{S}^2$. To handle $\mathbb{S}^2$-functions which have kinks or sharp discontinuity in their components, we incorporate the Spherical Essentially Non-Oscillatory (SENO) interpolation method, which effectively reduces the spurious oscillations in high-order reconstructions. We will show multiple examples to demonstrate the accuracy and effectiveness of the proposed algorithm for the partial differential equation of $\mathbb{S}^2$-functions.
Read the full abstract
Mathematical Physics
Clothoid helices obtained via the Lie-Darboux method
The clothoid helices that have both curvature and torsion directly proportional to the arclength are obtained via the Lie-Darboux method and analyzed in some detail. Shifted counterparts are also introduced and studied within the same framework.
Algebraic Geometry · Cross-listed from cs.MS
Polylab: A MATLAB Toolbox for Multivariate Polynomial Modeling
Polylab is a MATLAB toolbox for multivariate polynomial scalars and polynomial matrices with a unified symbolic-numeric interface across CPU and GPU-oriented backends. The software exposes three aligned classes: MPOLY for CPU execution, MPOLY_GPU as a legacy GPU baseline, and MPOLY_HP as an improved GPU-oriented implementation. Across these backends, Polylab supports polynomial construction, algebraic manipulation, simplification, matrix operations, differentiation, Jacobian and Hessian construction, LaTeX export, CPU-side LaTeX reconstruction, backend conversion, and interoperability with YALMIP and SOSTOOLS. Versions 3.0 and 3.1 add two practically important extensions: explicit variable identity and naming for safe mixed-variable expression handling, and affine-normal direction computation via automatic differentiation, MF-logDet-Exact, and MF-logDet-Stochastic. The toolbox has already been used successfully in prior research applications, and Polylab Version 3.1 adds a new geometry-oriented computational layer on top of a mature polynomial modeling core. This article documents the architecture and user-facing interface of the software, organizes its functionality by workflow, presents representative MATLAB sessions with actual outputs, and reports reproducible benchmarks. The results show that MPOLY is the right default for lightweight interactive workloads, whereas MPOLY-HP becomes advantageous for reduction-heavy simplification and medium-to-large affine-normal computation; the stochastic log-determinant variant becomes attractive in larger sparse regimes under approximation-oriented parameter choices.
Read the full abstract
Dynamical Systems
Boundary Hopf bifurcations in three-dimensional Filippov systems
For piecewise-smooth ordinary differential equations, the occurrence of a Hopf bifurcation on a switching surface is known as a boundary Hopf bifurcation. Boundary Hopf bifurcations are codimension-two, so occur at points in two-parameter bifurcation diagrams. From any such point there issues a curve of grazing bifurcations, where the limit cycle born in the Hopf bifurcation hits the switching surface. For Filippov systems, these are usually grazing-sliding bifurcations whose local dynamics are dictated by piecewise-linear maps. In general, these maps have many independent parameters and extraordinarily rich dynamical behaviour. We show that for three-dimensional Filippov systems only a two-parameter family of piecewise-linear maps is relevant, because sliding motion induces a loss of dimension, and the stability of the limit cycle is degenerate at the Hopf bifurcation. We derive explicit formulas for the two parameters in terms of quantities associated with the boundary Hopf bifurcation, and perform a comprehensive numerical analysis to characterise the attractor of the family, which may be chaotic. The results are illustrated with a pedagogical example, a pest control model, and a model of a food chain with threshold-based harvesting. To evaluate the parameters, we use a formula for the linear term of the discontinuity map associated with grazing-sliding bifurcations. In this paper we present a new, simpler derivation of this formula for $n$-dimensional systems based on displacements from a virtual counterpart.
Read the full abstract
Numerical Analysis
Nitsche's method for the stationary Boussinesq system under mixed and nonlinear boundary conditions
In this paper we analyze Nitsche's method for the stationary Boussinesq system with Navier's slip and a nonlinear boundary condition. Our analysis of the formulation establishes the robustness of a finite elements scheme in arbitrarily complex boundaries. The well-posedness of the discrete problem is established using fixed-point theorems under a standard smallness assumption on the data. We also provide optimal convergence rates for the approximation error. Furthermore, the efficiency and reliability of residual-based a posteriori error estimators are established. We validate our theory through several numerical tests.
Read the full abstract
Representation Theory
Invariants of derived equivalences for admissible fractional Brauer graph algebras
Characterizing derived equivalences between algebras via combinatorial structures has recently become a popular topic. In this paper, we study admissible fractional Brauer graph algebras, a new subclass of self-injective special biserial algebras, and provide several easily checkable combinatorial invariants for derived equivalences between them. In particular, we show that these algebras can be viewed as repetitive algebras and $r$-fold trivial extensions of gentle algebras.
Read the full abstract
Numerical Analysis
$LDL^\top$ Factorization-based Generalized Low-rank ADI Algorithm for Solving Large-scale Algebraic Riccati Equations
The low-rank alternating direction implicit (ADI) method is an efficient and effective solver for large-scale standard continuous-time algebraic Riccati equations that admit low-rank solutions. However, the existing low-rank ADI algorithm for Riccati equations (RADI) cannot be directly applied to general-form Riccati equations. This paper introduces a generalized RADI algorithm based on an $LDL^\top$ factorization, which efficiently handles the general Riccati equations arising in important applications like state estimation and controller design. An efficient implementation is presented that avoids the Sherman-Morrison-Woodbury formula and instead uses a low-rank Cholesky factor ADI method as the base algorithm to compute low-rank factors of general-form Riccati equations. Sample MATLAB-based implementations of the proposed algorithm are also provided. An approach for automatically and efficiently generating ADI shifts is discussed. Numerical examples solving several Riccati equations of orders ranging from $10^6$ to $10^7$ accurately and efficiently are presented, demonstrating the effectiveness of the proposed algorithm.
Read the full abstract
Metric Geometry
A characterization of the sphere in terms of the stereographic projection
Let $K$ be a convex body in the 3-dimensional Euclidian space $\mathbb{E}^3$ and let $N,S$ in the boubdary bd$K$ of $K$, $N\not=S$. Suppose that the support plane $\Pi_S$ of $K$ at $S$ is unique. For every point $x$ in bd$ K$, different than $N$, we define the stereographic projection $\Psi:\textrm{bd}K\backslash \{N\} \rightarrow \Pi_S$ of $x$ onto $\Pi_S$ as the point $y:=L(N,x)\cap \Pi_S$. It is a well known property of the sphere $\mathbb{S}^2$ in $\mathbb{E}^3$ that the stereographic projection maps circles onto circles (see \cite{Hilbert} pag. 248). In this work we investigate what geometric elements determines that this property is fulfilled. Here we demonstrate that the following two properties of a convex body $K\subset \mathbb{E}^3$ in terms of the stereographic projection characterize the sphere in $\mathbb{E}^3$: (1) The cones defined by the sections of $K$ and the point $N$ are axially symmetric (that is, they are invariant under a rotation by an angle of $\pi$). (2) given a section $K_\Gamma$ of $K$, the rotation that leaves the cone defined by $K_\Gamma$ and $N$ invariant is such that it maps $K_\Gamma$ into a homothetic figure to $\Psi(K_\Gamma)$ by a homothety with center of homothety at $N$. An important element in the proof of the main theorem of this work is a cha\-racterization of the circle based on a geometric property, which will be called the stereographic property. It is worth highlighting that the stereographic projection defined on the sphere maps circles onto circles is intimately linked to the conditions (1) and (2) and the stereographic property of the circle.
Read the full abstract
Differential Geometry
Linking at Infinity and Scalar Curvature Decay on Non-Compact Manifolds
We study complete non-compact manifolds of positive scalar curvature, with a focus on how curvature decay is constrained by topology at infinity. Our first main result shows that topological linking at infinity forces polynomial decay of scalar curvature on manifolds of weakly bounded geometry. This result provides a conceptual generalization of recently discovered examples of metrics with quadratic scalar curvature decay. Building on this decay mechanism, we develop an obstruction theory localized at the ends of non-compact manifolds. Using $\mu$–bubble exhaustions together with the analysis of stable minimal hypersurfaces and index theory, we obtain qualitative obstructions to uniformly positive scalar curvature on individual ends.
Read the full abstract
Numerical Analysis · Cross-listed from cs.CE
Shocks without shock capturing: Information geometric regularization of finite volume methods for Navier–Stokes-like problems
Shock waves in high-speed fluid dynamics produce near-discontinuities in the fluid momentum, density, and energy. Most contemporary works use artificial viscosity or limiters as numerical mitigation of the Gibbs–Runge oscillations that result from traditional numerics. These approaches face a delicate balance in achieving sufficiently regular solutions without dissipating fine-scale features, such as turbulence or acoustics. Recent work by Cao and Schäfer introduces information geometric regularization (IGR), the first inviscid regularization method for fluid dynamics. IGR replaces shock singularities with smooth profiles of adjustable width, without dissipating fine-scale features. This work provides a strategy for the practical use of IGR in finite-volume-based numerical methods. We illustrate its performance on canonical test problems and compare it against established approaches based on limiters and Riemann solvers. Results show that the finite volume IGR approach recovers the expected solutions in all cases. Across canonical benchmarks, IGR achieves accuracy competitive with WENO and LAD shock-capturing schemes in both smooth and discontinuous flow regimes. The IGR approach is computationally light, with meaningfully fewer memory accesses and arithmetic operations per time step.
Read the full abstract
Analysis of PDEs
Global well-posedness of the one-phase Muskat problem with surface tension
In this paper, we establish the global well-posedness of the one-phase Muskat problem with surface tension for small initial data. This problem describes the motion of the interface separating a wet region from a dry region within a porous medium, a process governed by Darcy's law. Although physically essential, the inclusion of surface tension introduces an additional challenge. We prove that if the initial free boundary is sufficiently small in $H^s$, $s>d/2+1$, then the problem admits a unique global strong solution. Moreover, the solution converges to zero in Lipschitz norm as $t\rightarrow\infty$. To the best of our knowledge, this work constitutes the first global well-posedness result for the one-phase Muskat problem with surface tension.
Read the full abstract
Analysis of PDEs
Global hypoellipticity and global solvability of Vekua-type operators associated with diagonal operators on compact Lie groups
In this paper, we study Vekua-type operators associated with diagonal operators on compact Lie groups. Characterizations of global hypoellipticity and global solvability properties are presented on classes of Vekua-type operators with constant coefficients. We also present sufficient conditions in order to get global solvability for a class of Vekua-type operators with non-constant coefficients.
Read the full abstract
Analysis of PDEs
Local H theorem for Enskog and Enskog-Vlasov equations with a modified Enskog factor
The local H theorem is shown to hold for the Enskog equation with a modified Enskog factor proposed by the authors [Phys. Rev. E 111, 065108 (2025)]. This is a stronger statement than the global one in the same paper and has been obtained along the lines of Mareschal et al. [Phys. Rev. Lett. 52, 1169-1172 (1984)] for the modified (or revised) Enskog equation. Furthermore, it is shown that the local H theorem also holds for the corresponding Enskog-Vlasov equation.
Read the full abstract
Combinatorics
Almost amorphic association schemes
An association scheme is called amorphic if every possible fusion of relations gives rise to another association scheme. In earlier work, we showed that if an association scheme has at most one relation that is neither strongly regular of Latin square type nor strongly regular of negative Latin square type, then it must be amorphic. We now construct non-amorphic $d$-class association schemes in which precisely two relations are not strongly regular of Latin square type or strongly regular of negative Latin square type, for any $d \geq 4$. We also raise the question whether different types of strongly regular graphs can coexist in an association scheme. Among some other results, we show that if one of the relations is a lattice graph, then any other strongly regular relation in the scheme must be of Latin square type.
Read the full abstract
Probability
Random permutations from $q$-Demazure products
We study the $q$-deformation of the Demazure product model from arXiv:2407.21653. Consider the longest element $w_0$ in $S_n$ written as a reduced word in simple transpositions. Independently delete each transposition with probability $1-p$ and apply the $q$-Demazure product to the remaining ones. We show that the law of the resulting permutation converges as $n \to \infty$ to a deterministic permuton, which coincides with the $q=0$ case studied in arXiv:2407.21653 for adjusted probability $p'=p(1-q)/(1-qp)$. This resolves Conjecture 1.13 from arXiv:2407.21653 and identifies the limiting permuton explicitly.
Read the full abstract
Optimization and Control
A Generalized Sinkhorn Algorithm for Mean-Field Schrödinger Bridge
The mean-field Schrödinger bridge (MFSB) problem concerns designing a minimum-effort controller that guides a diffusion process with nonlocal interaction to reach a given distribution from another by a fixed deadline. Unlike the standard Schrödinger bridge, the dynamical constraint for MFSB is the mean-field limit of a population of interacting agents with controls. It serves as a natural model for large-scale multi-agent systems. The MFSB is computationally challenging because the nonlocal interaction makes the problem nonconvex. We propose a generalization of the Hopf-Cole transform for MFSB and, building on it, design a Sinkhorn-type recursive algorithm to solve the associated system of integro-PDEs. Under mild assumptions on the interaction potential, we discuss convergence guarantees for the proposed algorithm. We present numerical examples with repulsive and attractive interactions to illustrate the theoretical contributions.