INDEPENDENCE AND PI POLYNOMIALS FOR FEW STRINGS

If $s_k$ is the number of independent sets of cardinality $k$ in a graph $G$, then $I(G; x)= s_0+s_1x+…+s_{\alpha} x^{\alpha}$ is the independence polynomial of $G$ [ Gutman, I. and Harary, F., Generalizations of the matching polynomial, Utilitas Mathematica 24 (1983) 97-106] , where $\alpha=\alpha(G)$ is the size of a maximum independent set. Also the PI polynomial of a molecular graph $G$ is defined as $A+\sum x^{|E(G)|-N(e)}$, where $N(e)$ is the number of edges parallel to $e$, $A=|V(G)|(|V(G)|+1)/2-|E(G)|$ and summation goes over all edges of $G$. In [T. Do$\check{s}$li$\acute{c}$, A. Loghman and L. Badakhshian, Computing Topological Indices by Pulling a Few Strings, MATCH Commun. Math. Comput. Chem. 67 (2012) 173-190], several topological indices for all graphs consisting of at most three strings are computed. In this paper we compute the PI and independence polynomials for graphs containing one, two and three strings

On the Usefulness of Predicates

Motivated by the pervasiveness of strong inapproximability results for Max-CSPs, we introduce a relaxed notion of an approximate solution of a Max-CSP. In this relaxed version, loosely speaking, the algorithm is allowed to replace the constraints of an instance by some other (possibly real-valued) constraints, and then only needs to satisfy as many of the new constraints as possible. To be more precise, we introduce the following notion of a predicate $P$ being \emph{useful} for a (real-valued) objective $Q$: given an almost satisfiable Max-$P$ instance, there is an algorithm that beats a random assignment on the corresponding Max-$Q$ instance applied to the same sets of literals. The standard notion of a nontrivial approximation algorithm for a Max-CSP with predicate $P$ is exactly the same as saying that $P$ is useful for $P$ itself. We say that $P$ is useless if it is not useful for any $Q$. This turns out to be equivalent to the following pseudo-randomness property: given an almost satisfiable instance of Max-$P$ it is hard to find an assignment such that the induced distribution on $k$-bit strings defined by the instance is not essentially uniform. Under the Unique Games Conjecture, we give a complete and simple characterization of useful Max-CSPs defined by a predicate: such a Max-CSP is useless if and only if there is a pairwise independent distribution supported on the satisfying assignments of the predicate. It is natural to also consider the case when no negations are allowed in the CSP instance, and we derive a similar complete characterization (under the UGC) there as well. Finally, we also include some results and examples shedding additional light on the approximability of certain Max-CSPs

Counting dependent and independent strings

The paper gives estimations for the sizes of the the following sets: (1) the set of strings that have a given dependency with a fixed string, (2) the set of strings that are pairwise \alpha independent, (3) the set of strings that are mutually \alpha independent. The relevant definitions are as follows: C(x) is the Kolmogorov complexity of the string x. A string y has \alpha -dependency with a string x if C(y) - C(y|x) \geq \alpha. A set of strings {x_1, \ldots, x_t} is pairwise \alpha-independent if for all i different from j, C(x_i) - C(x_i | x_j) \leq \alpha. A tuple of strings (x_1, \ldots, x_t) is mutually \alpha-independent if C(x_{\pi(1)} \ldots x_{\pi(t)}) \geq C(x_1) + \ldots + C(x_t) - \alpha, for every permutation \pi of [t]

Information-theoretic inference of common ancestors

A directed acyclic graph (DAG) partially represents the conditional independence structure among observations of a system if the local Markov condition holds, that is, if every variable is independent of its non-descendants given its parents. In general, there is a whole class of DAGs that represents a given set of conditional independence relations. We are interested in properties of this class that can be derived from observations of a subsystem only. To this end, we prove an information theoretic inequality that allows for the inference of common ancestors of observed parts in any DAG representing some unknown larger system. More explicitly, we show that a large amount of dependence in terms of mutual information among the observations implies the existence of a common ancestor that distributes this information. Within the causal interpretation of DAGs our result can be seen as a quantitative extension of Reichenbach's Principle of Common Cause to more than two variables. Our conclusions are valid also for non-probabilistic observations such as binary strings, since we state the proof for an axiomatized notion of mutual information that includes the stochastic as well as the algorithmic version.Comment: 18 pages, 4 figure

Flavor structure and coupling selection rule from intersecting D-branes

We study flavor structure and the coupling selection rule in intersecting D-brane configurations. We formulate the selection rule for Yukawa couplings and its extensions to generic n-point couplings. We investigate the possible flavor structure, which can appear from intersecting D-brane configuration, and it is found that their couplings are determined by discrete abelian symmetry. Our studies on the flavor structure and the coupling selection rule show that the minimal matter content of the supersymmetric standard model would have difficulty to derive realistic Yukawa matrices from stringy 3-point couplings at the tree-level. However, extended models have a richer structure, leading to non-trivial mass matrices.Comment: 28 pages, latex, 5 figure

Computability of simple games: A complete investigation of the sixty-four possibilities

Classify simple games into sixteen "types" in terms of the four conventional axioms: monotonicity, properness, strongness, and nonweakness. Further classify them into sixty-four classes in terms of finiteness (existence of a finite carrier) and algorithmic computability. For each such class, we either show that it is empty or give an example of a game belonging to it. We observe that if a type contains an infinite game, then it contains both computable ones and noncomputable ones. This strongly suggests that computability is logically, as well as conceptually, unrelated to the conventional axioms.Comment: 25 page