Related papers: Ordinal and Horizontal Sums Constructing PBZ*-latt…
We present new examples of deformations of smash product algebras that arise from Hopf algebra actions on pairs of module algebras. These examples involve module algebras that are Koszul, in which case a PBW theorem we established…
We give an effective upper bound on the h^*-polynomial of a lattice polytope in terms of its degree and leading coefficient, confirming a conjecture of Batyrev. We deduce this bound as a consequence of a strong Cayley decomposition theorem…
A partial algebra construction of Gr\"atzer and Schmidt from "Characterizations of congruence lattices of abstract algebras" (Acta Sci. Math. (Szeged) 24 (1963), 34-59) is adapted to provide an alternative proof to a well-known fact that…
In this paper it is shown that the lattice of C*-covers of an operator algebra does not contain enough information to distinguish operator algebras up to completely isometric isomorphism. In addition, four natural equivalences of the…
In this work we study Liouville conformal blocks with degenerate primaries and one operator in an irregular representation of the Virasoro algebra. Using an algebraic approach, we derive modified BPZ equations satisfied by such blocks and…
We extend the BMS(4) group by adding logarithmic supertranslations. This is done by relaxing the boundary conditions on the metric and its conjugate momentum at spatial infinity in order to allow logarithmic terms of carefully designed form…
Using nonlinear pde techniques, we construct a new family of globally smooth tt* structures. This includes tt* structures associated to the (orbifold) quantum cohomology of a finite number of complex projective spaces and weighted…
Quantum Latin squares are a generalization of classical Latin squares in quantum field and have wide applications in unitary error bases, mutually unbiased bases, $k$-uniform states and quantum error correcting codes. In this paper, we put…
It has recently been discovered that both quantum and classical propositional logics can be modelled by classes of non-orthomodular and thus non-distributive lattices that properly contain standard orthomodular and Boolean classes,…
This paper investigates the intersection of residuated structures from many-valued logic and orthomodular lattices from quantum logic. We explore whether non-Boolean structures can simultaneously satisfy residuation principles and…
In the 1970s, Williams developed an algorithm that has been used to construct and study modular links in the Lorenz template. We introduce an improved algorithm, which we call the bunch algorithm, to provide more insights into the geometry…
Given a Schauder basic sequence $(x_k)$ in a Banach lattice, we say that $(x_k)$ is bibasic if the expansion of every vector in $[x_k]$ converges not only in norm, but also in order. We prove that, in this definition, order convergence may…
Lattice reduction is a NP-hard problem well known in computer science and cryptography. The Lenstra-Lenstra-Lovasz (LLL) algorithm based on the calculation of orthogonal Gram-Schmidt (GS) bases is efficient and gives a good solution in…
A subresiduated lattice ordered commutative monoid (or srl-monoid for short) is a pair $(\textbf{A},Q)$ where $\textbf{A}=(A,\wedge,\vee,\cdot,e)$ is an algebra of type $(2,2,2,0)$ such that $(A,\wedge,\vee)$ is a lattice, $(A,\cdot,e)$ is…
We introduce an addition law for the usual quantum matrices $A(R)$ by means of a coaddition $\underline{\Delta} t=t\otimes 1+1\otimes t$. It supplements the usual comultiplication $\Delta t=t\otimes t$ and together they obey a…
The cascaded or central-moments-based lattice Boltzmann method (CM-LBM) is a robust alternative to the more conventional BGK-LBM for the simulation of high-Reynolds number flows. Unfortunately, its original formulation makes its extension…
We introduce certain lattice sums associated with hyperplane arrangements, which are (multiple) sums running over integers, and can be regarded as generalizations of certain linear combinations of zeta-functions of root systems. We also…
Algebraic lattices are those obtained from modules in the ring of integers of algebraic number fields through the canonical or twisted embeddings. In turn, well-rounded lattices are those with maximal cardinality of linearly independent…
Dualization of a monotone Boolean function on a finite lattice can be represented by transforming the set of its minimal 1 to the set of its maximal 0 values. In this paper we consider finite lattices given by ordered sets of their meet and…
It is well known that the discrete analogue of a lattice is a linear code which is a vector subspace of Hamming space $\mathbb{F}^n$. The set $\mathbb{F}$ is a finite field and $n \in \mathbb{Z}_{>0}$. Our attempt is to construct a class of…