Related papers: Triangular norms on finite lattices
To enumerate 3-manifold triangulations with a given property, one typically begins with a set of potential face pairing graphs (also known as dual 1-skeletons), and then attempts to flesh each graph out into full triangulations using an…
By median we mean a scheme that inputs three element of a lattice, and outputs an element that is an average of the three inputs in a certain sense. The medians of a given finite lattice form a new lattice that is usually larger than the…
In addition to the unique cover $M^+$ of the variety of modular lattices, we also deal with those twenty-three known covers of $M^+$ that can be extracted from the literature. For $M^+$ and for each of these twenty-three known varieties…
In the traditional view, heavy deformed nuclei are like axially-symmetric prolate ellipsoids, rotating about one of the short axes. In the present picture, their shapes may be triaxial. The triaxial shape yields complex rotations, which…
Explicit relations of matrices for two-dimensional finite element method with third-order triangular elements are given. They are more simple than relations presented in other works and could be easily implemented in new algorithms for both…
Links of singularity and generalized algebraic links are ways of constructing three-manifolds and smooth links inside them from potentially singular complex algebraic surfaces and complex curves inside them. We prove that knot lattice…
We show that in a rank supersolvable lattice that is graded by a bounded real interval, any antichain cutset is a level set for some appropriately constructed grading. As a consequence, given an antichain cutset in any of the measurable…
Our main goal is to develop a representation for finite distributive nearlattices through certain ordered structures. This representation generalizes the well-known representation given by Birkhoff for finite distributive lattices through…
If $L$ is a finite lattice, we show that there is a natural topological lattice structure on the geometric realization of its order complex $\Delta(L)$ (definition recalled). Lattice-theoretically, the resulting object is a subdirect…
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…
Given a group $G$ and a subgroup $H$, we let $\mathcal{O}_G(H)$ denote the lattice of subgroups of $G$ containing $H$. This paper provides a classification of the subgroups $H$ of $G$ such that $\mathcal{O}_{G}(H)$ is Boolean of rank at…
Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to carry over analysis of the classical algorithms from finite…
Tight triangulations are exotic, but highly regular objects in combinatorial topology. A triangulation is tight if all its piecewise linear embeddings into a Euclidean space are as convex as allowed by the topology of the underlying…
We first show that the tilings of a general domain form a lattice which we then undertake to decompose and generate without any redundance. To this end, we study extensively the relatively simple case of hexagons and their deformations. We…
The component-by-component construction is the standard method of finding good lattice rules or polynomial lattice rules for numerical integration. Several authors have reported that in numerical experiments the generating vector sometimes…
We study an atomistic model that describes the microscopic formation of material voids inside elastically stressed solids under an additional curvature regularization at the discrete level. Using a discrete-to-continuum analysis, by means…
We consider a single particle tunnelling in a tight-binding model with nearest-neighbour couplings, in the presence of a periodic high-frequency force. An effective Hamiltonian for the particle is derived using an averaging method…
This paper deals with many-valued modal logics, based only on the necessity operator, over a residuated lattice. We focus on three basic classes, according to the accessibility relation, of Kripke frames: the full class of frames evaluated…
A system of linear equations $L$ is said to be norming if a natural functional $t_L(\cdot)$ giving a weighted count for the set of solutions to the system can be used to define a norm on the space of real-valued functions on…
Building on the principle of combinatorial gauge symmetry, lattice gauge theories can be formulated with only one- and two-body interactions that ensure the exact realization of the symmetry rather than its approximate emergence in a…