Related papers: New structures for uninorms on bounded lattices
Suppose $X$ is a locally solid lattice ring. It is known that there are three classes of bounded group homomorphisms on $X$ whose topological structures make them again topological rings. In this note, we consider lattice structure on them;…
We introduce a new intrinsic metric in subdomains of a metric space and give upper and lower bounds for it in terms of well-known metrics. We also prove distortion results for this metric under quasiregular maps.
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…
We present in this paper a universal method of constructing left-continuous triangular norms (l.-c. t-norms). The starting point is an arbitrary, possibly finite, totally ordered monoid fulfilling the conditions that are characteristic for…
Nullnorms with a zero element being at any point of a bounded lattice are an important generalization of triangular norms and triangular conorms. This paper obtains an equivalent characterization for the existence of idempotent nullnorms…
In this paper, we introduce a new type fuzzy boundary and study some related set theoretic identities. Further, this new type of fuzzy boundary is compared with different existing fuzzy boundaries.
This paper presents a unified framework for determining the congruences on a number of monoids and categories of transformations, diagrams, matrices and braids, and on all their ideals. The key theoretical advances present an iterative…
This paper shows how proof nets can be used to formalize the notion of ``incomplete dependency'' used in psycholinguistic theories of the unacceptability of center-embedded constructions. Such theories of human language processing can…
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…
Polynomial meshes (called sometimes "norming sets") allow us to estimate the supremum norm of polynomials on a fixed compact set by the norm on its discrete subset. We give a general construction of polynomial weakly admissible meshes on…
This work shows several direct and recursive constructions of ordered covering arrays using projection, fusion, column augmentation, derivation, concatenation and cartesian product. Upper bounds on covering codes in NRT spaces are also…
In this paper, new extremal odd unimodular lattices in dimension $36$ are constructed. Some new odd unimodular lattices in dimension $36$ with long shadows are also constructed.
In this survey we describe a recently-developed technique for bounding the number (and controlling the typical structure) of finite objects with forbidden substructures. This technique exploits a subtle clustering phenomenon exhibited by…
We introduce a new combinatorial structure: the superselector. We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, compressed sensing, multi-channel…
We propose to use a recently introduced Totimorphic metamaterial for constructing morphable space structures. As a first step to investigate the feasibility of this concept, we present a method for morphing such structures autonomously…
Limited bonding valence, usually accompanied by well-defined directional interactions and selective bonding mechanisms, is nowadays considered among the key ingredients to create complex structures with tailored properties: even though…
A recent result of G. Cz\'edli relates the ordered set of principal congruences of a bounded lattice $L$ with the ordered set of principal congruences of a~bounded sublattice $K$ of $L$. In this note, I sketch a new proof.
We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…
We discuss a new geometric construction of port-Hamiltonian systems. Using this framework, we revisit the notion of interconnection providing it with an intrinsic description. Special emphasis on theoretical and applied examples is given…
We introduce a new type of lattice path, called brick-wall lattice path, and we derive a formula which counts the number of paths on these lattices imposing certain restrictions on the Cartesian plane. Connections to the Fibonacci sequence,…