Results 231 to 240 of about 14,100 (298)
A Formalisation of Aristotle's Assertoric Syllogistic in Isabelle/HOL. [PDF]
Koutsoukou-Argyraki A, Wapniarski K.
europepmc +1 more source
Unraveling the Thermal Response From Individual Multipole Resonances in Magnetodielectric Spheres
A semi‐analytical framework resolves electromagnetic heating into individual multipolar contributions and an inter‐order coupling correction, linking internal modal fields to local dissipation, temperature evolution, and heat flux. Applied to dual‐symmetric magnetodielectric spheres, it reveals balanced polarization and magnetization losses and ...
Jhon James Hernández‐Sarria +3 more
wiley +1 more source
The generic Markov cohomological Hall algebra is not spherically generated. [PDF]
Davison B.
europepmc +1 more source
How to Make a Phosphine by Catalytic Hydrophosphination
Catalysis is the winning hand for hydrophosphination. Three general advances, electrophilic metals, ionic and solvent effects, and photocatalysis have allowed for large categories of unsaturated and phosphine substrates to be accessed. Through these advances, a catalyst that can provide good conversion for most substrates can now be found. Implications
Rory Waterman
wiley +1 more source
Width Stability of Rotationally Symmetric Metrics. [PDF]
Stufflebeam H, Sweeney P.
europepmc +1 more source
Fractional Balanced Chromatic Number and Arboricity of Planar (Signed) Graphs
ABSTRACT A balanced ( p , q )‐coloring of a signed graph ( G , σ ) is an assignment of q colors to each vertex of G from a platter of p colors, such that each color class induces a balanced set (a set that does not induce a negative cycle). The fractional balanced chromatic number of ( G , σ ), denoted χ f b ( G , σ ), is the minimum ratio p / q such ...
Reza Naserasr +3 more
wiley +1 more source
Comment on "Inferring broken detailed balance in the absence of observable currents". [PDF]
Hartich D, Godec A.
europepmc +1 more source
Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices
ABSTRACT Given a graph G, we say that an orientation D of G is a KT orientation if, for all u , v ∈ V ( D ), there is at most one directed path (in any direction) between u and v. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as counterexamples to various ...
Barbora Dohnalová +3 more
wiley +1 more source
Representations of extensions of simple groups. [PDF]
Harper S, Liebeck MW.
europepmc +1 more source

