ar X iv : c s . D M / 0 50 30 83 v 1 2 9 M ar 2 00 5 Coarse and Sharp Thresholds of Boolean Constraint Satisfaction Problems ∗

ar X iv : c s / 06 07 10 9 v 1 [ cs . D M ] 2 5 Ju l 2 00 6 Complexity and Applications of Edge - Induced Vertex - Cuts

Motivated by hypergraph decomposition algorithms, we introduce the notion of edge-induced vertex-cuts and compare it with the well-known notions of edge-cuts and vertex-cuts. We investigate the complexity of computing minimum edge-induced vertex-cuts and demonstrate the usefulness of our notion by applications in network reliability and constraint satisfaction.

ar X iv : m at h - ph / 0 10 30 34 v 1 2 5 M ar 2 00 1 MZ - TH 01 - 09 LPT - ORSAY 01 - 28 MULTIPLE NONCOMMUTATIVE TORI

We derive the Kac-Paljutkin finite-dimensional Hopf algebras as finite fibrations of the quantum double torus and generalize the construction for quantum multiple tori.

ar X iv : c on d - m at / 0 50 20 77 v 1 2 F eb 2 00 5 HIGHER MOMENTS OF NOISE

ar X iv : m at h - ph / 0 30 30 45 v 1 1 9 M ar 2 00 3 p – Adic pseudodifferential operators and p – adic wavelets

We introduce a new wide class of p–adic pseudodifferential operators. We show that the basis of p–adic wavelets is the basis of eigenvectors for the introduced operators.

ar X iv : c on d - m at / 0 00 64 62 v 3 1 9 M ar 2 00 1 Uniaxial Lifshitz Point at O ( ǫ 2 L )

The critical exponents νL2, ηL2 and γL of a uniaxial Lifshitz point are calculated at two-loop level using renormalization group and ǫL expansion techniques. We introduced a new constraint involving the loop momenta along the competition axis, which allows to solve the two-loop integrals. The exponent γL obtained using our method is in good agreement with numerical estimates based on Monte Carl...