Related papers: Tight embedding of modular lattices into partition…
This paper presents a unified framework for determining the congruences on a number of monoids and categories of transformations, diagrams, matrices and braids, and on all their ideals. The key theoretical advances present an iterative…
A graph is called (generically) rigid in $\mathbb{R}^d$ if, for any choice of sufficiently generic edge lengths, it can be embedded in $\mathbb{R}^d$ in a finite number of distinct ways, modulo rigid transformations. Here we deal with the…
Learnable embedding vector is one of the most important applications in machine learning, and is widely used in various database-related domains. However, the high dimensionality of sparse data in recommendation tasks and the huge volume of…
Many lattice-based crypstosystems employ ideal lattices for high efficiency. However, the additional algebraic structure of ideal lattices usually makes us worry about the security, and it is widely believed that the algebraic structure…
Lattice theoretical generalizations of some classical linear algebra results are formulated. A vector space is replaced by its subspace lattice and a linear map is replaced by the induced lattice map. This map is a complete join…
Using shift vector method we obtain a large class of self-dual lattices of dimension $(l,l)$, which has a one to one correspondence with modular invariants of free bosonic theory compactified on co-root lattice of a rank $l$ Lie group. Then…
The goal of this paper is to prove that several variants of deciding whether a poset can be (weakly) embedded into a small Boolean lattice, or to a few consecutive levels of a Boolean lattice, are NP-complete, answering a question of Griggs…
We study the Lattice Isomorphism Problem (LIP), in which given two lattices L_1 and L_2 the goal is to decide whether there exists an orthogonal linear transformation mapping L_1 to L_2. Our main result is an algorithm for this problem…
Suppose L and M are full-rank lattices in Euclidean space, such that vol(L) < vol(M). Answering a question of Han and Wang from 2001, we show how to construct a bounded measurable set F (we can even take F to be a finite union of polytopes)…
We study the simultaneous embeddability of a pair of partitions of the same underlying set into disjoint blocks. Each element of the set is mapped to a point in the plane and each block of either of the two partitions is mapped to a region…
We prove that there is a lattice embedded from every countable distributive lattice into the Boolean algebra of computable subsets of $\mathbb{N}$. Along the way, we discuss all relevant results about lattices, Boolean algebras and…
Let $L$ be a complete orthomodular lattice. There is a one to one correspondence between complete boolean subalgebras of $L$ contained in the center of $L$ and endomorphisms $j$ of $L$ satisfying the Borceux-Van den Bossche conditions.
The methods to classify extremal unimodular lattices with given automorphisms are extended to the situation of modular lattices. A slightly more general notion than the type from the PhD thesis of Michael Juergens is the det-type. The…
The following work is an exploration into certain topics in the broad world of integrable models, both classical and quantum, and consists of two main parts of roughly equal length. The first part, consisting of chapters 1-3, concerns…
We initiate the study of general metric lattices in the context of the model theory of metric structures. As an application we develop a theory of pseudo-finite limits of partition lattices and connect this theory with the theory of…
We investigate the lattice L(V) of subspaces of an m-dimensional vector space V over a finite field GF(q) with q being the n-th power of a prime p. It is well-known that this lattice is modular and that orthogonality is an antitone…
We introduce an algorithm for computing closure systems derived from a family of implications on a set. Semilattices presentations are explored and used in conjunction with the algorithm to compute various types of lattices freely generated…
A general result by Jackson (Flat algebras and the translation of universal Horn logic to equational logic, J. Symb. Log. 73(1) (2008) 90--128) implies that the lattice of all quasivarieties of groups of exponent dividing $n$ embeds into…
Modern deep learning-based recommendation systems exploit hundreds to thousands of different categorical features, each with millions of different categories ranging from clicks to posts. To respect the natural diversity within the…
An effective way to design structured coherent wave interference patterns that builds on the theory of coherent lattices, is presented. The technique combines prime number factorization in the complex plane with moir\'e theory to provide a…