Related papers: Rises for Measuring Local Distributivity in Lattic…
In a totally ordered set the notion of sorting a finite sequence is defined through a suitable permutation of the sequence's indices. In this paper we prove a simple formula that explicitly describes how the elements of a sequence are…
We introduce the concept of basis for a lattice. This basis plays a vital role to determine the completeness and consistency of the lattice. Weighted lattices are introduced and its complexity is formulated. Some axiomatic systems,…
Skew lattices are non-commutative generalizations of lattices. The coset structure decomposition is an original approach to the study of these algebras describing the relation between its rectangular classes. In this paper we will look at…
Traditional measures based solely on pairwise associations often fail to capture the complex statistical structure of multivariate data. Existing approaches for identifying information shared among $d>3$ variables are frequently…
We study the joint distribution of the number of occurrences of members of a collection of nonoverlapping motifs in digital data. We deal with finite and countably infinite collections. For infinite collections, the setting requires that we…
We introduce two lattice growth models: aggregation of $l$-dimensional boxes and aggregation of partitions with $l$ parts. We describe properties of the models: the parameter set of aggregations, the moments of the random variable of the…
We develop techniques to quantify the degree to which a given (training or testing) example is an outlier in the underlying distribution. We evaluate five methods to score examples in a dataset by how well-represented the examples are, for…
We consider one component lattice gases with a local dynamics and a stationary product Bernoulli measure. We give upper and lower bounds on the diffusivity at an equilibrium point depending on the dimension and the local behavior of the…
The uniqueness of online social networks makes it possible to implement new methods that increase the quality and effectiveness of research processes. While surveys are one of the most important tools for research, the representativeness of…
We consider a square expanding with constant speed seen from an observer moving away with constant acceleration and study the distribution of angles between rays from the observer towards the lattice points in the square. We prove the…
Diffusion-coagulation can be simply described by a dynamic where particles perform a random walk on a lattice and coalesce with probability unity when meeting on the same site. Such processes display non-equilibrium properties with strong…
The dispersion of a point set in the unit square is defined to be the area of the largest empty axis-parallel box. In this paper we are interested in the dispersion of lattices in the plane, that is, the supremum of the area of the empty…
Assortative mixing in networks is the tendency for nodes with the same attributes, or metadata, to link to each other. It is a property often found in social networks manifesting as a higher tendency of links occurring between people with…
The Boolean lattice of logical statements induces the free distributive lattice of questions. Inclusion on this lattice is based on whether one question answers another. Generalizing the zeta function of the question lattice leads to a…
A full-rank lattice in the Euclidean space is a discrete set formed by all integer linear combinations of a basis. Given a probability distribution on $\mathbb{R}^n$, two operations can be induced by considering the quotient of the space by…
Problems related to projections on closed convex cones are frequently encountered in optimization theory and related fields. To study these problems, various unifying ideas have been introduced, including asymmetric vector-valued norms and…
In this work we develop a Monte Carlo method to compute the height distribution of local maxima of a stationary Gaussian or Gaussian-related random field that is observed on a regular lattice. We show that our method can be used to provide…
Lattices are a commonly used structure for the representation and analysis of relational and ontological knowledge. In particular, the analysis of these requires a decomposition of a large and high-dimensional lattice into a set of…
Join-distributive lattices are finite, meet-semidistributive, and semimodular lattices. They are the same as Dilworth's lattices in 1940, and many alternative definitions and equivalent concepts have been discovered or rediscovered since…
Let $A$ be a basic finite-dimensional algebra and denote by $\operatorname{tors} A$ the collection of all all torsion classes of $A$. It has been proved in \cite{Demonet} that $\operatorname{tors} A$ is always a completely semidistributive…