Results 41 to 50 of about 746,739 (376)

The Hamiltonian Syllogistic [PDF]

open access: yesJournal of Logic, Language and Information, 2011
This paper undertakes a re-examination of Sir William Hamilton's doctrine of the quantification of the predicate. Hamilton's doctrine comprises two theses. First, the predicates of traditional syllogistic sentence-forms contain implicit existential quantifiers, so that, for example, "All p are q" is to be understood as "All p are some q". Second, these
openaire   +4 more sources

On the structure and statistical theory of turbulence of extended magnetohydrodynamics

open access: yesNew Journal of Physics, 2017
Recent progress regarding the noncanonical Hamiltonian formulation of extended magnetohydrodynamics (XMHD), a model with Hall drift and electron inertia, is summarized.
George Miloshevich   +2 more
doaj   +1 more source

Simulating Ising-Like Models on Quantum Computer

open access: yesСовременные информационные технологии и IT-образование, 2023
Due to the complexity of lattice models of statistical physics, there is interest in developing new approaches to study them, including those using quantum technologies.
Andrey Andreev, Pavel Khrapov
doaj   +1 more source

Input-output decoupling of Hamiltonian systems: The linear case [PDF]

open access: yes, 1985
In this note we give necessary and sufficient conditions for a linear Hamiltonian system to be input-output decouplable by Hamiltonian feedback, i.e. feedback that preserves the Hamiltonian structure.
Nijmeijer, H.
core   +3 more sources

Combinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems

open access: yesScience Advances, 2019
Nonlinear Hamiltonian systems search optimal solutions exploiting their adiabatic and chaotic evolutions. Combinatorial optimization problems are ubiquitous but difficult to solve.
Hayato Goto   +2 more
semanticscholar   +1 more source

Experimental quantum Hamiltonian learning [PDF]

open access: yesNature Physics, 2017
With the help of a quantum simulator and Bayesian inference it is possible to determine the unknown Hamiltonian of a quantum system. An experiment demonstrates this using a photonic quantum simulator and a solid-state system.
Jianwei Wang   +10 more
semanticscholar   +1 more source

Hamiltonicities of Double Domination Critical and Stable Claw-Free Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2019
A graph G with the double domination number γ×2(G) = k is said to be k- γ×2-critical if γ×2 (G + uv) < k for any uv ∉ E(G). On the other hand, a graph G with γ×2 (G) = k is said to be k-γ×2+$k - \gamma _{ \times 2}^ + $-stable if γ×2 (G + uv) = k for any
Kaemawichanurat Pawaton
doaj   +1 more source

SOME PROPERTIES ON COPRIME GRAPH OF GENERALIZED QUATERNION GROUPS

open access: yesBarekeng, 2023
A coprime graph is a representation of finite groups on graphs by defining the vertex graph as an element in a group and two vertices adjacent to each other's if and only if the order of the two elements is coprime.
Arif Munandar
doaj   +1 more source

Learning a Local Hamiltonian from Local Measurements. [PDF]

open access: yesPhysical Review Letters, 2018
Recovering an unknown Hamiltonian from measurements is an increasingly important task for certification of noisy quantum devices and simulators.
Eyal Bairey, I. Arad, N. Lindner
semanticscholar   +1 more source

Improved Sufficient Conditions for Hamiltonian Properties

open access: yesDiscussiones Mathematicae Graph Theory, 2015
In 1980 Bondy [2] proved that a (k+s)-connected graph of order n ≥ 3 is traceable (s = −1) or Hamiltonian (s = 0) or Hamiltonian-connected (s = 1) if the degree sum of every set of k+1 pairwise nonadjacent vertices is at least ((k+1)(n+s−1)+1)/2.
Bode Jens-P.   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy