Tootfinder

Join the 2025 Maine AI 'unconference' on June 13 in Orono for face-to-face discussions whose topics will be democratically chosen by the attenders. (We've got expert panels too.) Register by this Friday—more at https://www.linkedin.com/posts/jonippolito

Nonlinear PDEs with modulated dispersion IV: normal form approach and unconditional uniqueness
Massimiliano Gubinelli, Guopeng Li, Jiawei Li, Tadahiro Oh
https://arxiv.org/abs/2505.24270

Nonlinear PDEs with modulated dispersion IV: normal form approach and unconditional uniqueness
We study the modulated Korteweg-de~Vries equation (KdV) on the circle with a time non-homogeneous modulation acting on the linear dispersion term. By adapting the normal form approach to the modulated setting, we prove sharp unconditional uniqueness of solutions to the modulated KdV in $L^2(\mathbb T)$ if a modulation is sufficiently irregular. For example, this result implies that if the modulation is given by a sample path of a fractional Brownian motion with Hurst index $0 < H < \frac 25$, t…

Unconditional Non-surrender from Mike Torr
#UnsignedMusician #MusicReview
https://

Unconditional Non-surrender from Mike Torr
Stan Stewart - @muz4now

Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs
Timothy LaRock, Renaud Lambiotte
https://arxiv.org/abs/2506.01479 https://

Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs
Hypergraphs extend traditional networks by capturing multi-way or group interactions. Given the complexity of hypergraph data and the wide range of methodology available for pairwise network analysis, hypergraph data is often projected onto a weighted and undirected network. The simplest of these projections, often referred to as a node co-occurrence matrix, is known to be non-unique, as distinct non-isomorphic hypergraphs can produce the same weighted adjacency matrix. This non-uniqueness rais…

ambassador: Philippines Ambassador bombing (2000)
A temporal network representing snapshots of relationships among individuals directly or indirectly associated with Philippines Ambassador Residence Bombing 2000, Jakarta. Nodes are people, and an edge exists if they are associated with each other. Definition of the edge weight is unknown.
This network has 16 nodes and 13 edges.
Tags: Social, Offline, Weighted, Temporal

Optimal Bregman quantization : existence and uniqueness of optimal quantizers revisited
Guillaume Boutoille, Gilles Pag\`es
https://arxiv.org/abs/2506.01746

Optimal Bregman quantization : existence and uniqueness of optimal quantizers revisited
In this paper we revisit the exsistence theorem for $L^r$-optimal quantization, $r\ge 2$, with respect to a Bregman divergence: we establish the existence of optimal quantizaers under lighter assumptions onthe strictly convex function which generates the divergence, espcially in the quadratic case ($r=2$). We then prove a uniqueness theorem ``à la Trushkin'' in one dimension for strongly unimodal distributions and divergences gerated by strictly convex functions whiose thire dervative is eithe…

#nzz #threema #schweiz

This https://arxiv.org/abs/2401.14319 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCR_…

A Quantum "Lifting Theorem" for Constructions of Pseudorandom Generators from Random Oracles
We study the (quantum) security of pseudorandom generators (PRGs) constructed from random oracles. We prove a "lifting theorem" showing, roughly, that if such a PRG is unconditionally secure against classical adversaries making polynomially many queries to the random oracle, then it is also (unconditionally) secure against quantum adversaries in the same sense. As a result of independent interest, we also show that any pseudo-deterministic quantum-oracle algorithm (i.e., a quantum algorithm tha…

ambassador: Philippines Ambassador bombing (2000)
A temporal network representing snapshots of relationships among individuals directly or indirectly associated with Philippines Ambassador Residence Bombing 2000, Jakarta. Nodes are people, and an edge exists if they are associated with each other. Definition of the edge weight is unknown.
This network has 16 nodes and 4 edges.
Tags: Social, Offline, Weighted, Temporal

Relaxed uniqueness conditions for the parabolic Schrodinger equation on Riemannian manifolds
Fabio Punzo
https://arxiv.org/abs/2505.24368 https://

Relaxed uniqueness conditions for the parabolic Schrodinger equation on Riemannian manifolds
We study uniqueness for solutions to the Cauchy problem associated with the parabolic Schrödinger equation on complete noncompact Riemannian manifolds, under suitable integral conditions on the solution. We show that, under suitable assumptions on the potential V, the required integrability condition can be significantly relaxed compared to the case without potential. This improvement is achieved by exploiting the decay of positive solutions to the associated stationary Schrodinger equation. T…