Related papers: Order polynomially complete lattices must be LARGE

We examine the lattice of all order congruences of a finite poset from the viewpoint of combinatorial algebraic topology. We will prove that the order complex of the lattice of all nontrivial order congruences (or order-preserving…

Let $X\subset \mathbb{C}^n$ be a smooth irreducible affine variety of dimension $k$ and let $F: X\to \mathbb{C}^m$ be a polynomial mapping. We prove that if $m\ge k$, then there is a Zariski open dense subset $U$ in the space of linear…

The collection CL(T) of nonempty convex sublattices of a lattice T ordered by bi-domination is a lattice. We say that T has the fixed point property for convex sublattices (CLFPP for short) if every order preserving map f from T to CL(T)…

We survey three methods for proving that the characteristic polynomial of a finite lattice factors over the nonnegative integers and indicate how they have evolved recently. The first technique uses geometric ideas and is based on…

For a set $S$ of quadratic polynomials over a finite field, let $C$ be the (infinite) set of arbitrary compositions of elements in $S$. In this paper we show that there are examples with arbitrarily large $S$ such that every polynomial in…

This paper studies the differential lattice, defined to be a lattice $L$ equipped with a map $d:L\to L$ that satisfies a lattice analog of the Leibniz rule for a derivation. Isomorphic differential lattices are studied and classifications…

We study the smallest convex lattice generated by a finite set of points. To analyze this structure, we introduce the notion of a point configuration, defined via the relative lattice. Under a suitable completeness condition, this lattice…

Some particular examples of classical and quantum systems on the lattice are solved with the help of orthogonal polynomials and its connection to continuous models are explored.

This paper is the concise addition to the foregoing work "Inconsistency of Inaccessibility", containing the presentation of main theorem proof (in ZF) about inaccessible cardinals nonexistence. Here some refinement of this presentation is…

This paper develops a rich theory of cardinality in the paraconsistent and paracomplete set theory $\mathrm{BZFC}$, where sets can be inconsistent ($A$ such that ``$x\in A$'' is both true and false for some $x$) or incomplete ($A$ such that…

We prove, via transfinite recursion, the existence, inside any linearly ordered set of appropriate regular cardinality $\lambda$, of a particular kind of well-ordered subsets characterized by the property of $\lambda$-fullness. Let $H$ be a…

We consider complete lattices equipped with preorderings indexed by the ordinals less than a given (limit) ordinal subject to certain axioms. These structures, called stratified complete lattices, and weakly monotone functions over them,…

In this paper we consider a general way of constructing profinite struc- tures based on a given framework - a countable family of objects and a countable family of recognisers (e.g. formulas). The main theorem states: A subset of a family…

In the paper the authors alternatively prove that the function $x^\alpha\big[\ln\frac{px}{x+p+1}-\psi_p(x)\big]$ is completely monotonic on $(0,\infty)$ if and only if $\alpha \le 1$, where $p\in\mathbb{N}$ and $\psi_p(x)$ is the…

For many classes of models, there are universal members in any cardinal $\lambda$ which "essentially satisfies GCH", i.e. $\lambda = 2^{< \lambda}$, in particular for the class of a complete first order $T$ (well, if at least $\lambda >…

We show that if we enrich first order logic by allowing quantification over isomorphisms between definable ordered fields the resulting logic, L(Q_{Of}), is fully compact. In this logic, we can give standard compactness proofs of various…

This paper has been withdrawn by the authors due to a crucial computational error. In this paper we deal with the finite case. We prove that a finite bounded ordered set can be represented as the order of principal congruences of a finite…

Ordering theorems, characterizing when partial orders of a group extend to total orders, are used to generate hypersequent calculi for varieties of lattice-ordered groups (l-groups). These calculi are then used to provide new proofs of…

Let I be a dense linear order with a left endpoint but no right endpoint. We consider the lattice L(I) of finite unions of closed intervals of I. This lattice arises naturally in the setting of o-minimality, as these are precisely the…

Does a given a set of polyominoes tile some rectangle? We show that this problem is undecidable. In a different direction, we also consider tiling a cofinite subset of the plane. The tileability is undecidable for many variants of this…