相关论文: On binary relations without non-identical endomorp…

On every set A there is a rigid binary relation i.e. such a relation R \subseteq A \times A that there is no homomorphism (A,R) \rightarrow (A,R) except the identity (Vop{\v{e}}nka et al. [1965]). We prove that for each infinite cardinal…

The rigid relation principle, introduced in this article, asserts that every set admits a rigid binary relation. This follows from the axiom of choice, because well-orders are rigid, but we prove that it is neither equivalent to the axiom…

We obtain a rigidity phenomena of rational cohomology automorphisms of certain homogeneous spaces, in the presence of external cohomology classes arising from spaces with trivial cup product in rational cohomology algebra. We classify…

A structure is called homogeneous if every isomorphism between finite substructures of the structure extends to an automorphism of the structure. Recently, P. J. Cameron and J. Ne\v{s}et\v{r}il introduced a relaxed version of homogeneity:…

The main result is Theorem: Let A be an R-algebra, mu, lambda be cardinals such that |A|<=mu=mu^{aleph_0}<lambda<=2^mu. If A is aleph_0-cotorsion-free or A is countably free, respectively, then there exists an aleph_0-cotorsion-free or a…

An $h$-ary relation $\r$ on a finite set $A$ is said to be \emph{hereditarily rigid} if the unary partial functions on $A$ that preserve $\r$ are the subfunctions of the identity map or of constant maps. A family of relations ${\mathcal F}$…

A structure is called homogeneous if every isomorphism between finitely induced substructures of the structure extends to an automorphism of the structure. Recently, P. J. Cameron and J. Ne\v{s}et\v{r}il introduced a relaxed version of…

A topological commutative ring is said to be rigid when for every set $X$, the topological dual of the $X$-fold topological product of the ring is isomorphic to the free module over $X$. Examples are fields with a ring topology, discrete…

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…

We examine functorial and homotopy properties of the exotic characteristic homomorphism in the category of Lie algebroids which was lastly obtained by the authors in [4]. This homomorphism depends on a triple (A,B,$\nabla$) where B…

In this paper, we prove that every real analytic totally nondegenerate model CR manifold of length >= 3 has rigidity. This result was actually conjectured before by Valerii Beloshapka as the so-called "maximum conjecture". It follows that…

If we assume the axiom of choice, then every two cardinal numbers are comparable. In the absence of the axiom of choice, this is no longer so. For a few cardinalities related to an arbitrary infinite set, we will give all the possible…

For any even natural number $r \ge 2$, we construct an irreducible rigid non-cohomologically rigid complex local system of rank $r$ on a smooth projective variety depending on $r$. For $r=2$, we construct an irreducible rigid…

In this paper we are interested in the fine-grained complexity of deciding whether there is a homomorphism from an input graph $G$ to a fixed graph $H$ (the $H$-Coloring problem). The starting point is that these problems can be viewed as…

The "Modularity Conjecture" is the assertion that the join of two nonmodular varieties is nonmodular. We establish the veracity of this conjecture for the case of linear idempotent varieties. We also establish analogous results concerning…

In this paper, we show that the presence of the Archimedean and the mixture-continuity properties of a binary relation, both empirically non-falsifiable in principle, foreclose the possibility of consistency (transitivity) without…

We prove that $i)$ if $\mathcal{A}$ is $\lambda $-accessible and it is axiomatizable in (finitary) coherent logic then $\lambda $-pure maps are strict monomorphisms and $ii)$ if there is a proper class of strongly compact cardinals and…

How many endomorphisms does a Boolean algebra have? Can we find Boolean algebras with as few endomorphisms as possible? Of course from any ultrafilter of the Boolean algebra we can define an endomorphism, and we can combine finitely many…

In [Sh:89] we, answering a question of Monk, have explicated the notion of ``a Boolean algebra with no endomorphisms except the ones induced by ultrafilters on it'' (see section 2 here) and proved the existence of one with character density…

A graph $H$ is said to be positive if the homomorphism density $t_H(G)$ is non-negative for all weighted graphs $G$. The positive graph conjecture proposes a characterisation of such graphs, saying that a graph is positive if and only if it…