Results 71 to 80 of about 35,227 (263)

Breaking Symmetries with Involutions

open access: yesCoRR
Symmetry breaking for graphs and other combinatorial objects is notoriously hard. On the one hand, complete symmetry breaks are exponential in size. On the other hand, current, state-of-the-art, partial symmetry breaks are often considered too weak to be of practical use.
Codish, Michael, Janota, Mikoláš
openaire   +3 more sources

On the Complexity of Breaking Symmetry

open access: yesCoRR, 2020
We can break symmetry by eliminating solutions within a symmetry class that are not least in the lexicographical ordering. This is often referred to as the lex-leader method. Unfortunately, as symmetry groups can be large, the lexleader method is not tractable in general.
openaire   +2 more sources

Optoelectronic Synaptic Devices Using Molecular Telluride Phase‐Change Inks for Three‐Factor Learning

open access: yesAdvanced Functional Materials, EarlyView.
Optoelectronic synaptic devices based on solution‐processed molecular telluride GST‐225 phase‐change inks are demonstrated for three‐factor learning. A global optical signal broadcast through a silicon waveguide induces non‐volatile conductance updates exclusively in locally electrically flagged memristors.
Kevin Portner   +14 more
wiley   +1 more source

symmetry broken supersolid in spin–orbit-coupled Bose–Einstein condensates

open access: yesNew Journal of Physics
Supersolid is an exotic state of matter characterized by both superfluid properties and periodic particle density modulation, due to spontaneous breaking of U (1) gauge symmetry and spatial translation symmetry, respectively. For conventional supersolids,
Ze-Hong Guo, Qizhong Zhu
doaj   +1 more source

Breaking Value Symmetry [PDF]

open access: yes, 2007
Symmetry is an important factor in solving many constraint satisfaction problems. One common type of symmetry is when we have symmetric values. In a recent series of papers, we have studied methods to break value symmetries. Our results identify computational limits on eliminating value symmetry. For instance, we prove that pruning all symmetric values
openaire   +4 more sources

Symmetry breaking at enhanced symmetry points [PDF]

open access: yesNuclear Physics B, 1996
32 pages, LaTeX, 2 figures in uuencoded ...
Green, Michael B., Gutperle, Michael
openaire   +2 more sources

Robust Electrocaloric Performance Enabled by Highly‐Polar Frustrated Nanodomains in NaNbO3‐Based Ferrodistortive Relaxor

open access: yesAdvanced Functional Materials, EarlyView.
P4bm framework in NaNbO3‐Ba(Ti, Hf)O3 ferrodistortive relaxor entails short‐range and highly‐polar ferrodistortive orders. The abundant highly‐polar orders facilitate to increase entropy change, and robust octahedral oxygen tilt enables to impede thermal perturbations.
Feng Li   +11 more
wiley   +1 more source

Omnipolar Magnetic Field Detection by Superlattice‐Based Hall Sensor

open access: yesAdvanced Functional Materials, EarlyView.
Magnetic‐field‐induced electronic switching is demonstrated in unit‐cell‐engineered La0.7Sr0.3MnO3–BiFeO3 superlattices. Distinct substrate terminations modify magnetic and transport properties. Hall resistance measurements show omnipolar, hysteretic anomalous Hall switching above the Curie temperature, arising from Fe─Mn interfacial exchange, enabling
Mark Huijben   +6 more
wiley   +1 more source

Chiral Phase Change Nanomaterials

open access: yesAdvanced Functional Materials, EarlyView.
This work demonstrates reversible, non‐volatile phase transitions in chiral Ge2${\rm Ge}_2$Sb2${\rm Sb}_2$Te5${\rm Te}_5$ (GST) nanohelices for high‐speed optical modulation of chirality and dynamic control of the state of polarization (SOP). The chiral nanostructures are fabricated using a highly directional, wafer‐scale physical vapor deposition ...
Joshua A. Burrow   +11 more
wiley   +1 more source

On the Effectiveness of Symmetry Breaking [PDF]

open access: yes, 2014
Symmetry breaking involves coloring the elements of a structure so that the only automorphism which respects the coloring is the identity. We investigate how much information we would need to be able to compute a 2-coloring of a computable finite-branching tree under the predecessor function which eliminates all automorphisms except the trivial one; we
Russell G. Miller   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy