相关论文: Order polynomially complete lattices must be LARGE

This paper explores several topics related to Woodin's HOD conjecture. We improve the large cardinal hypothesis of Woodin's HOD dichotomy theorem from an extendible cardinal to a strongly compact cardinal. We show that assuming there is a…

A comprehensive overview of lattice rules and polynomial lattice rules is given for function spaces based on $\ell_p$ semi-norms. Good lattice rules and polynomial lattice rules are defined as those obtaining worst-case errors bounded by…

We construct a countable simple theory which, in Keisler's order, is strictly above the random graph (but "barely so") and also in some sense orthogonal to the building blocks of the recently discovered infinite descending chain. As a…

We prove that the class of all ordinals Ord is not weakly compact with respect to definable classes. Specifically, in any model of ZFC, the definable tree property fails for Ord, in that there is a definable Ord tree with no definable…

This paper pursues an investigation on groups equipped with an $L$-ordered relation, where $L$ is a fixed complete complete Heyting algebra. First, by the concept of join and meet on an $L$-ordered set, the notion of an $L$-lattice is…

The status of topology on the lattice is reviewed. Recent results show that the topological susceptibility chi can be unambigously determined. Different methods, if properly implemented, give results consistent with each other. For SU(3)…

For an infinite group $G$, the poset $\mathcal{L}_G$ of group topologies constitutes a complete lattice. Although $\mathcal{L}_G$ is modular when $G$ is abelian, this property fails to persist for nilpotent groups. Extending Arnautov's 2010…

The canonical extension of a lattice is in an essential way a two-sided completion. Domain theory, on the contrary, is primarily concerned with one-sided completeness. In this paper, we show two things. Firstly, that the canonical extension…

The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values…

In this paper, a question due to Heckenberger, Shareshian and Welker on racks in [7] is positively answered. A rack is a set together with a selfdistributive bijective binary operation. We show that the lattice of subracks of every finite…

We construct a complete lattice $Z$ such that the binary supremum function $\sup:Z\times Z\to Z$ is discontinuous with respect to the product topology on $Z\times Z$ of the Scott topologies on each copy of $Z$. In addition, we show that…

Let $P$ be a partially ordered set. If the Boolean lattice $(2^{[n]},\subset)$ can be partitioned into copies of $P$ for some positive integer $n$, then $P$ must satisfy the following two trivial conditions: (1) the size of $P$ is a power…

We prove the consistency of: for suitable strongly inaccessible cardinal lambda the dominating number, i.e. the cofinality of lambda^lambda is strictly bigger than cov(meagre_lambda), i.e. the minimal number of nowhere dense subsets of…

Working with uncountable structures of fixed cardinality, we investigate the complexity of certain equivalence relations and show that if V = L, then many of them are \Sigma^1_1-complete, in particular the isomorphism relation of dense…

Let T be a topology on the finite set Xn. We consider the open polynomial associated with the topology T. Its coefficients are the cardinality of open sets of size j=0,...,n. J. Brown [4] asked when this polynomial has only real zeros. We…

Building on the work of Cassels we prove the existence of infinite families of compact orbits of the diagonal group in the space of lattices which accumulate only on the divergent orbit of the standard lattice. As a consequence, we prove…

For a given complete lattice L, we investigate whether L can be decomposed as a direct product of directly indecomposable lattices. We prove that this is the case if every element of L is a join of join-irreducible elements and dually, thus…

Under large cardinal hypotheses beyond the Kunen inconsistency -- hypotheses so strong as to contradict the Axiom of Choice -- we solve several variants of the generalized continuum problem and identify structural features of the levels…

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…

We show that the problem of deciding whether a given Euclidean lattice L has an orthonormal basis is in NP and co-NP. Since this is equivalent to saying that L is isomorphic to the standard integer lattice, this problem is a special form of…