umu.sePublications
Change search

Cite
Citation style
• apa
• ieee
• modern-language-association-8th-edition
• vancouver
• Other style
More styles
Language
• de-DE
• en-GB
• en-US
• fi-FI
• nn-NO
• nn-NB
• sv-SE
• Other locale
More languages
Output format
• html
• text
• asciidoc
• rtf
On the Ising problem and some matrix operations
Umeå University, Faculty of Science and Technology, Department of Mathematics and Mathematical Statistics.
2007 (English)Doctoral thesis, comprehensive summary (Other academic)
##### Abstract [en]

The first part of the dissertation concerns the Ising problem proposed to Ernst Ising by his supervisor Wilhelm Lenz in the early 20s. The Ising model, or perhaps more correctly the Lenz-Ising model, tries to capture the behaviour of phase transitions, i.e. how local rules of engagement can produce large scale behaviour.

Two decades later Lars Onsager solved the Ising problem for the quadratic lattice without an outer field. Using his ideas solutions for other lattices in two dimensions have been constructed. We describe a method for calculating the Ising partition function for immense square grids, up to linear order 320 (i.e. 102400 vertices).

In three dimensions however only a few results are known. One of the most important unanswered questions is at which temperature the Ising model has its phase transition. In this dissertation it is shown that an upper bound for the critical coupling Kc, the inverse absolute temperature, is 0.29 for the tree dimensional cubic lattice.

To be able to get more information one has to use different statistical methods. We describe one sampling method that can use simple state generation like the Metropolis algorithm for large lattices. We also discuss how to reconstruct the entropy from the model, in order to obtain parameters as the free energy.

The Ising model gives a partition function associated with all finite graphs. In this dissertation we show that a number of interesting graph invariants can be calculated from the coefficients of the Ising partition function. We also give some interesting observations about the partition function in general and show that there are, for any N, N non-isomorphic graphs with the same Ising partition function.

The second part of the dissertation is about matrix operations. We consider the problem of multiplying them when the entries are elements in a finite semiring or in an additively finitely generated semiring. We describe a method that uses O(n3 / log n) arithmetic operations.

We also consider the problem of reducing n x n matrices over a finite field of size q using O(n2 / logq n) row operations in the worst case.

##### Place, publisher, year, edition, pages
Umeå: Matematik och matematisk statistik , 2007. , p. 7
##### Series
Doctoral thesis / Umeå University, Department of Mathematics, ISSN 1102-8300 ; 37
##### Keywords [en]
Ising problem, phase tansition, matrix multiplicatoin, matrix inversion
##### National Category
Discrete Mathematics
##### Identifiers
ISBN: 987-91-7264-323-9 (print)OAI: oai:DiVA.org:umu-1129DiVA, id: diva2:140305
##### Public defence
2007-05-31, MA 121, MIT, Umeå, 13:15 (English)
##### Supervisors
Available from: 2007-05-10 Created: 2007-05-10 Last updated: 2011-04-21Bibliographically approved
##### List of papers
1. Series expansion for the density of states of the Ising and Potts models
Open this publication in new window or tab >>Series expansion for the density of states of the Ising and Potts models
##### Identifiers
urn:nbn:se:umu:diva-2344 (URN)
Available from: 2007-05-10 Created: 2007-05-10 Last updated: 2010-01-13Bibliographically approved
2. Computation of the Ising partition function for two-dimensional square grids
Open this publication in new window or tab >>Computation of the Ising partition function for two-dimensional square grids
2004 (English)In: Physical Review E. Statistical, Nonlinear, and Soft Matter Physics: Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics, ISSN 1063-651X, E-ISSN 1095-3787, Vol. 69, no 4, p. 19-, article id 046104Article in journal (Refereed) Published
##### Abstract [en]

An improved method for obtaining the Ising partition function for $n \times n$ square grids with periodic boundary is presented. Our method applies results from Galois theory in order to split the computation into smaller parts and at the same time avoid the use of numerics. Using this method we have computed the exact partition function for the $320 \times 320$-grid, the $256 \times 256$-grid, and the $160 \times 160$-grid, as well as for a number of smaller grids. We obtain scaling parameters and compare with what theory prescribes.

##### Place, publisher, year, edition, pages
New York: American Physical Society through the American Institute of Physics, 2004
Mathematics
##### Identifiers
urn:nbn:se:umu:diva-7684 (URN)10.1103/PhysRevE.69.046104 (DOI)
Available from: 2008-01-11 Created: 2008-01-11 Last updated: 2018-06-09Bibliographically approved
3. A Monte Carlo sampling scheme for the Ising model
Open this publication in new window or tab >>A Monte Carlo sampling scheme for the Ising model
2004 (English)In: Journal of statistical physics, ISSN 0022-4715, E-ISSN 1572-9613, Vol. 114, no 1-2, p. 455-480Article in journal (Refereed) Published
##### Abstract [en]

In this paper we describe a Monte Carlo sampling scheme for the Ising model and similar discrete-state models. The scheme does not involve any particular method of state generation but rather focuses on a new way of measuring and using the Monte Carlo data. We show how to reconstruct the entropy S of the model, from which, e.g., the free energy can be obtained. Furthermore we discuss how this scheme allows us to more or less completely remove the effects of critical fluctuations near the critical temperature and likewise how it reduces critical slowing down. This makes it possible to use simple state generation methods like the Metropolis algorithm also for large lattices.

Springer, 2004
##### Keywords
Monte Carlo methods, density of states, microcanonical
Mathematics
##### Identifiers
urn:nbn:se:umu:diva-2346 (URN)10.1023/B:JOSS.0000003116.17579.5d (DOI)000186548300016 ()
Available from: 2007-05-10 Created: 2007-05-10 Last updated: 2018-06-09Bibliographically approved
4. The Multivariate Ising Polynomial of a Graph
Open this publication in new window or tab >>The Multivariate Ising Polynomial of a Graph
##### Identifiers
urn:nbn:se:umu:diva-2347 (URN)
Available from: 2007-05-10 Created: 2007-05-10 Last updated: 2010-01-13Bibliographically approved
5. Fast multiplication of matrices over a finitely generated semiring
Open this publication in new window or tab >>Fast multiplication of matrices over a finitely generated semiring
2008 (English)In: Information Processing Letters, ISSN 0020-0190, E-ISSN 1872-6119, Vol. 107, no 6, p. 230-234Article in journal (Refereed) Published
##### Abstract [en]

In this paper we show that n×n matrices with entries from a semiring R which is generated additively by q generators can be multiplied in time O(q2nω), where nω is the complexity for matrix multiplication over a ring (Strassen: ω<2.807, Coppersmith and Winograd: ω<2.376).

We first present a combinatorial matrix multiplication algorithm for the case of semirings with q elements, with complexity O(n3/log2qn), matching the best known methods in this class.

Next we show how the ideas used can be combined with those of the fastest known boolean matrix multiplication algorithms to give an O(q2nω) algorithm for matrices of, not necessarily finite, semirings with q additive generators.

For finite semirings our combinatorial algorithm is simple enough to be a practical algorithm and is expected to be faster than the O(q2nω) algorithm for matrices of practically relevant sizes.

##### Keywords
Matrix multiplication, Semirings
##### Identifiers
urn:nbn:se:umu:diva-2348 (URN)10.1016/j.ipl.2008.03.004 (DOI)
Available from: 2007-05-10 Created: 2007-05-10 Last updated: 2019-07-05Bibliographically approved
6. On the complexity of matrix reduction over finite fields
Open this publication in new window or tab >>On the complexity of matrix reduction over finite fields
2007 (English)In: Advances in Applied Mathematics, ISSN 0196-8858, Vol. 39, no 4, p. 428-452Article in journal (Refereed) Published
##### Abstract [en]

We study matrix elimination over finite fields, and present an algorithm which is asymptotically faster than the traditional Gauss--Jordan elimination. We also bound the average and worst-case complexity for the problem, proving that our algorithm is close to being optimal, and show related concentration results for random matrices.

Next we present the results of a large computational study of the complexities for small matrices and fields. Here we determine the exact distribution of the complexity for matrices from $\mathrm{GL}_{n}(\mathbb{F}_{q})$, with $n$ an $q$ small

Finally we consider an extension of the problems studied for finite fields to finite semifields. We give a conjecture on the behaviour of a natural analogue of $\mathrm{GL}_{n}$ for semifields and prove this for a certain class of semifields.

##### Keywords
Matrix reduction, Complexity, Finite fields, Semifields
##### Identifiers
urn:nbn:se:umu:diva-7595 (URN)doi:10.1016/j.aam.2006.08.008 (DOI)
Available from: 2008-01-11 Created: 2008-01-11 Last updated: 2018-06-09Bibliographically approved

#### Open Access in DiVA

##### File information
File name FULLTEXT01.pdfFile size 226 kBChecksum MD5
7014c551248ffce58e16679afe6a5b55e17606ee7dc8957e2aae4ab906f5a0eeaab09d5a
Type fulltextMimetype application/pdf
##### By organisation
Department of Mathematics and Mathematical Statistics
##### On the subject
Discrete Mathematics

#### Search outside of DiVA

The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available
isbn
urn-nbn

#### Altmetric score

isbn
urn-nbn
Total: 1013 hits

Cite
Citation style
• apa
• ieee
• modern-language-association-8th-edition
• vancouver
• Other style
More styles
Language
• de-DE
• en-GB
• en-US
• fi-FI
• nn-NO
• nn-NB
• sv-SE
• Other locale
More languages
Output format
• html
• text
• asciidoc
• rtf