Related papers: Finite Confluences and Closed Pattern Mining
Computing conceptual structures, like formal concept lattices, is in the age of massive data sets a challenging task. There are various approaches to deal with this, e.g., random sampling, parallelization, or attribute extraction. A so far…
The geometric properties of a lattice can have profound consequences on its band spectrum. For example, symmetry constraints and geometric frustration can give rise to topologicially nontrivial and dispersionless bands, respectively.…
It is a long standing open problem to find search to decision reductions for structured versions of the decoding problem of linear codes. Such results in the lattice-based setting have been carried out using number fields: Polynomial-LWE,…
We provide the first information theoretic tight analysis for inference of latent community structure given a sparse graph along with high dimensional node covariates, correlated with the same latent communities. Our work bridges recent…
Dismantling allows for the removal of elements of a set, or in our case lattice, without disturbing the remaining structure. In this paper we have extended the notion of dismantling by single elements to the dismantling by intervals in a…
We study the problem of combining the outcomes of several different classifiers in a way that provides a coherent inference that satisfies some constraints. In particular, we develop two general approaches for an important…
Lattice relaxation profoundly reshapes electronic structures in twisted materials. Prevailing treatments, however, typically rely on large-scale density functional theory (DFT), which is computationally costly and mechanistically opaque.…
Certain operator algebras A on a Hilbert space have the property that every densely defined linear transformation commuting with A is closable. Such algebras are said to have the closability property. They are important in the study of the…
In the present paper we introduce a lattice-ordered partial monoid structure on a suitable set of multilayer networks. We first study a kind of mappings that preserve the partial order and describe the order structure. After that we define…
We introduce a partial order structure on the set of interval orders of a given size, and prove that such a structure is in fact a lattice. We also provide a way to compute meet and join inside this lattice. Finally, we show that, if we…
We study cooperating distributed grammar systems working in hybrid modes in connection with the finite index restriction in two different ways: firstly, we investigate cooperating distributed grammar systems working in hybrid modes which…
This document reports on the use of an algebraic, visual, formal approach to the specification of patterns for the formalization of the GoF design patterns. The approach is based on graphs, morphisms and operations from category theory and…
The study of topological information of spatial objects has for a long time been a focus of research in disciplines like computational geometry, spatial reasoning, cognitive science, and robotics. While the majority of these researches…
We construct a lattice theory describing a system of interacting nonrelativistic spin s=1/2 fermions at nonzero chemical potential. The theory is applicable whenever the interparticle separation is large compared to the range of the…
In this paper we develop a general theory which provides a unified treatment of two apparently different problems. The weak Gibbs property of measures arising from the application of Renormalization Group maps and the mixing properties of…
The aim of this paper is to construct a fractal with the help of a finite family of generalized F-contraction mappings, a class of mappings more general than contraction mappings, defined in the setup of b-metric space. Consequently, we…
Usually the intuition from condensed-matter physics is used to provide ideas for possible confinement mechanisms in gauge theories. Today, with a clear but puzzling ``spaghetti'' confinement pattern, arising after a decade of lattice…
We introduce evolving networks where new vertices preferentially connect to the more central parts of a network. This makes such networks compact. Finite networks grown under the preferential compactness mechanism have complex…
One way of studying a relational structure is to investigate functions which are related to that structure and which leave certain aspects of the structure invariant. Examples are the automorphism group, the self-embedding monoid, 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…