Related papers: Factorizing Lattices by Interval Relations

Lattices are a commonly used structure for the representation and analysis of relational and ontological knowledge. In particular, the analysis of these requires a decomposition of a large and high-dimensional lattice into a set of…

In this contribution I discuss a recent proposal of a novel action for lattice gauge theory for finite systems, which accommodates non-periodic spatial boundary conditions. Drawing on the summation-by-parts formulation of finite differences…

Relation extraction is the task of identifying predefined relationship between entities, and plays an essential role in information extraction, knowledge base construction, question answering and so on. Most existing relation extractors…

Locating arrays (LAs) can be used to detect and identify interaction faults among factors in a component-based system. The optimality and constructions of LAs with a single fault have been investigated extensively under the assumption that…

This article builds on Thurston's height functions. His tiling algorithm is reinterpreted using lattice theory and then generalized in order to generate any tiling of a hole-free region. Combined with a natural encoding of tilings by words,…

We study the class of those linear relations that can be factorized as products of idempotent relations. We provide several characterizations of this class, extending known factorization results for operators to the more general setting of…

IIn a finite lattice, a congruence spreads from a prime interval to another by a sequence of congruence-perspectivities through \emph{intervals of arbitrary size}, by a 1955 result of J. Jakub\'ik. In this note, I introduce the concept of…

Factorization of numbers with the help of Gauss sums relies on an intimate relationship between the maxima of these functions and the factors. Indeed, when we restrict ourselves to integer arguments of the Gauss sum we profit from a…

There is increasing focus on analyzing data represented as hypergraphs, which are better able to express complex relationships amongst entities than are graphs. Much of the critical information about hypergraph structure is available only…

In this paper we consider a general way of constructing profinite struc- tures based on a given framework - a countable family of objects and a countable family of recognisers (e.g. formulas). The main theorem states: A subset of a family…

The fermion determinant is a highly non-local object and its logarithm is an extensive quantity. For these reasons it is widely believed that the determinant cannot be treated in acceptance steps of gauge link configurations that differ in…

This paper studies the differential lattice, defined to be a lattice $L$ equipped with a map $d:L\to L$ that satisfies a lattice analog of the Leibniz rule for a derivation. Isomorphic differential lattices are studied and classifications…

A comprehensive overview of lattice rules and polynomial lattice rules is given for function spaces based on $\ell_p$ semi-norms. Good lattice rules and polynomial lattice rules are defined as those obtaining worst-case errors bounded by…

Flat-band physics has attracted much attention in recently years because of its interesting properties and important applications. Some typical lattices have been proposed to generate flat bands, such as Kagome and Lieb lattices. The flat…

It is well-known that relatively pseudocomplemented lattices can serve as an algebraic semantics of intuitionistic logic. To extend the concept of relative pseudocomplementation to non-distributive lattices, the first author introduced…

The simplest way to generate a lattice of convex sets is to consider an initial set of points and draw segments, triangles, and any convex hull from it, then intersect them to obtain new points, and so forth. The result is an infinite…

We propose a classification of group properties according to whether they can be deduced from the assumption that a group's subgroup lattice contains an interval isomorphic to some lattice. We are able to classify a few group properties as…

This paper deals with join-semilattices whose sections, i.e. principal filters, are pseudocomplemented lattices. The pseudocomplement of a\vee b in the section [b,1] is denoted by a\rightarrow b and can be considered as the connective…

We approximate $d$-variate periodic functions in weighted Korobov spaces with general weight parameters using $n$ function values at lattice points. We do not limit $n$ to be a prime number, as in currently available literature, but allow…

This paper deals with the kernel-based approximation of a multivariate periodic function by interpolation at the points of an integration lattice -- a setting that, as pointed out by Zeng, Leung, Hickernell (MCQMC2004, 2006) and Zeng,…