s-Hankel hypermatrices and 2 x 2 determinantal ideals

We introduce the concept of s-Hankel hypermatrix, which generalizes both Hankel matrices and generic hypermatrices. We study two determinantal ideals associated to an s-Hankel hypermatrix: the ideal I generated by certain 2 x 2 slice minors, and the ideal \tilde{I} generated by certain 2 x 2 generalized minors. We describe the structure of these two ideals, with particular attention to the primary decomposition of I, and provide the explicit list of minimal primes for large values of s. Finally we give some geometrical interpretations and generalise a theorem of Watanabe

Electric-field switchable magnetization via the Dzyaloshinskii-Moriya interaction: FeTiO_3 versus BiFeO_3

In this article we review and discuss a mechanism for coupling between electric polarization and magnetization that can ultimately lead to electric-field switchable magnetization. The basic idea is that a ferroelectric distortion in an antiferromagnetic material can "switch on" the Dzyaloshinskii-Moriya interaction which leads to a canting of the antiferromagnetic sublattice magnetizations, and thus to a net magnetization. This magnetization M is coupled to the polarization P via a trilinear free energy contribution of the form P(M x L), where L is the antiferromagnetic order parameter. In particular, we discuss why such an invariant is present in R3c FeTiO_3 but not in the isostructural multiferroic BiFeO_3. Finally, we construct symmetry groups that in general allow for this kind of ferroelectrically-induced weak ferromagnetism.Comment: 15 pages, 3 images, to appear in J. Phys: Condens. Matter Focus Issue on Multiferroic

Paradigm and Paradox in Topology Control of Power Grids

Corrective Transmission Switching can be used by the grid operator to relieve line overloading and voltage violations, improve system reliability, and reduce system losses. Power grid optimization by means of line switching is typically formulated as a mixed integer programming problem (MIP). Such problems are known to be computationally intractable, and accordingly, a number of heuristic approaches to grid topology reconfiguration have been proposed in the power systems literature. By means of some low order examples (3-bus systems), it is shown that within a reasonably large class of greedy heuristics, none can be found that perform better than the others across all grid topologies. Despite this cautionary tale, statistical evidence based on a large number of simulations using using IEEE 118- bus systems indicates that among three heuristics, a globally greedy heuristic is the most computationally intensive, but has the best chance of reducing generation costs while enforcing N-1 connectivity. It is argued that, among all iterative methods, the locally optimal switches at each stage have a better chance in not only approximating a global optimal solution but also greatly limiting the number of lines that are switched

Clique-Stable Set separation in perfect graphs with no balanced skew-partitions

Inspired by a question of Yannakakis on the Vertex Packing polytope of perfect graphs, we study the Clique-Stable Set Separation in a non-hereditary subclass of perfect graphs. A cut (B,W) of G (a bipartition of V(G)) separates a clique K and a stable set S if $K\subseteq B$ and $S\subseteq W$. A Clique-Stable Set Separator is a family of cuts such that for every clique K, and for every stable set S disjoint from K, there exists a cut in the family that separates K and S. Given a class of graphs, the question is to know whether every graph of the class admits a Clique-Stable Set Separator containing only polynomially many cuts. It is open for the class of all graphs, and also for perfect graphs, which was Yannakakis' original question. Here we investigate on perfect graphs with no balanced skew-partition; the balanced skew-partition was introduced in the proof of the Strong Perfect Graph Theorem. Recently, Chudnovsky, Trotignon, Trunck and Vuskovic proved that forbidding this unfriendly decomposition permits to recursively decompose Berge graphs using 2-join and complement 2-join until reaching a basic graph, and they found an efficient combinatorial algorithm to color those graphs. We apply their decomposition result to prove that perfect graphs with no balanced skew-partition admit a quadratic-size Clique-Stable Set Separator, by taking advantage of the good behavior of 2-join with respect to this property. We then generalize this result and prove that the Strong Erdos-Hajnal property holds in this class, which means that every such graph has a linear-size biclique or complement biclique. This property does not hold for all perfect graphs (Fox 2006), and moreover when the Strong Erdos-Hajnal property holds in a hereditary class of graphs, then both the Erdos-Hajnal property and the polynomial Clique-Stable Set Separation hold.Comment: arXiv admin note: text overlap with arXiv:1308.644