Related papers: Factorizing Lattices by Interval Relations
Lattices induced by coverings arise naturally in matroid theory and combinatorial optimization, providing a structured framework for analyzing relationships between independent sets and closures. In this paper, we explore the structural…
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…
We study the gauge symmetry factorizability by boundary conditions on intervals of any dimensions. With Dirichlet-Neumann BCs, the Kaluza-Klein decomposition in five-dimension for arbitrary gauge group can always be factorized into that for…
Matrix factorization is an inference problem that has acquired importance due to its vast range of applications that go from dictionary learning to recommendation systems and machine learning with deep networks. The study of its fundamental…
We present a novel approach to the construction of new finite algebras and describe the congruence lattices of these algebras. Given a finite algebra $(B_0, \dots)$, let $B_1, B_2, \dots, B_K$ be sets that either intersect $B_0$ or…
In this paper, we use a simple discrete dynamical model to study integer partitions and their lattice. The set of reachable configurations of the model, with the order induced by the transition rule defined on it, is the lattice of all…
The main aim of this paper is to study aggregation functions on lattices via clone theory approach. Observing that the aggregation functions on lattices just correspond to $0,1$-monotone clones, as the main result we show that for any…
We apply a categorical lens to the study of betweenness relations by capturing them within a topological category, fibred in lattices, and study several subcategories of it. In particular, we show that its full subcategory of finite objects…
This manuscript explores many convolution (restricted summation) type sequences via certain types of matrix based factorizations that can be used to express their generating functions. The last primary (non-appendix) section of the thesis…
In this paper, we characterize the congruences of an arbitrary i--lattice, investigate the structure of the lattice they form and how it relates to the structure of the lattice of lattice congruences, then, for an arbitrary non--zero…
We study processes with unstable particles in intermediate time-like states. It is shown that the amplitudes squared of such processes factor exactly in the framework of the model of unstable particles with continuous masses. Decay widths…
We study the splitting of regular square lattices subject to stochastic intermittent flows. Various flow patterns are produced by different groupings of the nodes, based on their random alternation between two possible states. The resulting…
In this paper, we study the congruences, prime filters and prime ideals of horizontal sums of bounded lattices, then, through a construction based on horizontal sums and without enforcing the Continuum Hypothesis, we are modifying an…
Given a join semilattice $S$ with a minimum $\hat{0}$, the quarks (also called atoms in order theory) are the elements that cover $\hat{0}$, and for each $x \in S \setminus \{\hat{0}\}$ a factorization (into quarks) of $x$ is a minimal set…
The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, and beyond. The purpose of this paper is to illustrate the…
Temporal graphs have been recently introduced to model changes to a given network that occur throughout a fixed period of time. The Temporal $\Delta$ Clique problem, that generalizes the well known Clique problem to temporal graphs, has…
We propose a combined model, which integrates the latent factor model and the logistic regression model, for the citation network. It is noticed that neither a latent factor model nor a logistic regression model alone is sufficient to…
This paper explores applications of the so-called Freese's technique, a classical approach to study the congruence variety of a given algebra. We leverage this tool to investigate lattices that are admissible as congruence sublattice of a…
In this review we discuss the general features of maximally twisted lattice QCD. In particular, we illustrate how automatic O(a) improvement can be achieved and how it is possible to set up a lattice regularization scheme where the problem…
This paper introduces the order-theoretic concept of lattices along with the concept of consistent quantification where lattice elements are mapped to real numbers in such a way that preserves some aspect of the order-theoretic structure.…