N/N^2)$
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Valence Ionization Of Water Clusters Formed Inside Helium Nanodroplets
Announce Type: new Abstract: The ionization mechanisms of small H$_2$O/D$_2$O clusters embedded in helium nanodroplets (HNDs) irradiated with extreme ultraviolet photons of energy $h\nu$ = 21.6 eV are investigated using Penning ionization electron-ion coincidence spectroscopy. Both protonated (H$_2$O)$_{n-1}$H$^{+}$/(D$_2$O)$_{n-1}$D$^{+}$ ($n$ = 3-6) and unprotonated (H$_2$O)$_{n}$$^{+}$/(D$_2$O)$_{n}$$^{+}$ ($n$ = 2-5) cluster ions were observed. Penning ionization electron spectra...
Faster algorithms for k-Orthogonal Vectors in low dimension
Announce Type: replace Abstract: In the Orthogonal Vectors problem (OV), we are given two families $A, B$ of subsets of $\{1,\ldots,d\}$, each of size $n$, and the task is to decide whether there exists a pair $a \in A$ and $b \in B$ such that $a \cap b = \emptyset$. Straightforward algorithms for this problem run in $\mathcal{O}(n^2 \cdot d)$ or $\mathcal{O}(2^d \cdot n)$ time, and assuming SETH, there is no $2^{o(d)}\cdot n^{2-\varepsilon}$ time algorithm that solves this problem for any...
A universal complementarity identity for polarized double-slit interferometry
arXiv:2604.18760v2 Announce Type: replace-cross Abstract: An exact identity is established among four experimentally accessible quantities in polarized double-slit interferometry: the phase-reference-dependent in-phase and quadrature components $V_A$ and $V_N$ of fringe visibility, the path predictability $\mathcal{P}$, and the mixedness $\mathcal{I}$ of the reduced path state satisfy $V_A^2+V_N^2+\mathcal{P}^2+\mathcal{I}^2=1$. The identity is an algebraic consequence of positivity and...
On the Duke--Erd\H{o}s--R\"odl Problem at the One-Third Threshold
Announce Type: cross Abstract: Let $G$ be an $n$-vertex graph with $e(G)\ge n^2/ k$. We prove a self-contained internal short-cycle core theorem at the threshold $k\le n^{1/3}$: the graph $G$ contains a subgraph $H_6$ with $\Omega(n^2/ k^3)$ edges in which every two distinct edges lie together on a cycle of length at most $6$ contained in $H_6$, and a subgraph $H_8$ with $\Omega(n^2/k^2)$ edges in which every two distinct edges lie together on a cycle of length at most $8$ contained in...
A formal proof of the Ramanujan--Nagell theorem in Lean 4
arXiv:2604.09808v2 Announce Type: replace-cross Abstract: We present a complete formalization, in the Lean interactive theorem prover with the Mathlib library, of the Ramanujan--Nagell theorem: the only integer solutions to the Diophantine equation $x^2 + 7 = 2^n$ are $(n,x) \in \{(3,\pm1),(4,\pm3),(5,\pm5),(7,\pm11),(15,\pm181)\}$. The formalization includes all dependencies, notably the computation of the ring of integers of the quadratic field $\mathbb{Q}(\sqrt{-7})$, its class number,...
Restartable Sequences
May 31st, 2026 @ justine's web page The best kept secret at the frontier of system programming right now is the Linux 4.18+ (c. 2018) concept of restartable sequences or rseq for short. They allow you to create thread-safe data structures without locks or atomics which scale to microprocessors with many cores. It's currently only possible to use rseq on Linux using handwritten assembly code.
An Energy-Stable Implicit Convex-Splitting BDF2 Scheme for the Cahn-Hilliard-Navier-Stokes Equations
Announce Type: new Abstract: We develop an energy-stable implicit convex-splitting BDF2 discretization (CS-BDF2) of the Cahn--Hilliard--Navier--Stokes equations. For the Cahn--Hilliard equation, BDF2 analyses can establish energy stability by testing the phase equation in the (H^{-1}) metric. For CHNS, this test is not compatible with the coupled energy estimate: the momentum equation is tested by (\bfu^{n+1}), while the transported phase equation is tested by (\mu^{n+1}) so that transport...
Degrees of Freedom of Over-the-Air Computation over a MIMO Gaussian Network with Two Transmitters and Two Receivers
Announce Type: new Abstract: The fundamental limits of over-the-air computation (AirComp) are explored in a two-transmitter, two-receiver MIMO Gaussian network, where both receivers demand the same aggregation of source symbols originating at the two transmitters. An AirComp degrees of freedom (ACDoF) metric is defined, constrained by an asymptotic mean-squared error threshold. For a generic MIMO setting where the two transmitters are equipped with $M_1, M_2$ antennas, and the two receivers...
Complementary Time-Space Tradeoff for Self-Stabilizing Leader Election: Polynomial States Meet Sublinear Time
arXiv:2505.23649v3 Announce Type: replace Abstract: We study the self-stabilizing leader election (SS-LE) problem in the population protocol model, assuming exact knowledge of the population size $n$. Burman, Chen, Chen, Doty, Nowak, Severson, and Xu [BCC+21a] (PODC) showed that this problem can be solved in $O(n)$ expected time with $O(n)$ states. Recently, G\k{a}sieniec, Grodzicki, and Stachowiak [GGS25] (PODC) proved that $n+O(\log n)$ states suffice to achieve $O(n \log n)$ time both in...
ETH-Tight Complexity of Optimal Morse Matching on Bounded-Treewidth Complexes
arXiv:2603.05406v2 Announce Type: replace Abstract: The Optimal Morse Matching (OMM) problem asks for a discrete gradient vector field on a simplicial complex that minimizes the number of critical simplices. It is NP-hard and has been studied extensively in heuristic, approximation, and parameterized complexity settings. Parameterized by treewidth $k$, OMM has long been known to be solvable on triangulations of $3$-manifolds in $2^{O(k^2)} n^{O(1)}$ time and in FPT time for triangulations of...