Related papers: Bubble Lattices I: Structure
In part I: We find a series physical scales such as 1) Planck scale, 2) Minimal approximate grand unification SU(5), 3) the mass scale of the see saw model right handed or Majorana neutrinoes, some invented scale with many scalar bosons,…
A resolution of the intersection of a finite number of subgroups of an abelian group by means of their sums is constructed, provided the lattice generated by these subgroups is distributive. This is used for detecting singularities of…
We apply operad theory to enumerative combinatorics in order to count the number of shuffles between series-parallel posets and chains. We work with three types of shuffles, two of them noncommutative, for example a left deck-divider…
A lattice $\Lambda$ is said to be an extension of a sublattice $L$ of smaller rank if $L$ is equal to the intersection of $\Lambda$ with the subspace spanned by $L$. The goal of this paper is to initiate a systematic study of the geometry…
Flip-sort is a natural sorting procedure which raises fascinating combinatorial questions. It finds its roots in the seminal work of Knuth on stack-based sorting algorithms and leads to many links with permutation patterns. We present…
Especially in lattice structured populations, homogeneous mixing represents an inadequate assumption. Various improvements upon the ordinary pair approximation based on a number of assumptions concerning the higher-order correlations have…
We investigate the Hubbard Hamiltonian on ladders where the number of sites per rung alternates between two and three. These geometries are bipartite, with a non-equal number of sites on the two sublattices. Thus they share a key feature of…
We study maximal sublattices of finite semidistributive lattices via their complements. We focus on the conjecture that such complements are always intervals, which is known to be true for bounded lattices. Since the class of…
A set A of natural numbers is finitely embeddable in another such set B if every finite subset of A has a rightward translate that is a subset of B. This notion of finite embeddability arose in combinatorial number theory, but in this paper…
Rotation of atoms in a lattice is studied using a Hubbard model. It is found that the atoms are still contained in the trap even when the rotation frequency is larger than the trapping frequency. This is very different from the behavior in…
This paper first gives a necessary and sufficient condition that a lattice $L$ can be represented as the collection of all up-sets of a poset. Applying the condition, it obtains a necessary and sufficient condition that a lattice can be…
Consider two independent random strings having same length and taking values uniformly in a common finite alphabet. We study the order of the variance of the length of the longest common subsequences (LCS) of these strings when long blocks,…
We consider the $U(1)$ gauge theory on a four-dimensional torus, where the instanton number is restricted to an integral multiple of $p$. This theory possesses the nontrivial higher-group structure, which can be regarded as a generalization…
Motivated by a 2019 result of Faulhuber-Steinerberger, we demonstrate that the real square lattice $\mathbb{Z}^2$ exhibits the same local, extremal property as the hexagonal lattice $\Lambda$, where distances of lattice points from the…
We present an explanation for the puzzling spectral and transport properties of layered cobaltates close to the band-insulator limit, which relies on the key effect of charge ordering. Blocking a significant fraction of the lattice sites…
In paper I of this series on fluid turbulence we showed that exact resummations of the perturbative theory of the structure functions of velocity differences result in a finite (order by order) theory. These findings exclude any known…
We provide a classification of the homogeneous 3-dimensional permutation structures, i.e. homogeneous structures in a language of 3 linear orders, partially answering a question of Cameron. We also arrive at a natural description of all…
We describe the basic lattice structures of attractors and repellers in dynamical systems. The structure of distributive lattices allows for an algebraic treatment of gradient-like dynamics in general dynamical systems, both invertible and…
The purpose of this paper is twofold. Firstly, to emphasise that the class of Lie algebras with chain lattices of ideals are elementary blocks in the embedding or decomposition of Lie algebras with finite lattice of ideals. Secondly, to…
We study combinatorial and order theoretic structures arising from the fragment of combinatory logic spanned by the basic combinator ${\bf M}$. This basic combinator, named as the Mockingbird by Smullyan, is defined by the rewrite rule…