Finite Groups Having Exactly Two Conjugate Classes of Non-subnormal Subgroups

In this paper, finite groups having exactly two conjugate classes of non-subnormal subgroups of G are completely classified.     

Automorphism Groups of Schur Rings

In 1993, Muzychuk [23 Muzychuk , Mikhail E. ( 1993 ). The structure of rational Schur rings over cyclic groups . European Journal of Combinatorics 14 : 479 – 490 .[Crossref], [Web of Science ®] , [Google Scholar]] showed that the rational Schur rings over a cyclic group Z _n are in one-to-one correspondence with sublattices of the divisor lattice of n, or equivalently, with sublattices of the lattice of subgroups of Z _n . This can easily be extended to show that for any finite group G, sublattices of the lattice of characteristic subgroups of G give rise to rational Schur rings over G in a natural way. Our main result is that any finite group may be represented as the (algebraic) automorphism group of such a rational Schur ring over an abelian p-group, for any odd prime p. In contrast, over a cyclic group the automorphism group of any Schur ring is abelian. We also prove a converse to the well-known result of Muzychuk [24 Muzychuk , Mikhail E. ( 1994 ). On the structure of basic sets of Schur rings over cyclic groups . Journal of Algebra 169 : 655 – 678 .[Crossref], [Web of Science ®] , [Google Scholar]] that two Schur rings over a cyclic group are isomorphic if and only if they coincide; namely, we show that over a group which is not cyclic, there always exist distinct isomorphic Schur rings.     

A Characteristic Finite Volume Element Method for the Air Pollution Model

In this article, a characteristic finite volume element method is presented for solving air pollution models. The convection term is discretized using the characteristic method and diffusion term is approximated by finite volume element method. Compared with standard finite volume element method, our proposed method is more accurate and efficient, especially suitable to solve convection-dominated problems. The proposed numerical schemes are analyzed for convergence in L ₂ norm. Some numerical results are presented to demonstrate the efficiency and accuracy of the method.     

On the Behavior of the Solutions for Certain Linear Autonomous Difference Equations

Certain linear autonomous delay as well as neutral delay difference equations are considered. A class of linear autonomous delay difference equations with continuous variable is also considered. Some results on the behavior of the solutions are established via two distinct positive roots of the corresponding characteristic equation.     

Neural Models for the Resonant Frequency of Electrically Thin and Thick Circular Microstrip Antennas and the Characteristic Parameters of Asymmetric Coplanar Waveguides Backed with a Conductor

Neural models for computing the resonant frequency of electrically thin and thick circular microstrip antennas, based on the multilayered perceptrons and the radial basis function networks, are presented. Five learning algorithms, delta-bar-delta, extended delta-bar-delta, quick-propagation, directed random search and genetic algorithms, are used to train the multilayered perceptrons. The radial basis function network is trained according to its learning strategy. The resonant frequency results of neural models are in very good agreement with the experimental results available in the literature. In this paper, the characteristic impedance and the effective permittivity of the asymmetric coplanar waveguide backed with a conductor are also computed by using only one neural model trained by the backpropagation with momentum and the extended delta-bar-delta algorithms. When the performances of neural models are compared with each other, the best results for test are obtained from the multilayered perceptrons trained by the extended delta-bar-delta algorithm.     

Counting Function of Characteristic Values and Magnetic Resonances

We consider the meromorphic operator-valued function I ? K(z) = I ? A(z)/z where A is holomorphic on the domain 𝒟 ? ?, and has values in the class of compact operators acting in a given Hilbert space. Under the assumption that A(0) is a selfadjoint operator which can be of infinite rank, we study the distribution near the origin of the characteristic values of I ? K, i.e. the complex numbers w ≠ 0 for which the operator I ? K(w) is not invertible, and we show that generically the characteristic values of I ? K converge to 0 with the same rate as the eigenvalues of A(0).

We apply our abstract results to the investigation of the resonances of the operator H = H ₀ + V where H ₀ is the shifted 3D Schrödinger operator with constant magnetic field of scalar intensity b > 0, and V: ?³ → ? is the electric potential which admits a suitable decay at infinity. It is well known that the spectrum σ(H ₀) of H ₀ is purely absolutely continuous, coincides with [0, + ∞[, and the so-called Landau levels 2bq with integer q ≥ 0, play the role of thresholds in σ(H ₀). We study the asymptotic distribution of the resonances near any given Landau level, and under generic assumptions obtain the main asymptotic term of the corresponding resonance counting function, written explicitly in the terms of appropriate Toeplitz operators.     

The perturbed laplacian matrix of a graph

For a graph G, we define its perturbed Laplacian matrix as D?A(G) where A(G) is the adjacency matrix of G and D is an arbitrary diagonal matrix. Both the Laplacian matrix and the negative of the adjacency matrix are special instances of the perturbed Laplacian. Several well-known results, contained in the classical work of Fiedler and in more recent contributions of other authors are shown to be true, with suitable modifications, for the perturbed Laplacian. An appropriate generalization of the monotonicity property of a Fiedler vector for a tree is obtained. Some of the results are applied to interval graphs.     

Maximizing the distance between center,centroid and characteristic set of a tree

Consider a tree P_n-g,g , n≥ 2, 1≤ g≤ n-1 on n vertices which is obtained from a path on [1,2,?…?,n-g] vertices by adding g pendant vertices to the pendant vertex n-g. We prove that over all trees on n?≥?5 vertices, the distance between center and characteristic set, centroid and characteristic set, and center and centroid is maximized by trees of the form P_n-g,g , 2?≤?g?≤?n-3. For n≥ 5, we also supply the precise location of the characteristic set of the tree P_n-g,g , 2?≤?g?≤?n-3.     

Number of connected components of groups of real points of adjoint groups

We present a unified approach to compute the number of connected components in the group of real points of adjoint almost simple real algebraic groups.