Related papers: Tight embedding of modular lattices into partition…
Rough set theory is a useful tool to deal with uncertain, granular and incomplete knowledge in information systems. And it is based on equivalence relations or partitions. Matroid theory is a structure that generalizes linear independence…
In a seminal work, Micciancio & Voulgaris (2013) described a deterministic single-exponential time algorithm for the Closest Vector Problem (CVP) on lattices. It is based on the computation of the Voronoi cell of the given lattice and thus…
The practically important classes of equal-input and of monotone Markov matrices are revisited, with special focus on embeddability, infinite divisibility, and mutual relations. Several uniqueness results for the classic Markov embedding…
In this paper, we will show how the Caratheodory Extension process is intimately related to the metric completion process. In particular, it will be shown how one is able to construct a lattice on the completion and to obtain an isomorphism…
The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…
This is the first paper in a series on intrinsic Donaldson-Thomas theory, where we develop a new framework for enumerative geometry that allows the generalization of constructions and results from linear moduli stacks to general non-linear…
We introduce a notion of a (V,T)-module over a vertex algebra V for an arbitrary positive integer T, which is a generalization of a twisted V-module. Under some conditions on V, we construct an associative algebra A^{T}_{m}(V) for…
In this paper, we present a lattice-theoretic characterization for valuated matroids, which is an extension of the well-known cryptomorphic equivalence between matroids and geometric lattices ($=$ atomistic semimodular lattices). We…
Constraint answer set programming is a promising research direction that integrates answer set programming with constraint processing. It is often informally related to the field of satisfiability modulo theories. Yet, the exact formal link…
In 1980, U. Faigle introduced a sort of finite geometries on posets that are in bijective correspondence with finite semimodular lattices. His result has almost been forgotten in lattice theory. Here we simplify the axiomatization of these…
It is well known by analysts that a concept lattice has an exponential size in the data. Thus, as soon as he works with real data, the size of the concept lattice is a fundamental problem. In this chapter, we propose to investigate factor…
We prove identities generating higher dimensional vector partitions. We derive theorems for integer lattice points in the 2D first quadrant, then generalize the approach to find 3D and $n$-space lattice point vector region extensions. We…
Lattice models are valuable tools to gain insight into the statistical physics of heteropolymers. We rigorously map the partition function of these models into a vacuum expectation value of a $\mathbb{Z}_2$ lattice gauge theory (LGT), with…
In [A. Day, Filter monads, continuous lattices and closure systems, Can. J. Math. 27 (1975) 50--59], Day showed that continuous lattices are precisely the algebras of the open filter monad over the category of $T_0$ spaces. The aim of this…
Design Structure Matrix (DSM) modularization, the task of partitioning system elements into cohesive modules, is a fundamental combinatorial challenge in engineering design. Traditional methods treat modularization as a pure graph…
Large Language Models (LLMs) have emerged as a new paradigm for recommendation by converting interacted item history into language modeling. However, constrained by the limited context length of LLMs, existing approaches have to truncate…
In the Partially Embedded Planarity problem, we are given a graph $G$ together with a topological drawing of a subgraph $H$ of $G$. The task is to decide whether the drawing can be extended to a drawing of the whole graph such that no two…
An $\ell$-page stack layout (also known as an $\ell$-page book embedding) of a graph is a linear order of the vertex set together with a partition of the edge set into $\ell$ stacks (or pages), such that the endpoints of no two edges on the…
Tabular deep-learning methods require embedding numerical and categorical input features into high-dimensional spaces before processing them. Existing methods deal with this heterogeneous nature of tabular data by employing separate…
We establish a number of results which say, roughly, that interpretation functors preserve algebraic complexity. First we show that representation embeddings between categories of modules of finite-dimensional algebras induce embeddings of…