This page requires that JavaScript be enabled in your browser.
Learn how »
Graph Rewriting for Lattice Topological Invariants
Sinuhé Perea
Learn about finite lattice systems in the context of simple rewriting rules. Based on discrete manifolds and Cayley graphs, we look for the set and taxonomy of simple rewriting rules that preserve properties that can be understood as conserved measurable magnitudes of a physical system. We study those toy models about field configurations of discrete fiber bundles and we apply local perturbations to a field configuration, searching for discrete analogs to Noether's theorem.
Thanks for your feedback.
Channels: Technology Conference
1311 videos match your search.
|
Eric Mjolsness Collaborative projects have resulted in several Mathematica-implemented modeling languages aimed at general-purpose biological modeling, which is a useful and topical but an indefinitely expandable goal. We update previous work on ... |
|
Jae Bum Jung/Yan Zhuang |
|
Phillip Todd |
|
Василий Сороко |
|
Phil Ramsden |
|
Lou D'Andria Constructing interfaces with Dynamic, DynamicModule and Manipulate is nothing new, but those aren't the only Dynamic primitives available in Mathematica. In this talk, we'll identify and demonstrate some of the ... |
|
Галина Михалкина, Григорий Фридман |
|
Галина Михалкина |
|
Андрей Кротких |
|
Антон Екименко, Кирилл Белов |
|
Физический институт имени П.Н. Лебедева |
|
Григорий Фридман, Олег Иванов |
|
Галина Михалкина |
|
Олег Кофнов |
|
Николай Сосновский |
|
Микаэл Эгибян |
|
Микаэл Эгибян |
|
Леонид Шифрин |
|
Вахагн Геворгян |
|
Алексей Семенов |