Generalized Fitch Graphs III: Symmetrized Fitch maps and Sets of Symmetric Binary Relations that are explained by Unrooted Edge-labeled Trees

Binary relations derived from labeled rooted trees play an import role in mathematical biology as formal models of evolutionary relationships. The (symmetrized) Fitch relation formalizes xenology as the pairs of genes separated by at least one horizontal transfer event. As a natural generalization, we consider symmetrized Fitch maps, that is, symmetric maps $\varepsilon$ that assign a subset of colors to each pair of vertices in $X$ and that can be explained by a tree $T$ with edges that are labeled with subsets of colors in the sense that the color $m$ appears in $\varepsilon(x,y)$ if and only if $m$ appears in a label along the unique path between $x$ and $y$ in $T$. We first give an alternative characterization of the monochromatic case and then give a characterization of symmetrized Fitch maps in terms of compatibility of a certain set of quartets. We show that recognition of symmetrized Fitch maps is NP-complete. In the restricted case where $|\varepsilon(x,y)|\leq 1$ the problem becomes polynomial, since such maps coincide with class of monochromatic Fitch maps whose graph-representations form precisely the class of complete multi-partite graphs.

Almost disjoint families and ultrapowers

We prove estimates for the cardinality of set-theoretic ultrapowers in terms of the cardinality of almost disjoint families. Such results are then applied to obtain estimates for the density of ultrapowers of Banach spaces. We focus on the change of the behavior of the corresponding ultrapower when certain ‘‘completeness thresholds’’ of the relevant ultrafilter are crossed. Finally, we also provide an alternative characterization of measurable cardinals.

The State of Starch/Hydroxyapatite Composite Scaffold in Bone Tissue Engineering with Consideration for Dielectric Measurement as an Alternative Characterization Technique

Hydroxyapatite (HA) has been widely used as a scaffold in tissue engineering. HA possesses high mechanical stress and exhibits particularly excellent biocompatibility owing to its similarity to natural bone. Nonetheless, this ceramic scaffold has limited applications due to its apparent brittleness. Therefore, this had presented some difficulties when shaping implants out of HA and for sustaining a high mechanical load. Fortunately, these drawbacks can be improved by combining HA with other biomaterials. Starch was heavily considered for biomedical device applications in favor of its low cost, wide availability, and biocompatibility properties that complement HA. This review provides an insight into starch/HA composites used in the fabrication of bone tissue scaffolds and numerous factors that influence the scaffold properties. Moreover, an alternative characterization of scaffolds via dielectric and free space measurement as a potential contactless and nondestructive measurement method is also highlighted.

Average crossing time: An alternative characterization of mean aversion and reversion

This study compares and contrasts the multiple characterizations of mean reversion in financial time series as regards the restrictions they imply. This is accomplished by translating them into statements about an alternative measure, the “Average Crossing Time” or ACT. We argue that the ACT measure, per se, provides not only a useful benchmark for the degree of mean reversion/aversion, but also an intuitive, and easily quantified sense of one time series being “more strongly mean‐reverting/averting” than another. We conclude our discussion by deriving the ACT measure for a wide class of stochastic processes and detailing its statistical characteristics. Our analysis is principally undertaken within a class of well‐understood production based asset pricing models.

Complexity-theoretic aspects of expanding cellular automata

The expanding cellular automata (XCA) variant of cellular automata is investigated and characterized from a complexity-theoretical standpoint. An XCA is a one-dimensional cellular automaton which can dynamically create new cells between existing ones. The respective polynomial-time complexity class is shown to coincide with $${\le _{tt}^p}(\textsf {NP})$$ ≤ tt p ( NP ) , that is, the class of decision problems polynomial-time truth-table reducible to problems in $$\textsf {NP}$$ NP . An alternative characterization based on a variant of non-deterministic Turing machines is also given. In addition, corollaries on select XCA variants are proven: XCAs with multiple accept and reject states are shown to be polynomial-time equivalent to the original XCA model. Finally, XCAs with alternative acceptance conditions are considered and classified in terms of $${\le _{tt}^p}(\textsf {NP})$$ ≤ tt p ( NP ) and the Turing machine polynomial-time class $$\textsf {P}$$ P .