English
Related papers

Related papers: Lattice exit models

200 papers

We study the dynamics of fronts in parametrically forced oscillating lattices. Using as a prototypical example the discrete Ginzburg-Landau equation, we show that much information about front bifurcations can be extracted by projecting onto…

Pattern Formation and Solitons · Physics 2008-01-18 Diego Pazó , Ernesto M. Nicola

The following is the very first set of the series in 'Problems and Solutions in a Graduate Course in Classical Electrodynamics'. In each of the sets of the problems we intend to follow a theme, which not only makes it unique but also deals…

Classical Physics · Physics 2008-01-30 Raza M. Syed

We introduce an algorithm for computing closure systems derived from a family of implications on a set. Semilattices presentations are explored and used in conjunction with the algorithm to compute various types of lattices freely generated…

Combinatorics · Mathematics 2010-04-26 Jean Yves Semegni , Marcel Wild

One of the longstanding problems in universal algebra is the question of which finite lattices are isomorphic to the congruence lattices of finite algebras. This question can be phrased as which finite lattices can be represented as…

Combinatorics · Mathematics 2014-12-25 Jeremy F. Alm , John W. Snow

The study of very large graphs is a prominent theme in modern-day mathematics. In this paper we develop a rigorous foundation for studying the space of finite labelled graphs and their limits. These limiting objects are naturally countable…

Combinatorics · Mathematics 2021-05-27 Apoorva Khare , Bala Rajaratnam

We introduce an algebraic concept of the frame for abstract conditional independence (CI) models, together with basic operations with respect to which such a frame should be closed: copying and marginalization. Three standard examples of…

Combinatorics · Mathematics 2024-11-04 Tobias Boege , Janneke H. Bolt , Milan Studený

We show that real tight frames that generate lattices must be rational, and use this observation to describe a construction of lattices from vertex transitive graphs. In the case of irreducible group frames, we show that the corresponding…

Combinatorics · Mathematics 2019-08-20 Lenny Fukshansky , Deanna Needell , Josiah Park , Yuxin Xin

The study of Locally Checkable Labelings (LCLs) has led to a remarkably precise characterization of the distributed time complexities that can occur on bounded-degree trees. A central feature of this complexity landscape is the existence of…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-02-17 Gustav Schmid

We explore the possibilities for elementary embeddings $j : M \to N$, where $M$ and $N$ are models of ZFC with the same ordinals, $M \subseteq N$, and $N$ has access to large pieces of $j$. We construct commuting systems of such maps…

Logic · Mathematics 2023-03-27 Monroe Eskew , Sy-David Friedman

We study a free boundary problem on the lattice whose scaling limit is a harmonic free boundary problem with a discontinuous Hamiltonian. We find an explicit formula for the Hamiltonian, prove the solutions are unique, and prove that the…

Analysis of PDEs · Mathematics 2018-11-14 William M Feldman , Charles K Smart

There is increasing focus on analyzing data represented as hypergraphs, which are better able to express complex relationships amongst entities than are graphs. Much of the critical information about hypergraph structure is available only…

Data Structures and Algorithms · Computer Science 2023-07-24 Michael G. Rawson , Audun Myers , Robert Green , Michael Robinson , Cliff Joslyn

In this paper, we first develop the theory of Musielak-Orlicz spaces on locally finite graphs, including completeness, reflexivity, separability, and so on. Then, we give some elementary properties of double phase operators on locally…

Analysis of PDEs · Mathematics 2024-04-16 Zhentao He , Chao Ji

We study lattice fermions from the viewpoint of spectral graph theory (SGT). We find that a fermion defined on a certain lattice is identified as a spectral graph. SGT helps us investigate the number of zero eigenvalues of lattice Dirac…

High Energy Physics - Lattice · Physics 2022-02-17 Jun Yumoto , Tatsuhiro Misumi

For large ranks, there is no good algorithm that decides whether a given lattice has an orthonormal basis. But when the lattice is given with enough symmetry, we can construct a provably deterministic polynomial-time algorithm to accomplish…

Number Theory · Mathematics 2016-10-05 H. W. Lenstra , A. Silverberg

We derive the degrees of freedom of the lasso fit, placing no assumptions on the predictor matrix $X$. Like the well-known result of Zou, Hastie and Tibshirani [Ann. Statist. 35 (2007) 2173-2192], which gives the degrees of freedom of the…

Statistics Theory · Mathematics 2012-07-25 Ryan J. Tibshirani , Jonathan Taylor

This paper extends prior work on the connections between logics from finite model theory and propositional/algebraic proof systems. We show that if all non-isomorphic graphs in a given graph class can be distinguished in the logic…

Logic in Computer Science · Computer Science 2023-02-13 Benedikt Pago

The problems of enumerating lattice walks, with an arbitrary finite set of allowed steps, both in one and two dimensions, where one must always stay in the non-negative half-line and quarter-plane respectively, are used, as case studies, to…

Combinatorics · Mathematics 2015-02-17 Shalosh B. Ekhad , Doron Zeilberger

The critical behavior of driven lattice gas models has been studied for decades as a paradigm to explore nonequilibrium phase transitions and critical phenomena. However, there exists a long-standing controversy in the universality classes…

Statistical Mechanics · Physics 2019-09-04 Yahui Li , Zhongda Zeng , Fan Zhong

We study the Fourier transforms of indicator functions of some special high-dimensional finite type domains and obtain estimates of the associated lattice point discrepancy.

Number Theory · Mathematics 2015-12-17 Jingwei Guo

Coordination sequences of periodic and quasiperiodic graphs are analysed. These count the number of points that can be reached from a given point of the graph by a number of steps along its bonds, thus generalising the familiar coordination…

Statistical Mechanics · Physics 2019-07-17 Michael Baake , Uwe Grimm , Przemyslaw Repetowicz , Dieter Joseph