Related papers: Finite Confluences and Closed Pattern Mining
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…
In recent years, a new interest for the use of graph-theory based networks has emerged within the field of cognitive science. This has played a key role in mining the large amount of data generated by word association norms. In the present…
Some theories on data flow security are based on order-theoretical concepts, most commonly on lattice concepts. This paper presents a correspondence between security concepts and partial order concepts, by which the former become an…
We take an order-theoretic approach to circuit (string diagram) syntax, treating a circuit as a partial order with additional input-output structure. We define morphisms between circuits and prove a factorisation theorem showing that these…
Syntactic theory has traditionally adopted a constructivist approach, in which a set of atomic elements are manipulated by combinatory operations to yield derived, complex elements. Syntactic structure is thus seen as the result or discrete…
In this work I apply a recently proposed improvement procedure, originally conceived to reduce finite lattice spacing effects in transfer matrices for dilute Fermi systems, to tuning operators for the calculation of observables. I…
We present general design principles for engineering and discovering periodic systems with flat bands. Our paradigm exploits spin-orbit assisted orbital frustration on a lattice to produce band structures that contain multiplets of narrowly…
The processes of constructing some graphs from others using binary operations of union with intersection (gluing) are studied. For graph classes closed with respect to gluing operations the elemental and operational bases are introduced.…
A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…
This short note describes and proves a connectedness property which was introduced in Blocher et al. [2023] in the context of data depth functions for partial orders. The connectedness property gives a structural insight into union-free…
This paper studies structural aspects of lattice path matroids, a class of transversal matroids that is closed under taking minors and duals. Among the basic topics treated are direct sums, duals, minors, circuits, and connected flats. One…
Link prediction is an open problem in the complex network, which attracts much research interest currently. However, little attention has been paid to the relation between network structure and the performance of prediction methods. In…
In the dilute limit, the properties of fermionic lattice models with short-range attractive interactions converge to those of a dilute Fermi gas in continuum space. We investigate this connection using mean-field and we show that the…
In this paper, we investigate the general properties of lattice spin models that have string and/or membrane condensed ground states. We discuss the properties needed to define a string or membrane operator. We study three 3D spin models…
Considering patterns as sets of their instances, a difference operator over patterns computes a finite set of two given patterns, which represents the difference between the dividend pattern and the divisor pattern. A complement of a…
In this paper, we investigate the algebras of consequence operators and finite consequence operators on a fixed language. Significant new collections of consequence operators are defined and shown to be complete and distributive…
The skyline concept has been introduced in order to exhibit the best objects according to all the criterion combinations and makes it possible to analyse the relationships between skyline objects. Like the data cube, the skycube is so…
An expansive, monotone operator is dominating; if it is also idempotent it is a closure operator. Although they have distinct properties, these two kinds of discrete operators are also intertwined. Every closure operator is dominating;…
We introduce the use of Fourier analysis on lattices as an integral part of a lattice based construction. The tools we develop provide an elegant description of certain Gaussian distributions around lattice points. Our results include two…
The main purpose of the present paper is to provide a partial classification, performed with respect the weak-combinatorics, of free arrangements consisting of lines and one smooth conic with quasi-homogeneous ordinary singularities.