Results 41 to 50 of about 70,685 (147)
On Conditions for Distributivity or Modularity of Congruence Lattices of Commutative Unary Algebras
, 2013 The paper is devoted to the problem of describing unary algebras whose congruence lattices have a given property. By now this problem has been solved for algebras with one unary operation. In the paper it is shown that this problem is much more difficult
V. Kartashov +2 more
semanticscholar +1 more source
Journal of the American Ceramic Society, Volume 109, Issue 1, January 2026.Abstract Silicate dissolution under hyperalkaline conditions is a key process that affects the evolution of alkali–silica reaction (ASR) in concrete. In these environments, dissolution may involve multiple overlapping processes—including ion adsorption on reactive sites, transport of dissolved species, and the formation of alteration layers.
Rui Xiao +4 more
wiley +1 more source
Bulletin of the London Mathematical Society, Volume 58, Issue 1, January 2026.Abstract We classify fibered ribbon pretzel knots up to mutation. The classification is complete, except perhaps for members of Lecuona's “exceptional” family of Lecuona [Algebr. Geom. Topol. 15 (2015), no. 4, 2133–2173]. The result is obtained by combining lattice embedding techniques with Gabai's classification of fibered pretzel knots, and ...
Ana G. Lecuona, Andy Wand
wiley +1 more source
Mathematika, Volume 72, Issue 1, January 2026.Abstract In the “Covering” pursuit game on a graph, a robber and a set of cops play alternately, with the cops each moving to an adjacent vertex (or not moving) and the robber moving to a vertex at distance at most 2 from his current vertex. The aim of the cops is to ensure that, after every one of their turns, there is a cop at the same vertex as the ...
Benjamin Gillott
wiley +1 more source
Noncrossing arc diagrams and canonical join representations
, 2015 We consider two problems that appear at first sight to be unrelated. The first problem is to count certain diagrams consisting of noncrossing arcs in the plane. The second problem concerns the weak order on the symmetric group. Each permutation $x$ has a
Reading, Nathan
core +1 more source
Advanced Materials, Volume 37, Issue 52, December 29, 2025.An overview is provided of the mechanochemistry of metal‐organic frameworks (MOFs) and covalent‐organic frameworks (COFs), highlighting opportunities and strategies for discovery, synthesis and reactivity studies of these materials. Mechanistic studies and comparisons to the mechanochemistry of organic solids are outlined, showcasing how advances in ...
Joseph M. Marrett +3 more
wiley +1 more source
Generic Expression Hardness Results for Primitive Positive Formula Comparison [PDF]
, 2011 We study the expression complexity of two basic problems involving the comparison of primitive positive formulas: equivalence and containment. In particular, we study the complexity of these problems relative to finite relational structures.
Bova, Simone +2 more
core
Machine Learning Design of Soft Magnetoresponsive Materials With Multidirectional Fields
SmartMat, Volume 6, Issue 6, December 2025.Combining deep learning with evolutionary algorithms, this study accurately predicts the deformation of soft magneto‐responsive materials under different external magnetic fields and inversely designs initial magnetization distributions and external field directions based on desired deformation.
Xin Ye +7 more
wiley +1 more source
Processability and Performance of Dual‐Cure Resins: A Study of Cyanate Ester Integration for DLP
Journal of Applied Polymer Science, Volume 142, Issue 43, November 15, 2025.From formulation to function: an integration of cyanate esters with acrylates to achieve thermally stable, mechanically robust, and finely detailed printed parts with DLP. ABSTRACT This study investigates dual‐cure resins for the DLP process using photorheological and thermomechanical characterization methods to optimize their mechanical, thermal, and ...
Max Friedel +3 more
wiley +1 more source
Almost structural completeness; an algebraic approach [PDF]
, 2014 A deductive system is structurally complete if its admissible inference rules are derivable. For several important systems, like modal logic S5, failure of structural completeness is caused only by the underivability of passive rules, i.e. rules that can
M. Stronkowski, Michał, Wojciech Dzik
core