95,056+ open-access research outputs.
$\omega$~Centauri, the most massive globular cluster in the Milky Way, exhibits a level of stellar population complexity that has long resisted a unified chemical characterisation. We exploit high-res…
Efficient exploration is a central problem in reinforcement learning and is often formalized as maximizing the entropy of the state-action occupancy measure. While unconstrained maximum-entropy explor…
Although intersections are the most complex parts of the roadway network, pedestrian crashes at non-intersection locations are disproportionately frequent, highlighting a serious traffic safety concer…
Spiking neural networks (SNNs) are a promising paradigm for energy-efficient event-driven computation, but large-scale SNN execution remains challenging because sparse spike communication and synchron…
Let $M$ be a smooth manifold without boundary and let $\mathcal{T}$ be a countable collection of manifolds with corners, each equipped with a smooth map to $M$. We show that the singular simplicial se…
We prove the existence of many non-trivial characteristic classes of smooth oriented bundles with fibre a product $ S^{n}\times S^{n} $ of odd-dimensional spheres. We do so by proving injectivity of t…
In this paper, we investigate the existence of fixed-point-free automorphisms for finite-dimensional Lie algebras. By a result of Jacobson, a Lie algebra admitting a fixed-point-free automorphism is s…
The toughness of a graph $G$, denoted by $\tau(G)$, is defined by $\tau(G)=$min $\{\frac{|S|}{c(G-S)}:S\subseteq V(G)$ and $c(G-S)\geq2\}$. A graph $G$ is said to be $\tau$-tough if $\tau(G)\geq \tau$…
High-order harmonic generation (HHG) in solids - the frequency up-conversion of an optical signal - is governed by symmetries. At terahertz (THz) frequencies, HHG is a key technology to access high fr…
We measured the rectification of an ac voltage in a structure of superconducting circularly-asymmetric aluminum rings in series, permeated with a magnetic flux and biased with a low-frequency alternat…
J. Conway defined useful operations on the Class of combinatorial games and also introduced a notion of equivalence between games. Conway showed that, under his equivalence, games form a Group. Howeve…
We present a unifying Nearly Asymptotically Invariant Manifold (NAIM) framework for understanding Nesterovs Accelerated Gradient (NAG) method. By lifting the first-order gradient flow into a second-or…
We introduce G\r{a}rding polynomials, a class of real multivariate polynomials defined via positivity regions invariant under translation by positive directions and closed under strictly positive affi…
The full-field reconstruction of three-dimensional (3D) turbulent flows from sparse experimental measurements remains a significant challenge, particularly for flows exhibiting complex 3D flow separat…
The evolution of protoplanetary disks, especially in the early stages of planetary formation, as dust grows, is the cornerstone of the birth of planets. The mechanisms involved in the growth of sub-mi…
There is a Lie algebra structure on the tensor product of a Leibniz algebra and a Zinbiel algebra for the operads of Leibniz algebras and Zinbiel algebras are Koszul dual. In this paper, we extend suc…
Let $ n \in \mathbb{N} $ with $ n \geq 3 $, and let $\mathcal{G} = \{G_i:i\in [n]\} $ be a family of $ n $-vertex graphs on a common vertex set $V$, where the graphs in the family do not need to be di…
We introduce the notions of $\mathbb{K}$-framings, based $\mathbb{K}$-framings and relative $\mathbb{K}$-framings of a compact connected oriented surface $\Sigma$ for any commutative ring $\mathbb{K}$…
We define a torus $U \subset T = (\mathbb{C}^\times)^K$ which acts on the $\Delta$-Springer varieties $Y_{n,\lambda,s}$ defined by Griffin-Levinson-Woo and give a Borel-style presentation for the equi…
Motivated by an optimal-matching problem (Leighton-Shor) and the random-field Ising model (Aizenman-Wehr, Ding-Wirth), we consider a variational problem for graphs in $1+1$ dimension maximizing an act…
Free open-access publishing with Google Scholar indexing.
Submission Guide →