相关论文: A uniform refinement property for congruence latti…

Three philosophical principles are often quoted in connection with Leibniz: "objects sharing the same properties are the same object", "everything can possibly exist, unless it yields contradiction", "the ideal elements correctly determine…

We consider the coincidence problem for the square lattice that is translated by an arbitrary vector. General results are obtained about the set of coincidence isometries and the coincidence site lattices of a shifted square lattice by…

It is shown that the universal theory of the free pseudocomplemented distributive lattice is decidable and a recursive axiomatization is presented. This contrasts with the case of the full elementary theory of the finitely generated free…

We show that all finite lattices, including non-distributive lattices, arise as stable matching lattices when all agents have path-independent choice functions. This result answers an open question of Blair~\cite{blair1988lattice}. In the…

We construct a completely normal bounded distributive lattice D in which for every pair (a, b) of elements, the set {x $\in$ D | a $\le$ b $\lor$ x} has a countable coinitial subset, such that D does not carry any binary operation -…

We propose a lattice field theory formulation which overcomes some fundamental difficulties in realizing exact supersymmetry on the lattice. The Leibniz rule for the difference operator can be recovered by defining a new product on the…

In this note we give a simple unifying proof of the undecidability of several diagrammatic properties of term rewriting systems that include: local confluence, strong confluence, diamond property, subcommutative property, and the existence…

The aim of this paper is to study lattice properties of the sharp partial order for complex matrices having index at most 1. We investigate the down-set of a fixed matrix $B$ under this partial order via isomorphisms with two different…

Slim semimodular lattices were introduced by G. Gr\"atzer and E. Knapp in 2007, and they have intensively been studied since then. It is often reasonable to give these lattices by their $\mathcal C_1$-diagrams defined by the author in 2017.…

The special linear group G=SL_n(Z[x1,...,xk]) (n at least 3 and k finite) is called the universal lattice. Let n be at least 4, p be any real number in (1,\infty). The main result is the following: any finite index subgroup of G has the…

We develop further basic tools in the theory of continuous bounded cohomology of locally compact groups. We apply this tools to establish a Milnor-Wood type inequality in a very general context and to prove a global rigidity result which…

We consider the reproducing kernel function of the theta Bargmann-Fock Hilbert space associated to given full-rank lattice and pseudo-character, and we deal with some of its analytical and arithmetical properties. Specially, the…

Let $\Gamma$ be an irreducible lattice in a semisimple Lie group of real rank at least $2$. Suppose that $\Gamma$ has property (T;FD), that is, its finite dimensional representations have a uniform spectral gap. We show that if $\Gamma$ is…

We investigate, theoretically and experimentally,the properties of diffraction spectra of Fibonacci lattices with arbitrary spacings. We show that, by means of a suitable composition rule, a Fibonacci sequence can be mapped into another one…

This paper presents a unified framework for determining the congruences on a number of monoids and categories of transformations, diagrams, matrices and braids, and on all their ideals. The key theoretical advances present an iterative…

We affirm a conjecture of Sacks [1972] by showing that every countable distributive lattice is isomorphic to an initial segment of the hyperdegrees, $\mathcal{D}_{h}$. In fact, we prove that every sublattice of any hyperarithmetic lattice…

We investigate the alternate order on a congruence-uniform lattice $\mathcal{L}$ as introduced by N. Reading, which we dub the core label order of $\mathcal{L}$. When $\mathcal{L}$ can be realized as a poset of regions of a simplicial…

We use the subgraph replacement method to investigate new properties of the tilings of regions on the square lattice with diagonals drawn in. In particular, we show that the centrally symmetric tilings of a generalization of the Aztec…

We denote by Conc(L) the semilattice of all finitely generated congruences of a lattice L. For varieties (i.e., equational classes) V and W of lattices such that V is contained neither in W nor its dual, and such that every simple member of…

This paper studies the \emph{unimodular isomorphism problem} (UIP) of convex lattice polytopes: given two convex lattice polytopes $P$ and $P'$, decide whether there exists a unimodular affine transformation mapping $P$ to $P'$. We show…