928+ open-access research outputs.
Complexity class containments involving interactive proof classes are famously nonrelativizing: although $\mathsf{IP} = \mathsf{PSPACE}$, Fortnow and Sipser showed that that there exists an oracle relโฆ
Mazur's separable quotient problem, open since 1932, asks whether every infinite-dimensional Banach space admits an infinite-dimensional separable quotient. We prove that any $\mathscr{L}_\infty$-spacโฆ
The realization of blue electroluminescence with high efficiency and lifetime remains a long-standing hurdle for OLED technology to overcome. Divalent Europium [Europium(II)] complexes offer a fundameโฆ
Aza-BODIPY dimers represent promising molecular systems for efficient triplet-state generation through either intramolecular-singlet fission (iSF) or spin-orbit charge transfer intersystem crossing (Sโฆ
A promising approach for steering auditory attention in complex listening environments relies on Auditory Attention Decoding (AAD), which aim to identify the attended speech stream in a multiple speakโฆ
We study compact embeddings of Sobolev, Besov, and Triebel-Lizorkin spaces with variable exponents on both bounded and unbounded metric measure spaces. We establish sufficient conditions for compactneโฆ
Facial behavior constitutes the primary medium of human nonverbal communication. Existing synthesis methods predominantly follow two paradigms: coarse emotion category labels or one-hot Action Unit (Aโฆ
In the online hitting set problem, sets arrive over time, and the algorithm has to maintain a subset of elements that hit all the sets seen so far. Alon, Awerbuch, Azar, Buchbinder, and Naor (SICOMP 2โฆ
Control of encrypted digital assets is traditionally equated with permanent possession of private keys, a model that precludes regulatory supervision, conditional delegation, and legally compliant traโฆ
Some questions raised in [K. Zi\k{e}tak, {\it From the strict Chebyshev approximant of a vector to the strict spectral approximant of a matrix}, Warsaw : Banach Center Publ., 112 Polish Acad. Sci. Insโฆ
The rise of Large Language Model-based Automated Algorithm Design (LLM-AAD) has transformed algorithm development by autonomously generating code implementations of expert-level algorithms. Unlike traโฆ
Evaluating the reliability of noisy quantum circuits is essential for implementing quantum algorithms on noisy quantum devices. However, current quantum hardware exhibits diverse noise mechanisms whosโฆ
This submission includes a complete reference implementation together with deterministic test vectors and a reproducible benchmark suite. All source code, build instructions, and regression artifacts โฆ
We propose a strategy to obtain conducting organic materials with fully spin-polarized Fermi surface, lying at a singular flat band, with antiferromagnetically coupled magnetic moments that reside in โฆ
Using flag algebras, we prove that the minimum density of $8$-cliques in a large graph without an independent set of size $3$ is $491411/268435456+o(1)$, thus resolving a new case of an old problem ofโฆ
Compressed Deep Learning (DL) models are essential for deployment in resource-constrained environments. But their performance often lags behind their large-scale counterparts. To bridge this gap, we pโฆ
Quasi Monte Carlo (QMC) and Global Sensitivity Analysis (GSA) techniques are applied for pricing and hedging representative financial instruments of increasing complexity. We compare standard Monte Caโฆ
The purpose of this article is two-folds. Firstly, we establish two sufficient conditions under which the sequence $\{f(n)\pmod{m}: n\geq1\}$ is non-periodic, where $f(n)$ is an arithmetic function. Aโฆ
Facial age estimation plays a critical role in content moderation, age verification, and deepfake detection. However, no prior benchmark has systematically compared modern vision-language models (VLMsโฆ
Large language models have enabled automated algorithm design (AAD) by generating optimization algorithms directly from natural-language prompts. While evolutionary frameworks such as LLaMEA demonstraโฆ
Free open-access publishing with Google Scholar indexing.
Submission Guide โ