Rayleigh dissipation from the general recurrence of metrics in path spaces

Given a pair (metric g, symmetric 2-covariant tensor field H though as a Rayleigh dissipation) on a path space (manifold M, semispray S), the family of nonlinear connections N such that H equals the dynamical derivative of g with respect to (S,N) is determined by using the Obata tensors. In this way, we generalize the case of metric nonlinear connections as well as that of recurrent metrics. As applications, we treat firstly the case of Finslerian (α,β)-metrics finding all nonlinear connections for which the associated Finsler-Sasaki metric is exactly the dynamical derivative of the Riemannian-Sasaki metric. Secondly, we apply our results for the case of Beil metrics used in Relativity and field theories.     

Similarity in soft set theory

We introduce and study the concept of similarity between soft sets, which is an extension of the equality for soft set theory. We also introduce the concepts of conjunction parameter (α∧β) and disjunction parameter (α∨β) of ordered pair parameter 〈α,β〉 for soft set theory, and we investigate modified operations of soft set theory in terms of ordered parameters.     

Nonlinear dissipative wave equations with space-time dependent potential

We study the long time behavior of solutions for damped wave equations with absorption. These equations are generally accepted as models of wave propagation in heterogeneous media with space-time dependent friction a(t,x)u_t and nonlinear absorption |u|^p−1u (Ikawa (2000) [17]). We consider 1<p<(n+2)/(n−2) and separable a(t,x)=λ(x)η(t) with λ(x)∼(1+|x|)^−α and η(t)∼(1+t)^−β satisfying conditions (A1) or (A2) which are given. The main results are precise decay estimates for the energy, L² and L^p+1 norms of solutions. We also observe the following behavior: if α∈[0,1), β∈(−1,1) and 0<α+β<1, there are three different regions for the decay of solutions depending on p; if α∈(−∞,0) and β∈(−1,1), there are only two different regions for the decay of the solutions depending on p.     

More on “Connected (n, m)-graphs with minimum and maximum zeroth-order general Randi? index”

Let G be a graph and d(u) denote the degree of a vertex u in G. The zeroth-order general Randi? index ⁰R_α(G) of the graph G is defined as ∑_u∈V(G)d(u)^α, where the summation goes over all vertices of G and α is an arbitrary real number. In this paper we correct the proof of the main Theorem 3.5 of the paper by Hu et al. [Y. Hu, X. Li, Y. Shi, T. Xu, Connected (n,m)-graphs with minimum and maximum zeroth-order general Randi? index, Discrete Appl. Math. 155 (8) (2007) 1044-1054] and give a more general Theorem. We finally characterize ¹ for α<0 the connected G(n,m)-graphs with maximum value ⁰R_α(G(n,m)), where G(n,m) is a simple connected graph with n vertices and m edges.     

Comparison of two randomized policy M/G/1 queues with second optional service, server breakdown and startup

The problem addressed in this paper is to compare the minimum cost of the two randomized control policies in the M/G/1 queueing system with an unreliable server, a second optional service, and general startup times. All arrived customers demand the first required service, and only some of the arrived customers demand a second optional service. The server needs a startup time before providing the first required service until the system becomes empty. After all customers are served in the queue, the server immediately takes a vacation and the system operates the (T, p)-policy or (p, N)-policy. For those two policies, the expected cost functions are established to determine the joint optimal threshold values of (T, p) and (p, N), respectively. In addition, we obtain the explicit closed form of the joint optimal solutions for those two policies. Based on the minimal cost, we show that the optimal (p, N)-policy indeed outperforms the optimal (T, p)-policy. Numerical examples are also presented for illustrative purposes.     

On the α-invariants of cubic surfaces with Eckardt points

In this paper, we show that the αm,2-invariant (introduced by Tian (1991) [27] and (1997) [29]) of a smooth cubic surface with Eckardt points is strictly bigger than . This can be used to simplify Tian's original proof of the existence of Kähler-Einstein metrics on such manifolds. We also sketch the computations on cubic surfaces with one ordinary double points, and outline the analytic difficulties to prove the existence of orbifold Kähler-Einstein metrics.     

Workshop lecture on products of Fréchet spaces

The general question, “When is the product of Fréchet spaces Fréchet?” really depends on the questions of when a product of α₄ Fréchet spaces (also known as strongly Fréchet or countably bisequential spaces) is α₄, and when it is Fréchet. Two subclasses of the class of strongly Fréchet spaces shed much light on these questions. These are the class of α₃ Fréchet spaces and its subclass of ℵ₀-bisequential spaces. The latter is closed under countable products, the former not even under finite products. A number of fundamental results and open problems are recalled, some further highlighting the difference between being α₃ and Fréchet and being ℵ₀-bisequential.     

Riesz transforms and conjugacy for Laguerre function expansions of Hermite type

Riesz transforms and conjugate Poisson integrals for multi-dimensional Laguerre function expansions of Hermite type with index α are defined and investigated. It is proved that for any multi-index α=(α₁,…,αd) such that αi?−1/2, αi∉(−1/2,1/2), the appropriately defined Riesz transforms , j=1,2,…,d, are Calderón-Zygmund operators, hence their mapping properties follow from a general theory. Similar mapping results are obtained in one dimension, without excluding α∈(−1/2,1/2), by means of a local Calderón-Zygmund theory and weighted Hardy's inequalities. The conjugate Poisson integrals are shown to satisfy a system of Cauchy-Riemann type equations and to recover the Riesz-Laguerre transforms on the boundary. The two specific values of α, (−1/2,…,−1/2) and (1/2,…,1/2), are distinguished since then a connection with Riesz transforms for multi-dimensional Hermite function expansions is established.     

On operator valued sequences of multipliers and R-boundedness

In recent papers (cf. [J.L. Arregui, O. Blasco, (p,q)-Summing sequences, J. Math. Anal. Appl. 274 (2002) 812-827; J.L. Arregui, O. Blasco, (p,q)-Summing sequences of operators, Quaest. Math. 26 (2003) 441-452; S. Aywa, J.H. Fourie, On summing multipliers and applications, J. Math. Anal. Appl. 253 (2001) 166-186; J.H. Fourie, I. Röntgen, Banach space sequences and projective tensor products, J. Math. Anal. Appl. 277 (2) (2003) 629-644]) the concept of (p,q)-summing multiplier was considered in both general and special context. It has been shown that some geometric properties of Banach spaces and some classical theorems can be described using spaces of (p,q)-summing multipliers. The present paper is a continuation of this study, whereby multiplier spaces for some classical Banach spaces are considered. The scope of this research is also broadened, by studying other classes of summing multipliers. Let E(X) and F(Y) be two Banach spaces whose elements are sequences of vectors in X and Y, respectively, and which contain the spaces c₀₀(X) and c₀₀(Y) of all X-valued and Y-valued sequences which are eventually zero, respectively. Generally spoken, a sequence of bounded linear operators (un)⊂L(X,Y) is called a multiplier sequence from E(X) to F(Y) if the linear operator from c₀₀(X) into c₀₀(Y) which maps (xi)∈c₀₀(X) onto (unxn)∈c₀₀(Y) is bounded with respect to the norms on E(X) and F(Y), respectively. Several cases where E(X) and F(Y) are different (classical) spaces of sequences, including, for instance, the spaces Rad(X) of almost unconditionally summable sequences in X, are considered. Several examples, properties and relations among spaces of summing multipliers are discussed. Important concepts like R-bounded, semi-R-bounded and weak-R-bounded from recent papers are also considered in this context.     

The Independence Number for De Bruijn networks and Kautz networks

Let D be a directed graph; the (l,ω)-Independence Number of graph D, denoted by α_l,ω(D), is an important performance parameter for interconnection networks. De Bruijn networks and Kautz networks, denoted by B(d,n) and K(d,n) respectively, are versatile and efficient topological structures of interconnection networks. For l=1,2,…,n, this paper shows that α_l,d−1(B(d,n))=dⁿ,α_l,d−1(K(d,n))=α_l,d(K(d,n))=dⁿ+dⁿ⁻¹ if d≥3 and n≤d−2. In particular, the paper shows the exact value of the Independence Number for B(d,1) and B(d,2) for any d. For the generalized situation, the paper obtains a lower bound α_l,d−1(B(d,n))≥d² if n≥3 and d≥5.     

Absolutely convergent Fourier series and function classes

We study the smoothness property of a function f with absolutely convergent Fourier series, and give best possible sufficient conditions in terms of its Fourier coefficients to ensure that f belongs either to one of the Lipschitz classes Lip(α) and lip(α) for some 0<α?1, or to one of the Zygmund classes Λ_∗(1) and λ_∗(1). Our theorems generalize some of those by Boas [R.P. Boas Jr., Fourier series with positive coefficients, J. Math. Anal. Appl. 17 (1967) 463-483] and one by Németh [J. Németh, Fourier series with positive coefficients and generalized Lipschitz classes, Acta Sci. Math. (Szeged) 54 (1990) 291-304]. We also prove a localized version of a theorem by Paley [R.E.A.C. Paley, On Fourier series with positive coefficients, J. London Math. Soc. 7 (1932) 205-208] on the existence and continuity of the derivative of f.     

Absolutely convergent Fourier series and function classes. II

We study the smoothness property of a function f with absolutely convergent Fourier series, and give best possible sufficient conditions in terms of its Fourier coefficients to ensure that f belongs to one of the Zygmund classes Λ_∗(α) and λ_∗(α) for some 0<α?2. This paper is a natural supplement to our earlier one [F. Móricz, Absolutely convergent Fourier series and function classes, J. Math. Anal. Appl. 324 (2) (2006) 1168-1177] under the same title, and we keep its notations.     

Rough approximations of vague sets in fuzzy approximation space

The combination of the rough set theory, vague set theory and fuzzy set theory is a novel research direction in dealing with incomplete and imprecise information. This paper mainly concerns the problem of how to construct rough approximations of a vague set in fuzzy approximation space. Firstly, the β-operator and its complement operator are introduced, and some new properties are examined. Secondly, the approximation operators are constructed based on β-(complement) operator. Meantime, λ-lower (upper) approximation is firstly proposed, and then some properties of two types of approximation operators are studied. Afterwards, for two different kinds of approximation operators, we introduce two roughness measure methods of the same vague set and discuss a property. Finally, an example is given to illustrate how to calculate the rough approximations and roughness measure of a vague set using the β-(complement) product between two fuzzy matrixes. The results show that the proposed rough approximations and roughness measure of a vague set in fuzzy environment are reasonable.     

Growth conditions, compact perturbations and operator subdecomposability, with applications to generalized Cesàro operators

We adapt recent results of Albrecht and Ricker to obtain conditions under which growth constraints on the left resolvent of a Banach space operator are preserved under suitable perturbations. As an application, we establish Bishop's property (β) for certain generalized Cesàro operators on the classical Hardy spaces Hp, 1<p<∞. Our methods also apply to unilateral weighted shifts whose weight sequence converges sufficiently rapidly as well as to perturbations of restrictions of a class of generalized scalar operators.     

Linear-time certifying algorithms for near-graphical sequences

A sequence 〈d₁,d₂,…,d_n〉 of non-negative integers is graphical if it is the degree sequence of some graph, that is, there exists a graph G on n vertices whose ith vertex has degree d_i, for 1≤i≤n. The notion of a graphical sequence has a natural reformulation and generalization in terms of factors of complete graphs.If H=(V,E) is a graph and g and f are integer-valued functions on the vertex set V, then a (g,f)-factor of H is a subgraph G=(V,F) of H whose degree at each vertex v∈V lies in the interval [g(v),f(v)]. Thus, a (0,1)-factor is just a matching of H and a (1, 1)-factor is a perfect matching of H. If H is complete then a (g,f)-factor realizes a degree sequence that is consistent with the sequence of intervals 〈[g(v₁),f(v₁)],[g(v₂),f(v₂)],…,[g(v_n),f(v_n)]〉.Graphical sequences have been extensively studied and admit several elegant characterizations. We are interested in extending these characterizations to non-graphical sequences by introducing a natural measure of “near-graphical”. We do this in the context of minimally deficient (g,f)-factors of complete graphs. Our main result is a simple linear-time greedy algorithm for constructing minimally deficient (g,f)-factors in complete graphs that generalizes the method of Hakimi and Havel (for constructing (f,f)-factors in complete graphs, when possible). It has the added advantage of producing a certificate of minimum deficiency (through a generalization of the Erdös-Gallai characterization of (f,f)-factors in complete graphs) at no additional cost.     

Using Lagrangians of hypergraphs to find non-jumping numbers(II)

Let r?2 be an integer. A real number α∈[0,1) is a jump for r if for any ε>0 and any integer m?r, any r-uniform graph with n>n₀(ε,m) vertices and density at least α+ε contains a subgraph with m vertices and density at least α+c, where c=c(α)>0 does not depend on ε and m. A result of Erd?s, Stone and Simonovits implies that every α∈[0,1) is a jump for r=2. Erd?s asked whether the same is true for r?3. Frankl and Rödl gave a negative answer by showing an infinite sequence of non-jumping numbers for every r?3. However, there are a lot of unknowns on determining whether or not a number is a jump for r?3. In this paper, we find two infinite sequences of non-jumping numbers for r=4, and extend one of the results to every r?4. Our approach is still based on the approach developed by Frankl and Rödl.     

Perturbation theory for convolution semigroups

We deal with convolution semigroups (not necessarily symmetric) in Lp(RN) and provide a general perturbation theory of their generators by indefinite singular potentials. Such semigroups arise in the theory of Lévy processes and cover many examples such as Gaussian semigroups, α-stable semigroups, relativistic Schrödinger semigroups, etc. We give new generation theorems and Feynman-Kac formulas. In particular, by using weak compactness methods in L¹, we enlarge the extended Kato class potentials used in the theory of Markov processes. In L² setting, Dirichlet form-perturbation theory is finely related to L¹-theory and the extended Kato class measures is also enlarged. Finally, various perturbation problems for subordinate semigroups are considered.     

Generalization of matching extensions in graphs (III)

Proposing them as a general framework, Liu and Yu (2001) [6] introduced (n,k,d)-graphs to unify the concepts of deficiency of matchings, n-factor-criticality and k-extendability. Let G be a graph and let n,k and d be non-negative integers such that n+2k+d+2?|V(G)| and |V(G)|−n−d is even. If on deleting any n vertices from G the remaining subgraph H of G contains a k-matching and each k-matching can be extended to a defect-d matching in H, then G is called an (n,k,d)-graph. In this paper, we obtain more properties of (n,k,d)-graphs, in particular the recursive relations of (n,k,d)-graphs for distinct parameters n,k and d. Moreover, we provide a characterization for maximal non-(n,k,d)-graphs.     

Solutions of non-periodic super-quadratic Dirac equations

This paper is concerned with solutions to the Dirac equation: −i∑αkk_∂u+aβu+M(x)u=Ru(x,u). Here M(x) is a general potential and R(x,u) is a self-coupling which is super-quadratic in u at infinity. We use variational methods to study this problem. By virtue of some auxiliary system related to the “limit equation” of the Dirac equation, we construct linking levels of the variational functional ΦM such that the minimax value cM based on the linking structure of ΦM satisfies , where is the least energy of the “limit equation”. Thus we can show the c(C)-condition holds true for all and consequently obtain one least energy solution to the Dirac equation.     

Identifying codes and locating-dominating sets on paths and cycles

Let G=(V,E) be a graph and let r≥1 be an integer. For a set D⊆V, define N_r[x]={y∈V:d(x,y)≤r} and D_r(x)=N_r[x]∩D, where d(x,y) denotes the number of edges in any shortest path between x and y. D is known as an r-identifying code (r-locating-dominating set, respectively), if for all vertices x∈V (x∈V?D, respectively), D_r(x) are all nonempty and different. Roberts and Roberts [D.L. Roberts, F.S. Roberts, Locating sensors in paths and cycles: the case of 2-identifying codes, European Journal of Combinatorics 29 (2008) 72-82] provided complete results for the paths and cycles when r=2. In this paper, we provide results for a remaining open case in cycles and complete results in paths for r-identifying codes; we also give complete results for 2-locating-dominating sets in cycles, which completes the results of Bertrand et al. [N. Bertrand, I. Charon, O. Hudry, A. Lobstein, Identifying and locating-dominating codes on chains and cycles, European Journal of Combinatorics 25 (2004) 969-987].