Related papers: Irreducible Elements in Metric Lattices
Periodic lattices are natural generalizations of lattices, which arise naturally in diophantine approximations with rationals of bounded denominators. In this paper, we prove analogues of classical theorems in geometry of numbers for…
We study rigidity properties of lattices in terms of invariant means and commensurating actions (or actions on CAT(0) cube complexes). We notably study Property FM for groups, namely that any action on a discrete set with an invariant mean…
We consider metric versions of the notions of local embeddability and LEF. We pay special attention to normally finitely generated groups with word metrics.
Matrices are very popular and widely used in mathematics and other fields of science. Every mathematician has known the properties of finite-sized matrices since the time of study. In this paper, we consider the basic theory of infnite…
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…
Intervals in binary or n-ary relations or other discrete structures generalize the concept of interval in a linearly ordered set. Join-irreducible partitions into intervals are characterized in the lattice of all interval decompositions of…
We deal with equations over free semilattice of infinite rank and prove that any infinite consistent system of equations is equivalent to its finite subsystem. Moreover, we describe irreducible algebraic sets and solve some algorithmic…
It is a fairly known fact that most of the algebras appearing in the theory of rings of differential operators, quantized algebras of different kinds (including many quantum groups), regular algebras in projective non-commutative geometry,…
For a finitely generated regular wreath product, the metric is known, but its computation can be an NP-complete problem. Also, it is not known for the nonregular case. In this article, a metric estimate is defined for regular wreath…
We characterize factor congruences in semilattices by using generalized notions of order ideal and of direct sum of ideals. When the semilattice has a minimum (maximum) element, these generalized ideals turn into ordinary (dual) ideals.
In this paper, we give some generalizations the concept of element order and we study some of the properties of these generalized order. In particular, with using this generalization we derive two solvability criteria.
We consider the lattice of coarse structures on a set $X$ and study metrizable, locally finite and cellular coarse structures on $X$ from the lattice point of view.
Simple deformations, with a parameter $\epsilon$, of classical $R$-matrices which follow from decomposition of appropriate Lie algebras, are considered. As a result nonstandard Lax representations for some well known integrable systems are…
In a previous paper, we provided some update in the treatment of the finiteness theorem for rational maps of finite degree from a fixed variety to varieties of general type. In the present paper we present another improvement, introducing…
Dualization of a monotone Boolean function on a finite lattice can be represented by transforming the set of its minimal 1 to the set of its maximal 0 values. In this paper we consider finite lattices given by ordered sets of their meet and…
Convergence is a fundamental topic in analysis that is most commonly modelled using topology. However, there are many natural convergences that are not given by any topology; e.g., convergence almost everywhere of a sequence of measurable…
We conjecture recurrence relations satisfied by the degrees of some linearizable lattice equations. This helps to prove linear growth of these equations. We then use these recurrences to search for lattice equations that have linear growth…
The notion of multidimensional quadrilateral lattice is introduced. It is shown that such a lattice is characterized by a system of integrable discrete nonlinear equations. Different useful formulations of the system are given. The…
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…
This paper introduces the order-theoretic concept of lattices along with the concept of consistent quantification where lattice elements are mapped to real numbers in such a way that preserves some aspect of the order-theoretic structure.…