Long Code testing is a fundamental problem in the area of property testing and hardness of approximation. In this paper, we study how small the soundness s of the Long Code test with perfect completeness can be by using non-adaptive q queries. We show that s = (2q+3)/2 is possible, where q is of the form 2 − 1 for any integer k > 2.

The longitudinal optical conductivity is the most important property for graphene-baseddevices. So investigating this property for spatially separated few-layer graphene systems analytically and numerically is the main purpose of our study. Each layer can be mono- or bi-layer graphene. The density-density correlation function has been screened by the dielectric function using the random p...

We describe a very general technique for generating families of combinatorial objects without isomorphs. It applies to almost any class of objects for which an inductive construction process exists. In one form of our technique, no explicit isomorphism testing is required. In the other form, isomorph testing is restricted to within small subsets of the entire set of objects. A variety of differ...

For a property π on graphs, the edge-contraction problem with respect to π is defined as a problem of finding a set of edges of minimum cardinality whose contraction results in a graph satisfying the property π. This paper gives a lower bound for the approximation ratio for the problem for any property π that is hereditary on contractions and determined by biconnected components. key words: edg...

 For a Banach algebra $fA$, we introduce ~$c.c(fA)$, the set of all $phiin fA^*$ such that $theta_phi:fAto  fA^*$ is a completely continuous operator, where $theta_phi$ is defined by $theta_phi(a)=acdotphi$~~ for all $ain fA$. We call $fA$, a completely continuous Banach algebra if $c.c(fA)=fA^*$. We give some examples of completely continuous Banach algebras and a sufficient condition for an o...