Resonating-valence-bond theory for the square-planar lattice

The short-range resonating-valence-bond (RVB) wave function with nearest-neighbor (NN) spin pairings only is investigated as a possible description for the Heisenberg model on a square-planar lattice. A type of long-range order associated to this RVB Ansatz is identified along with some qualitative consequences involving lattice distortions, excitations, and their coupling.

Kinetic resolution: a powerful tool for the synthesis of planar-chiral ferrocenes

Since the serendipitous discovery of ferrocene by Pauson and Kealy in 1951, it has become one of the most important structures in Organic Chemistry. Lately, kinetic resolution has emerged as a useful tool for the synthesis of planar chiral ferrocenes. This review aims to cover and discuss the development of this topic.

The number of planar central configurations for the 4-body problem is finite when 3 mass positions are fixed

In the n{body problem a central con guration is formed when the position vector of each particle with respect to the center of mass is a common scalar multiple of its acceleration vector. Lindstrom showed for n = 3 and for n > 4 that if n ? 1 masses are located at xed points in the plane, then there are only a nite number of ways to position the remaining nth mass in such a way that they de ne a central con guration. Lindstrom leaves open the case n = 4. In this paper we prove the case n = 4 using as variables the mutual distances between the particles.

General electromagnetic simulation tool to predict the microwave nonlinear response of planar, arbitrarily-shaped HTS structures

This work describes a simulation tool being developed at UPC to predict the microwave nonlinear behavior of planar superconducting structures with very few restrictions on the geometry of the planar layout. The software is intended to be applicable to most structures used in planar HTS circuits, including line, patch, and quasi-lumped microstrip resonators. The tool combines Method of Moments (MoM) algorithms for general electromagnetic simulation with Harmonic Balance algorithms to take into account the nonlinearities in the HTS material. The Method of Moments code is based on discretization of the Electric Field Integral Equation in Rao, Wilton and Glisson Basis Functions. The multilayer dyadic Green's function is used with Sommerfeld integral formulation. The Harmonic Balance algorithm has been adapted to this application where the nonlinearity is distributed and where compatibility with the MoM algorithm is required. Tests of the algorithm in TM010 disk resonators agree with closed-form equations for both the fundamental and third-order intermodulation currents. Simulations of hairpin resonators show good qualitative agreement with previously published results, but it is found that a finer meshing would be necessary to get correct quantitative results. Possible improvements are suggested.

Contact force transitions in regrasp tasks of planar objects

This paper presents a simple and fast solution to the problem of finding the time variations of the forces that keep the object equilibrium when a finger is removed from a three contact point grasp or a finger is added to a two contact point grasp, assuming the existence of an external perturbation force (that can be the object weight itself). The procedure returns force set points for the control system of a manipulator device in a regrasping action. The approach was implemented and a numerical example is included in the paper to illustrate how it works.

A note on the degree sequences of graphs with restrictions

Degree sequences of some types of graphs will be studied and characterizedin this paper.

Generating hard SAT/CSP instances using expander graphs

In this paper we provide a new method to generate hard k-SAT instances. We incrementally construct a high girth bipartite incidence graph of the k-SAT instance. Having high girth assures high expansion for the graph, and high expansion implies high resolution width. We have extended this approach to generate hard n-ary CSP instances and we have also adapted this idea to increase the expansion of the system of linear equations used to generate XORSAT instances, being able to produce harder satisfiable instances than former generators.

Sherali-Adams Relaxations and Indistinguishability in Counting Logics

Two graphs with adjacency matrices $\mathbf{A}$ and $\mathbf{B}$ are isomorphic if there exists a permutation matrix $\mathbf{P}$ for which the identity $\mathbf{P}^{\mathrm{T}} \mathbf{A} \mathbf{P} = \mathbf{B}$ holds. Multiplying through by $\mathbf{P}$ and relaxing the permutation matrix to a doubly stochastic matrix leads to the linear programming relaxation known as fractional isomorphism. We show that the levels of the Sherali--Adams (SA) hierarchy of linear programming relaxations applied to fractional isomorphism interleave in power with the levels of a well-known color-refinement heuristic for graph isomorphism called the Weisfeiler--Lehman algorithm, or, equivalently, with the levels of indistinguishability in a logic with counting quantifiers and a bounded number of variables. This tight connection has quite striking consequences. For example, it follows immediately from a deep result of Grohe in the context of logics with counting quantifiers that a fixed number of levels of SA suffice to determine isomorphism of planar and minor-free graphs. We also offer applications in both finite model theory and polyhedral combinatorics. First, we show that certain properties of graphs, such as that of having a flow circulation of a prescribed value, are definable in the infinitary logic with counting with a bounded number of variables. Second, we exploit a lower bound construction due to Cai, Fürer, and Immerman in the context of counting logics to give simple explicit instances that show that the SA relaxations of the vertex-cover and cut polytopes do not reach their integer hulls for up to $\Omega(n)$ levels, where $n$ is the number of vertices in the graph.

Anonymizing Graphs: Measuring Quality for Clustering

Peer-reviewed