2006
DOI: 10.1088/0305-4470/39/16/004
|View full text |Cite
|
Sign up to set email alerts
|

Possible sets of autocorrelations and the Simplex algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2007
2007
2011
2011

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 13 publications
0
3
0
Order By: Relevance
“…As the notation indicates, we are still considering translation invariant correlations; we may in addition require that the two-point correlations ρ 2 (x, y) of the realizing measure all be translation invariant and approach ρ 2 as |x − y| → ∞. This is the problem discussed in [15] for r ∈ Z, or just on a ring. It turns out that, at least for the case r ∈ Z and specified (ρ, g (1), .…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…As the notation indicates, we are still considering translation invariant correlations; we may in addition require that the two-point correlations ρ 2 (x, y) of the realizing measure all be translation invariant and approach ρ 2 as |x − y| → ∞. This is the problem discussed in [15] for r ∈ Z, or just on a ring. It turns out that, at least for the case r ∈ Z and specified (ρ, g (1), .…”
Section: Discussionmentioning
confidence: 99%
“…, k, are specified only on part of the domain X; for example, on the lattice we might only specify the nearest neighbor correlations. See [15] for a similar problem in error correcting codes. We will not consider this case further here, except for some comments at the end of section 6.…”
Section: Introductionmentioning
confidence: 99%
“…In this and other situations it is natural to consider a closely related problem in which the CONDITIONS FOR REALIZABILITY 5 correlation functions are specified only on part of the domain X; for example, if X is a lattice then we might only specify the nearest neighbor correlations. See [17] for a similar problem in error correcting codes. This will not be considered here; see, however, [20], Section 7.…”
Section: Introductionmentioning
confidence: 99%