2020
DOI: 10.3390/e22030322
|View full text |Cite
|
Sign up to set email alerts
|

Unification of the Nature’s Complexities via a Matrix Permanent—Critical Phenomena, Fractals, Quantum Computing, ♯P-Complexity

Abstract: We reveal the analytic relations between a matrix permanent and major nature’s complexities manifested in critical phenomena, fractal structures and chaos, quantum information processes in many-body physics, number-theoretic complexity in mathematics, and ♯P-complete problems in the theory of computational complexity. They follow from a reduction of the Ising model of critical phenomena to the permanent and four integral representations of the permanent based on (i) the fractal Weierstrass-like functions, (ii)… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
15
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6

Relationship

2
4

Authors

Journals

citations
Cited by 12 publications
(15 citation statements)
references
References 64 publications
(110 reference statements)
0
15
0
Order By: Relevance
“…The permanents of the order 6 and lower in the right-hand side of the recurrence equations (that is, A 3 , A( * ) 3 , B 4 , B 5 , etc.) should be computed directly via the definition of the permanent in Equation (1). Direct numerical calculations, such as in Figure 1, confirm that the recurrence ( 44)- (48) gives easy and fast access to the correct result for the permanent of the circulant (3) with arbitrary, even complex values of the entries c 0 , c 1 , c 2 for any, arbitrarily large matrix size n in linear time.…”
Section: The Permanent Of a Uniform Circulant Matrix With A Band Of Two Any-value Diagonals (K = 2) And The Ménage Numbersmentioning
confidence: 91%
See 4 more Smart Citations
“…The permanents of the order 6 and lower in the right-hand side of the recurrence equations (that is, A 3 , A( * ) 3 , B 4 , B 5 , etc.) should be computed directly via the definition of the permanent in Equation (1). Direct numerical calculations, such as in Figure 1, confirm that the recurrence ( 44)- (48) gives easy and fast access to the correct result for the permanent of the circulant (3) with arbitrary, even complex values of the entries c 0 , c 1 , c 2 for any, arbitrarily large matrix size n in linear time.…”
Section: The Permanent Of a Uniform Circulant Matrix With A Band Of Two Any-value Diagonals (K = 2) And The Ménage Numbersmentioning
confidence: 91%
“…Plugging the third equation into Equation (30), we get the first equation of the system (27). At last, the second equation of the system (27) follows from the first equation and the representation of the permanent of the matrix A (1) with a 1's-column defect at the position of the first column obtained by means of Lemma 1:…”
Section: The Permanent Of a Uniform Circulant Matrix With A Band Of Two Any-value Diagonals (K = 2) And The Ménage Numbersmentioning
confidence: 99%
See 3 more Smart Citations