On a functional equation related to derivations in prime rings

In this paper we prove the following result. Let m ≥ 1, n ≥ 1 be fixed integers and let R be a prime ring with m + n + 1 ≤ char(R) or char(R) = 0. Suppose there exists an additive nonzero mapping D : R → R satisfying the relation 2D(x ^n+m+1) = (m + n + 1)(x ^m D(x)x ⁿ + x ⁿ D(x)x ^m ) for all \({x\in R}\). In this case R is commutative and D is a derivation.     

The Paranormality of Products and Their Subsets

A topological space is called paranormal if any countable discrete system of closed sets {D_n:n = 1, 2, 3,...} can be expanded to a locally finite system of open sets {U_n:n = 1, 2, 3,...}, i.e., D_n is contained in U_n for all n, and D_m ∩ U_n≠ Ø if and only if D_m = D_n. It is proved that if X is a countably compact space whose cube is hereditarily paranormal, then X is metrizable.     

The weak form of normality

A topological space is said to be paranormal if every countable discrete collection of closed sets {D _n : n < ω} can be expanded to a locally finite collection of open sets {U _n : n < ω}, i.e., D _n ? U _n and D _m ∩ U _n ≠ 0 if and only if D _m = D _n . It is proved that if F: Comp → Comp is a normal functor of degree ≥ 3 and the compact space F(X) is hereditarily paranormal, then the compact space X is metrizable.     

Optimal Control of an <Emphasis Type="Italic">M/E</Emphasis><Subscript><Emphasis Type="Italic">k</Emphasis></Subscript>/1 Queueing System with a Removable Service Station

This paper studies the optimal operation of an M/E _k /1 queueing system with a removable service station under steady-state conditions. Analytic closed-form solutions of the controllable M/E _k /1 queueing system are derived. This is a generalization of the controllable M/M/1, the ordinary M/E _k /1, and the ordinary M/M/1 queueing systems in the literature. We prove that the probability that the service station is busy in the steady-state is equal to the traffic intensity. Following the construction of the expected cost function per unit time, we determine the optimal operating policy at minimum cost.     

Asymptotically optimal approach to the approximate solution of several problems of covering a graph by nonadjacent cycles

We consider the m-Cycle Cover Problem of covering a complete undirected graph by m vertex-nonadjacent cycles of extremal total edge weight. The so-called TSP approach to the construction of an approximation algorithm for this problem with the use of a solution of the traveling salesman problem (TSP) is presented. Modifications of the algorithm for the Euclidean Max m-Cycle Cover Problem with deterministic instances (edge weights) in a multidimensional Euclidean space and the Random Min m-Cycle Cover Problem with random instances UNI(0,1) are analyzed. It is shown that both algorithms have time complexity O(n ³) and are asymptotically optimal for the number of covering cycles m = o(n) and \(m \leqslant \frac{{n^{1/3} }}{{\ln n}}\), respectively.     

Contribution to the General Linear Conjugation Problem for A Piecewise Analytic Vector

Establishing an analogy between the theories of Riemann–Hilbert vector problem and linear ODEs, for the n-dimensional homogeneous linear conjugation problem on a simple smooth closed contour Γ partitioning the complex plane into two domains D⁺ and D^? we show that if we know n?1 particular solutions such that the determinant of the size n?1 matrix of their components omitting those with index k is nonvanishing on D⁺ ∪ Γ and the determinant of the matrix of their components omitting those with index j is nonvanishing on Γ ∪ D^? {∞}, where \(k,j = \overline {1,n} \), then the canonical system of solutions to the linear conjugation problem can be constructed in closed form.     

Balanced metrics on Hartogs domains

An n-dimensional strictly pseudoconvex Hartogs domain D _F can be equipped with a natural Kähler metric g _F . In this paper we prove that if m ₀ g _F is balanced for a given positive integer m ₀ then m ₀>n and (D _F ,g _F ) is holomorphically isometric to an open subset of the n-dimensional complex hyperbolic space.     

New Applications of the <Emphasis Type="Italic">p</Emphasis>-Adic Nevanlinna Theory

Let IK be an algebraically closed field of characteristic 0 complete for an ultrametric absolute value. Following results obtained in complex analysis, here we examine problems of uniqueness for meromorphic functions having finitely many poles, sharing points or a pair of sets (C.M. or I.M.) defined either in the whole field IK or in an open disk, or in the complement of an open disk. Following previous works in C, we consider functions fⁿ(x)f^m(ax + b), gⁿ(x)g^m(ax + b) with |a| = 1 and n ≠ m, sharing a rational function and we show that f/g is a n + m-th root of 1 whenever n + m ≥ 5. Next, given a small function w, if n, m ∈ IN are such that |n ? m|_∞ ≥ 5, then fⁿ(x)f^m(ax + b) ? w has infinitely many zeros. Finally, we examine branched values for meromorphic functions fⁿ(x)f^m(ax + b).     

Kolmogorov type inequalities for norms of Riesz derivatives of multivariate functions and some applications

Let L _∞,s ¹ (? ^m ) be the space of functions f ∈ L _∞(? ^m ) such that ?f/?x _i ∈ L _s (? ^{m) for each i = 1, ...,m} . New sharp Kolmogorov type inequalities are obtained for the norms of the Riesz derivatives ∥D ^α f∥_∞ of functions f ∈ L _∞,s ¹ (? ^m ). Stechkin’s problem on approximation of unbounded operators D ^α by bounded operators on the class of functions f ∈ L _∞,s ¹ (? ^m ) such that ∥?f∥ _s ≤ 1 and the problem of optimal recovery of the operator D ^α on elements from this class given with error δ are solved.     

A boundary Schwarz lemma on the classical domain of type <Emphasis Type="Italic">I</Emphasis>

Let R _I (m, n) be the classical domain of type I in ? ^m×n with 1 ≤ m ≤ n. We obtain the optimal estimates of the eigenvalues of the Fréchet derivative Df(\(\mathop Z\limits^ \circ \)) at a smooth boundary fixed point \(\mathop Z\limits^ \circ \)of R _I (m, n) for a holomorphic self-mapping f of R _I (m, n). We provide a necessary and sufficient condition such that the boundary points of R _I (m, n) are smooth, and give some properties of the smooth boundary points of R _I (m, n). Our results extend the classical Schwarz lemma at the boundary of the unit disk Δ to R _I (m, n), which may be applied to get some optimal estimates in several complex variables.     

On the Completeness of Products of Harmonic Functions and the Uniqueness of the Solution of the Inverse Acoustic Sounding Problem

It is proved that the family of all pairwise products of regular harmonic functions on D and of the Newtonian potentials of points on the line L ? Rⁿ is complete in L₂(D), where D is a bounded domain in Rⁿ, n ≥ 3, such that \(\bar D\) ∩ L = ?. This result is used in the proof of uniqueness theorems for the inverse acoustic sounding problem in R³.     

Augmentation quotients for burnside rings of generalized dihedral groups

Let H be a finite abelian group of odd order, D be its generalized dihedral group, i.e., the semidirect product of C₂ acting on H by inverting elements, where C₂ is the cyclic group of order two. Let Ω (D) be the Burnside ring of D, Δ(D) be the augmentation ideal of Ω (D). Denote by Δⁿ(D) and Q_n(D) the nth power of Δ(D) and the nth consecutive quotient group Δⁿ(D)/Δⁿ⁺¹(D), respectively. This paper provides an explicit Z-basis for Δⁿ(D) and determines the isomorphism class of Q_n(D) for each positive integer n.     

On Lebesgue Measure of Integral Self-Affine Sets

Let A be an expanding integer n×n matrix and D be a finite subset of ? ⁿ . The self-affine set T=T(A,D) is the unique compact set satisfying the equality \(A(T)=\bigcup_{d\in D}(T+d)\). We present an effective algorithm to compute the Lebesgue measure of the self-affine set T, the measure of the intersection T∩(T+u) for u∈? ⁿ , and the measure of the intersection of self-affine sets T(A,D ₁)∩T(A,D ₂) for different sets D ₁, D ₂?? ⁿ .     

Two-stage flexible flow shop scheduling subject to fixed job sequences

This paper investigates the scheduling problem in a two-stage flexible flow shop, which consists of m stage-1 parallel dedicated machines and a stage-2 bottleneck machine, subject to the condition that n _l jobs per type l∈{1, …, m} are processed in a fixed sequence. Four regular performance metrics, including the total completion time, the maximum lateness, the total tardiness, and the number of tardy jobs, are considered. For each considered objective function, we aim to determine an optimal interleaving processing sequence of all jobs coupled with their starting times on the stage-2 bottleneck machine. The problem under study is proved to be strongly NP-hard. An O(m²Π_l=1 ^m n _l ²) dynamic programming algorithm coupled with numerical experiments is presented.     

An Optimal Heuristic For Coordinated Multi-Item Inventory Replenishments

The inventory control problem can be vastly simplified if the replenishments of inventory items are coordinated with one another. That is, whenever an item is replenished, n other items, where n is a decision variable, are also replenished. One way to ensure this would be to classify the inventory items into several groups with a common order interval for each group. In this paper we establish that the optimal groups will be consecutive by hD/A, where h, D and A are the holding cost, demand rate and set-up cost of an item respectively. Using this property of consecutiveness, we develop a fast converging heuristic to create m groups optimally, m = 2, 3,..., M. The heuristic is a substitute for the dynamic programme which would otherwise be necessary and it has the potential for nomographic applications.     

Normal families of meromorphic functions and shared functions

The paper is devoted to the normal families of meromorphic functions and shared functions. Generalizing a result of Chang (2013), we prove the following theorem. Let h (≠≡ 0,∞) be a meromorphic function on a domain D and let k be a positive integer. Let F be a family of meromorphic functions on D, all of whose zeros have multiplicity at least k + 2, such that for each pair of functions f and g from F, f and g share the value 0, and f^(k) and g^(k) share the function h. If for every f ∈ F, at each common zero of f and h the multiplicities m_f for f and m_h for h satisfy m_f ≥ m_h + k + 1 for k > 1 and m_f ≥ 2m_h + 3 for k = 1, and at each common pole of f and h, the multiplicities nf for f and nh for h satisfy n_f ≥ n_h + 1, then the family F is normal on D.     

On the Strong <Emphasis Type="Italic">n</Emphasis>-partite Tournaments with Exactly Two Cycles of Length <Emphasis Type="Italic">n</Emphasis> − 1

Gutin and Rafiey (Australas J. Combin. 34 (2006), 17-21) provided an example of an n-partite tournament with exactly n ? m + 1 cycles of length of m for any given m with 4 ≤ m ≤ n, and posed the following question. Let 3 ≤ m ≤ n and n ≥ 4. Are there strong n-partite tournaments, which are not themselves tournaments, with exactly n ? m + 1 cycles of length m for two values of m? In the same paper, they showed that this question has a negative answer for two values n ? 1 and n. In this paper, we prove that a strong n-partite tournament with exactly two cycles of length n ? 1 must contain some given multipartite tournament as subdigraph. As a corollary, we also show that the above question has a negative answer for two values n ? 1 and any l with 3 ≤ l ≤ n and l ≠ n ? 1.     

On the k-polygonal numbers and the mean value of Dedekind sums

For any positive integer k ≥ 3, it is easy to prove that the k-polygonal numbers are a_n(k) = (2n+n(n?1)(k?2))/2. The main purpose of this paper is, using the properties of Gauss sums and Dedekind sums, the mean square value theorem of Dirichlet L-functions and the analytic methods, to study the computational problem of one kind mean value of Dedekind sums S(a_n(k)ā_m(k), p) for k-polygonal numbers with 1 ≤ m, n ≤ p ? 1, and give an interesting computational formula for it.     

The Center of <Emphasis Type="Italic">Dist</Emphasis> (<Emphasis Type="Italic">GL</Emphasis>(<Emphasis Type="Italic">m</Emphasis>|<Emphasis Type="Italic">n</Emphasis>)) in Positive Characteristic

The purpose of this paper is to investigate central elements in distribution algebras D i s t(G) of general linear supergroups G = G L(m|n). As an application, we compute explicitly the center of D i s t(G L(1|1)) and its image under Harish-Chandra homomorphism.