Topological orderIn physics, topological order is a kind of order in the zero-temperature phase of matter (also known as quantum matter). Macroscopically, topological order is defined and described by robust ground state degeneracy and quantized non-Abelian geometric phases of degenerate ground states. Microscopically, topological orders correspond to patterns of long-range quantum entanglement. States with different topological orders (or different patterns of long range entanglements) cannot change into each other without a phase transition.
Topological insulatorA topological insulator is a material whose interior behaves as an electrical insulator while its surface behaves as an electrical conductor, meaning that electrons can only move along the surface of the material. A topological insulator is an insulator for the same reason a "trivial" (ordinary) insulator is: there exists an energy gap between the valence and conduction bands of the material. But in a topological insulator, these bands are, in an informal sense, "twisted", relative to a trivial insulator.
Eulerian pathIn graph theory, an Eulerian trail (or Eulerian path) is a trail in a finite graph that visits every edge exactly once (allowing for revisiting vertices). Similarly, an Eulerian circuit or Eulerian cycle is an Eulerian trail that starts and ends on the same vertex. They were first discussed by Leonhard Euler while solving the famous Seven Bridges of Königsberg problem in 1736. The problem can be stated mathematically like this: Given the graph in the image, is it possible to construct a path (or a cycle; i.
Ring learning with errors key exchangeIn cryptography, a public key exchange algorithm is a cryptographic algorithm which allows two parties to create and share a secret key, which they can use to encrypt messages between themselves. The ring learning with errors key exchange (RLWE-KEX) is one of a new class of public key exchange algorithms that are designed to be secure against an adversary that possesses a quantum computer. This is important because some public key algorithms in use today will be easily broken by a quantum computer if such computers are implemented.
Delayed sleep phase disorderDelayed sleep phase disorder (DSPD), more often known as delayed sleep phase syndrome and also as delayed sleep–wake phase disorder, is the delaying of a person's circadian rhythm (biological clock) compared to those of societal norms. The disorder affects the timing of biological rhythms including sleep, peak period of alertness, core body temperature, and hormonal cycles. The diagnosis of this disorder is currently a point of contention among specialists of sleep disorders.
Advanced sleep phase disorderAdvanced Sleep Phase Disorder (ASPD), also known as the advanced sleep-phase type (ASPT) of circadian rhythm sleep disorder, is a condition that is characterized by a recurrent pattern of early evening (e.g. 7-9 PM) sleepiness and very early morning awakening (e.g. 2-4 AM). This sleep phase advancement can interfere with daily social and work schedules, and results in shortened sleep duration and excessive daytime sleepiness. The timing of sleep and melatonin levels are regulated by the body's central circadian clock, which is located in the suprachiasmatic nucleus in the hypothalamus.
Cayley graphIn mathematics, a Cayley graph, also known as a Cayley color graph, Cayley diagram, group diagram, or color group, is a graph that encodes the abstract structure of a group. Its definition is suggested by Cayley's theorem (named after Arthur Cayley), and uses a specified set of generators for the group. It is a central tool in combinatorial and geometric group theory. The structure and symmetry of Cayley graphs makes them particularly good candidates for constructing families of expander graphs.
Cycle graphIn graph theory, a cycle graph or circular graph is a graph that consists of a single cycle, or in other words, some number of vertices (at least 3, if the graph is simple) connected in a closed chain. The cycle graph with n vertices is called C_n. The number of vertices in C_n equals the number of edges, and every vertex has degree 2; that is, every vertex has exactly two edges incident with it. There are many synonyms for "cycle graph".
Petersen graphIn the mathematical field of graph theory, the Petersen graph is an undirected graph with 10 vertices and 15 edges. It is a small graph that serves as a useful example and counterexample for many problems in graph theory. The Petersen graph is named after Julius Petersen, who in 1898 constructed it to be the smallest bridgeless cubic graph with no three-edge-coloring. Although the graph is generally credited to Petersen, it had in fact first appeared 12 years earlier, in a paper by .
Circadian rhythm sleep disorderCircadian rhythm sleep disorders (CRSD), also known as circadian rhythm sleep-wake disorders (CRSWD), are a family of sleep disorders which affect the timing of sleep. CRSDs arise from a persistent pattern of sleep/wake disturbances that can be caused either by dysfunction in one's biological clock system, or by misalignment between one's endogenous oscillator and externally imposed cues. As a result of this mismatch, those affected by circadian rhythm sleep disorders have a tendency to fall asleep at unconventional time points in the day.
Degree (graph theory)In graph theory, the degree (or valency) of a vertex of a graph is the number of edges that are incident to the vertex; in a multigraph, a loop contributes 2 to a vertex's degree, for the two ends of the edge. The degree of a vertex is denoted or . The maximum degree of a graph , denoted by , and the minimum degree of a graph, denoted by , are the maximum and minimum of its vertices' degrees. In the multigraph shown on the right, the maximum degree is 5 and the minimum degree is 0.
Non-24-hour sleep–wake disorderNon-24-hour sleep–wake disorder (non-24 or N24SWD) is one of several chronic circadian rhythm sleep disorders (CRSDs). It is defined as a "chronic steady pattern comprising [...] daily delays in sleep onset and wake times in an individual living in a society". Symptoms result when the non-entrained (free-running) endogenous circadian rhythm drifts out of alignment with the light–dark cycle in nature. Although this sleep disorder is more common in blind people, affecting up to 70% of the totally blind, it can also affect sighted people.
Topological quantum computerA topological quantum computer is a theoretical quantum computer proposed by Russian-American physicist Alexei Kitaev in 1997. It employs quasiparticles in two-dimensional systems, called anyons, whose world lines pass around one another to form braids in a three-dimensional spacetime (i.e., one temporal plus two spatial dimensions). These braids form the logic gates that make up the computer. The advantage of a quantum computer based on quantum braids over using trapped quantum particles is that the former is much more stable.
Sleep disorderA sleep disorder, or somnipathy, is a medical disorder of an individual's sleep patterns. Some sleep disorders are severe enough to interfere with normal physical, mental, social and emotional functioning. Polysomnography and actigraphy are tests commonly ordered for diagnosing sleep disorders. Sleep disorders are broadly classified into dyssomnias, parasomnias, circadian rhythm sleep disorders involving the timing of sleep, and other disorders including ones caused by medical or psychological conditions.
Orientation (graph theory)In graph theory, an orientation of an undirected graph is an assignment of a direction to each edge, turning the initial graph into a directed graph. A directed graph is called an oriented graph if none of its pairs of vertices is linked by two symmetric edges. Among directed graphs, the oriented graphs are the ones that have no 2-cycles (that is at most one of (x, y) and (y, x) may be arrows of the graph). A tournament is an orientation of a complete graph. A polytree is an orientation of an undirected tree.
Order and disorderIn physics, the terms order and disorder designate the presence or absence of some symmetry or correlation in a many-particle system. In condensed matter physics, systems typically are ordered at low temperatures; upon heating, they undergo one or several phase transitions into less ordered states. Examples for such an order-disorder transition are: the melting of ice: solid-liquid transition, loss of crystalline order; the demagnetization of iron by heating above the Curie temperature: ferromagnetic-paramagnetic transition, loss of magnetic order.
Topological quantum numberIn physics, a topological quantum number (also called topological charge) is any quantity, in a physical theory, that takes on only one of a discrete set of values, due to topological considerations. Most commonly, topological quantum numbers are topological invariants associated with topological defects or soliton-type solutions of some set of differential equations modeling a physical system, as the solitons themselves owe their stability to topological considerations.
Topological defectTopological defects or solitons are irregularities or disruptions that occur within continuous fields or ordered states of matter. These defects, which can take various forms such as points, lines, or surfaces, are characterized by their stability and the fact that they cannot be 'smoothed out' or removed through continuous transformations of the field or material. They play a significant role in various areas of physics, including condensed matter physics, cosmology, and quantum field theory, and can have profound effects on the properties and behavior of the systems in which they occur.
Phase transitionIn chemistry, thermodynamics, and other related fields, a phase transition (or phase change) is the physical process of transition between one state of a medium and another. Commonly the term is used to refer to changes among the basic states of matter: solid, liquid, and gas, and in rare cases, plasma. A phase of a thermodynamic system and the states of matter have uniform physical properties. During a phase transition of a given medium, certain properties of the medium change as a result of the change of external conditions, such as temperature or pressure.
Cycle spaceIn graph theory, a branch of mathematics, the (binary) cycle space of an undirected graph is the set of its even-degree subgraphs. This set of subgraphs can be described algebraically as a vector space over the two-element finite field. The dimension of this space is the circuit rank of the graph. The same space can also be described in terms from algebraic topology as the first homology group of the graph. Using homology theory, the binary cycle space may be generalized to cycle spaces over arbitrary rings.
