Related papers: Factorizing Lattices by Interval Relations
This paper has taken into advantage the relationship between Fuzzy Relation Equations (FRE) and Concept Lattices in order to introduce a procedure to reduce a FRE, without losing information. Specifically, attribute reduction theory in…
We study sequences of partitions of the unit interval into subintervals, starting from the trivial partition, in which each partition is obtained from the one before by splitting its subintervals in two, according to a given rule, and then…
We investigate the lattice of clones that are generated by a set of functions that are induced on a finite field $\mathbb{F}$ by monomials. We study the atoms and coatoms of this lattice and investigate whether this lattice contains…
We use the factorization method to find the exact eigenvalues and eigenfunctions for a particle in a box with the delta function potential $V(x)=\lambda\delta(x-x_{0})$. We show that the presence of the potential results in the…
Over the last years, novel low-complexity approaches to the equalization of MIMO channels have gained much attention. Thereby, methods based on lattice basis reduction are of special interest, as they achieve the optimum diversity order. In…
We propose a new unsupervised learning method for clustering a large number of time series based on a latent factor structure. Each cluster is characterized by its own cluster-specific factors in addition to some common factors which impact…
We study effectively inseparable (e.i.) pre-lattices (i.e. structures of the form $L=\langle \omega, \wedge, \lor, 0, 1, \leq_L\rangle$ where $\omega$ denotes the set of natural numbers and the following hold: $\wedge, \lor$ are binary…
In this paper we extend a decision procedure for the Boolean algebra of finite sets with cardinality constraints ($\mathcal{L}_{\lvert\cdot\rvert}$) to a decision procedure for $\mathcal{L}_{\lvert\cdot\rvert}$ extended with set terms…
We study the equational theories and bases of meets and joins of several varieties of plactic-like monoids. Using those results, we construct sublattices of the lattice of varieties of monoids, generated by said varieties. We calculate the…
Relational concept analysis (RCA) is an extension of formal concept analysis allowing to deal with several related contexts simultaneously. It has been designed for learning description logic theories from data and used within various…
Classical spin liquids are frustrated magnetic phases characterized by local constraints, flat bands in reciprocal space, and emergent gauge structures with distinctive signatures such as pinch points. These arise generally in \emph{cluster…
It has been recently observed that fundamental aspects of the classical theory of factorization can be greatly generalized by combining the languages of monoids and preorders. This has led to various theorems on the existence of certain…
We revisit Schnorr's lattice-based integer factorization algorithm, now with an effective point of view. We present effective versions of Theorem 2 of Schnorr's "Factoring integers and computing discrete logarithms via diophantine…
The standard perturbative weak-coupling expansions in lattice models are asymptotic. The reason for this is hidden in the incorrect interchange of the summation and integration. However, substituting the Gaussian initial approximation of…
Although it has been claimed in two different papers that the maximum cardinality cut problem is polynomial-time solvable for proper interval graphs, both of them turned out to be erroneous. In this paper, we give FPT algorithms for the…
We introduce and explore a natural rank for totally disconnected locally compact groups called the bounded conjugacy rank. This rank is shown to be a lattice invariant for lattices in sigma compact totally disconnected locally compact…
The aim of this note is to survey the factorizations of the Fibonacci infinite word that make use of the Fibonacci words and other related words, and to show that all these factorizations can be easily derived in sequence starting from…
Recent works have discussed the violation of factorization and universality in hadronic hard scattering processes aimed at measurements of T-odd distributions. We use simple arguments to show that it is possible to restore an approximate…
Rough sets are efficient for data pre-processing in data mining. Matroids are based on linear algebra and graph theory, and have a variety of applications in many fields. Both rough sets and matroids are closely related to lattices. For a…
In the first part of the thesis we consider the constraints of causality and unitarity for particles interacting via strictly finite-range interactions. We generalize Wigner's causality bound to the case of non-vanishing partial-wave…