175 research outputs found

    Imaging with two skew ideal lenses

    Get PDF
    In lens systems, the constituent lenses usually share a common optical axis, or at least a common optical-axis direction, and such combinations of lenses are well understood. However, in recent proposals for lens-based transformation-optics devices [Opt. Express 26, 17872 (2018) ], the lenses do not share an optical-axis direction. To facilitate the understanding of such lens systems, we describe here combinations of two ideal lenses in any arbitrary arrangement as a single ideal lens. This description has the potential to become an important tool in understanding novel optical instruments enabled by skew-lens combinations

    Connection Matrices and the Definability of Graph Parameters

    Full text link
    In this paper we extend and prove in detail the Finite Rank Theorem for connection matrices of graph parameters definable in Monadic Second Order Logic with counting (CMSOL) from B. Godlin, T. Kotek and J.A. Makowsky (2008) and J.A. Makowsky (2009). We demonstrate its vast applicability in simplifying known and new non-definability results of graph properties and finding new non-definability results for graph parameters. We also prove a Feferman-Vaught Theorem for the logic CFOL, First Order Logic with the modular counting quantifiers

    Thinness of product graphs

    Full text link
    The thinness of a graph is a width parameter that generalizes some properties of interval graphs, which are exactly the graphs of thinness one. Many NP-complete problems can be solved in polynomial time for graphs with bounded thinness, given a suitable representation of the graph. In this paper we study the thinness and its variations of graph products. We show that the thinness behaves "well" in general for products, in the sense that for most of the graph products defined in the literature, the thinness of the product of two graphs is bounded by a function (typically product or sum) of their thinness, or of the thinness of one of them and the size of the other. We also show for some cases the non-existence of such a function.Comment: 45 page

    Connection Matrices and the Definability of Graph Parameters

    Get PDF
    In this paper we extend the Finite Rank Theorem for connection matrices of graph parameters definable in Monadic Second Order Logic with modular counting CMSOL of B. Godlin, T. Kotek and J.A. Makowsky (2008 and 2009), and demonstrate its vast applicability in simplifying known and new non-definability results of graph properties and finding new non-definability results for graph parameters. We also prove a Feferman-Vaught Theorem for the logic CFOL, First Order Logic with the modular counting quantifiers
    • …
    corecore