|
Alternating Sign Matrix Conjecture
In mathematics, an alternating sign matrix is a square matrix of 0s, 1s, and −1s such that the sum of each row and column is 1 and the nonzero entries in each row and column alternate in sign. These matrices generalize permutation matrices and arise naturally when using Dodgson condensation to compute a determinant. They are also closely related to the six-vertex model with domain wall boundary conditions from statistical mechanics. They were first defined by William Mills, David Robbins, and Howard Rumsey in the former context. Examples A permutation matrix is an alternating sign matrix, and an alternating sign matrix is a permutation matrix if and only if no entry equals . An example of an alternating sign matrix that is not a permutation matrix is : \begin 0&0&1&0\\ 1&0&0&0\\ 0&1&-1&1\\ 0&0&1&0 \end. Alternating sign matrix theorem The ''alternating sign matrix theorem'' states that the number of n\times n alternating sign matrices is : \prod_^\frac = \frac. The fi ... [...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 points of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Square Matrix
In mathematics, a square matrix is a matrix with the same number of rows and columns. An ''n''-by-''n'' matrix is known as a square matrix of order Any two square matrices of the same order can be added and multiplied. Square matrices are often used to represent simple linear transformations, such as shearing or rotation. For example, if R is a square matrix representing a rotation (rotation matrix) and \mathbf is a column vector describing the position of a point in space, the product R\mathbf yields another column vector describing the position of that point after that rotation. If \mathbf is a row vector, the same transformation can be obtained using where R^ is the transpose of Main diagonal The entries a_ (''i'' = 1, …, ''n'') form the main diagonal of a square matrix. They lie on the imaginary line which runs from the top left corner to the bottom right corner of the matrix. For instance, the main diagonal of the 4×4 matrix above contains the elements , , , . The d ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Permutation Matrix
In mathematics, particularly in matrix theory, a permutation matrix is a square binary matrix that has exactly one entry of 1 in each row and each column and 0s elsewhere. Each such matrix, say , represents a permutation of elements and, when used to multiply another matrix, say , results in permuting the rows (when pre-multiplying, to form ) or columns (when post-multiplying, to form ) of the matrix . Definition Given a permutation of ''m'' elements, :\pi : \lbrace 1, \ldots, m \rbrace \to \lbrace 1, \ldots, m \rbrace represented in two-line form by :\begin 1 & 2 & \cdots & m \\ \pi(1) & \pi(2) & \cdots & \pi(m) \end, there are two natural ways to associate the permutation with a permutation matrix; namely, starting with the ''m'' × ''m'' identity matrix, , either permute the columns or permute the rows, according to . Both methods of defining permutation matrices appear in the literature and the properties expressed in one representation can be easily converted to th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dodgson Condensation
In mathematics, Dodgson condensation or method of contractants is a method of computing the determinants of square matrix, square matrices. It is named for its inventor, Charles Lutwidge Dodgson (better known by his pseudonym, as Lewis Carroll, the popular author). The method in the case of an ''n'' × ''n'' matrix is to construct an (''n'' − 1) × (''n'' − 1) matrix, an (''n'' − 2) × (''n'' − 2), and so on, finishing with a 1 × 1 matrix, which has one entry, the determinant of the original matrix. General method This algorithm can be described in the following four steps: # Let A be the given ''n'' × ''n'' matrix. Arrange A so that no zeros occur in its interior. An explicit definition of interior would be all ai,j with i,j\ne1,n. One can do this using any operation that one could normally perform without changing the value of the determinant, such as adding a multiple of one row t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Six-vertex Model
In statistical mechanics, the ice-type models or six-vertex models are a family of vertex models for crystal lattices with hydrogen bonds. The first such model was introduced by Linus Pauling in 1935 to account for the residual entropy of water ice. Variants have been proposed as models of certain ferroelectric and antiferroelectric crystals. In 1967, Elliott H. Lieb found the exact solution to a two-dimensional ice model known as "square ice". The exact solution in three dimensions is only known for a special "frozen" state. Description An ice-type model is a lattice model defined on a lattice of coordination number 4. That is, each vertex of the lattice is connected by an edge to four "nearest neighbours". A state of the model consists of an arrow on each edge of the lattice, such that the number of arrows pointing inwards at each vertex is 2. This restriction on the arrow configurations is known as the ice rule. In graph theoretic terms, the states are Eulerian orientatio ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Statistical Mechanics
In physics, statistical mechanics is a mathematical framework that applies statistical methods and probability theory to large assemblies of microscopic entities. It does not assume or postulate any natural laws, but explains the macroscopic behavior of nature from the behavior of such ensembles. Statistical mechanics arose out of the development of classical thermodynamics, a field for which it was successful in explaining macroscopic physical properties—such as temperature, pressure, and heat capacity—in terms of microscopic parameters that fluctuate about average values and are characterized by probability distributions. This established the fields of statistical thermodynamics and statistical physics. The founding of the field of statistical mechanics is generally credited to three physicists: *Ludwig Boltzmann, who developed the fundamental interpretation of entropy in terms of a collection of microstates *James Clerk Maxwell, who developed models of probability distr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
David P
David (; , "beloved one") (traditional spelling), , ''Dāwūd''; grc-koi, Δαυΐδ, Dauíd; la, Davidus, David; gez , ዳዊት, ''Dawit''; xcl, Դաւիթ, ''Dawitʿ''; cu, Давíдъ, ''Davidŭ''; possibly meaning "beloved one". was, according to the Hebrew Bible, the third king of the United Kingdom of Israel. In the Books of Samuel, he is described as a young shepherd and harpist who gains fame by slaying Goliath, a champion of the Philistines, in southern Canaan. David becomes a favourite of Saul, the first king of Israel; he also forges a notably close friendship with Jonathan, a son of Saul. However, under the paranoia that David is seeking to usurp the throne, Saul attempts to kill David, forcing the latter to go into hiding and effectively operate as a fugitive for several years. After Saul and Jonathan are both killed in battle against the Philistines, a 30-year-old David is anointed king over all of Israel and Judah. Following his rise to power, David ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Permutation Matrix
In mathematics, particularly in matrix theory, a permutation matrix is a square binary matrix that has exactly one entry of 1 in each row and each column and 0s elsewhere. Each such matrix, say , represents a permutation of elements and, when used to multiply another matrix, say , results in permuting the rows (when pre-multiplying, to form ) or columns (when post-multiplying, to form ) of the matrix . Definition Given a permutation of ''m'' elements, :\pi : \lbrace 1, \ldots, m \rbrace \to \lbrace 1, \ldots, m \rbrace represented in two-line form by :\begin 1 & 2 & \cdots & m \\ \pi(1) & \pi(2) & \cdots & \pi(m) \end, there are two natural ways to associate the permutation with a permutation matrix; namely, starting with the ''m'' × ''m'' identity matrix, , either permute the columns or permute the rows, according to . Both methods of defining permutation matrices appear in the literature and the properties expressed in one representation can be easily converted to th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Matrice Signes Alternants 4x4
Matrice is a ''comune'' (municipality) in the Province of Campobasso in the Italian region Molise, located about northeast of Campobasso. As of 31 December 2004, it had a population of 1,081 and an area of .All demographics and other statistics: Italian statistical institute Istat. Matrice borders the following municipalities: Campobasso, Campolieto, Castellino del Biferno, Montagano, Petrella Tifernina, Ripalimosani, San Giovanni in Galdo San Giovanni in Galdo is a ''comune'' (municipality) in the Province of Campobasso in the Italian region of Molise, located about east of Campobasso. San Giovanni in Galdo borders the following municipalities: Campobasso, Campodipietra, Campo .... At the beginning of the 20th century, many residents of Matrice began to immigrate to the U.S. Demographic evolution Colors= id:lightgrey value:gray(0.9) id:darkgrey value:gray(0.8) id:sfondo value:rgb(1,1,1) id:barra value:rgb(0.6,0.7,0.8) ImageSize = width:455 height:303 PlotAr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Doron Zeilberger
Doron Zeilberger (דורון ציילברגר, born 2 July 1950 in Haifa, Israel) is an Israeli mathematician, known for his work in combinatorics. Education and career He received his doctorate from the Weizmann Institute of Science in 1976, under the direction of Harry Dym, with the thesis "New Approaches and Results in the Theory of Discrete Analytic Functions." He is a Board of Governors Professor of Mathematics at Rutgers University. Contributions Zeilberger has made contributions to combinatorics, hypergeometric identities, and q-series. Zeilberger gave the first proof of the alternating sign matrix conjecture, noteworthy not only for its mathematical content, but also for the fact that Zeilberger recruited nearly a hundred volunteer checkers to "pre-referee" the paper. In 2011, together with Manuel Kauers and Christoph Koutschan, Zeilberger proved the ''q''-TSPP conjecture, which was independently stated in 1983 by George Andrews and David P. Robbins. Zeilberger is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Greg Kuperberg
Greg Kuperberg (born July 4, 1967) is a Polish-born American mathematician known for his contributions to geometric topology, quantum algebra, and combinatorics. Kuperberg is a professor of mathematics at the University of California, Davis.Greg Kuperberg, Greg Kuperberg', retrieved March 8, 2008. Biography Kuperberg is the son of two mathematicians, Krystyna Kuperberg and Włodzimierz Kuperberg. He was born in Poland in 1967, but his family emigrated to Sweden in 1969 due to the 1968 Polish political crisis. In 1972, Kuperberg's family moved to the United States, eventually settling in Auburn, Alabama. Kuperberg wrote three computer games for the IBM Personal Computer in 1982 and 1983 (which were published by Orion Software): ''Paratrooper'', ''PC-Man'' and ''J-Bird''. (video game clones of ''Sabotage'', ''Pac-Man'' and ''Q*bert'', respectively) He enrolled at Harvard University in 1983 and received a bachelor's degree in 1987. He was ranked Top 10 in the 1986 William Low ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Yang–Baxter Equation
In physics, the Yang–Baxter equation (or star–triangle relation) is a consistency equation which was first introduced in the field of statistical mechanics. It depends on the idea that in some scattering situations, particles may preserve their momentum while changing their quantum internal states. It states that a matrix R, acting on two out of three objects, satisfies :(\check\otimes \mathbf)(\mathbf\otimes \check)(\check\otimes \mathbf) =(\mathbf\otimes \check)(\check \otimes \mathbf)(\mathbf\otimes \check) In one dimensional quantum systems, R is the scattering matrix and if it satisfies the Yang–Baxter equation then the system is integrable. The Yang–Baxter equation also shows up when discussing knot theory and the braid groups where R corresponds to swapping two strands. Since one can swap three strands two different ways, the Yang–Baxter equation enforces that both paths are the same. It takes its name from independent work of C. N. Yang from 1968, and R. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
