The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
2014
DOI: 10.1140/epje/i2014-14002-9
|View full text |Cite
|
Sign up to set email alerts
|

Ordering kinetics in liquid crystals with long-ranged interactions

Abstract: We present the results from comprehensive Monte Carlo (MC) simulations of ordering kinetics in d = 2 liquid crystals (LCs). Our LC system is described by the two-component Lebwohl-Lasher model with long-ranged interactions, V(r) ∼ r(-n). We find that systems with n ≥ 2 show the same dynamical behavior as the nearest-neighbor case (n = ∞). This contradicts available theoretical predictions.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
6
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
6
2
1

Relationship

2
7

Authors

Journals

citations
Cited by 11 publications
(6 citation statements)
references
References 29 publications
0
6
0
Order By: Relevance
“…We thus consider n < 4 cases for the long-ranged interaction. For each value of n , we cut-off the interaction at r c = (2.5) 6/ n to accelerate our simulation [ 41 ]. We stress that the simulations are numerically very demanding for larger cut-offs.…”
Section: Details Of Simulationmentioning
confidence: 99%
“…We thus consider n < 4 cases for the long-ranged interaction. For each value of n , we cut-off the interaction at r c = (2.5) 6/ n to accelerate our simulation [ 41 ]. We stress that the simulations are numerically very demanding for larger cut-offs.…”
Section: Details Of Simulationmentioning
confidence: 99%
“…The generic simple feature of the method shall ensure its facile adoptions to nonequilibrium simulations of other models, viz., q-state Potts and clock models. In view of the delicate cut-off dependence, it would also be interesting to revisit the ordering phenomenon in long-range liquid crystals [41]. Although originally designed for simulating dynamics, our method should be proven to be handy for equilibrium simulations of systems with long-range interactions, for which there (currently) exist no cluster algorithms, e.g.,…”
mentioning
confidence: 99%
“…We thus consider n < 4 cases for the longranged interaction. For each value of n, we cut-off the interaction at r c = (2.5) 6/n to accelerate our simulation [29]. We stress that the simulations are numerically very demanding for larger cut-offs.…”
Section: Details Of Simulationmentioning
confidence: 99%