Angle orders,regular n-gon orders and the crossing number

A finite poset P(X,<) on a set X={ x ₁,...,x _m} is an angle order (regular n-gon order) if the elements of P(X,<) can be mapped into a family of angular regions on the plane (a family of regular polygons with n sides and having parallel sides) such that x _ij if and only if the angular region (regular n-gon) for x _i is contained in the region (regular n-gon) for x _j. In this paper we prove that there are partial orders of dimension 6 with 64 elements which are not angle orders. The smallest partial order previously known not to be an angle order has 198 elements and has dimension 7. We also prove that partial orders of dimension 3 are representable using equilateral triangles with the same orientation. This results does not generalizes to higher dimensions. We will prove that there is a partial order of dimension 4 with 14 elements which is not a regular n-gon order regardless of the value of n. Finally, we prove that partial orders of dimension 3 are regular n-gon orders for n3.This research was supported by the Natural Sciences and Engineering Research Council of Canada, grant numbers A0977 and A2415.     

A stochastic algorithm using one sample point per iteration and diminishing stepsizes

A stochastic algorithm for finding stationary points of real-valued functions defined on a Euclidean space is analyzed. It is based on the Robbins-Monro stochastic approximation procedure. Gradient evaluations are done by means of Monte Carlo simulations. At each iteratex _i , one sample point is drawn from an underlying probability space, based on which the gradient is approximated. The descent direction is against the approximation of the gradient, and the stepsize is 1/i. It is shown that, under broad conditions, w.p.1 if the sequence of iteratesx ₁,x ₂,...generated by the algorithm is bounded, then all of its accumulation points are stationary.     

Magneto-optical Kerr effect in CoxAg1-x nanostructured granular films

A series of Co_xAg_{1 - x} nanostructured granular films have been prepared by ion beam sputtering and annealed at 100, 250, 400, 500°C. The optical constants, the complex dielectric function and magneto-optical Kerr parameters were measured at room temperature. For the samples having low Co compositions, the strong Kerr effect enhancement is observed around the Ag plasma edge. With an increase in annealing temperature, the resonance-like peaks appear in the Kerr rotation, and the peak positions are shifted toward the low photon energy region. From the analysis of the numerical calculations, it is concluded that the magneto-optical Kerr effect enhancement (MOKE) is due to the presence of the steep plasma edge.     

Characterizations on Heavy—tailed Distributions by Means of Hazard Rate

Let F(x) be a distribution function supp0orted on[0,∞),with an equilibrium distribution function Fe(x).In this paper we shall study the function re(x)=(-in -↑Fe(x))′=-↑Fe(x)/∫x^∞-↑Fe(u)du,which is called the equilibrium hazard rate of F.By the limiting behavior of re(x) we give a criterion to identify F to be heavy-tailed or light-tailed.Two broad classes of heavy-tailed distributions are also introduced and strdied.↑     

Singular control problems in bounded intervals

We consider optimal control problems for one-dimensional diffusion processes y _x (t) = y ^v _x (t), solutions dy _x (t) = g(y _x (t) dt + σ(y _x (t)(dw) + dv _t with y _x(0) = x& isinv;[a,b], the control processes v _t are increasing, positive, and adapted. Several types of expected cost structures associated with each policy v(.) are adopted, e.g. discounted cost, long term average cost and time average cost. Our work is related to [2,6,12,14,16 and 21], where diffusions are allowed to evolve in the whole space, and to [13] and [20], where diffusions evolve only in bounded regions. We shall present some analytic results about value functions, mainly their characterizations, by simple dynamic programming arguments. Several simple examples are explicitly solved to illustrate the singular behaviour of our problems     

On the solvability problem for equations with a single coefficient

It is proved that the general solvability problem for equations in a free group is polynomially reducible to the solvability problem for equations of the formw(x ₁, ...,x _n)=g, whereg is a coefficient, i.e., an element of the group, andw(x ₁, ...,x _n) is a group word in the alphabet of unknowns. We prove the NP-completeness of the solvability problem in a free semigroup for equations of the formw(x ₁,...,x _n)=g, wherew(x ₁,...,x _n) is a semigroup word in the alphabet of unknowns andg is an element of a free semigroup. Translated fromMatematicheskie Zametki, Vol. 59, No. 6, pp. 832–845, June, 1996. I wish to express my deep gratitude to S. I. Adyan and A. A. Razborov for the discussion of the present paper and for valuable remarks concerning the exposition. This research was partially supported by the International Science Foundation under grant MUV000.     

3-Rewritable Nilpotent 2-Groups of Class 2#

ABSTRACT

Let n be an integer greater than 1. A group G is said to be n-rewritable (or a Q_n-group) if for every n elements x₁, x₂,…,x_n in G there exist distinct permutations σ and τ in S_n such that x_σ(1)x_{σ (2)} ??? x_σ(n) = x_τ(1)x_τ(2) ??? x_τ(n). In this paper, we characterize all 3-rewritable nilpotent 2-groups of class 2. Also we have found a bound for the nilpotency class of certain nilpotent 3-rewritable groups, and have shown that 3-rewritable groups satisfy a certain law.     

ON THE GROENEWALD-HEYMAN STRONGLY PRIME RADICAL

Strongly prime rings were introduced by Handelman and Lawrence [6], and in a recent paper [5] Groenewald and Heyman investigated the upper radical determined by the class of all strongly prime rings. In this paper we continue this investigation. Section 1 provides some alternative characterizations of the radical and in section 2 we discuss general properties of the radical and compare it with other well-known radicals. Finally, combinatorial results on polynomial identities are presented which, combined with our results in section 2. yield some new comnutativity theorems.

All rings considered are associative, but do not necessarily have an identity. As usual, I Δ A means that I is an ideal of the ring A. The notation <x₁,x₂,…> and (x_l,x₂,…) will stand for the subring and ideal, respectively, generated by the elements x₁,x₂,…. The rignt annihirator of a subset S of a ring A will be denoted by ann_A(S).

This work was supported in part by NSERC grants A-8775 and A-8789. and was completed while the first and third authors were visiting Dalhousie University. These authors would like to thank the Department of Mathematics, Statistics and Computing Science at Oalhousie University for its generous hospitality.     

Greedy posets for the bump-minimizing problem

A bump (x _i,x _i+1) occurs in a linear extension L={x ₁<...n} of a poset P, if x _ii+1 in P. L. is greedy if x _ij for every j>i, whenever (x _i x _i+1) in a bump in L. The purpose of this paper is to give a characterization of all greedy posets. These are the posets for which every greedy linear extension has a minimum number of bumps.This research (Math/1406/31) was supported by the Research Center, College of Science, King Saud University, Riyadh, Saudi Arabia.     

The Projected Power Method: An Efficient Algorithm for Joint Alignment from Pairwise Differences

Various applications involve assigning discrete label values to a collection of objects based on some pairwise noisy data. Due to the discrete—and hence nonconvex—structure of the problem, computing the optimal assignment (e.g., maximum‐likelihood assignment) becomes intractable at first sight. This paper makes progress towards efficient computation by focusing on a concrete joint alignment problem; that is, the problem of recovering n discrete variables x_i ∊ {1, …, m}, 1 ≤ i ≤ n, given noisy observations of their modulo differences {x_i — x_j mod m}. We propose a low‐complexity and model‐free nonconvex procedure, which operates in a lifted space by representing distinct label values in orthogonal directions and attempts to optimize quadratic functions over hypercubes. Starting with a first guess computed via a spectral method, the algorithm successively refines the iterates via projected power iterations. We prove that for a broad class of statistical models, the proposed projected power method makes no error—and hence converges to the maximum‐likelihood estimate—in a suitable regime. Numerical experiments have been carried out on both synthetic and real data to demonstrate the practicality of our algorithm. We expect this algorithmic framework to be effective for a broad range of discrete assignment problems.© 2018 Wiley Periodicals, Inc.     

Magneto-optical Kerr effect in Co x Ag1-x nanostructured granular films

A series of Co_xAg_{1 - x} nanostructured granular films have been prepared by ion beam sputtering and annealed at 100, 250, 400, 500°C. The optical constants, the complex dielectric function and magneto-optical Kerr parameters were measured at room temperature. For the samples having low Co compositions, the strong Kerr effect enhancement is observed around the Ag plasma edge. With an increase in annealing temperature, the resonance-like peaks appear in the Kerr rotation, and the peak positions are shifted toward the low photon energy region. From the analysis of the numerical calculations, it is concluded that the magneto-optical Kerr effect enhancement (MOKE) is due to the presence of the steep plasma edge.     

Power Residue Symbols and the Central Sections of SL(2, A)

In TheE(2,A) sections of SL(2,A) (Ann. of Math. 134 (1991), 159–188), we locate the E(A) normalized subgroups of SL(2,A) in central sections of SL(2,A) for all subrings of Q and all commutative rings satisfying SR ₂ In solving this problem we introduced the notion of radix (see (1.1)) and the group C(P_x) = [E(2,A),E(2,A;P_x)] = [SL(2,A), SL(2,A;P_x)] for the rings considered here.The purpose of this paper is to determine SL(2,A;P_xC(P_x) for SR ₂ rings and number rings with infinitely many units.In Section 2, Mennicke symbols for Jordan ideals are defined. They are determined for number rings and shown to be connected to power residue symbols in a delicate way. This extends the work of Bass, Milnor and Serre.In Section 3, an explicit homomorphism from E(2,Al;P_x) into an additive section of A is given for all commutative rings A. If A satisfiesSR ₂ the kernel of this map is C(P_x.The main problem for number rings is solved by giving an explicit homomorphism on SL(2,A;P_x) whose kernel is C(P_x).     

M?ssbauer study on Sn-doped (Lal1-x,Srx)2Cu1-x,Snx,O4 superconductors under a new concept

¹¹⁹Sn M?ssbauer research is carried out on (La_1-xSr_x),Cu_1-xSn_xO₄(x = 0.075 and 0.110) superconductors which are designed under a new concept. The M?ssbauer spectra results show that Sn occupies Cu position in Sn⁴⁺ state, and there is no Sn²⁺ ion occupying La position. The local lattice deformation near Sn⁴⁺ site is small, but displays an increasing tendency with Sn doping. For La₂CuO₄ matrix, the simultaneous dopings of Sr/Sn induce holes and electrons on CuO₂ layer in a new mechanism which influences superconductivity. Under a new mechanism of extra oxygen, the extra oxygen effect of Sn-doping on superconductivity is discussed     

A taxonomy for decision models

Decision models can be classified according to the number of decision makers (x ₁), of decision criteria (x ₂), and of decisions called for (x ₃). If we allow eachx _j to take one of the values 1 or m (many), we have 8 possible triples (x ₁,x ₂,x ₃) each of which defines or describes a class of decision models. The simplest and by far the most prevalent in textbooks and journals are the two (1, 1,m) and (1, 1, 1). The two classes (m, 1,x ₃) include most of game theory and models for fair allocation; the importance of these classes is widely comprehended. The classes (1,m,x ₃) are somewhat less well understood although increasingly recognized in the literature of decision models. The class (m, m, 1) has not achieved broad attention even though it relates to highly important national and worldwide problems. Finally, despite its potential importance, the class (m, m, m) has received almost no attention from modelers.     

Mössbauer study on Sn-doped (Lal1-x,Srx)2Cu1-x,Snx,O4 superconductors under a new concept

¹¹⁹Sn Mössbauer research is carried out on (La_1-xSr_x),Cu_1-xSn_xO₄(x = 0.075 and 0.110) superconductors which are designed under a new concept. The Mössbauer spectra results show that Sn occupies Cu position in Sn⁴⁺ state, and there is no Sn²⁺ ion occupying La position. The local lattice deformation near Sn⁴⁺ site is small, but displays an increasing tendency with Sn doping. For La₂CuO₄ matrix, the simultaneous dopings of Sr/Sn induce holes and electrons on CuO₂ layer in a new mechanism which influences superconductivity. Under a new mechanism of extra oxygen, the extra oxygen effect of Sn-doping on superconductivity is discussed     

Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images

In successive deletion stages of parallel thinning algorithms for binary digital images, one usually checks the preservation of connectivity by verifying that: (a) every removed pixel is individually deletable without modifying connectivity (well-known criteria, such as those of Rosenfeld and Yokoi, exist for that purpose); (b) every pair of 8-adjacent removed pixels is deletable without connectivity modification. In the case of the 8-connectivity for the figure (and the 4-connectivity for the background), two more patterns must be tested for connectivity preservation: an isolated triple or quadruple of mutually 8-adjacent pixels.In this paper we give a formal characterization of these patterns for testing connectivity preservation by what we call minimal non-x-deletable sets (x-MND sets), where x=4, 8 or {4,8} (the type of connectivity considered for the figure). A parallel thinning algorithm whose deletion stage cannot remove an x-MND set is guaranteed to preserve the connectivity properties of any figure. We show that an x-MND set consists in either (1) a single pixel; or (2) a pair of 8-adjacent pixels; or (3) an isolated triple or quadruple of mutually 8-adjacent pixels (for x=8 only).     

Modules Satisfying the S-Noetherian Property and S-ACCR

Let A = k[x₁,..., x_n] be a standard graded k-algebra over an infinite field k. We assume A is Cohen-Macaulay and has Krull dimension one. Let e denote the multiplicity of A and r - 1 the postulation number of A. Let I be a homogeneous ideal in A of grade one. Let j(I) denote the smallest degree of a regular form in I. Let l (I) denote the smallest power of (x₁,... , x_n) contained in I. If μ(I) denotes the minimum number of generators of I, then we show μ(I) ≤ e + j(I) - max{r,l(I)}, We then show how Dubreil's Second Theorem follows easily from this inequality     

Über Folgen,die BezÜglich Eines Mittels Rekurrent Sind

Let X be a convex subset of a finite-dimensional real vector space. A function M: X ^k → X is called a strict mean value, if M(x₁,…, x_k) lies in the convex hull of x₁,…, x_k), but does not coincide with one of its vertices. A sequence (x_n)_{n∈ ?} in X is called M-recursive if x_n+k = M(x_n, x_n+1,…, x_n+k?1) for all n. We prove that for a continuous strict mean value M every M-recursive sequence is convergent. We give a necessary and sufficient condition for a convergent sequence in X to be M-recursive for some continuous strict mean value M, and we characterize its limit by a functional equation. 39 B 72, 39 B 52, 40 A 05.     

Boundary value problem for the KDV equation on a half-line

The L-A pair corresponding to the boundary value problem with the conditionu| _x=0=a for the KdV equation is presented. A broad class of exact solutions to this equation is constructed and the conservation laws are discussed. Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 110, No. 1, pp. 98–113, January, 1997.     

Generalized cartan type k lie algebras in characteristic 0

The Lie algebra of Cartan type K which occurs as a subalgebra of the Lie algebra of derivations of the polynomial algebra F[x₀, x₁,…, x_n,x_n?1,…,x_?n], where F is a field of characteristic 0, was generalized by the first author to a class which included a subalgebra of the derivations of the Laurent polynomials F[x₀,x₁,…, x_n,x_?1,…,x_?n,X₀ ^?1x₁ ^-1,…,x_n ^?1,…,x_?1 ^?1…,x_?n ^?1]A further generalization of these algebras is the main topic of this paper. We show when these algebras are simple, determine all possible