102,888+ open-access research outputs.
Multi-turn prompt injection follows a known attack path -- trust-building, pivoting, escalation but text-level defenses miss covert attacks where individual turns appear benign. We show this attack paโฆ
Denote by $p(k)$ the limit, as $n \rightarrow \infty$, of the probability that a random permutation on a set of size $n$ has an invariant set of size $k$. We give an asymptotic formula for $p(k)$, shoโฆ
We prove a transfer theorem for hereditary classes of $(r+1)$-uniform hypergraphs. Let $\mathcal G$ be such a class, and for $H\in\mathcal G$ write $\Delta(H)$ and $d(H)$ for the maximum degree and avโฆ
We prove that a class of classical lattice models on $\mathbb{Z}^d$ ($d \geq 2$) with on-site space $\mathbb{N}_0$ exhibits long-range checkerboard order at sufficiently high temperature. The model haโฆ
In this paper, we study an inverse boundary value problem for the Jordan--Moore--Gibson--Thompson equation on a simple Riemannian manifold. We consider an all boundary measurement map that maps Dirichโฆ
We consider smooth convex minimization over compact convex sets, i.e., $\min_{x \in C} f(x)$ with the (vanilla) Frank-Wolfe algorithm. Well-known lower bounds establish a worst-case $\Omega(1/t)$ primโฆ
Multimodal large language models (MLLMs) are increasingly used to translate visual artifacts into code, from UI mockups into HTML to scientific plots into Python scripts. A circuit diagram can be viewโฆ
An important tool in the design of fault-tolerant graph data structures are $(L,f)$-replacement path coverings (RPCs). An RPC is a family $\mathcal{G}$ of subgraphs of a given graph $G$ such that, forโฆ
We introduce a fast, one-dimensional Newtonian {reduced model} to capture uniform rotation in cold white dwarfs, encoding centrifugal support as an effective pressure anisotropy. Using $\Delta_{\rm roโฆ
The Etzion-Silberstein conjecture asserts that, for any finite field $\mathbb F$, Ferrers diagram $\mathcal D$, and integer $d$, there exists a linear matrix code supported on $\mathcal D$ with minimuโฆ
The 'Species Scale' has proved to be an important concept when studying consistent effective actions in Quantum Gravity. This is a short summary of my contribution to the Corfu Summer Institute in Sepโฆ
We study hypergeometric functions of nilpotent operators in finite-dimensional settings, motivated by the algebraic structure of exceptional points in non-Hermitian quantum mechanics. Our starting poiโฆ
We give a self-contained, modern exposition of \'Edouard Goursat's 1887 theorem on pseudo-elliptic integrals -- those integrals of the form $\int F(t)\,\d t/\sqrt{R(t)}$ with $R$ a cubic or quartic poโฆ
Cosmology has entered a precision era in which discrepancies between independent datasets, most notably the $H_0$ and $S_8$ tensions, have become robust and statistically significant. These tensions aโฆ
Let $k\in\mathbb{N}$. Wigert's divisor function $d^{\left(\frac{1}{k}\right)}(j)$ counts the number of representations of $j$ of the form $m^k+mn$ with $m\geq1 , n\geq0$. Let $\mathcal{F}_k(s)$ denoteโฆ
On the flag variety $ \mathcal{F}l_s(E)$ associated to a vector bundle $E,$ , a sequence $s$ and a partition $a,$ there is a line bundle $\it Q^a_s$ on $ \mathcal{F}l_s(E).$ The aim of this papeโฆ
Let $\mathcal A$ be an $\mathbb F$-algebra and $\omega \in \mathcal A\langle x_1, \ldots, x_m \rangle$ which defines a map $\mathcal A^m \rightarrow \mathcal A$ by evaluation, called a polynomial map โฆ
In this paper, we propose an enhanced physical layer security approach, named joint secrecy and covert communication (JSACC), which aims to improve the performance of physical layer security (PLS). Thโฆ
Boolean circuits form the foundational computational substrate of symmetric cryptography, yet the exploration of their architectural design space has remained largely confined to a handful of canonicaโฆ
We address the question of the large-time behavior of solutions to reaction-diffusion equations in periodic media. We start with the description of the asymptotic shape of the invasion set, which is cโฆ
Free open-access publishing with Google Scholar indexing.
Submission Guide โ