Related papers: Finite Confluences and Closed Pattern Mining
The present work aims to exploit the interplay between the algebraic properties of rings and the graph-theoretic structures of their associated graphs. We introduce commutatively closed graphs and investigate properties of commutatively…
The paper investigates localized deformation patterns resulting from the onset of instabilities in lattice structures. The study is motivated by previous observations on discrete hexagonal lattices, where the onset of non-uniform,…
A new class of integrable maps, obtained as lattice versions of polynomial dynamical systems is introduced. These systems are obtained by means of a discretization procedure that preserves several analytic and algebraic properties of a…
In recent years the investigation of hadron structure using lattice techniques has attracted growing attention. In this talk we give an overview on recent work with a focus on results for nucleon spectrum and structure from the QCDSF…
Atomically thin metallenes have emerged as a new member of the two-dimensional (2D) materials family. Recent experimental realization of metallenes in the {\AA}ngstr\"om limit has further intensified interest in this class of 2D materials.…
A lattice model of critical spanning webs is considered for the finite cylinder geometry. Due to the presence of cycles, the model is a generalization of the known spanning tree model which belongs to the class of logarithmic theories with…
In this paper we describe a mechanism to improve Information Retrieval (IR) on the web. The method is based on Formal Concepts Analysis (FCA) that it is makes semantical relations during the queries, and allows a reorganizing, in the shape…
In this thesis, I use the strong coupling expansion to investigate the multiflavor lattice Schwinger models in the hamiltonian formalism using staggered fermions. In particular, I am interested in analysing the mapping of these gauge…
The construction of multigrid operators for disordered linear lattice operators, in particular the fermion matrix in lattice gauge theories, by means of algebraic multigrid and block LU decomposition is discussed. In this formalism, the…
We propose a generalization of continuous lattices and domains through the concept of enriched closure space, defined as a closure space equipped with a preclosure operator satisfying some compatibility conditions. In this framework we are…
This paper introduces statistical order convergence and its pointwise variant for sequences of order bounded operators between Riesz spaces. We establish fundamental properties: uniqueness of the limit, stability under lattice operations,…
A number of mechanisms that lead to the confinement of patterns to a small part of a translationally symmetric pattern-forming system are reviewed: nonadiabatic locking of fronts, global coupling and conservation laws, dispersion, and…
Control-flow refinement refers to program transformations whose purpose is to make implicit control-flow explicit, and is used in the context of program analysis to increase precision. Several techniques have been suggested for different…
Formal concepts and closed itemsets proved to be of big importance for knowledge discovery, both as a tool for concise representation of association rules and a tool for clustering and constructing domain taxonomies and ontologies.…
As the first part of the treatise on A General Theory of Concept Lattice (I-V), this work develops the general concept lattice for the problem concerning categorization of objects according to their properties. Unlike the conventional…
This paper deals with the notion of weak Lawvere-Tierney topology on a topos. Our motivation to study such a notion is based on the observation that the composition of two Lawvere-Tierney topologies is no longer idempotent, when seen as a…
We develop a general framework for construction and analysis of discrete extension operators with application to unfitted finite element approximation of partial differential equations. In unfitted methods so called cut elements intersected…
This paper is motivated by the desire to study package management using the toolkit of the semantics of functional languages. As it transpires, this is deeply related to the semantics of concurrent computation. The models we produce are not…
Unification and generalization are operations on two terms computing respectively their greatest lower bound and least upper bound when the terms are quasi-ordered by subsumption up to variable renaming (i.e., $t_1\preceq t_2$ iff $t_1 =…
We argue that the existing knowledge about modular decomposition of graphs and clan decomposition of 2-structures can be put to use advantageously in a context of data analysis. We show how to obtain visual descriptions of co-occurrence…