Peer Revenue Equity in science

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Wednesday 4 March

Functional Analysis

Bounded Multilinear Functionals and Multicontinuous Functions on n-Normed Spaces

In this paper, we introduced some notions on the n-Normed Spaces. Those are bounded k-linear (or multilinear) functionals and k-continuous (or multicontinuous) functions with k \in \mathbb{N}. We defined k-linear functionals under several types of boundedness, and constructed the corresponding dual spaces based on each type of boundedness. We then proved that these types of boundedness are actually equivalent. This means the boundedness of a multilinear functional can be verified using any of the equivalent notions of boundedness that we defined earlier. The equivalent also implies that all of the resulting dual spaces are identical as a set. We also defined two norms on the dual spaces and showed that both norms are equivalent. Moreover, we gave some examples of bounded k-linear functionals on an n-normed space and calculated their norms with respect to the types of boundedness. We also defined a new notion of k-continuous function in n-normed spaces. Then we gave a relation between the bounded k-linear functional and k-continuous function in n-normed spaces.
Read the full abstract

All authors Harmanus Batkunde, Muh. Nur, Al Azhary Masta, Meilin Imelda Tilukay

Representation Theory

Representations of the modular shifted super Yangian $Y_{1|1}(\sigma)$

Let $Y_{1|1}$ be the Yangian associated to the general linear Lie superalgebra $\mathfrak{gl}_{1|1}$, defined over an algebraically closed field $\mathbbm{k}$ of characteristic $p>2$. In this paper, we classify the finite dimensional irreducible representations of the restricted super Yangian $Y_{1|1}^{[p]}$ and the restricted truncated shifted super Yangian $Y_{1|1,\ell}^{[p]}(\sigma)$.
Read the full abstract

Statistics Theory

On large bandwidth matrix values kernel smoothed estimators for multi-index models

The kernel smoothing with large bandwidth values causes oversmoothing or underfitting in general. However, when irrelevant variables are included, the corresponding large bandwidth values are known to have an effect of shrinking them. This study investigates asymptotic properties of the kernel conditional density estimator and the regression estimator with large bandwidth matrix elements for cases of multi-index model. It is clarified that the optimal convergence rate of the estimators depends on not the number of the variables but the effective dimension without eliminating the irrelevant variables. Thus, the kernel conditional density estimator and regression estimator are demonstrated to equip the reduction of the curse of dimensionality by nature. Finite sample performances are investigated by a numerical study, and the bandwidth selection is discussed. Finally a case study on the Boston housing data is provided.
Read the full abstract

Optimization and Control · Cross-listed from cs.MA

Learning Approximate Nash Equilibria in Cooperative Multi-Agent Reinforcement Learning via Mean-Field Subsampling

Many large-scale platforms and networked control systems have a centralized decision maker interacting with a massive population of agents under strict observability constraints. Motivated by such applications, we study a cooperative Markov game with a global agent and $n$ homogeneous local agents in a communication-constrained regime, where the global agent only observes a subset of $k$ local agent states per time step. We propose an alternating learning framework $(\texttt{ALTERNATING-MARL})$, where the global agent performs subsampled mean-field $Q$-learning against a fixed local policy, and local agents update by optimizing in an induced MDP. We prove that these approximate best-response dynamics converge to an $\widetilde{O}(1/\sqrt{k})$-approximate Nash Equilibrium, while separating the sample complexities between the joint state and action spaces. Finally, we validate our results in numerical simulations for multi-robot control.
Read the full abstract

Algebraic Geometry

Tannakian duality and Gauss-Manin connections for a family of curves

Let $X/S$ be a smooth family of smooth projective varieties, where $S$ is a smooth affine curve over a field $k$ of characteristic $0.$ We relate the differential fundamental groupoid scheme of $X/k$ with the differential fundamental groupoid scheme of $S/k$ and the relative differential fundamental group of $X/S$ in a short exact sequence. This yields natural maps from the group cohomology of the geometric relative fundamental group to the Gauss-Manin connections. For families of curves of genus at least $1,$ we prove that these maps are isomorphisms. This gives an interpretation of the Gauss-Manin connection in terms of cohomology of the differential fundamental group. As a consequence we can shrink $X$ (as a family on $S$) to obtain a de Rham $K(\pi,1)$ surface.
Read the full abstract

Geometric Topology

Electric Teichmüller spaces and $k$-multicurve graphs

Masur and Minsky showed that the curve graph is quasi-isometric to the Teichmüller space electrified along its thin part, and hence the Teichmüller space is weakly relatively hyperbolic with respect to the thin part. In this paper, we extend this result to the $k$-multicurve graph by electrifying the Teichmüller space along the thin part where the extremal length of $k$ curves is sufficiently small. A key ingredient is a bound on the $k$-multicurve graph distance in terms of the intersection number, which is obtained by adapting the upper bound for the pants graph due to Lackenby and Yazdi.
Read the full abstract

Functional Analysis

Comparison of polynomial matrix differential operators

We characterize matrix polynomials $P,Q$ such that the inequality $$ \left\Vert Q(D)u\right\Vert _{L^{2}}\leq C\left\Vert P(D)u\right\Vert _{L^{2}}\quad\text{for all }u\in C_c^\infty(\Omega), $$ holds on bounded open sets $\Omega$. We also characterize the operators $P,Q$ for which the linear continuous embedding above is compact, i.e., if $u_n\in C_c^\infty(\Omega)$ are such that $(P(D)u_n)_{n\geq 1}$ is bounded in $L^2$, then $(Q(D)u_n)_{n\geq 1}$ is strongly compact in $L^2$.
Read the full abstract

Information Theory

A New Class of Geometric Analog Error Correction Codes for Crossbar Based In-Memory Computing

Analog error correction codes have been proposed for analog in-memory computing on resistive crossbars, which can accelerate vector-matrix multiplication for machine learning. Unlike traditional communication or storage channels, this setting involves a mixed noise model with small perturbations and outlier errors. A number of analog codes have been proposed for handling a single outlier, and several constructions have also been developed to address multiple outliers. However, the set of available code families remains limited, covering only a narrow range of code lengths and dimensions. In this paper, we study a recently proposed family of geometric codes capable of handling multiple outliers, and develop a geometric analysis that characterizes their m-height profiles.
Read the full abstract

All authors Ziyuan Zhu, Changcheng Yuan, Ron M. Roth, Paul H. Siegel, Anxiao Jiang

Number Theory

Polarized superspecial abelian varieties over $\mathbb{F}_p$ via hermitian lattices

We study the set of isomorphism classes of polarized superspecial abelian varieties $(A,\lambda)$ of a fixed dimension over $\mathbb{F}_p$ with Frobenius endomorphism $\pi_A=\sqrt{-p}$ and $\ker \lambda =\ker \pi_A$. This set plays an important role in the geometry of the supersingular locus, and the generalizations of Deuring's $2T-H$ Theorem by Ibukiyama and Katsura. We determine when this set is nonempty and classify its genera. Our method reduces the problems of superspecial abelian varieties to those of certain hermitian lattices by the lattice description established by Jordan et. al and Ibukiyama–Karemaker–Yu, and we treat these problems on the lattices concerned by arithmetic methods.
Read the full abstract

Probability

Small ball probability of collision local time for symmetric stable processes

In this article, the small ball probability is obtained for the collision local time of two independent symmetric $\alpha-$stable processes with parameters $\alpha_1,\alpha_2\in(0,2]$ satisfying $\max\{\alpha_1,\alpha_2\}>1$. The proof is based on obtaining the asymptotic behavior of moment generating function by contour integration.
Read the full abstract

Information Theory

When Relaxation Does Not Help: RLDCs with Small Soundness Yield LDCs

Locally decodable codes (LDCs) are error-correcting codes that allow recovery of any single message symbol by probing only a small number of positions from the (possibly corrupted) codeword. Relaxed locally decodable codes (RLDCs) further allow the decoder to output a special failure symbol $\bot$ on a corrupted codeword. While known constructions of RLDCs achieve much better parameters than standard LDCs, it is intriguing to understand the relationship between LDCs and RLDCs. On the one hand, separation results (i.e., the existence of $q$-query RLDCs that are not $q$-query LDCs) are known for $q=3$ (Gur, Minzer, Weissenberg, and Zheng, STOC 2026) and $q \geq 15$ (Grigorescu, Kumar, Manohar, and Mon, STOC 2026). On the other hand, prior work (Block, Blocki, Cheng, Grigorescu, Li, Zheng, and Zhu, CCC 2023) shows that any $2$-query RLDC also gives a $2$-query LDC, and Grigorescu, Kumar, Manohar, and Mon (STOC 2026) show that any linear $3$-query RLDC is also a linear $3$-query LDC. Furthermore, Grigorescu, Kumar, Manohar, and Mon (STOC 2026) show that when the soundness error of a linear $q$-query RLDC with perfect completeness is below some threshold $s(q)$, the code must also be a linear $q$-query LDC with comparable parameters. In this work, we extend the main result of Grigorescu, Kumar, Manohar, and Mon (STOC 2026) by removing the linearity requirement in the nonadaptive setting. Specifically, we show that every nonadaptive $(q,\delta,1,s)$-RLDC over a finite alphabet $\Sigma$ with $s<|\Sigma|^{-q}$ yields a $q$-query LDC with comparable decoding radius and error. Our results also extend to the setting of locally correctable codes (LCCs) and relaxed locally correctable codes (RLCCs). From this, we also obtain lower bounds for nonadaptive RLDCs from known LDC lower bounds.
Read the full abstract

Geometric Topology

Polynomially many surfaces of fixed Euler characteristic in a hyperbolic 3-manifold

We give an upper bound for the number of compact essential orientable non-isotopic surfaces, with Euler characteristic at least some constant $\chi$, properly embedded in a finite-volume hyperbolic 3-manifold $M$, closed or cusped. This bound is a polynomial function of the volume of $M$, with degree that depends linearly on $|\chi|$.
Read the full abstract

Optimization and Control

Tractable infinite-dimensional model for long-term environmental impact assessment of long-memory deacay processes

Focusing on the assessment of benthic algae blooms that decay subexponentially, we propose a tractable (solvable in a semi-explicit form) and well-defined (that does not diverge) environmental index for the impact assessment of long-memory processes under model uncertainties. Our target system generates long-memory decay through an infinite superposition of multiscale processes. The sensitivity of the environmental index can be controlled by the degree of model uncertainty in terms of the relative entropy and nonexponential discount; hence, we apply a long-memory discount to evaluate long-memory processes. In our framework, the evaluation of the environmental index is reduced to finding a proper solution to an infinite-dimensional extended Hamilton-Jacobi-Bellman system. We solve this system, verify a reasonable solution, and numerically handle it by using a quantization technique. Finally, we present a demonstrative application of the proposed framework to benthic algae population dynamics in river environments based on a laboratory experiment. This paper offers a tractable framework for the assessment of persistent environmental phenomena.
Read the full abstract

Dynamical Systems · Cross-listed from cs.CR

Internet malware propagation: Dynamics and control through SEIRV epidemic model with relapse and intervention

Malware attacks in today's vast digital ecosystem pose a serious threat. Understanding malware propagation dynamics and designing effective control strategies are therefore essential. In this work, we propose a generic SEIRV model formulated using ordinary differential equations to study malware spread. We establish the positivity and boundedness of the system, derive the malware propagation threshold, and analyze the local and global stability of the malware-free equilibrium. The separatrix defining epidemic regions in the control space is identified, and the existence of a forward bifurcation is demonstrated. Using normalized forward sensitivity indices, we determine the parameters most influential to the propagation threshold. We further examine the nonlinear dependence of key epidemic characteristics on the transmission rate, including the maximum number of infected, time to peak infection, and total number of infected. We propose a hybrid gradient-based global optimization framework using simulated annealing approach to identify effective and cost-efficient control strategies. Finally, we calibrate the proposed model using infection data from the "Windows Malware Dataset with PE API Calls" and investigated the effect of intervention onset time on averted cases, revealing an exponential decay relationship between delayed intervention and averted cases.
Read the full abstract

Number Theory

Intrinsic semistable reduction loci for the iterations of non-archimedean quadratic rational functions and moduli-theoretic applications

We study the intrinsic semistable reduction loci for the iterations of quadratic rational functions over algebraically closed complete non-archimedean fields. Using a reduction-theoretic slope formula for the hyperbolic resultant function and the non-archimedean argument principle, we establish a precise eventual stationarity theorem when the residue characteristic is different from $2$. In the finite-order case, we define an intrinsic prehole parameter, and for quadratic rational functions with the same reduction order and boundary period, classify the intrinsic reduction data of all iterations at distinguished Fatou boundary points up to simultaneous projective equivalence. For antispecialization algebraic arcs degenerating to an order $p>1$ boundary point of the compactified quadratic moduli space over an algebraically closed field of characteristic $0$, we define an intrinsic antispecialization parameter using the fixed-point multiplier polynomial. We show that this parameter equals the prehole parameter of every Puiseux lift of an antispecialization arc degenerating to the boundary point and that the $p$th iteration specialization determines all iteration specializations. Over $\mathbb{C}$, the two intrinsic parameters coincide with DeMarco's parameter $\tau^2$ after an appropriate interpretation. As a global consequence, we construct explicit blow-up models for the iterate compactification over arbitrary algebraically closed fields of characteristic $0$ and describe its boundary intrinsically. Over $\mathbb{C}$, this also recovers DeMarco's compactification.
Read the full abstract

Statistics Theory · Cross-listed from stat.ML

Generalization Properties of Score-matching Diffusion Models for Intrinsically Low-dimensional Data

Despite the remarkable empirical success of score-based diffusion models, their statistical guarantees remain underdeveloped. Existing analyses often provide pessimistic convergence rates that do not reflect the intrinsic low-dimensional structure common in real data, such as that arising in natural images. In this work, we study the statistical convergence of score-based diffusion models for learning an unknown distribution $\mu$ from finitely many samples. Under mild regularity conditions on the forward diffusion process and the data distribution, we derive finite-sample error bounds on the learned generative distribution, measured in the Wasserstein-$p$ distance. Unlike prior results, our guarantees hold for all $p \ge 1$ and require only a finite-moment assumption on $\mu$, without compact-support, manifold, or smooth-density conditions. Specifically, given $n$ i.i.d.\ samples from $\mu$ with finite $q$-th moment and appropriately chosen network architectures, hyperparameters, and discretization schemes, we show that the expected Wasserstein-$p$ error between the learned distribution $\hat{\mu}$ and $\mu$ scales as $\mathbb{E}\, \mathbb{W}_p(\hat{\mu},\mu) = \widetilde{O}\!\left(n^{-1 / d^\ast_{p,q}(\mu)}\right),$ where $d^\ast_{p,q}(\mu)$ is the $(p,q)$-Wasserstein dimension of $\mu$. Our results demonstrate that diffusion models naturally adapt to the intrinsic geometry of data and mitigate the curse of dimensionality, since the convergence rate depends on $d^\ast_{p,q}(\mu)$ rather than the ambient dimension. Moreover, our theory conceptually bridges the analysis of diffusion models with that of GANs and the sharp minimax rates established in optimal transport. The proposed $(p,q)$-Wasserstein dimension also extends the notion of classical Wasserstein dimension to distributions with unbounded support, which may be of independent theoretical interest.
Read the full abstract

Classical Analysis and ODEs

A degeneration of the generalized Zwegers' $\mu$-function according to the Ramanujan difference equation

In this paper, we introduce the little $\mu$-function, which is obtained as a degenerate limit of the generalized $\mu$-function. We derive the little $\mu$-function as the image of the $q$-Borel summation of a divergent solution to the Ramanujan equation which is the most degenerate second order linear $q$-difference equations of Laplace type excluding those of constant coefficients. Moreover, we present several formulas, such as symmetries and connection formulas for the little $\mu$-function, similar to those for the generalized $\mu$-function. Furthermore, we establish contiguous relations related to the $q,t$-Fibonacci sequences and Wronskian relations involving the Rogers-Ramanujan continued fraction.
Read the full abstract

Combinatorics

Measures on Cameron's treelike classes and applications to tensor categories

Measures on Fraïssé classes are a key input in the Harman–Snowden (2022) construction of tensor categories. Treelike Fraïssé classes provide a particularly tractable source of examples. In this paper, we complete the classification of measures on Cameron's elementary treelike classes. In particular, for the class $\partial \mathfrak{T}_3(n)$ of node-colored rooted binary tree structures with $n$ colors, we classify measures by an explicit bijection with directed rooted trees edge-labeled by $\{1, \dots, n\}$ with a distinguished vertex, yielding $(2n+2)^n$ distinct $\mathbb{Z}\left[\frac{1}{2}\right]$-valued measures. For each $n \geq 1$, we use a family of measures $\mu_n^I$ and their supports $\partial \mathfrak{T}_3(n)^{\mathrm{ord}}_I$ (where $I \subseteq \{1, \dots, n\}$) to construct the Karoubi envelopes $\mathbf{Rep}(\partial \mathfrak{T}_3(n)^{\mathrm{ord}}_I;\mu^I_n)$, producing infinite families of semisimple tensor categories with superexponential growth that cannot be obtained via Deligne's interpolation of representation categories. We also prove the nonexistence of measures on the $n$-colored tree class $C_n\mathfrak{T}$ for $n \geq 2$ and the labeled tree class $L \mathfrak{T}$, extending Snowden's results for uncolored trees.
Read the full abstract

Optimization and Control

Frequency Security-Aware Production Scheduling of Utility-Scale Off-Grid Renewable P2H Systems Coordinating Heterogeneous Electrolyzers

Renewable power-to-hydrogen (ReP2H) enables large-scale renewable energy utilization and supports the decarbonization of hard-to-abate sectors, such as chemicals and maritime transport, via hydrogen-based renewable ammonia and methanol fuels. As a result, utility-scale ReP2H projects are expanding worldwide. However, off-grid ReP2H systems exhibit low inertia due to their converter-dominated nature, making frequency security a critical concern. Although recent studies show that electrolyzers can contribute to frequency regulation (FR), their support capability depends on operating states and loading levels, creating a trade-off between hydrogen output and frequency security. To address this challenge, this work develops a unified co-optimization framework for frequency security-aware production scheduling of utility-scale off-grid ReP2H systems coordinating heterogeneous electrolyzers. A system-level frequency response model is established to capture multi-stage FR from alkaline water electrolyzers (AWEs), proton exchange membrane electrolyzers (PEMELs), and other resources, including ammonia-fueled generators retrofitted in co-located chemical plants, battery energy storage, and wind turbines (WTs). Stage-wise transient frequency security constraints are derived, reformulated into tractable forms, and embedded into production scheduling, enabling coordinated on/off switching and load allocation across electrolyzers to maximize hydrogen output under uncertain renewable power input while enforcing frequency security constraints. Case studies based on real-world systems demonstrate that the proposed approach allows HPs to replace 55.52% and 96.85% of FR reserves from WTs and AFGs, respectively, while maintaining comparable hydrogen output. Year-long simulations show an average 28.96% increase in annual net profit resulting from reduced reliance on conventional reserves.
Read the full abstract

All authors Jie Zhu, Yiwei Qiu, Yangjun Zeng, Shahab Dehghan, Sheng Wang, Shi Chen, Buxiang Zhou

History and Overview of Mathematics

Mathematicians in the age of AI

Recent developments show that AI can prove research-level theorems in mathematics, both formally and informally. This essay urges mathematicians to stay up-to-date with the technology, to consider the ways it will disrupt mathematical practice, and to respond appropriately to the challenges and opportunities we now face.
Read the full abstract

Differential Geometry

Minimal hypersurfaces in spheres generated by isoparametric foliations

We investigate the existence of minimal hypersurfaces in $\mathbb{S}^{n+1}$ that are generated by the isoparametric foliation of a subsphere $\mathbb{S}^n$. By considering a generalized rotational ansatz formed by the union of homothetic copies of isoparametric leaves, we reduce the minimal surface equation to an ordinary differential equation. We prove that this construction yields a closed embedded minimal hypersurface for any choice of isoparametric hypersurface $M \subset \mathbb{S}^n$. The resulting hypersurfaces have the topological type $S^1 \times M$, extending the known examples of minimal hypertori ($S^1\times S^k\times S^k$ and $S^1\times S^k\times S^l$) to a broader class of topologies determined by isoparametric structures.
Read the full abstract

Analysis of PDEs

On non-uniqueness of mild solutions and stationary singular solutions to the Navier-Stokes equations

We prove that the unconditional uniqueness of mild solutions to the Navier-Stokes equations fails in all the Besov spaces with negative regularity index, by constructing non-trivial stationary singular solutions via convex integration. We also establish uniqueness of stationary weak solutions in an endpoint critical space. Similar results are proved for the fractional Navier-Stokes equations with arbitrarily large power of the Laplacian in both Lebesgue and Besov spaces.
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

Principled Learning-to-Communicate with Quasi-Classical Information Structures

Learning-to-communicate (LTC) in partially observable environments has received increasing attention in deep multi-agent reinforcement learning, where the control and communication strategies are jointly learned. Meanwhile, the impact of communication on decision-making has been extensively studied in control theory. In this paper, we seek to formalize and better understand LTC by bridging these two lines of work, through the lens of information structures (ISs). To this end, we formalize LTC in decentralized partially observable Markov decision processes (Dec-POMDPs) under the common-information-based framework from decentralized stochastic control, and classify LTC problems based on the ISs before (additional) information sharing. We first show that non-classical LTCs are computationally intractable in general, and thus focus on quasi-classical (QC) LTCs. We then propose a series of conditions for QC LTCs, under which LTC preserves the QC IS after information sharing, whereas violating them can cause computational hardness in general. Further, we develop provable planning and learning algorithms for QC LTCs, and establish quasi-polynomial time and sample complexities for several QC LTC examples that satisfy the above conditions. Along the way, we also establish new results on a relationship between (strictly) QC IS and the condition of having strategy-independent common-information-based beliefs (SI-CIBs), as well as on solving Dec-POMDPs without computationally intractable oracles but beyond those with SI-CIBs, which may be of independent interest.
Read the full abstract

Optimization and Control

Continuous-time multi-armed bandits under random intervention times

This paper examines multi-armed bandits with $J$ independent arms in which actions are taken at random discrete times. When an arm is operated, it must remain active for a renewal inter-arrival time. For arms evolving as a Lévy process, we provide an explicit characterization of the Gittins index, known to yield an optimal strategy. Furthermore, when the inter-arrival times are exponential and the arms evolve as a spectrally negative Lévy process, a reflected spectrally negative Lévy process, or a diffusion process, the Gittins index is explicitly characterized in terms of the scale function or diffusion characteristics, respectively. Convergence analysis and numerical experiments are performed to support the theoretical results.
Read the full abstract

All authors Kei Noba, José Luis Pérez, Kazutoshi Yamazaki, Qingyuan Zhang

Logic

Parameterized D-torsors in differential Galois theory

In the context of differential fields of characteristic zero with several commuting derivations, we discuss the notion of $\#$-differential equations on parameterized D-torsors and their associated Galois extensions. Using model-theoretic methods, we observe that any generalized strongly normal extension (in the sense of Pillay [14] and, more generally, León Sánchez [9]) is the Galois extension of a parameterized D-torsor. Furthermore, we prove a parameterized version of a theorem of Kolchin on differential cohomology, itself of independent interest, and use it to provide a necessary and sufficient cohomological condition for when a generalized strongly normal extension is the Galois extension for a log-differential equation on its Galois group (as a parameterized D-group). We also present general model-theoretic versions of some of the main results.
Read the full abstract

Algebraic Geometry

Cohomological Chow Groups of codimension one of varieties with isolated singularities

We compute some particular examples of cohomological Chow groups for varieties with isolated singularities. For higher-dimensional varieties, we compute the cohomological Chow groups of codimension one, provided that the dual complex associated to the normal crossing divisor is contractible. For 3-dimensional varieties, we consider a weaker condition on the dual complex, namely $H^{2}(\Gamma(E))=0$.
Read the full abstract

Probability

An approach to non-equilibrium Markov chains through cycle matrices

Analogously to the quantum case considered in Cruz-de-la-Rosa and Guerrero-Poblete (Open Syst. Inf. Dyn. 32, 2550005, 2025), this work proposes a graph-theoretic approach to studying non-equilibrium properties in Markov chains. We prove that the kernel of the incidence matrix associated with the interaction graph of the chain, which consists of cycles, is isomorphic to the space of anti-symmetric matrices with rows sum to zero. The main contribution of this work is the introduction of the called cycle matrices, which constitute a basis for the space of matrices that describe the non-equilibrium.
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

Local Safety Filters for Networked Systems via Two-Time-Scale Design

Safety filters based on Control Barrier Functions (CBFs) provide formal guarantees of forward invariance, but are often difficult to implement in networked dynamical systems. This is due to global coupling and communication requirements. This paper develops locally implementable approximations of networked CBF safety filters that require no coordination across subsystems. The proposed approach is based on a two-time-scale dynamic implementation inspired by singular perturbation theory, where a small parameter $\epsilon$ separates fast filter dynamics from the plant dynamics; then, a local implementation is enabled via derivative estimation. Explicit bounds are derived to quantify the mismatch between trajectories of the systems with dynamic filter and with the ideal centralized safety filter. These results characterize how safety degradation depends on the time-scale parameter $\epsilon$, estimation errors, and filter activation time, thereby quantifying trade-offs between safety guarantees and local implementability.
Read the full abstract

Analysis of PDEs

Well-posedness and mean-field limit of discontinuous weighted dynamics via the relative entropy method

We consider deterministic particle dynamics with time evolving weights and their associated Kolmogorov equation and mean-field equation. We prove existence and unique- ness for the limit PDE alongside estimates on the growth of the logarithmic gradient as well as existence of weak solutions for the Kolmogorov equation satisfying an appropriate entropy inequality. We then apply these estimates and the relative entropy method as developed in [17], in order to derive the associated equation as a mean field limit. Our results cover both interactions and influence kernels with mild regularity assumptions.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

A relation between the HOMFLY-PT and Kauffman polynomials via characters

The HOMFLY-PT and Kauffman polynomials are related to each other for special classes of knots constructed by full twists and Jucys-Murphy twists. The conditions for this relation are articulated in terms of characters of the Birman-Murakami-Wenzl algebra. The latter are the coefficients in the expansion of the Kauffman polynomial involving the quantum dimensions of SO(N+1). This expansion allows to prove the conjectural 1-1 correspondence between the HOMFLY-PT/Kauffman relation and the Harer-Zagier (HZ) factorisability for a large family of 3-strand knots. The conjecture remains open for knots with 4 and higher strands.
Read the full abstract