Structure of free strong doppelsemigroups

We consider strong doppelsemigroups which are sets with two binary associative operations satisfying axioms of strong interassociativity. Commutative dimonoids in the sense of Loday are examples of strong doppelsemigroups and two strongly interassociative semigroups give rise to a strong doppelsemigroup. The main aim of this paper is to construct a free strong doppelsemigroup, a free n-dinilpotent strong doppelsemigroup, a free commutative strong doppelsemigroup and a free n-nilpotent strong doppelsemigroup. We also characterize the least n-dinilpotent congruence, the least commutative congruence, the least n-nilpotent congruence on a free strong doppelsemigroup and establish that the automorphism group of every constructed free algebra is isomorphic to the symmetric group.     

多元向量值测度

在本系列论中,研究了相应于多重线性映射的强测度论;引入基于该测度论的强多重线性积分系统;建立了基于弱测度论的弱积分理论,这些结果属于多元向量值测度论的范畴,其积分模型几乎包含了所有现今广泛应用的积分。     

Pointwise strong and very strong approximation of Fourier series

We present an estimation of the and H _u ^λφ f means as approximation versions of the Totik type generalization (see [6, 7]) of the result of G. H. Hardy, J. E. Littlewood, considered by N. L. Pachulia in [5]. Some results on the norm approximation will also be given.      

Strong chromatic index of unit distance graphs

The strong chromatic index of a graph , denoted by , is defined as the least number of colors in a coloring of edges of , such that each color class is an induced matching (or: if edges and have the same color, then both vertices of are not adjacent to any vertex of ). A graph is a unit distance graph in if vertices of can be uniquely identified with points in , so that is an edge of if and only if the Euclidean distance between the points identified with and is 1. We would like to find the largest possible value of , where is a unit distance graph (in and ) of maximum degree . We show that , where is a unit distance graph in of maximum degree . We also show that the maximum possible size of a strong clique in unit distance graph in is linear in and give a tighter result for unit distance graphs in the plane.     

Lower and upper orientable strong radius and strong diameter of complete k-partite graphs

For two vertices u and v in a strong digraph D, the strong distance sd(u,v) between u and v is the minimum size (the number of arcs) of a strong sub-digraph of D containing u and v. For a vertex v of D, the strong eccentricity se(v) is the strong distance between v and a vertex farthest from v. The strong radius srad(D) (resp. strong diameter sdiam(D)) is the minimum (resp. maximum) strong eccentricity among the vertices of D. The lower (resp. upper) orientable strong radius srad(G) (resp. SRAD(G)) of a graph G is the minimum (resp. maximum) strong radius over all strong orientations of G. The lower (resp. upper) orientable strong diameter sdiam(G) (resp. SDIAM(G)) of a graph G is the minimum (resp. maximum) strong diameter over all strong orientations of G. In this paper, we determine the lower orientable strong radius and diameter of complete k-partite graphs, and give the upper orientable strong diameter and the bounds on the upper orientable strong radius of complete k-partite graphs. We also find an error about the lower orientable strong diameter of complete bipartite graph K_m,n given in [Y.-L. Lai, F.-H. Chiang, C.-H. Lin, T.-C. Yu, Strong distance of complete bipartite graphs, The 19th Workshop on Combinatorial Mathematics and Computation Theory, 2002, pp. 12-16], and give a rigorous proof of a revised conclusion about sdiam(K_m,n).     

Strong Chromatic Index of Chordless Graphs

A strong edge coloring of a graph is an assignment of colors to the edges of the graph such that for every color, the set of edges that are given that color form an induced matching in the graph. The strong chromatic index of a graph G, denoted by , is the minimum number of colors needed in any strong edge coloring of G. A graph is said to be chordless if there is no cycle in the graph that has a chord. Faudree, Gyárfás, Schelp, and Tuza (The Strong Chromatic Index of Graphs, Ars Combin 29B (1990), 205–211) considered a particular subclass of chordless graphs, namely, the class of graphs in which all the cycle lengths are multiples of four, and asked whether the strong chromatic index of these graphs can be bounded by a linear function of the maximum degree. Chang and Narayanan (Strong Chromatic Index of 2‐degenerate Graphs, J Graph Theory, 73(2) (2013), 119–126) answered this question in the affirmative by proving that if G is a chordless graph with maximum degree Δ, then . We improve this result by showing that for every chordless graph G with maximum degree Δ, . This bound is tight up to an additive constant.     

Proximinal subspaces of finite codimension in direct sum spaces

We give a necessary and sufficient condition for proximinality of a closed subspace of finite codimension in c₀-direct sum of Banach spaces.     

Multiple nontrivial solutions for nonlinear eigenvalue problems

In this paper we study a nonlinear eigenvalue problem driven by the -Laplacian. Assuming for the right-hand side nonlinearity only unilateral and sign conditions near zero, we prove the existence of three nontrivial solutions, two of which have constant sign (one is strictly positive and the other is strictly negative), while the third one belongs to the order interval formed by the two opposite constant sign solutions. The approach relies on a combination of variational and minimization methods coupled with the construction of upper-lower solutions. The framework of the paper incorporates problems with concave-convex nonlinearities.

     

Polishness of the Wijsman topology revisited

Let be a completely metrizable space. Then the space of nonempty closed subsets of endowed with the Wijsman topology is -favorable in the strong Choquet game. As a consequence, a short proof of the Beer-Costantini Theorem on Polishness of the Wijsman topology is given.

     

Local Times of Markov Processes Approximated by a Generalized Iterated Brownian Motion

Csáki et al.⁽⁵⁾ have given strong approximations of continuous additive functional of Brownian motion. We establish here an extension of these results for a large class of Markov processes.     

Strong stability of Nash equilibria in load balancing games

We study strong stability of Nash equilibria in load balancing games of m(m 2)identical servers,in which every job chooses one of the m servers and each job wishes to minimize its cost,given by the workload of the server it chooses.A Nash equilibrium(NE)is a strategy profile that is resilient to unilateral deviations.Finding an NE in such a game is simple.However,an NE assignment is not stable against coordinated deviations of several jobs,while a strong Nash equilibrium(SNE)is.We study how well an NE approximates an SNE.Given any job assignment in a load balancing game,the improvement ratio(IR)of a deviation of a job is defined as the ratio between the pre-and post-deviation costs.An NE is said to be aρ-approximate SNE(ρ1)if there is no coalition of jobs such that each job of the coalition will have an IR more thanρfrom coordinated deviations of the coalition.While it is already known that NEs are the same as SNEs in the 2-server load balancing game,we prove that,in the m-server load balancing game for any given m 3,any NE is a(5/4)-approximate SNE,which together with the lower bound already established in the literature yields a tight approximation bound.This closes the final gap in the literature on the study of approximation of general NEs to SNEs in load balancing games.To establish our upper bound,we make a novel use of a graph-theoretic tool.     

强S—Lindelof空间

利用强半开集定义了强S-Lindelof可数性的概念,讨论了其基本性质．证明了强S-Lindelof性对强半闭子集是遗传的,具有强半同胚不变性等,并给出了强S-Lindelof空间的一些应用．     

Strong F-regularity in images of regular rings

We characterize strong F-regularity, a property associated with tight closure, in a large class of rings. A special case of our results is a workable criterion in complete intersection rings.

     

Regime-switching diffusion processes: strong solutions and strong Feller property

Abstract

We investigate the existence and uniqueness of strong solutions for state-dependent regime-switching diffusion processes in an infinite state space with singular coefficients. Non-explosion conditions are given by using the Zvonkin’s transformation. The strong Feller property is proved by further assuming that the diffusion in each fixed environment generates a strong Feller semigroup, and our results can also be applied to irregular or degenerate situations.     

Statistically D-bounded sequences in probabilistic normed spaces

In this study, the concept of a statistically D-bounded sequence in a probabilistic normed (PN) space endowed with the strong topology is introduced and its basic properties are investigated. It is shown that a strongly statistically convergent sequence and a strong statistically Cauchy sequence are statistically D-bounded under certain conditions. A sequence which goes far away from the limit point infinitely many times and presents random deviations in a PN space may be handled with the tools of strong statistical convergence and statistical D-boundedness.     

Duality results and inequalities with respect to Hardy spaces containing function sequences

With the help of two-parameter martingales and strong martingales Hardy spaces consisting of adapted function sequences are considered. The Hardy spaces generated by the square and by the conditional square functions and their dual spaces are investigated. An inequality due to Stein and Lepingle is extended to two parameters.This research was supported by the Hungarian Scientific Research Funds No. 2085 and No. 74189 as well as by DAAD, the lattest with a stay at the Ludwig-Maximilians-Universität in München.     

P-析取强P-反演半群

介绍了强P-反演半群的概念,刻划了P-析取强P-反演半群的某些特征.     

一类3-正则图的邻强边染色

对简单图G(V,E),f是从V(G)∪E(G)到{1,2,…,k}的映射,k是自然数,若f满足(1)uv,uw∈E(G),u≠w,f(uv)≠f(uw);(2)uv∈E(G),C(u)≠C(v).则称f是G的一个邻强边染色,最小的k称为邻强边色数,其中C(u)={f(uv)|uv∈E(G)}.给出了一类3-正则重圈图的邻强边色数.     

Sufficient conditions for a control to be a strong minimum

The control literature either presents sufficient conditions for global optimality (for example, the Hamilton-Jacobi-Bellman theorem) or, if concerned with local optimality, restricts attention to comparison controls which are local in theL -sense. In this paper, use is made of an exact expression for the change in cost due to a change in control, a natural extension of a result due to Weierstrass, to obtain sufficient conditions for a control to be a strong minimum (in the sense that comparison controls are merely required to be close in theL ₁-sense).     

Corner Markov processes

In this work, a corner Markov type of property is suggested as a multiparameter interpretation of the classical Markov property. The first result presents one-dimensional conditions on a random field { _z },z ₊ ² , which, together with a Cairoli-WalshF4-type of condition, are sufficient for this corner Markov property. In the second part of this work two approaches to relevant strong Markov properties are discussed.