5,708 research outputs found

    Varieties whose tolerances are homomorphic images of their congruences

    Get PDF
    The homomorphic image of a congruence is always a tolerance (relation) but, within a given variety, a tolerance is not necessarily obtained this way. By a Maltsev-like condition, we characterize varieties whose tolerances are homomorphic images of their congruences (TImC). As corollaries, we prove that the variety of semilattices, all varieties of lattices, and all varieties of unary algebras have TImC. We show that a congruence n-permutable variety has TImC if and only if it is congruence permutable, and construct an idempotent variety with a majority term that fails TImC

    Node counting in wireless ad-hoc networks

    Get PDF
    We study wireless ad-hoc networks consisting of small microprocessors with limited memory, where the wireless communication between the processors can be highly unreliable. For this setting, we propose a number of algorithms to estimate the number of nodes in the network, and the number of direct neighbors of each node. The algorithms are simulated, allowing comparison of their performance

    Term functions and subalgebras

    Get PDF

    CHEOPS performance for exomoons: The detectability of exomoons by using optimal decision algorithm

    Get PDF
    Many attempts have already been made for detecting exomoons around transiting exoplanets but the first confirmed discovery is still pending. The experience that have been gathered so far allow us to better optimize future space telescopes for this challenge, already during the development phase. In this paper we focus on the forthcoming CHaraterising ExOPlanet Satellite (CHEOPS),describing an optimized decision algorithm with step-by-step evaluation, and calculating the number of required transits for an exomoon detection for various planet-moon configurations that can be observable by CHEOPS. We explore the most efficient way for such an observation which minimizes the cost in observing time. Our study is based on PTV observations (photocentric transit timing variation, Szab\'o et al. 2006) in simulated CHEOPS data, but the recipe does not depend on the actual detection method, and it can be substituted with e.g. the photodynamical method for later applications. Using the current state-of-the-art level simulation of CHEOPS data we analyzed transit observation sets for different star-planet-moon configurations and performed a bootstrap analysis to determine their detection statistics. We have found that the detection limit is around an Earth-sized moon. In the case of favorable spatial configurations, systems with at least such a large moon and with at least Neptune-sized planet, 80\% detection chance requires at least 5-6 transit observations on average. There is also non-zero chance in the case of smaller moons, but the detection statistics deteriorates rapidly, while the necessary transit measurements increase fast. (abridged)Comment: 32 pages, 14 figures, accepted for publication in PAS

    Emergence of patterns in driven and in autonomous spatiotemporal systems

    Full text link
    The relationship between a driven extended system and an autonomous spatiotemporal system is investigated in the context of coupled map lattice models. Specifically, a locally coupled map lattice subjected to an external drive is compared to a coupled map system with similar local couplings plus a global interaction. It is shown that, under some conditions, the emergent patterns in both systems are analogous. Based on the knowledge of the dynamical responses of the driven lattice, we present a method that allows the prediction of parameter values for the emergence of ordered spatiotemporal patterns in a class of coupled map systems having local coupling and general forms of global interactions.Comment: 7 pages, 3 figs, submitted to PRE (2002
    • 

    corecore