Research
Research
Research
Research
336,377+ open-access research outputs.
Relaxation of far-from-equilibrium quantum fluids, intimately related to the emergence of long-range order, is theoretically associated with the decay of a turbulent isotropic tangle of vortex lines. …
We prove superpolynomial length lower bounds for the semantic tree-like Frege refutation system with bounded line size. Concretely, for any function $n^{2-\varepsilon} \leq s(n) \leq 2^{n^{1-\varepsil…
Deeply virtual meson production (DVMP) is among the most prominent channels to extract the nucleon's generalized parton distributions (GPDs) at $ep$ scattering facilities such as {\tt JLab} and the up…
Degenerate quantum eigenspaces can support substantial changes in nodal geometry at fixed energy. We show that, for the two-dimensional isotropic harmonic oscillator, this restructuring is organized b…
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…
Ta$_{3}$N$_{5}$ is among the most intensively studied photoanode materials for solar-driven water oxidation, yet its performance often remains limited by short carrier lifetimes and defect mediated re…
Building on the genus-3 reduction $C_A : w^2 = \lambda^8 + A \lambda^4 + 1$ established in our companion paper (arXiv:2604.09328), we give an unconditional proof of the perfect-cuboid conjecture ("Con…
The impossibility of eliminating hallucination, understood here as incorrect definite answers, in sufficiently expressive yes-or-no formal domains is an immediate consequence of classical undecidabili…
We study Tur\'an-type extremal problems for distance graphs, motivated by work of Csikv\'ari, Bollob\'as, Tyomkyn, and Uzzell. We determine the maximum number of vertex pairs at distance three in an $…
In this chapter we provide a pedagogical introduction to the main theoretical aspects related to topology and $\theta$-dependence in Quantum Chromo-Dynamics (QCD), and to their phenomenological releva…
For a graph \(G\), let $avm(G)$ denote the average size of its maximal matchings. This parameter was introduced by Engbers and Erey in the study of extremal problems for maximal matchings, and they as…
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…
Barvinok introduced the symmetrized determinant ($\sdet$) as a \emph{non-commutative} analogue of the determinant. Intuitively, given a square matrix over an associative algebra, we can obtain the sym…
Diffuse-interface (phase-field) models are widely used to describe multiphase mixtures and their interfacial dynamics. In multiphase settings, however, the constitutive closure should remain meaningfu…
This paper examines how different types of large language model (LLM) agents perform on scientific visualization (SciVis) tasks, where users generate visualization workflows from natural-language inst…
We show that every minimally generically globally rigid graph in $\mathbb R^d$ which contains a subgraph isomorphic to $K_{d+2}$ is itself isomorphic to $K_{d+2}$, confirming a conjecture by Garamv{\"…
In this paper, we consider the Santa Claus problem in the CONGEST model. This NP-hard problem can be modeled as a bipartite graph of children and gifts where an edge indicates that a child desires a g…
We numerically study a formation of near extremal horizons from a gravitational collapse of radially symmetric gravitational waves in $4+1$ dimensions within the framework of pure Einstein gravity wit…
Background: Timely, uncertainty-aware forecasting from irregular electronic health records (EHR) can support critical-care decisions, yet most approaches either impute to a grid or sacrifice interpret…
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…
Free open-access publishing with Google Scholar indexing.
Submission Guide →