|
Connective Constant
In mathematics, the connective constant is a numerical quantity associated with self-avoiding walks on a lattice. It is studied in connection with the notion of universality in two-dimensional statistical physics models. While the connective constant depends on the choice of lattice so itself is not universal (similarly to other lattice-dependent quantities such as the critical probability threshold for percolation), it is nonetheless an important quantity that appears in conjectures for universal laws. Furthermore, the mathematical techniques used to understand the connective constant, for example in the recent rigorous proof by Duminil-Copin and Smirnov that the connective constant of the hexagonal lattice has the precise value \sqrt, may provide clues to a possible approach for attacking other important open problems in the study of self-avoiding walks, notably the conjecture that self-avoiding walks converge in the scaling limit to the Schramm–Loewner evolution. Definitio ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics with the major subdisciplines of number theory, algebra, geometry, and analysis, respectively. There is no general consensus among mathematicians about a common definition for their academic discipline. Most mathematical activity involves the discovery of properties of abstract objects and the use of pure reason to prove them. These objects consist of either abstractions from nature orin modern mathematicsentities that are stipulated to have certain properties, called axioms. A ''proof'' consists of a succession of applications of deductive rules to already established results. These results include previously proved theorems, axioms, andin case of abstraction from naturesome basic properties that are considered true starting poin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Schramm–Loewner Evolution
In probability theory, the Schramm–Loewner evolution with parameter ''κ'', also known as stochastic Loewner evolution (SLE''κ''), is a family of random planar curves that have been proven to be the scaling limit of a variety of two-dimensional lattice models in statistical mechanics. Given a parameter ''κ'' and a domain in the complex plane ''U'', it gives a family of random curves in ''U'', with ''κ'' controlling how much the curve turns. There are two main variants of SLE, ''chordal SLE'' which gives a family of random curves from two fixed boundary points, and ''radial SLE'', which gives a family of random curves from a fixed boundary point to a fixed interior point. These curves are defined to satisfy conformal invariance and a domain Markov property. It was discovered by as a conjectured scaling limit of the planar uniform spanning tree (UST) and the planar loop-erased random walk (LERW) probabilistic processes, and developed by him together with Greg Lawler and W ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ising Model
The Ising model () (or Lenz-Ising model or Ising-Lenz model), named after the physicists Ernst Ising and Wilhelm Lenz, is a mathematical model of ferromagnetism in statistical mechanics. The model consists of discrete variables that represent magnetic dipole moments of atomic "spins" that can be in one of two states (+1 or −1). The spins are arranged in a graph, usually a lattice (where the local structure repeats periodically in all directions), allowing each spin to interact with its neighbors. Neighboring spins that agree have a lower energy than those that disagree; the system tends to the lowest energy but heat disturbs this tendency, thus creating the possibility of different structural phases. The model allows the identification of phase transitions as a simplified model of reality. The two-dimensional square-lattice Ising model is one of the simplest statistical models to show a phase transition. The Ising model was invented by the physicist , who gave it as a pro ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Percolation Threshold
The percolation threshold is a mathematical concept in percolation theory that describes the formation of long-range connectivity in random systems. Below the threshold a giant connected component does not exist; while above it, there exists a giant component of the order of system size. In engineering and coffee making, percolation represents the flow of fluids through porous media, but in the mathematics and physics worlds it generally refers to simplified lattice models of random systems or networks (graphs), and the nature of the connectivity in them. The percolation threshold is the critical value of the occupation probability ''p'', or more generally a critical surface for a group of parameters ''p''1, ''p''2, ..., such that infinite connectivity (''percolation'') first occurs. Percolation models The most common percolation model is to take a regular lattice, like a square lattice, and make it into a random network by randomly "occupying" sites (vertices) or bonds (edges ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Trihexagonal Tiling
In geometry, the trihexagonal tiling is one of 11 uniform tilings of the Euclidean plane by regular polygons. See in particular Theorem 2.1.3, p. 59 (classification of uniform tilings); Figure 2.1.5, p.63 (illustration of this tiling), Theorem 2.9.1, p. 103 (classification of colored tilings), Figure 2.9.2, p. 105 (illustration of colored tilings), Figure 2.5.3(d), p. 83 (topologically equivalent star tiling), and Exercise 4.1.3, p. 171 (topological equivalence of trihexagonal and two-triangle tilings). It consists of equilateral triangles and regular hexagons, arranged so that each hexagon is surrounded by triangles and vice versa. The name derives from the fact that it combines a regular hexagonal tiling and a regular triangular tiling. Two hexagons and two triangles alternate around each vertex, and its edges form an infinite arrangement of lines. Its dual is the rhombille tiling. This pattern, and its place in the classification of uniform tilings, was already known to Joh ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Square Lattice
In mathematics, the square lattice is a type of lattice in a two-dimensional Euclidean space. It is the two-dimensional version of the integer lattice, denoted as . It is one of the five types of two-dimensional lattices as classified by their symmetry groups; its symmetry group in IUC notation as , Coxeter notation as , and orbifold notation as . Two orientations of an image of the lattice are by far the most common. They can conveniently be referred to as the upright square lattice and diagonal square lattice; the latter is also called the centered square lattice.. They differ by an angle of 45°. This is related to the fact that a square lattice can be partitioned into two square sub-lattices, as is evident in the colouring of a checkerboard. Symmetry The square lattice's symmetry category is wallpaper group . A pattern with this lattice of translational symmetry cannot have more, but may have less symmetry than the lattice itself. An upright square lattice can be view ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hexagonal Lattice
The hexagonal lattice or triangular lattice is one of the five two-dimensional Bravais lattice types. The symmetry category of the lattice is wallpaper group p6m. The primitive translation vectors of the hexagonal lattice form an angle of 120° and are of equal lengths, : , \mathbf a_1, = , \mathbf a_2, = a. The reciprocal lattice of the hexagonal lattice is a hexagonal lattice in reciprocal space with orientation changed by 90° and primitive lattice vectors of length : g=\frac. Honeycomb point set The honeycomb point set is a special case of the hexagonal lattice with a two-atom basis. The centers of the hexagons of a honeycomb form a hexagonal lattice, and the honeycomb point set can be seen as the union of two offset triangular lattices. In nature, carbon atoms of the two-dimensional material graphene are arranged in a honeycomb point set. Crystal classes The ''hexagonal lattice'' class names, Schönflies notation, Hermann-Mauguin notation, orbifold nota ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fekete's Lemma
In mathematics, subadditivity is a property of a function that states, roughly, that evaluating the function for the sum of two elements of the domain always returns something less than or equal to the sum of the function's values at each element. There are numerous examples of subadditive functions in various areas of mathematics, particularly norms and square roots. Additive maps are special cases of subadditive functions. Definitions A subadditive function is a function f \colon A \to B, having a domain ''A'' and an ordered codomain ''B'' that are both closed under addition, with the following property: \forall x, y \in A, f(x+y)\leq f(x)+f(y). An example is the square root function, having the non-negative real numbers as domain and codomain, since \forall x, y \geq 0 we have: \sqrt\leq \sqrt+\sqrt. A sequence \left \, n \geq 1, is called subadditive if it satisfies the inequality a_\leq a_n+a_m for all ''m'' and ''n''. This is a special case of subadditive function ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stanislav Smirnov
Stanislav Konstantinovich Smirnov (russian: Станисла́в Константи́нович Cмирно́в; born 3 September 1970) is a Russian mathematician currently working at the University of Geneva. He was awarded the Fields Medal in 2010. His research involves complex analysis, dynamical systems and probability theory. Career Smirnov's Ph.D. was conducted at Caltech under advisor Nikolai Makarov. In 1998 he was employed as part of the faculty at the Royal Institute of Technology in Stockholm, after which he took up his second position as a professor in the Analysis, Mathematical Physics and Probability group at the University of Geneva in 2003. Research Smirnov has worked on percolation theory, where he proved Cardy's formula for critical site percolation on the triangular lattice, and deduced conformal invariance. The conjecture was proved in the special case of site percolation on the triangular lattice. Smirnov's theorem has led to a fairly complete theory ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Self-avoiding Walks
In mathematics, a self-avoiding walk (SAW) is a sequence of moves on a lattice (a lattice path) that does not visit the same point more than once. This is a special case of the graph theoretical notion of a path. A self-avoiding polygon (SAP) is a closed self-avoiding walk on a lattice. Very little is known rigorously about the self-avoiding walk from a mathematical perspective, although physicists have provided numerous conjectures that are believed to be true and are strongly supported by numerical simulations. In computational physics, a self-avoiding walk is a chain-like path in or with a certain number of nodes, typically a fixed step length and has the property that it doesn't cross itself or another walk. A system of SAWs satisfies the so-called excluded volume condition. In higher dimensions, the SAW is believed to behave much like the ordinary random walk. SAWs and SAPs play a central role in the modeling of the topological and knot-theoretic behavior of thread- a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Duminil-Copin
Hugo Duminil-Copin (born 26 August 1985) is a French mathematician specializing in probability theory. He was awarded the Fields Medal in 2022. Biography The son of a middle school sports teacher and a former female dancer who became a primary school teacher, Duminil-Copin grew up in the outer suburbs of Paris, where he played a lot of sports as a child, and initially considered attending a sports-oriented high school to pursue his interest in handball. He decided to attend a school focused on mathematics and science, and enrolled at the Lycée Louis-le-Grand in Paris, then at the École normale supérieure (Paris) and the University Paris-Sud. He decided to focus on math instead of physics, because he found the rigour of mathematical proof more satisfying, but developed an interest in percolation theory, which is used in mathematical physics to address issues in statistical mechanics. In 2008, he moved to the University of Geneva to write a PhD thesis under Stanislav Smirnov. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Percolation Threshold
The percolation threshold is a mathematical concept in percolation theory that describes the formation of long-range connectivity in random systems. Below the threshold a giant connected component does not exist; while above it, there exists a giant component of the order of system size. In engineering and coffee making, percolation represents the flow of fluids through porous media, but in the mathematics and physics worlds it generally refers to simplified lattice models of random systems or networks (graphs), and the nature of the connectivity in them. The percolation threshold is the critical value of the occupation probability ''p'', or more generally a critical surface for a group of parameters ''p''1, ''p''2, ..., such that infinite connectivity (''percolation'') first occurs. Percolation models The most common percolation model is to take a regular lattice, like a square lattice, and make it into a random network by randomly "occupying" sites (vertices) or bonds (edges ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
