f**k
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Midwives used 'f**k off home' code for heavily pregnant women at NHS trust
Midwives used 'f**k off home' code for heavily pregnant women at NHS trust Women were allegedly encouraged to remain at home despite concerns they were in labour, with one woman later arriving at Nottingham University Hospitals NHS Trust to find out her baby had died Pregnant women were allegedly labelled with an offensive acronym telling them to “f**k off home” as fresh allegations have emerged about the NHS trust at the centre of the largest maternity inquiry in history. The three letters:...
$O(n +f(k))$: Truly Linear FPT
Announce Type: new Abstract: Parameterized complexity has always been concerned with practical computing: by confining combinatorial explosion to a secondary parameter $k$, one can uncover why and how many NP-hard problems are effectively tackled in practice. Today, however, the scale of data has changed: scientists study Big Data, which is so large that even quadratic dependence in the total input size $n$ is unaffordable. Therefore, what constitutes a practical algorithm has also changed.
Erd\H{o}s Rado Sunflower Theorem for Shifted Families
Combinatorics [Submitted on 1 Jun 2026 (v1), last revised 8 Jun 2026 (this version, v2)] Title:Erdős Rado Sunflower Theorem for Shifted Families View PDF HTML (experimental)Abstract:Let $f(k,s)$ denote the minimum integer $m$ such that any family $\mathcal{F}$ consisting of $k$-sized sets of cardinality at least $m$ always contain a sunflower of size $s$. The Erdős-Rado Sunflower Conjecture states that for every $s >2$, there is an constant $C=C(s)$ such that $f(k,s) \leq C^k$.
Almost balanced ordered biclique covering of graphs
arXiv:2606.08506v1 Announce Type: cross Abstract: Let $f(n,k)$ be the minimum size of a collection of bicliques such that (i) every edge of the complete graph $K_n$ is covered by at least one and at most $k$ bicliques in the collection, and (ii) for each edge $\{u,v\}$, the number of bicliques in which $u$ appears in the first class and $v$ in the second class differs by at most one from the number of bicliques in which $u$ appears in the second class and $v$ in the first class. For $k=1$,...
Erd\H{o}s Rado Sunflower (Conjecture) Theorem
Combinatorics [Submitted on 1 Jun 2026] Title:Erdős Rado Sunflower (Conjecture) Theorem View PDF HTML (experimental)Abstract:Let $f(k,s)$ denote the minimum integer $m$ such that any family $\mathcal{F}$ consisting of $k$-sized sets of cardinality at least $m$ always contain a sunflower of size $s$.
A Kronecker algorithm for locally closed sets over a perfect field
arXiv:2512.14888v2 Announce Type: replace-cross Abstract: We develop a probabilistic algorithm of Kronecker type for computing a Kronecker representation of a zero-dimensional linear section of an algebraic variety $V$ defined over a perfect field $k$. The variety $V$ is the Zariski closure of the set of common zeros $\{F_1=0,\ldots,F_r=0,G\not=0\}$ of multivariate polynomials $F_1,\ldots,F_r\in k[X_1,\ldots,X_n]$ outside a prescribed hypersurface $\{G=0\}$. We assume that $F_1,\ldots,F_r$...
On Sketching Trimmed Statistics
Announce Type: replace Abstract: We study sketching trimmed statistics of a frequency vector, including the $F_p$ moment of the top-$k$ coordinates and of the trimmed-$k$ vector. Despite their natural role in robust analytics, this is the first time these problems have been studied in any sublinear space setting. For $p \in [0,2]$, we obtain $poly(\log n/\varepsilon)$-space algorithms for both tasks when $k$ is moderately large, and for general $k$ we identify a sharp structural threshold...
On the Maximal Length of MDS Elliptic Codes
arXiv:2605.29439v2 Announce Type: replace Abstract: The determination of the maximal length of maximum distance separable (MDS) codes arising from elliptic curves is a central problem in coding theory. For an elliptic curve $E$ over $\mathbb{F}_q$, let $\operatorname{MEC}(k,q)$ denote the maximal length of a $q$-ary MDS elliptic code of dimension $k$. It was recently shown that $\operatorname{MEC}(k,q)\le\frac{q+1}{2}+\sqrt{q}$ for $q\ge289$ and $3\le k\le(q+1-2\sqrt{q})/10$, with equality...
Magenta RealTime 2: Open and Local Live Music Models
We’re excited to share Magenta RealTime 2 (MRT2), a state-of-the-art open model and efficient real-time inference engine that enables you to build and play AI musical instruments on your laptop! To get started, download the apps on your MacBook (requires Apple Silicon). Unlike other large generative music models that work offline to turn a prompt into a track, MRT2 is a live, interactive model that you can control with MIDI and audio, in addition to text.
Approximating $f$-Divergences with Rank Statistics
arXiv:2601.22784v2 Announce Type: replace-cross Abstract: We introduce a rank-statistic approximation of $f$-divergences that avoids explicit density-ratio estimation by working directly with the distribution of ranks. For a resolution parameter $K$, we map the mismatch between two univariate distributions $\mu$ and $\nu$ to a rank histogram on $\{ 0, \ldots, K\}$ and measure its deviation from uniformity via a discrete $f$-divergence, yielding a rank-statistic divergence estimator. We prove...