Related papers: Some Properties of Lattice Substitution Systems
In the framework of the so called link approach we study exact lattice supersymmetry for the simplest supersymmetric model: N=1 supersymmetry in D=1. The model is described by a lattice with spacing a/2, thus containing twice as many sites…
An optical four-level atomic discrete system through optical induction is proposed. A theoretical scheme to produce nonclassical lattice solitons (NLS) in the system is presented with the use of the effects of enhanced self-phase modulation…
The Lie product and the order relation are viewed as defining structures for Hamiltonian dynamical systems. Their admissible combinations are singled out by the requirement that the group of the Lie automorphisms be contained in the group…
We produce families of two-dimensional gap solitons (GSs) maintained by moir\'{e} lattices (MLs) composed of linear and nonlinear sublattices, with the defocusing sign of the nonlinearity. Depending on the angle between the sublattices, the…
A two species interacting system motivated by the density functional theory for triblock copolymers contains long range interaction that affects the two species differently. In a two species periodic assembly of discs, the two species…
The intrinsic connection between lattice theory and topology is fairly well established, For instance, the collection of open subsets of a topological subspace always forms a distributive lattice. Persistent homology has been one of the…
We completely determine all semigroup varieties satysfiyng a permutational identity of length 3 that are modular elements of the lattice of all semigroup varieties. Using this result, we provide an example of a semigroup variety that is a…
The main purpose of this paper is to study the lattice structure of variable precision rough sets. The notion of variation in precision of rough sets have been further extended to variable precision rough set with variable classification…
We show that the process of spontaneous symmetry breaking can trap a field theoretic system in a highly non-trivial state containing a lattice of domain walls. In one large compact space dimension, a lattice is inevitably formed. In two…
Tunnelling Two-Level Systems (TLS) dominate the physics of glasses at low temperatures. Yet TLS are extremely rare and it is extremely difficult to directly observe them $\it{in \, silico}$. It is thus crucial to develop simple structural…
The dynamical behavior of switched affine systems is known to be more intricate than that of the well-studied switched linear systems, essentially due to the existence of distinct equilibrium points for each subsystem. First, under…
Linear time-invariant (LTI) systems appear frequently in natural sciences and engineering contexts. Many LTI systems are described by ordinary differential equations (ODEs). For example, biological gene regulation, analog filter circuits,…
We investigate the connection between pseudo-Hermitian and Hermitian descriptions for a lattice, which consists of a set of isomorphic pseudo-Hermitian clusters. We show that such non-Hermitian systems can act as Hermitian systems. This is…
For a rank two root system and a pair of nonnegative integers, using only elementary combinatorics we construct two posets. The constructions are uniform across the root systems A1+A1, A2, C2, and G2. Examples appear in Figures 3.2 and 3.3.…
For a many-to-many matching market, we study the lattice structure of the set of random stable matchings. We define a partial order on the random stable set and present two intuitive binary operations to compute the least upper bound and…
The set of all perfect matchings of a plane (weakly) elementary bipartite graph equipped with a partial order is a poset, moreover the poset is a finite distributive lattice and its Hasse diagram is isomorphic to $Z$-transformation directed…
This paper focuses on analyzing and differentiating between lattice linear problems and algorithms. It introduces a new class of algorithms called \textit{(fully) lattice linear algorithms}. A property of these algorithms is that they…
Flatness of discrete-time systems can be characterized by two simple properties. There exists a map, a submersion, from the flat coordinates and their forward shifts to the state and the input of the discrete-time system, such that the…
In this work, we study some general property of a strongly correlated electron system defined on a lattice. Assuming that the lattice system exhibits off-diagonal long range order, we show rigorously that this assumption would lead to…
Using a recently introduced tensor network method, we study the density of states of the lattice Schwinger model, a standard testbench for lattice gauge theory numerical techniques, but also the object of recent experimental quantum…