Structural variations in aromatic 2 pi-electron three-membered rings of the main group elements

Structural variations of different Z pi-aromatic three-membered ring systems of main group elements, especially group 14 and 13 elements as compared to the classical description of cyclopropenyl cation has been reviewed in this article. The structures of heavier analogues as well as group 13 analogues of cyclopropenyl cation showed an emergence of dramatic structural patterns which do not conform, to the general norms of carbon chemistry. Isolobal analogies between the main group fragments have been efficiently used to explain the peculiarities observed in these three-membered ring systems.

A faster algorithm for testing polynomial representability of functions over finite integer rings

Given a function from Z(n) to itself one can determine its polynomial representability by using Kempner function. In this paper we present an alternative characterization of polynomial functions over Z(n) by constructing a generating set for the Z(n)-module of polynomial functions. This characterization results in an algorithm that is faster on average in deciding polynomial representability. We also extend the characterization to functions in several variables. (C) 2015 Elsevier B.V. All rights reserved.

Energy Sharing for Multiple Sensor Nodes With Finite Buffers

We consider the problem of finding optimal energy sharing policies that maximize the network performance of a system comprising of multiple sensor nodes and a single energy harvesting (EH) source. Sensor nodes periodically sense the random field and generate data, which is stored in the corresponding data queues. The EH source harnesses energy from ambient energy sources and the generated energy is stored in an energy buffer. Sensor nodes receive energy for data transmission from the EH source. The EH source has to efficiently share the stored energy among the nodes to minimize the long-run average delay in data transmission. We formulate the problem of energy sharing between the nodes in the framework of average cost infinite-horizon Markov decision processes (MDPs). We develop efficient energy sharing algorithms, namely Q-learning algorithm with exploration mechanisms based on the epsilon-greedy method as well as upper confidence bound (UCB). We extend these algorithms by incorporating state and action space aggregation to tackle state-action space explosion in the MDP. We also develop a cross entropy based method that incorporates policy parameterization to find near optimal energy sharing policies. Through simulations, we show that our algorithms yield energy sharing policies that outperform the heuristic greedy method.

On the superposition principle in interference experiments

The superposition principle is usually incorrectly applied in interference experiments. This has recently been investigated through numerics based on Finite Difference Time Domain (FDTD) methods as well as the Feynman path integral formalism. In the current work, we have derived an analytic formula for the Sorkin parameter which can be used to determine the deviation from the application of the principle. We have found excellent agreement between the analytic distribution and those that have been earlier estimated by numerical integration as well as resource intensive FDTD simulations. The analytic handle would be useful for comparing theory with future experiments. It is applicable both to physics based on classical wave equations as well as the non-relativistic Schrodinger equation.

Maximum group velocity in a one-dimensional model with a sinusoidally varying staggered potential

We use Floquet theory to study the maximum value of the stroboscopic group velocity in a one-dimensional tight-binding model subjected to an on-site staggered potential varying sinusoidally in time. The results obtained by numerically diagonalizing the Floquet operator are analyzed using a variety of analytical schemes. In the low-frequency limit we use adiabatic theory, while in the high-frequency limit the Magnus expansion of the Floquet Hamiltonian turns out to be appropriate. When the magnitude of the staggered potential is much greater or much less than the hopping, we use degenerate Floquet perturbation theory; we find that dynamical localization occurs in the former case when the maximum group velocity vanishes. Finally, starting from an ``engineered'' initial state where the particles (taken to be hard-core bosons) are localized in one part of the chain, we demonstrate that the existence of a maximum stroboscopic group velocity manifests in a light-cone-like spreading of the particles in real space.

Microwave Spectrum of Hexafluoroisopropanol and Torsional Behavior of Molecules with a CF3-C-CF3 Group

This paper presents the first microwave spectroscopic investigation on hexafluoroisopropanol (HFIP). A pulsed nozzle Fourier transform microwave spectrometer has been used to determine the rotational constants for HFIP as A = 2105.12166(18) MHz, B = 1053.99503(12) MHz, and C = 932.33959(13) MHz. In addition, five isotopologues of HFIP have been observed experimentally to determine the accurate structure of HFIP. The observed spectrum could be assigned to the most stable conformer of HFIP, called antiperiplanar. Available spectroscopic information and ab initio calculations on five prototype molecules helped in exploring the torsional behavior of molecules having a CF3-C-CF3 group. Two-dimensional potential energy surfaces have been analyzed for all molecules, which explained the presence/absence of doubling in the rotational transitions. With the help of natural bond orbital (NBO) analysis, reasons for the conformational preference of HFIP have been explained.

A Reliable Residual Based A Posteriori Error Estimator for a Quadratic Finite Element Method for the Elliptic Obstacle Problem

A residual based a posteriori error estimator is derived for a quadratic finite element method (FEM) for the elliptic obstacle problem. The error estimator involves various residuals consisting of the data of the problem, discrete solution and a Lagrange multiplier related to the obstacle constraint. The choice of the discrete Lagrange multiplier yields an error estimator that is comparable with the error estimator in the case of linear FEM. Further, an a priori error estimate is derived to show that the discrete Lagrange multiplier converges at the same rate as that of the discrete solution of the obstacle problem. The numerical experiments of adaptive FEM show optimal order convergence. This demonstrates that the quadratic FEM for obstacle problem exhibits optimal performance.