A longstanding open problem in lambda calculus is whether there exists a non-syntactical model of the untyped lambda calculus whose theory is exactly the least λ-theory λβ. In this paper we make use of the Visser topology for investigating the related question of whether the equational theory of a model can be recursively enumerable (r.e. for brevity). We introduce the notion of an effective mo...

Let G(V;E) be a graph. The common neighborhood graph (congraph) of G is a graph with vertex set V , in which two vertices are adjacent if and only if they have a common neighbor in G. In this paper, we obtain characteristics of congraphs under graph operations; Graph :::::union:::::, Graph cartesian product, Graph tensor product, and Graph join, and relations between Cayley graphs and its c...

Compactifying 6d superconformal field theories (SCFTs) to 4d $\mathcal{N}=1$ on two-punctured spheres (tubes) and tori with flux is realized using duality domain walls in 5d Kaluza-Klein (KK) theories, which are usually denoted by $flux$ $domain$ $walls$. We revisit this construction study it detail from the perspective, specifically rephrasing box graph description of extended Coulomb branch p...

We study the relational graph models that constitute a natural subclass of relational models of λ-calculus. We prove that among the λ-theories induced by such models there exists a minimal one, and that the corresponding relational graph model is very natural and easy to construct. We then study relational graph models that are fully abstract, in the sense that they capture some observational e...

The study of culture in international relations theories takes a wide range of complex issues, which without enough perception about these issues, certainly our understanding about the role of culture in international relations theories will be incomplete. Since in real world the study of international affairs is best understood as traditional competition between traditional mainstream theories...

Finding clusters of well-connected nodes in a graph is useful in many domains, including Social Network, Web and molecular interaction analyses. From a computational viewpoint, finding these clusters or graph communities is a difficult problem. We consider the framework of Clique Matrices to decompose a graph into a set of possibly overlapping clusters, defined as well-connected subsets of vert...

The Merrifield-Simmons index of a graph is defined as the total number of the independent sets of the graph and the Hosoya index of a graph is defined as the total number of the matchings of the graph. In this paper, we give formula for Merrifield-Simmons and Hosoya indices of some classes of cartesian product of two graphs K{_2}×H, where H is a path graph P{_n}, cyclic graph C{_n}, or star gra...

Communication games are crucial tools for investigating the limitations of physical theories. The communication complexity (CC) problem is a typical example, which several distributed parties attempt to jointly calculate given function with limited classical communications. In this work, we present method construct CC problems from Bell tests in graph-theoretic way. Starting an experimental com...

‎in this paper we give a characterization for all commutative‎ ‎rings with $1$ whose zero-divisor graphs are $c_4$-free.‎

This paper describes a method for learning which relations are highly associated with a given seed relation such as marriage or working for a company. Relation instances taken from a large knowledge base are used as seeds for obtaining candidate sentences expressing the associated relations. Relations of interest are identified by parsing the sentences and extracting dependency graph fragments,...