Results 31 to 40 of about 42,222 (303)
Isomorphism versus commensurability for a class of finitely presented groups
We construct a class of finitely presented groups where the isomorphism problem is solvable but the commensurability problem is unsolvable. Conversely, we construct a class of finitely presented groups within which the commensurability problem is ...
Arzhantseva, Goulnara +2 more
core +1 more source
When are two types the same? In this paper we argue that isomorphism is a more useful notion than equality. We explain a succinct and elegant approach to establishing isomorphisms, with our focus on showing their existence over deriving the witnesses.
Hinze, R, James, D, ACM
openaire +3 more sources
We describe a Monte Carlo study examining the impact of assuming item isomorphism (i.e., equivalent construct meaning across levels of analysis) on conclusions about homology (i.e., equivalent structural relations across levels of analysis) under varying
Nigel eGuenole
doaj +1 more source
Equivalences between isomorphism classes on infinite graphs [PDF]
summary:The paper studies some equivalence relations between isomorphism classes of countable graphs which correspond in a certain sense to various distances between isomorphism classes of finite ...
Zelinka, Bohdan
core +1 more source
Isomorphism: Initially referring to the structuralist, in particular glossematic, hypothesis that the expression and meaning of linguistic signs show structural parallelisms, the term isomorphism is used in current linguistic theory to designate the one ...
Willems, Klaas
core +1 more source
A multi‐stimuli‐responsive material is designed that responds to light, heat, and mechanical force through distinct chemical reaction pathways. The pathway is directed by self‐assembly and the applied stimulus. A novel pericyclic reaction cascade is also achieved, and the mechanism is supported through density functional theory calculations.
Liulei Ma +4 more
wiley +2 more sources
Investigations in Quantum Computing: Causality and Graph Isomorphism [PDF]
In this thesis I explore two different types of limits on the time complexity of quantum computation---that is, limits on how much time is required to perform a given class of quantum operations on a quantum system. Upper limits can be found by explicit
Beckman, David Eugene
core +1 more source
ON EXTENSIONS OF PARTIAL ISOMORPHISMS [PDF]
AbstractIn this paper we study a notion of HL-extension (HL standing for Herwig–Lascar) for a structure in a finite relational language $\mathcal {L}$ . We give a description of all finite minimal HL-extensions of a given finite $\mathcal {L}$ -structure. In addition, we study a group-theoretic property considered by Herwig–Lascar and show that it is
Mahmood Etedadialiabadi, Su Gao
openaire +3 more sources
Stabilizing Zinc Anodes via a Zeolite‐Induced Localized Supersaturated Electrolyte Interface
A low‐Si/Al‐ratio ZSM‐5 (LZ5) interphase induces a localized supersaturated electrolyte interface on Zn, with a local Zn2+ concentration exceeding 10 M in a 1 M ZnSO4 bulk electrolyte. Continuous Zn2+ enrichment within the zeolite nanochannels creates an H2O‐deficient, anion‐enriched solvation environment, promoting rapid desolvation, uniform ...
Xiaoqi Liu +12 more
wiley +2 more sources
Epis and monos which must be isos
Orzech [1] has shown that every surjective endomorphism of a noetherian module is an isomorphism. Here we prove analogous results for injective endomorphisms of noetherian injective modules, and the duals of these results.
David J. Fieldhouse
doaj +1 more source

