Related papers: Strong G-schemes and strict homomorphisms

A new class of partial order-types, class $\gbqo^+$ is defined and investigated here. A poset $P$ is in the class $W^+ $ iff the free poset algebra $F(P)$ is generated by a better quasi-order $G$ that is included in the free lattice $L(P)$.…

Let $P,$ $S,$ and $T$ be semigroups, $f:P\to S$ and $g:P\to T$ semigroup homomorphisms, and $X$ a generating set for $S$ (possibly infinite). Clearly, a <i>necessary</i> condition for there to exist a homomorphism $S\to T$ making a…

In this article, we prove that if a finitely generated group $G$ is not torsion then a necessary and sufficient condition for every full shift over $G$ has (continuous) cocycle superrigidity is that $G$ has one end. It is a topological…

Let K\subset R^N be any convex body containing the origin. A measurable set G\subset R^N with finite and positive Lebesgue measure is said to be K-dense if, for any fixed r>0, the measure of G\cap (x+r K) is constant when x varies on the…

We provide specific PDEs for preserved quantities $Q$ in Geometry, as well as a bridge between this and specific PDEs for observables $O$ in Physics. We furthermore prove versions of four other theorems either side of this bridge: the below…

The stability number of a graph $G$, denoted as $\alpha(G)$, is the maximum size of an independent (stable) set in $G$. Semidefinite programming (SDP) methods, which originated from Lov\'asz's theta number and expanded through…

We apply the homomorphism complex construction to partially ordered sets, introducing a new topological construction based on the set of maximal chains in a graded poset. Our primary objects of study are distributive lattices, with special…

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:…

Let $R$ be a semilocal principal ideal domain. Two algebraic objects over $R$ in which scalar extension makes sense (e.g. quadratic spaces) are said to be of the same genus if they become isomorphic after extending scalars to all…

A simple but elegant result of Rival states that every sublattice $L$ of a finite distributive lattice $\mathcal{P}$ can be constructed from $\mathcal{P}$ by removing a particular family $\mathcal{I}_L$ of its irreducible intervals.…

Given a graph G, we investigate the question of determining the parity of the number of homomorphisms from G to some other fixed graph H. We conjecture that this problem exhibits a complexity dichotomy, such that all parity graph…

A set $S\subseteq \re^n$ is called to be {\it Semidefinite (SDP)} representable if $S$ equals the projection of a set in higher dimensional space which is describable by some Linear Matrix Inequality (LMI). The contributions of this paper…

A specialization semilattice is a join semilattice together with a coarser preorder $ \sqsubseteq $ satisfying an appropriate compatibility condition. If $X$ is a topological space, then $(\mathcal P(X), \cup, \sqsubseteq )$ is a…

Given a symmetric monoidal category $C$ with product $\sqcup$, where the neutral element for the product is an initial object, we consider the poset of $\sqcup$-complemented subobjects of a given object $X$. When this poset has finite…

A graph $G$ covers a graph $H$ if there exists a locally bijective homomorphism from $G$ to $H$. We deal with regular covers where this homomorphism is prescribed by the action of a semiregular subgroup of $\textrm{Aut}(G)$. We study…

We discuss whether finiteness properties of a profinite group $G$ can be deduced from the coefficients of the probabilistic zeta function $P_G(s)$. In particular we prove that if $P_G(s)$ is rational and all but finitely many non abelian…

Let $G$ be a discrete group and let $\mathcal A$ and $\mathcal B$ be two subgroups of $G$-valued continuous functions defined on two $0$-dimensional compact spaces $X$ and $Y$. A group isomorphism $H$ defined between $\mathcal A$ and…

This paper deals with combinatorial aspects of finite covers of groups by cosets or subgroups. Let $a_1G_1,...,a_kG_k$ be left cosets in a group $G$ such that ${a_iG_i}_{i=1}^k$ covers each element of $G$ at least $m$ times but none of its…

We introduce so-called consistent posets which are bounded posets with an antitone involution ' where the lower cones of x,x' and of y,y' coincide provided x,y are different form 0,1 and, moreover, if x,y are different form 0 then their…

In this paper, we introduce the notion of the containment graph of a family of sets and containment classes of graphs and posets. Let $Z$ be a family of nonempty sets. We call a (simple, finite) graph G = (V, E) a $Z$-containment graph…