English
Related papers

Related papers: Formal Concepts and Residuation on Multilattices

200 papers

We study the smallest, as well as the largest numbers of congruences of lattices of an arbitrary finite cardinality $n$. Continuing the work of Freese and Cz\' edli, we prove that the third, fourth and fifth largest numbers of congruences…

Rings and Algebras · Mathematics 2018-01-22 J\' ulia Kulin , Claudia Mureşan

In this paper we investigate the class of rigid monomial ideals. We give a characterization of the minimal free resolutions of certain classes of these ideals. Specifically, we show that the ideals in a particular subclass of rigid monomial…

Commutative Algebra · Mathematics 2011-02-14 Timothy B. P. Clark , Sonja Mapes

A convex set with nonempty interior is maximal lattice-free if it is inclusion-maximal with respect to the property of not containing integer points in its interior. Maximal lattice-free convex sets are known to be polyhedra. The precision…

Optimization and Control · Mathematics 2011-03-28 Gennadiy Averkov , Christian Wagner , Robert Weismantel

We give a proof-theoretic as well as a semantic characterization of a logic in the signature with conjunction, disjunction, negation, and the universal and existential quantifiers that we suggest has a certain fundamental status. We present…

Logic · Mathematics 2023-04-06 Wesley H. Holliday

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…

Logic · Mathematics 2024-02-15 Saeed Rasouli , Amin Dehghani

The lattice of monotone triangles $(\mathfrak{M}_n,\le)$ ordered by entry-wise comparisons is studied. Let $\tau_{\min}$ denote the unique minimal element in this lattice, and $\tau_{\max}$ the unique maximum. The number of $r$-tuples of…

Combinatorics · Mathematics 2014-07-23 John Engbers , Adam Hammett

The topic of this paper is the Finiteness Conjecture for minimally unsatisfiable clause-sets (MUs), stating that for each fixed deficiency (number of clauses minus number of variables) there are only finitely many patterns, given a certain…

Discrete Mathematics · Computer Science 2016-04-06 Oliver Kullmann , Xishun Zhao

A nucleus $\gamma$ on a (bounded commutative integral) residuated lattice $\mathbf{A}$ is a closure operator that satisfies the inequality $\gamma(a) \cdot \gamma(b) \leq \gamma(a \cdot b)$ for all $a,b \in A$. In this article, among…

Logic · Mathematics 2024-12-30 Sebastián Buss , Diego Castaño , José Patricio Díaz Varela

We introduce the dimension monoid of a lattice L, denoted by Dim L. The monoid Dim L is commutative and conical, the latter meaning that the sum of any two nonzero elements is nonzero. Furthermore, Dim L is given along with the dimension…

General Mathematics · Mathematics 2007-05-23 Friedrich Wehrung

It has been shown by Soprunov that the normalized mixed volume (minus one) of an $n$-tuple of $n$-dimensional lattice polytopes is a lower bound for the number of interior lattice points in the Minkowski sum of the polytopes. He defined…

Combinatorics · Mathematics 2020-02-27 Gabriele Balletti , Christopher Borger

The sets of all neutral, distributive and lower-modular elements of the lattice of semigroup varieties are finite, countably infinite and uncountably infinite, respectively. In 2018, we established that there are precisely three neutral…

Group Theory · Mathematics 2022-12-12 Sergey V. Gusev

We present a short elementary proof of the following Twelve Points Theorem: Let M be a convex polygon with vertices at the lattice points, containing a single lattice point in its interior. Denote by m (resp. m*) the number of lattice…

Metric Geometry · Mathematics 2008-08-11 Matija Cencelj , Dušan Repovš , Mikhail Skopenkov

Formal concept analysis has grown from a new branch of the mathematical field of lattice theory to a widely recognized tool in Computer Science and elsewhere. In order to fully benefit from this theory, we believe that it can be enriched…

Logic in Computer Science · Computer Science 2012-01-23 Pascal Hitzler , Markus Krötzsch , Guo-Qiang Zhang

We introduce a new combinatorial structure: the metasylvester lattice on decreasing trees. It appears in the context of the $m$-Tamari lattices and other related $m$-generalizations. The metasylvester congruence has been recently introduced…

Combinatorics · Mathematics 2015-01-21 Viviane Pons

The first aim of this work is to characterize when the lattice of all submodules of a module is a direct product of two lattices. In particular, which decompositions of a module $M$ produce these decompositions: the \emph{lattice…

Rings and Algebras · Mathematics 2021-02-03 Josefa M. García , Pascual Jara , Luis M. Merino

In this paper we study projective algebras in varieties of (bounded) commutative integral residuated lattices from an algebraic (as opposed to categorical) point of view. In particular we use a well-established construction in residuated…

Logic · Mathematics 2022-09-05 Paolo Aglianò , Sara Ugolini

For a monoid $M$, we denote by $\mathbb G(M)$ the group of units, $\mathbb E(M)$ the submonoid generated by the idempotents, and $\mathbb G_L(M)$ and $\mathbb G_R(M)$ the submonoids consisting of all left or right units. Writing $\mathcal…

Group Theory · Mathematics 2020-06-08 James East

Correct identification of the Bravais lattice of a crystal is an important step in structure solution. Niggli reduction is a commonly used technique. We investigate the boundary polytopes of the Niggli-reduced cone in the six-dimensional…

Mathematical Physics · Physics 2013-08-12 Lawrence C. Andrews , Herbert J. Bernstein

It was proved by Nill that for any lattice simplex of dimension $d$ with degree $s$ which is not a lattice pyramid, the inequality $d+1 \leq 4s-1$ holds. In this paper, we give a complete characterization of lattice simplices satisfying the…

Combinatorics · Mathematics 2017-04-06 Akihiro Higashitani

We construct a diagram D, indexed by a finite partially ordered set, of finite Boolean semilattices and (v,0,1)-embeddings, with top semilattice $2^4$, such that for any variety V of algebras, if D has a lifting, with respect to the…

Rings and Algebras · Mathematics 2007-05-23 Friedrich Wehrung , Jiri Tuma