相关论文: Deciding whether a Lattice has an Orthonormal Basi…

Let $L$ be a complete orthomodular lattice. There is a one to one correspondence between complete boolean subalgebras of $L$ contained in the center of $L$ and endomorphisms $j$ of $L$ satisfying the Borceux-Van den Bossche conditions.

We prove two results concerning an Ulam-type stability problem for homomorphisms between lattices. One of them involves estimates by quite general error functions; the other deals with approximate (join) homomorphisms in terms of certain…

We consider two-dimensional lattice equations defined on an elementary square of the Cartesian lattice and depending on the variables at the corners of the quadrilateral. For such equations the property often associated with integrability…

Two semigroups are lattice isomorphic if the lattices of their subsemigroups are isomorphic, and a class of semigroups is lattice closed if it contains every semigroup which is lattice isomorphic to some semigroup from that class. An…

The main ingredient to construct an O-border basis of an ideal I $\subseteq$ K[x1,. .., xn] is the order ideal O, which is a basis of the K-vector space K[x1,. .., xn]/I. In this paper we give a procedure to find all the possible order…

One of the longstanding problems in universal algebra is the question of which finite lattices are isomorphic to the congruence lattices of finite algebras. This question can be phrased as which finite lattices can be represented as…

We are concerned with the well-posedness of linear elliptic systems posed on $\mathbb{R}^d$. The concrete problem of interest, for which we require this theory, arises from the linearization of the equations of anisotropic finite…

We prove noncoherence of certain families of lattices in the isometry group of the hyperbolic n-space for n greater than 3. For instance, every nonuniform arithmetic lattice in SO(n,1) is noncoherent, provided that n is at least 6.

We address the problem of defining Schubert classes independently of a reduced word in equivariant elliptic cohomology, based on the Kazhdan-Lusztig basis of a corresponding Hecke algebra. We study some basic properties of these classes,…

Implicational bases are a well-known representation of closure spaces and their closure lattices. This representation is not unique, though, and a closure space usually admits multiple bases. Among these, the canonical base, the canonical…

We consider the problem of revealing a small hidden lattice from the knowledge of a low-rank sublattice modulo a given sufficiently large integer -- the {\em Hidden Lattice Problem}. A central motivation of study for this problem is the…

We provide a simple method to recognize classical orthogonal polynomials on lattices defined only by their coefficients of the three term recurrence relation.

We characterize numerical semigroups for which the poset of its ideal class monoid is a lattice, and study the irreducible elements of such a lattice with respect to union, intersection, infimum and supremum.

For a lattice L, let Princ L denote the ordered set of principal congruences of L. In a pioneering paper, G. Gratzer characterized the ordered sets Princ L of finite lattices L; here we do the same for countable lattices. He also showed…

For a proper, smooth scheme $X$ over a $p$-adic field $K$, we show that any proper, flat, semistable $\mathcal{O}_K$-model $\mathcal{X}$ of $X$ whose logarithmic de Rham cohomology is torsion free determines the same $\mathcal{O}_K$-lattice…

Let $B$ be an arrangement of linear complex hyperplanes in $C^d$. Then a classical result by Orlik \& Solomon asserts that the cohomology algebra of the complement can be constructed from the combinatorial data that are given by the…

A procedure for the construction and the classification of multilattices in arbitrary dimension is proposed. The algorithm allows to determine explicitly the location of the points of a multilattice given its space group, and to determine…

We classify rigid Schubert classes in orthogonal Grassmannians. More generally, given a representative $X$ of a Schubert class in an orthogonal Grassmannian, we give combinatorial conditions which guarantee that every linear space…

Lattice reduction is a NP-hard problem well known in computer science and cryptography. The Lenstra-Lenstra-Lovasz (LLL) algorithm based on the calculation of orthogonal Gram-Schmidt (GS) bases is efficient and gives a good solution in…

Let $\mathcal{K}=\mathbb{F}_q((x^{-1}))$. Analogous to orthogonality in the Euclidean space $\mathbb{R}^n$, there exists a well-studied notion of ultrametric orthogonality in $\mathcal{K}^n$. In this paper, we extend the work of…