相关论文: Comaximal filter graphs in residuated lattices
In this paper, we introduce the comaximal graph $\Gamma(L)$ of a finite-dimensional Lie algebra $L$, whose vertices are the nontrivial proper Lie subalgebras of $L$ over a field $\mathbb{F}$, and two vertices $A$ and $B$ are adjacent if and…
We introduce and characterize various gluing constructions for residuated lattices that intersect on a common subreduct, and which are subalgebras, or appropriate subreducts, of the resulting structure. Starting from the 1-sum construction…
The notion of $n$-normal residuated lattice, as a class of residuated lattices in which every prime filter contains at most $n$ minimal prime filters, is introduced and studied. Before that, the notion of $\omega$-filter is introduced and…
The \emph{difference subgroup graph} $D(G)$ of a finite group $G$ is defined as the graph whose vertices are the non-trivial proper subgroups of $G$, with two distinct vertices $H$ and $K$ adjacent if and only if $\langle H, K \rangle = G$…
We develop the theory of residuated lattices by introducing and studying several new types of filters and related concepts, including semi-simple filters, essential filters, the socle of a filter, and independent families of filters. Our…
In this paper, the class of quasicomplemented residuated lattices is introduced and investigated, as a subclass of residuated lattices in which any prime filter not containing any dense element is a minimal prime filter. The notion of…
M.S. Rao recently investigated some sorts of special filters in distributive pseudocomplemented lattices. In our paper we extend this study to lattices which need neither be distributive nor pseudocomplemented. For this sake we define a…
We study the design of graph filters to implement arbitrary linear transformations between graph signals. Graph filters can be represented by matrix polynomials of the graph-shift operator, which captures the structure of the graph and is…
Flow polytopes of acyclic oriented graphs arise naturally in combinatorial optimization, and the study of their volumes and triangulations has revealed intriguing connections across combinatorics, geometry, algebra, and representation…
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…
A cocomparability graph is a graph whose complement admits a transitive orientation. An interval graph is the intersection graph of a family of intervals on the real line. In this paper we investigate the relationships between interval and…
This paper is dedicated to the fused trend filtering on a general graph, which is a combination of fused estimator and 1-st order trend filtering on a graph. There are two cases of fusion regularisers studied in this work: anisotropic total…
Given a graph $G$ with vertices $\{v_1,\ldots,v_n\}$, we define $\mathcal{S}(G)$ to be the set of symmetric matrices $A=[a_{i,j}]$ such that for $i\ne j$ we have $a_{i,j}\ne 0$ if and only if $v_iv_j\in E(G)$. Motivated by the Graph…
In this paper, replacing `equality' by 'equality almost everywhere' we modify several terms associated with the ring of measurable functions defined on a measure space $(X, \mathcal{A}, \mu)$ and thereby study the graph theoretic features…
A graph G is (a:b)-colorable if there exists an assignment of b-element subsets of {1,...,a} to vertices of G such that sets assigned to adjacent vertices are disjoint. We first show that for every triangle-free planar graph G and a vertex…
In this paper, a combination of algebraic and topological methods is applied to obtain new and structural results on Gelfand residuated lattices. It is demonstrated that Gelfand's residuated lattices strongly tied up with the hull-kernel…
A {\it fractional matching} of a graph $G$ is a function $f$ giving each edge a number in $[0,1]$ so that $\sum_{e\in \Gamma(v)}f(e)\leq 1$ for each $v\in V(G)$, where $\Gamma(v)$ is the set of edges incident to $v$. The {\it fractional…
Residuated lattices play an important role in the study of fuzzy logic based of t-norm. In this paper, we introduced the notions of n-fold implicative filters, n-fold positive implicative filters, n-fold boolean filters, n-fold fantastic…
A fractional matching of a graph $G$ is a function $f$ giving each edge a number in $[0,1]$ such that $\sum_{e\in\Gamma(v)}f(e)\leq1$ for each vertex $v\in V(G)$, where $\Gamma(v)$ is the set of edges incident to $v$. The fractional…
There is a profound connection between copositive matrices and graph theory. Copositive matrices provide a powerful tool for formulating and solving various challenging graph-related problems. Conversely, graph theory provides a rich set of…