Research
Research
Research
Research
3,642+ open-access research outputs.
Associating multiple sensory cues with a single experience or object is a fundamental process that improves object recognition and memory performance. However, neural mechanisms that bind sensory feat…
In this paper, we study the $L^p$-boundedness of Stein's square function $\mathfrak{S}^{\alpha}(\mathcal{L})$ associated with the sub-Laplacian $\mathcal{L}$ on M\'etivier group $G$. A key aspect of o…
In this note we prove an upper bound on the $\mathbb F_p$-rank of the incidence matrix of points and hyperplanes in $(\mathbb Z/p^k \mathbb Z)^n$, improving a recent bound of Laba and Trainer when $k$…
The development of intelligent and diversified ser vices in urban rail transit (URT) has resulted in an increasing de mand for high-rate communication between vehicles and ground equipment. However, e…
Cell--cell communication (CCC) is commonly inferred from ligand--receptor co-expression, an associational paradigm that cannot distinguish causal signaling from shared regulation or confounding. We pr…
CLIP-based person re-identification (ReID) methods aggregate spatial features into a single global \texttt{[CLS]} token optimized for image-text alignment rather than spatial selectivity, making repre…
The Simons Observatory Large Aperture Telescope Receiver (SO LATR) is a next generation Cosmic Microwave Background camera equipped with > 60, 000 detectors operating at 100 mK. Maintaining these dete…
The properties of plasmas in the low-density limit are described by virial expansions. Analytical expressions are known for the lowest virial coefficients from Green's function approaches.Recently, ac…
Large language models perform well on many reasoning tasks, yet they often lack awareness of whether their current knowledge or reasoning state is complete. In non-interactive puzzle settings, the nar…
In this paper we present the first-order logic QLETF+, a quantified version of the logic LETF+, introduced in Coniglio and Rodrigues (Studia Logica 112:561-606, 2024). QLETF+ exhibits several properti…
We study in detail an A4-symmetric tensegrity appearing in Connelly's catalog. The realizable configurations form a one-parameter family that can be parametrized by points on the elliptic curve with C…
Let $G$ be a finite simple graph and let $I(G)$ denote its edge ideal. For $q \ge 1$, the $q$-th squarefree power $I(G)^{[q]}$ is generated by squarefree monomials corresponding to matchings of size $…
We study the sample complexity of learning an $\epsilon$-optimal policy in the Stochastic Shortest Path (SSP) problem. We first derive sample complexity bounds when the learner has access to a generat…
Spatiotemporal modeling has evolved beyond simple time series analysis to become fundamental in structural time series analysis. While current research extensively employs graph neural networks (GNNs)…
The so-called SAGA-LD algorithm is used for efficient sampling from high-dimensional distributions in machine learning. Its intricate dynamics resists standard approaches of Markov chain theory. We pr…
This work investigates the dynamics of a charged particle in a uniform magnetic field within the Bohm--Madelung formulation of quantum mechanics. In this representation, the stationary Schrodinger equ…
We use the theory of entire functions of finite order to prove a universal spectral dependence of the blowup/decay rate of solutions of the Sturm-Liouville eigenvalue equation for problems with Schatt…
We study Schr\"odinger operators on metric and discrete decorated graphs. The values taken by the integrated density of states (IDS) on spectral gaps are called gap labels. A natural question is which…
Determining the nature of the optical excited state (excitons or free carriers) in nanostructured materials is crucial for device design, as optoelectronic and photovoltaic technologies require differ…
We investigate the Bishop-Phelps-Bollob\'as property for the numerical radius (BPBp-nu) through a Zizler-type perspective on the classical Bishop-Phelps-Bollob\'as property (BPBp). This approach allow…
Free open-access publishing with Google Scholar indexing.
Submission Guide →