Let G=Cpn be a finite cyclic p-group, and let Hol(G) denote its holomorph. In this work, we find characterize the regular subgroups of that mutually normalize each other in symmetric group Sym(G). We represent as vertices graph, connect pair them by an edge when they other. The approach to construct local normalizing graph relies on theory gamma functions, final result will contain all informat...

Hara [Ha3] and Smith [Sm2] independently proved that in a normal Q-Gorenstein ring of characteristic p ≫ 0, the test ideal coincides with the multiplier ideal associated to the trivial divisor. We extend this result for a pair (R,∆) of a normal ring R and an effective Q-Weil divisor ∆ on SpecR. As a corollary, we obtain the equivalence of strongly F-regular pairs and klt pairs.

Several stabilized finite element methods for the Stokes eigenvalue problem based on the lowest equal-order finite element pair are numerically investigated. They are penalty, regular, multiscale enrichment, and local Gauss integration method. Comparisons between them are carried out, which show that the local Gauss integration method has good stability, efficiency, and accuracy properties, and...

This paper is devoted on the one hand to the study of specific properties of an evolution variational inequality, holding in the Hilbert setting. We give on the other hand a general criterion for Lyapunov pairs of this dynamical system and some results on the asymptotic behaviour of the solution. Key-words: Differential inclusions Evolution variational inequalities Proximal normal cone Uniforml...

In pair programming, two software developers share a single computer monitor and keyboard. One of the developers, called the driver, controls the computer keyboard and mouse. The driver is responsible for entering software design, source code, and test cases. The second developer, called the navigator, examines the driver’s work, offering advice, suggesting corrections, and assisting with desig...

Two new fixed polarity linear Kronecker transforms executed over GF(3) are introduced in this article. Both transforms are based on recursive equations using Kronecker products what allows to obtain simple corresponding fast transforms and very regular butterfly diagrams. The computational costs to calculate the new pair of transforms and their experimental comparison with ternary Reed–Muller t...

A pseudo-Euclidean space, or Smarandache space is a pair (Rn, ω|− → O ). In this paper, considering the time scale concept on Smarandache space with ω|− → O (u) = 0 for ∀u ∈ E, i.e., the Euclidean space, we introduce the tangent vector and some properties according to directional derivative, the delta differentiable vector fields on regular curve parameterized by time scales and the Jacobian ma...

We analyze combinatorial optimization problems over a random pair of points (X ,Y) in R of equal cardinal. Typical examples include the matching of minimal length, the traveling salesperson tour constrained to alternate between points of each set, or the connected bipartite r-regular graph of minimal length. As the cardinal of the sets goes to infinity, we investigate the convergence of such bi...

Let C be a collection of n compact convex sets in the plane, such that the boundaries of any pair of sets in C intersect in at most s points, for some constant s. We show that the maximum number of regular vertices (intersection points of two boundaries that intersect twice) on the boundary of the union U of C is O(n), which improves earlier bounds due to Aronov et al. [4]. The bound is nearly ...