Results 181 to 190 of about 355,626 (313)
Compatibility of Drinfeld presentations for split affine Kac-Moody quantum symmetric pairs. [PDF]
Li JR, Przeździecki T.
europepmc +1 more source
A Vulnerability Lens for Intuitive‐Logic Scenarios
ABSTRACT Exploration of possibilities by means of intuitive logic is hampered by a large number of scenarios, which easily exceed the limits imposed by human bounded rationality. While many practitioners constrain their scenarios within a 2 × 2 $2\times 2$ matrix by design, more structured approaches point to rationales such as eliminating ...
Guido Fioretti
wiley +1 more source
Complex Time Approach to the Hamiltonian and the Entropy Production of the Damped Harmonic Oscillator. [PDF]
Aslani KE.
europepmc +1 more source
Generalized Choi maps in three-dimensional matrix algebra
Sungwon Cho, Seung-Hyeok Kye, Sa Ge Lee
semanticscholar +1 more source
Some bounds related to the 2‐adic Littlewood conjecture
Abstract For every irrational real α$\alpha$, let M(α)=supn⩾1an(α)$M(\alpha) = \sup _{n\geqslant 1} a_n(\alpha)$ denote the largest partial quotient in its continued fraction expansion (or ∞$\infty$, if unbounded). The 2‐adic Littlewood conjecture (2LC) can be stated as follows: There exists no irrational α$\alpha$ such that M(2kα)$M(2^k \alpha)$ is ...
Dinis Vitorino, Ingrid Vukusic
wiley +1 more source
Hypercomplex neural networks: Exploring quaternion, octonion, and beyond in deep learning. [PDF]
Devadas RM +5 more
europepmc +1 more source
Discrepancy of arithmetic progressions in boxes and convex bodies
Abstract The combinatorial discrepancy of arithmetic progressions inside [N]:={1,…,N}$[N]:= \lbrace 1, \ldots, N\rbrace$ is the smallest integer D$D$ for which [N]$[N]$ can be colored with two colors so that any arithmetic progression in [N]$[N]$ contains at most D$D$ more elements from one color class than the other.
Lily Li, Aleksandar Nikolov
wiley +1 more source
Statistical control of relaxation and synchronization in open anyonic systems. [PDF]
Bittner ER, Tyagi B.
europepmc +1 more source
Variants of a theorem of Macbeath in finite‐dimensional normed spaces
Abstract A classical theorem of Macbeath states that for any integers d⩾2$d \geqslant 2$, n⩾d+1$n \geqslant d+1$, d$d$‐dimensional Euclidean balls are hardest to approximate, in terms of volume difference, by inscribed convex polytopes with n$n$ vertices.
Zsolt Lángi, Shanshan Wang
wiley +1 more source

