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.

Tailoring the surface density of silicon nanocrystals embedded in SiOx single layers

In this article, we explore the possibility of modifying the silicon nanocrystal areal density in SiOx single layers, while keeping constant their size. For this purpose, a set of SiOx monolayers with controlled thickness between two thick SiO2 layers has been fabricated, for four different compositions (x=1, 1.25, 1.5, or 1.75). The structural properties of the SiO x single layers have been analyzed by transmission electron microscopy (TEM) in planar view geometry. Energy-filtered TEM images revealed an almost constant Si-cluster size and a slight increase in the cluster areal density as the silicon content increases in the layers, while high resolution TEM images show that the size of the Si crystalline precipitates largely decreases as the SiO x stoichiometry approaches that of SiO2. The crystalline fraction was evaluated by combining the results from both techniques, finding a crystallinity reduction from 75% to 40%, for x = 1 and 1.75, respectively. Complementary photoluminescence measurements corroborate the precipitation of Si-nanocrystals with excellent emission properties for layers with the largest amount of excess silicon. The integrated emission from the nanoaggregates perfectly scales with their crystalline state, with no detectable emission for crystalline fractions below 40%. The combination of the structural and luminescence observations suggests that small Si precipitates are submitted to a higher compressive local stress applied by the SiO2 matrix that could inhibit the phase separation and, in turn, promotes the creation of nonradiative paths.

Effect of the surface charge discretization on electric double layers. A Monte Carlo simulation study

The structure of the electric double layer in contact with discrete and continuously charged planar surfaces is studied within the framework of the primitive model through Monte Carlo simulations. Three different discretization models are considered together with the case of uniform distribution. The effect of discreteness is analyzed in terms of charge density profiles. For point surface groups,a complete equivalence with the situation of uniformly distributed charge is found if profiles are exclusively analyzed as a function of the distance to the charged surface. However, some differences are observed moving parallel to the surface. Significant discrepancies with approaches that do not account for discreteness are reported if charge sites of finite size placed on the surface are considered.

Families of periodic horseshoe orbits in the restricted three-body problem

We compute families of symmetric periodic horseshoe orbits in the restricted three-body problem. Both the planar and three-dimensional cases are considered and several families are found.We describe how these families are organized as well as the behavior along and among the families of parameters such as the Jacobi constant or the eccentricity. We also determine the stability properties of individual orbits along the families. Interestingly, we find stable horseshoe-shaped orbit up to the quite high inclination of 17◦

Highly eccentric hip-hop solutions of the 2N

We show the existence of families of hip-hop solutions in the equal-mass 2N-body problem which are close to highly eccentric planar elliptic homographic motions of 2N bodies plus small perpendicular non-harmonic oscillations. By introducing a parameter ϵ, the homographic motion and the small amplitude oscillations can be uncoupled into a purely Keplerian homographic motion of fixed period and a vertical oscillation described by a Hill type equation. Small changes in the eccentricity induce large variations in the period of the perpendicular oscillation and give rise, via a Bolzano argument, to resonant periodic solutions of the uncoupled system in a rotating frame. For small ϵ ≠ 0, the topological transversality persists and Brouwer's fixed point theorem shows the existence of this kind of solutions in the full system

An octree isosurface codification based on discrete planes

Describes a method to code a decimated model of an isosurface on an octree representation while maintaining volume data if it is needed. The proposed technique is based on grouping the marching cubes (MC) patterns into five configurations according the topology and the number of planes of the surface that are contained in a cell. Moreover, the discrete number of planes on which the surface lays is fixed. Starting from a complete volume octree, with the isosurface codified at terminal nodes according to the new configuration, a bottom-up strategy is taken for merging cells. Such a strategy allows one to implicitly represent co-planar faces in the upper octree levels without introducing any error. At the end of this merging process, when it is required, a reconstruction strategy is applied to generate the surface contained in the octree intersected leaves. Some examples with medical data demonstrate that a reduction of up to 50% in the number of polygons can be achieved