Related papers: Mix $\star$-autonomous quantales and the continuou…
Lattice rules are among the most prominently studied quasi-Monte Carlo methods to approximate multivariate integrals. A rank-1 lattice rule to approximate an $s$-dimensional integral is fully specified by its generating vector $\mathbf{z}…
Extended versions of the Lambek Calculus currently used in computational linguistics rely on unary modalities to allow for the controlled application of structural rules affecting word order and phrase structure. These controlled structural…
Standard optical potentials use off-resonant laser standing wave induced AC-Stark shift. In a recent development [Phys. Rev. Lett. {\bf 117}, 233001 (2016)] a three-level scheme in $\Lambda$ configuration coupled coherently by resonant…
Every atomic JBW-algebra is known to be a direct sum of JBW-algebra factors of type I. Extending Kadison's anti-lattice theorem, we show that each of these factors is a disjointness free anti-lattice. We characterise disjointness, bands,…
We present an improved orderly algorithm for constructing all unlabelled lattices up to a given size, that is, an algorithm that constructs the minimal element of each isomorphism class relative to some total order. Our algorithm employs a…
We consider a graph called a lattice diagram, which is a graph in the $xy$-plane such that each edge is parallel to the $x$-axis or the $y$-axis. In [4], we investigated transformations of certain lattice diagrams, and we considered the…
The paper concerns lattice triangulations, that is, triangulations of the integer points in a polygon in $\mathbb{R}^2$ whose vertices are also integer points. Lattice triangulations have been studied extensively both as geometric objects…
The space spanned by the characters of twisted affine Lie algebras admit the action of certain congruence subgroups of $SL(2,\mathbb{Z})$. By embedding the characters in the space spanned by theta functions, we study an…
We investigate the descriptive complexity of order convergence in separable Banach lattices. While uniform convergence is Borel and $\sigma$-order convergence is known to be ${\bf \Delta}^1_2$, it is unclear in general when $\sigma$-order…
One-dimensional cut-and-project point sets obtained from the square lattice in the plane are considered from a unifying point of view and in the perspective of aperiodic wavelet constructions. We successively examine their geometrical…
Two-dimensional critical percolation is the member LM(2,3) of the infinite series of Yang-Baxter integrable logarithmic minimal models LM(p,p'). We consider the continuum scaling limit of this lattice model as a `rational' logarithmic…
In recent years, diagrammatic languages have been shown to be a powerful and expressive tool for reasoning about physical, logical, and semantic processes represented as morphisms in a monoidal category. In particular, categorical quantum…
An aggregative composition is a binary operation obeying the principle that the whole is determined by the sum of its parts. The development of graph algebras, on which the theory of formal graph languages is built, relies on aggregative…
This survey article is devoted to general results in combinatorial enumeration. The first part surveys results on growth of hereditary properties of combinatorial structures. These include permutations, ordered and unordered graphs and…
We report in details the observations of structures in coupled map lattice during its chaotic evolution, both in one and two dimension, driven by identical noise on each site (by a structure we mean a group of neighboring lattice-sites for…
Robust mixed finite element methods are developed for a quad-curl singular perturbation problem. Lower order H(grad curl)-nonconforming but H(curl)-conforming finite elements are constructed, which are extended to nonconforming finite…
We propose a construction of lattices from (skew-) polynomial codes, by endowing quotients of some ideals in both number fields and cyclic algebras with a suitable trace form. We give criteria for unimodularity. This yields integral and…
In continuous first-order logic, the union of definable sets is definable but generally the intersection is not. This means that in any continuous theory, the collection of $\varnothing$-definable sets in one variable forms a…
If $L$ is a finite lattice, we show that there is a natural topological lattice structure on the geometric realization of its order complex $\Delta(L)$ (definition recalled). Lattice-theoretically, the resulting object is a subdirect…
C. Greene introduced the shuffle lattice as an idealized model for DNA mutation and discovered remarkable combinatorial and enumerative properties of this structure. We attempt an explanation of these properties from a lattice-theoretic…