FCFrank a Campo

Frank a Campo

*This is an algorithmically generated author record based on publicly available information.

Frank a Campo has a total of 1 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    About posets of height one as retracts

    by Frank a Campo

    We investigate connected posets $C$ of height one as retracts of finite posets $P$. We define two multigraphs: a multigraph $\mathfrak{F}(P)$ reflecting the network of so-called improper 4-crown bundles contained in the extremal points of $P$, and a multigraph $\mathfrak{C}(C)$ depending on $C$ but not on $P$. There exists a close interdependence between $C$ being a retract of $P$ and the existence of a graph homomorphism of a certain type from $\mathfrak{F}(P)$ to $\mathfrak{C}(C)$. In particular, if $C$ is an ordinal sum of two antichains, then $C$ is a retract of $P$ iff such a graph homomorphism exists. Returning to general connected posets $C$ of height one, we show that the image of such a graph homomorphism can be a clique in $\mathfrak{C}(C)$ iff the improper 4-crowns in $P$ contain only a sparse subset of the edges of $C$.

  • Open Access

    A Flexible Approach for the Enumeration of Down-Sets and its Application on Dedekind Numbers

    by Frank a Campo

    We introduce a flexible approach for the enumeration of the down-sets of a finite poset and test it with the calculation of the Dedekind numbers $b(5) = 7581$ and $b(6) = 7828354$. For the calculation of $b(5)$, we develop two methods of which the first one (without pre-calculations) requires simple evaluation of 80 posets and the second one (with pre-calculations) of 34 posets. The calculation of $b(6)$ (with pre-calculations) is done by evaluating 245 posets.

  • Open Access

    Crowns as Retracts

    by Frank a Campo

    We characterize finite, connected posets $P$ having a crown as retract. We define a multigraph $\mathfrak{F}(P)$ whose vertices are the so-called improper 4-crowns contained in the extremal points of $P$ , and we show that $P$ contains a 4-crown as retract iff there exists a graph homomorphism of a certain type from $\mathfrak{F}(P)$ to a multigraph $\mathfrak{C}$ not depending on $P$ . Additionally we show that $P$ contains a retract-crown with $n \geq 6$ points iff the poset induced by the extremal points of $P$ contains a retract-crown with $n$ points.Mathematics Subject Classification: Primary: 06A07. Secondary: 06A06.

  • Open Access

    Crowns as retracts

    by Frank a Campo

    We characterize finite, connected posets $P$ having a crown as retract. We define a multigraph $\mathfrak{F}(P)$ whose vertices are the so-called improper 4-crowns contained in the extremal points of $P$, and we show that $P$ contains a 4-crown as retract iff there exists a graph homomorphism of a certain type from $\mathfrak{F}(P)$ to a multigraph $\mathfrak{C}$ not depending on $P$. Additionally we show that $P$ contains a retract-crown with $n \geq 6$ points iff the poset induced by the extremal points of $P$ contains a retract-crown with $n$ points.

  • Open Access

    The fixed point property of a poset and the fixed point property of the poset induced by its extremal points

    by Frank a Campo

    For a connected finite poset $P$, let $E(P)$ be the poset induced by the extremal points of $P$. We show that the fixed point property of $E(P)$ implies the fixed point property of $P$. On the other hand, we show that a homomorphism $f : E(P) \rightarrow Q$ can be extended to $P$ if $Q$ is a flat poset not containing a 4-crown. We conclude that every retract-crown of $E(P)$ with more than four points is a retract-crown of $P$, too. We see that for $P$ having the fixed point property but $E(P)$ not, every edge of every crown in $E(P)$ must belong to a so-called improper 4-crown, with additional specifications if $P$ has height two. The results provide several sufficient and necessary conditions for $P$ having the fixed point property, and these conditions refer to objects simpler than $P$.

  • Open Access

    A recursive approach for the enumeration of the homomorphisms from a poset $P$ to the chain $C_3$

    by Frank a Campo

    Let ${\cal H}(P,C_3)$ be the set of order homomorphisms from a poset $P$ to the chain $C_3 = 1 < 2 < 3$. We develop a recursive approach for the calculation of the cardinality of ${\cal H}(P,C_3)$, and we apply it on several types of posets, including $P = C_3 \times C_3 \times C_k$ and $P = {\cal H}(C_k, C_3)$; for the latter poset $P$, we derive a direct formula for $\# {\cal H} ( P, C_3 )$.

  • Open Access

    Interdependencies of less-equal-relations between partial Lovász-vectors of digraphs

    by Frank a Campo

    For digraphs $G$ and $H$, let ${\cal H}(G,H)$ be the set of all homomorphisms from $G$ to $H$, and let ${\cal S}(G,H)$ be the subset of those homomorphisms mapping all proper arcs in $G$ to proper arcs in $H$. From an earlier investigation we know that for certain digraphs $R$ and $S$, the relation "$\# {\cal S}(G,R) \leq \# {\cal S}(G,S)$ for all $G \in \mathfrak{ D }'$" implies "$\# {\cal H}(G,R) \leq \# {\cal H}(G,S)$ for all $G \in \mathfrak{ D }'$", where $\mathfrak{ D }'$ is a subclass of digraphs. Now we ask for the inverse: For which digraphs $R, S$ and which subclasses $\mathfrak{ D }'$ of digraphs does "$\# {\cal H}(G,R) \leq \# {\cal H}(G,S)$ for all $G \in \mathfrak{ D }'$" imply "$\# {\cal S}(G,R) \leq \# {\cal S}(G,S)$ for all $G \in \mathfrak{ D }'$"? We prove this implication for three combinations of digraph classes. In particular, the relations are equivalent for all flat posets $R, S$ with respect to all flat posets $G$.

  • Open Access

    Generalized One-to-One Mappings between Homomorphism Sets of Digraphs

    by Frank a Campo

    Structural properties of finite digraphs $R$ and $S$ are studied which enforce $\# {\cal H}(G,R) \leq \# {\cal H}(G,S)$ for every finite digraph $G \in \mathfrak{ D }'$, where ${\cal H}(G,H)$ is the set of homomorphisms from $G$ to $H$, and $\mathfrak{ D }'$ is a class of digraphs. In a previous study, we have seen that the key for such a relation between $R$ and $S$ is the existence of a strong S-scheme from $R$ to $S$. Such an S-scheme $\rho$ defines a one-to-one mapping $\rho_G : {\cal S}(G,R) \rightarrow {\cal S}(G,S)$ for every $G \in \mathfrak{ D }'$, where ${\cal S}(G,H)$ is the set of homomorphisms from $G$ to $H$ mapping proper arcs of $G$ to proper arcs of $H$. In the present article, we characterize S-schemes $\rho$ which are induced by strict homomorphisms $\epsilon : {\cal E}(R) \rightarrow {\cal E}(S)$ between auxiliary systems of $R$ and $S$, and we analyze the mutual dependency between the properties of $\rho$ and $\epsilon$. Wide applicability of the theory is ensured by specifying the auxiliary systems ${\cal E}(R)$ and ${\cal E}(S)$ as EV-systems of $R$ and $S$. The results are applied on a rearrangement method for digraphs and on undirected graphs.

  • Open Access

    Criteria for the less-equal-relation between partial Lovász-vectors of digraphs

    by Frank a Campo

    Finite digraphs $R$ and $S$ are studied with $\# {\cal H}(G,R) \leq \# {\cal H}(G,S)$ for every finite digraph $G \in \mathfrak{ D }'$, where ${\cal H}(G,H)$ is the set of order homomorphisms from $G$ to $H$ and $\mathfrak{ D }'$ is a class of finite digraphs. It is shown that for several classes $\mathfrak{ D }'$ of digraphs and $R \in \mathfrak{ D }'$, the relation $\# {\cal H}(G,R) \leq \# {\cal H}(G,S)$ for every $G \in \mathfrak{ D }'$ is implied by the relation $\# {\cal S}(G,R) \leq \# {\cal S}(G,S)$ for every $G \in \mathfrak{ D }'$, where ${\cal S}(G,H)$ is the set of homomorphisms from $G$ to $H$ mapping all proper arcs of $G$ to proper arcs of $H$. Under an application-oriented regularity condition, the two relations are even equivalent. A method is developed for the rearrangement of a digraph $R$, resulting in a digraph $S$ with $\# {\cal H}(G,R) \leq \# {\cal H}(G,S)$ for every digraph $G$. The method is applied in constructing pairs of partially ordered sets $R$ and $S$ with $\# {\cal H}(P,R) \leq \# {\cal H}(P,S)$ for every partially ordered set $P$. The main part of the results holds also for undirected graphs.