Unfreezing Casimir invariants: singular perturbations giving rise to forbidden instabilities

The infinite-dimensional mechanics of fluids and plasmas can be formulated as "noncanonical" Hamiltonian systems on a phase space of Eulerian variables. Singularities of the Poisson bracket operator produce singular Casimir elements that foliate the phase space, imposing topological constraints on the dynamics. Here we proffer a physical interpretation of Casimir elements as \emph{adiabatic invariants} ---upon coarse graining microscopic angle variables, we obtain a macroscopic hierarchy on which the separated action variables become adiabatic invariants. On reflection, a Casimir element may be \emph{unfrozen} by recovering a corresponding angle variable; such an increase in the number of degrees of freedom is, then, formulated as a \emph{singular perturbation}. As an example, we propose a canonization of the resonant-singularity of the Poisson bracket operator of the linearized magnetohydrodynamics equations, by which the ideal obstacle (resonant Casimir element) constraining the dynamics is unfrozen, giving rise to a tearing-mode instability

General Rule and Materials Design of Negative Effective U System for High-T_c Superconductivity

Based on the microscopic mechanisms of (1) charge-excitation-induced negative effective U in s^1 or d^9 electronic configurations, and (2) exchange-correlation-induced negative effective U in d^4 or d^6 electronic configurations, we propose a general rule and materials design of negative effective U system in itinerant (ionic and metallic) system for the realization of high-T_c superconductors. We design a T_c-enhancing layer (or clusters) of charge-excitation-induced negative effective $U$ connecting the superconducting layers for the realistic systems.Comment: 11 pages, 1 figures, 2 tables, APEX in printin

Lower Bounds on Query Complexity for Testing Bounded-Degree CSPs

In this paper, we consider lower bounds on the query complexity for testing CSPs in the bounded-degree model. First, for any ``symmetric'' predicate $P:{0,1}^{k} \to {0,1}$ except \equ where $k\geq 3$, we show that every (randomized) algorithm that distinguishes satisfiable instances of CSP(P) from instances $(|P^{-1}(0)|/2^k-\epsilon)$-far from satisfiability requires $\Omega(n^{1/2+\delta})$ queries where $n$ is the number of variables and $\delta>0$ is a constant that depends on $P$ and $\epsilon$. This breaks a natural lower bound $\Omega(n^{1/2})$, which is obtained by the birthday paradox. We also show that every one-sided error tester requires $\Omega(n)$ queries for such $P$. These results are hereditary in the sense that the same results hold for any predicate $Q$ such that $P^{-1}(1) \subseteq Q^{-1}(1)$. For EQU, we give a one-sided error tester whose query complexity is $\tilde{O}(n^{1/2})$. Also, for 2-XOR (or, equivalently E2LIN2), we show an $\Omega(n^{1/2+\delta})$ lower bound for distinguishing instances between $\epsilon$-close to and $(1/2-\epsilon)$-far from satisfiability. Next, for the general k-CSP over the binary domain, we show that every algorithm that distinguishes satisfiable instances from instances $(1-2k/2^k-\epsilon)$-far from satisfiability requires $\Omega(n)$ queries. The matching NP-hardness is not known, even assuming the Unique Games Conjecture or the $d$-to-$1$ Conjecture. As a corollary, for Maximum Independent Set on graphs with $n$ vertices and a degree bound $d$, we show that every approximation algorithm within a factor d/\poly\log d and an additive error of $\epsilon n$ requires $\Omega(n)$ queries. Previously, only super-constant lower bounds were known

Testing List H-Homomorphisms

Let $H$ be an undirected graph. In the List $H$-Homomorphism Problem, given an undirected graph $G$ with a list constraint $L(v) \subseteq V(H)$ for each variable $v \in V(G)$, the objective is to find a list $H$-homomorphism $f:V(G) \to V(H)$, that is, $f(v) \in L(v)$ for every $v \in V(G)$ and $(f(u),f(v)) \in E(H)$ whenever $(u,v) \in E(G)$. We consider the following problem: given a map $f:V(G) \to V(H)$ as an oracle access, the objective is to decide with high probability whether $f$ is a list $H$-homomorphism or \textit{far} from any list $H$-homomorphisms. The efficiency of an algorithm is measured by the number of accesses to $f$. In this paper, we classify graphs $H$ with respect to the query complexity for testing list $H$-homomorphisms and show the following trichotomy holds: (i) List $H$-homomorphisms are testable with a constant number of queries if and only if $H$ is a reflexive complete graph or an irreflexive complete bipartite graph. (ii) List $H$-homomorphisms are testable with a sublinear number of queries if and only if $H$ is a bi-arc graph. (iii) Testing list $H$-homomorphisms requires a linear number of queries if $H$ is not a bi-arc graph