Determination of the prime bound of a graph

Given a graph $G$, a subset $M$ of $V(G)$ is a module of $G$ if for each $v\in V(G)\setminus M$, $v$ is adjacent to all the elements of $M$ or to none of them. For instance, $V(G)$, $\emptyset$ and $\{v\}$ ($v\in V(G)$) are modules of $G$ called trivial. Given a graph $G$, $\omega_M(G)$ (respectively $\alpha_M(G)$) denotes the largest integer $m$ such that there is a module $M$ of $G$ which is a clique (respectively a stable) set in $G$ with $|M|=m$. A graph $G$ is prime if $|V(G)|\geq 4$ and if all its modules are trivial. The prime bound of $G$ is the smallest integer $p(G)$ such that there is a prime graph $H$ with $V(H)\supseteq V(G)$, $H[V(G)]=G$ and $|V(H)\setminus V(G)|=p(G)$. We establish the following. For every graph $G$ such that $\max(\alpha_M(G),\omega_M(G))\geq 2$ and $\log_2(\max(\alpha_M(G),\omega_M(G)))$ is not an integer, $p(G)=\lceil\log_2(\max(\alpha_M(G),\omega_M(G)))\rceil$. Then, we prove that for every graph $G$ such that $\max(\alpha_M(G),\omega_M(G))=2^k$ where $k\geq 1$, $p(G)=k$ or $k+1$. Moreover $p(G)=k+1$ if and only if $G$ or its complement admits $2^k$ isolated vertices. Lastly, we show that $p(G)=1$ for every non prime graph $G$ such that $|V(G)|\geq 4$ and $\alpha_M(G)=\omega_M(G)=1$.Comment: arXiv admin note: text overlap with arXiv:1110.293

Polynomials with prescribed bad primes

We tabulate polynomials in Z[t] with a given factorization partition, bad reduction entirely within a given set of primes, and satisfying auxiliary conditions associated to 0, 1, and infinity. We explain how these sets of polynomials are of particular interest because of their role in the construction of nonsolvable number fields of arbitrarily large degree and bounded ramification. Finally we discuss the similar but technically more complicated tabulation problem corresponding to removing the auxiliary conditions.Comment: 26 pages, 3 figure

James' Conjecture for Hecke algebras of exceptional type, I

In this paper, and a second part to follow, we complete the programme (initiated more than 15 years ago) of determining the decomposition numbers and verifying James' Conjecture for Iwahori--Hecke algebras of exceptional type. The new ingredients which allow us to achieve this aim are: - the fact, recently proved by the first author, that all Hecke algebras of finite type are cellular in the sense of Graham--Lehrer, and - the explicit determination of $W$-graphs for the irreducible (generic) representations of Hecke algebras of type $E_7$ and $E_8$ by Howlett and Yin. Thus, we can reduce the problem of computing decomposition numbers to a manageable size where standard techniques, e.g., Parker's {\sf MeatAxe} and its variations, can be applied. In this part, we describe the theoretical foundations for this procedure.Comment: 24 pages; corrected some misprints, added Remark 4.1

Bipartite entangled stabilizer mutually unbiased bases as maximum cliques of Cayley graphs

We examine the existence and structure of particular sets of mutually unbiased bases (MUBs) in bipartite qudit systems. In contrast to well-known power-of-prime MUB constructions, we restrict ourselves to using maximally entangled stabilizer states as MUB vectors. Consequently, these bipartite entangled stabilizer MUBs (BES MUBs) provide no local information, but are sufficient and minimal for decomposing a wide variety of interesting operators including (mixtures of) Jamiolkowski states, entanglement witnesses and more. The problem of finding such BES MUBs can be mapped, in a natural way, to that of finding maximum cliques in a family of Cayley graphs. Some relationships with known power-of-prime MUB constructions are discussed, and observables for BES MUBs are given explicitly in terms of Pauli operators.Comment: 8 pages, 1 figur

Drawing a Graph in a Hypercube

A $d$-dimensional hypercube drawing of a graph represents the vertices by distinct points in $\{0,1\}^d$, such that the line-segments representing the edges do not cross. We study lower and upper bounds on the minimum number of dimensions in hypercube drawing of a given graph. This parameter turns out to be related to Sidon sets and antimagic injections.Comment: Submitte