Related papers: Geometric enumeration problems for lattices and em…

We introduce the notion of intrinsic semilattice entropy $\widetilde h$ in the category $\mathcal L_{qm}$ of generalized quasimetric semilattices and contractive homomorphisms. By using appropriate categories $\mathfrak X$ and functors…

Motivated by lattice mixture identification and grain boundary detection, we present a framework for lattice pattern representation and comparison, and propose an efficient algorithm for lattice separation. We define new scale and shape…

Algebraic statistics uses tools from algebra (especially from multilinear algebra, commutative algebra and computational algebra), geometry and combinatorics to provide insight into knotty problems in mathematical statistics. In this survey…

The consistency problem for a class of algebraic structures asks for an algorithm to decide for any given conjunction of equations whether it admits a non-trivial satisfying assignment within some member of the class. By Adyan (1955) and…

We consider the problem of computing $R(c,a)$, the number of unlabeled graded lattices of rank $3$ that contain $c$ coatoms and $a$ atoms. More specifically we do this when $c$ is fairly small, but $a$ may be large. For this task, we…

For many equation-theoretical questions about modular lattices, Hall and Dilworth give a useful construction: Let $L_0$ be a lattice with largest element $u_0$, $L_1$ be a lattice disjoint from $L_0$ with smallest element $v_1$, and $a \in…

The distribution of the deformations of elementary cells is studied in an abstract lattice constructed from the existence of the empty set. One combination rule determining oriented sequences with continuity of set-distance function in such…

Submodularity is a fundamental phenomenon in combinatorial optimization. Submodular functions occur in a variety of combinatorial settings such as coverage problems, cut problems, welfare maximization, and many more. Therefore, a lot of…

In this work we propose Support Vector Machine classification algorithms to classify onedimensional crystal lattice waves from locally sampled data. Different learning datasets of particle displacements, momenta and energy density values…

We involve a certain propositional logic based on ortholattices. We characterize the implicational reduct of such a logic and we show that its algebraic counterpart is the so-called orthosemilattice. Properties of congruences and congruence…

We consider the enumeration of walks on the two dimensional non-negative integer lattice with short steps. Up to isomorphism there are 79 unique two dimensional models to consider, and previous work in this area has used the kernel method,…

The problem of map enumeration concerns counting connected spatial graphs, with a specified number $j$ of vertices, that can be embedded in a compact surface of genus $g$ in such a way that its complement yields a cellular decomposition of…

Let A, B, S be categories, let F:A-->S and G:B-->S be functors. We assume that for "many" objects a in A, there exists an object b in B such that F(a) is isomorphic to G(b). We establish a general framework under which it is possible to…

In this paper we generalize the well known relation between Heyting algebras and Nelson algebras in the framework of subresiduated lattices. In order to make it possible, we introduce the variety of subresiduated Nelson algebras. The main…

Algebraic lattices are those obtained from modules in the ring of integers of algebraic number fields through the canonical or twisted embeddings. In turn, well-rounded lattices are those with maximal cardinality of linearly independent…

The paper deals with the problem of identifying the internal dependencies and similarities among a large number of random processes. Linear models are considered to describe the relations among the time series and the energy associated to…

We use the theory of hyperplane arrangements to construct natural bases for the homology of partition lattices of types A, B and D. This extends and explains the "splitting basis" for the homology of the partition lattice given in [Wa96],…

In this chapter, we identify fundamental geometric structures that underlie the problems of sampling, optimisation, inference and adaptive decision-making. Based on this identification, we derive algorithms that exploit these geometric…

We relate the singularities of a scheme $X$ to the asymptotics of the number of points of $X$ over finite rings. This gives a partial answer to a question of Mustata. We use this result to count representations of arithmetic lattices. More…

We show that the isotropic lines in the lattice Z_{d}^{2} are the Lagrangian submodules of that lattice and we give their number together with the number of them through a given point of the lattice. The set of isotropic lines decompose…