Related papers: Some further construction methods for uninorms via…
This article intends to characterize triangular norms on a finite lattice. We first give a method for generating a triangular norm on an atomistic lattice by the values of atoms. Then we prove that every triangular norm on a non-Boolean…
In this paper, we introduce the notion of pseudo-triangular norm (pseudo-t-norm, for short) as a classes of weakly associative operations on trellises and as a generalization of triangular norm (t-norm, for short) on bounded trellises and…
Inspired by natural cellular materials such as trabecular bone, lattice structures have been developed as a new type of lightweight material. In this paper we present a novel method to design lattice structures that conform with both the…
In this paper, we present an algorithmic approach to design and construct planar truss structures based on symmetric lattices using modular elements. The method of assembly is similar to Leonardo grids as they both rely on the property of…
There are presented certain results on extending continuous linear operators defined on spaces of E-valued continuous functions (defined on a compact Hausdorff space X) to linear operators defined on spaces of E-valued measurable functions…
We study a composition operator on Lorentz spaces. In particular we provide necessary and sufficient conditions under which a measurable mapping induces a bounded composition operator.
In this paper we prove two new abstract compactness criteria in normed spaces. To this end we first introduce the notion of an equinormed set using a suitable family of semi-norms on the given normed space satisfying some natural…
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…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
In this paper, we construct odd unimodular lattices in dimensions n=36,37 having minimum norm 3 and 4s=n-16, where s is the minimum norm of the shadow. We also construct odd unimodular lattices in dimensions n=41,43,44 having minimum norm 4…
This paper is an investigation of a procedure for constructing lattices by means of taking the sum of a pair of isometric lattices. We present various general results pertaining to this construction and discuss several examples of it…
We prove an uniform boundedness principle for the Lipschitz seminorm of continuous, monotone, positively homogeneous and subadditive mappings on suitable cones of functions. The result is applicable to several classes of classically…
We present a systematic study of the method of "norms on possibilities" of building forcing notions with keeping their properties under full control. This technique allows us to answer several open problems, but on our way to get the…
Methods were developed in Ref. [1] for constructing reference metrics (and from them differentiable structures) on three-dimensional manifolds with topologies specified by suitable triangulations. This note generalizes those methods by…
In this paper, we continue the investigation of topological properties of unbounded norm (un-)topology in normed lattices. We characterize separability and second countability of un-topology in terms of properties of the underlying normed…
For many equation-theoretical questions about modular lattices, Hall and Dilworth give a useful construction: Let $L_0$ be a lattice with largest element $u_0$, $L_1$ be a lattice disjoint from $L_0$ with smallest element $v_1$, and $a \in…
We present a survey of results concerning the use of inductive constructions to study the rigidity of frameworks. By inductive constructions we mean simple graph moves which can be shown to preserve the rigidity of the corresponding…
It is shown that an n-dimensional unimodular lattice has minimal norm at most 2[n/24] +2, unless n = 23 when the bound must be increased by 1. This result was previously known only for even unimodular lattices. Quebbemann had extended the…
We develop a word mechanism applied in knot and link diagrams for the illustration of a diagrammatic property. We also give a necessary condition for determining incompressible and pairwise incompressible surfaces, that are embedded in knot…
We present an improved orderly algorithm for constructing all unlabelled lattices up to a given size, that is, an algorithm that constructs the minimal element of each isomorphism class relative to some total order. Our algorithm employs a…