Related papers: Lattices in Chip-Firing
The coupled-mode theory is developed for description of the nonlinear wave dynamics in binary optical lattices. The obtained equations of motion accurately describe nonlinear wave dynamics close to the band edges and in the gap of the…
Linearizability is the de facto consistency condition for concurrent objects, widely used in theory and practice. Loosely speaking, linearizability classifies concurrent executions as correct if operations on shared objects appear to take…
The aim of the present paper is to show that the concept of intuitionistic logic based on a Heyting algebra can be generalized in such a way that it is formalized by means of a bounded poset. In this case it is not assumed that the poset is…
A scheme for addressing individual atoms in one- or two-dimensional optical lattices loaded with one atom per site is proposed. The scheme is based on position-dependent atomic population transfer induced by several standing-wave driving…
We examine the lattice of all order congruences of a finite poset from the viewpoint of combinatorial algebraic topology. We will prove that the order complex of the lattice of all nontrivial order congruences (or order-preserving…
We study a certain poset on the free monoid on a countable alphabet. This poset is determined by the fact that its total extensions are precisely the standard term orders. We also investigate the poset classifying degree-compatible standard…
In this paper, we consider a reaction-diffusion system describing the propagation of flames under the assumption of ignition-temperature kinetics and fractional reaction order. It was shown in [3] that this system admits a traveling front…
There is a well-known bijection between parking functions of a fixed length and maximal chains of the noncrossing partition lattice which we can use to associate to each set of parking functions a poset whose Hasse diagram is the union of…
The purpose of this paper is to study stable representations of partially ordered sets (posets) and compare it to the well known theory for quivers. In particular, we prove that every indecomposable representation of a poset of finite type…
We consider a bound system of charged particles moving in an external electromagnetic field, including leading relativistic corrections. The difference from the point particle with a magnetic moment comes from the presence of…
We study the mobility of a charged colloidal particle in a constant homogeneous electric field by means of computer simulations. The simulation method combines a lattice Boltzmann scheme for the fluid with standard Langevin dynamics for the…
A grid poset -- or grid for short -- is a product of chains. We ask, what does a random linear extension of a grid look like? In particular, we show that the average "jump number," i.e., the number of times that two consecutive elements in…
We classify finite posets with a particular sorting property, generalizing a result for rectangular arrays. Each poset is covered by two sets of disjoint saturated chains such that, for any original labeling, after sorting the labels along…
We study a far-from-equilibrium system of interacting particles, hopping between sites of a 1d lattice with a rate which increases with the number of particles at interacting sites. We find that clusters of particles, which initially…
We investigate linear and additive codes in partially ordered Hamming-like spaces that satisfy the extension property, meaning that automorphisms of ideals extend to automorphisms of the poset. The codes are naturally described in terms of…
We introduce the concept of a bounded below set in a lattice. This can be used to give a generalization of Rota's broken circuit theorem to any finite lattice. We then show how this result can be used to compute and combinatorially explain…
In this paper we introduce and study the poset of equivalence classes of subgroups of a finite group $G$, induced by the isomorphism relation. This contains the well-known lattice of solitary subgroups of $G$. We prove that in several…
We present a matrix-theoretic approach for studying and enumerating finite posets through their incidence representations, referred to as poset matrices. Naturally labelled posets are encoded as Boolean lower triangular matrices, allowing a…
Adding a column of numbers produces "carries" along the way. We show that random digits produce a pattern of carries with a neat probabilistic description: the carries form a one-dependent determinantal point process. This makes it easy to…
We study on-line colorings of certain graphs given as intersection graphs of objects "between two lines", i.e., there is a pair of horizontal lines such that each object of the representation is a connected set contained in the strip…