The Fixed Points of Contractions of <Emphasis Type="Italic">f</Emphasis>-Quasimetric Spaces

The recent articles of Arutyunov and Greshnov extend the Banach and Hadler Fixed-Point Theorems and the Arutyunov Coincidence-Point Theorem to the mappings of (q₁, q₂)-quasimetric spaces. This article addresses similar questions for f-quasimetric spaces.Given a function f: R ₊² → R₊ with f(r₁, r₂) → 0 as (r₁, r₂) → (0, 0), an f-quasimetric space is a nonempty set X with a possibly asymmetric distance function ρ: X² → R+ satisfying the f-triangle inequality: ρ(x, z) ≤ f(ρ(x, y), ρ(y, z)) for x, y, z ∈ X. We extend the Banach Contraction Mapping Principle, as well as Krasnoselskii’s and Browder’s Theorems on generalized contractions, to mappings of f-quasimetric spaces.     

On <Emphasis Type="Italic">g</Emphasis><Subscript><Emphasis Type="Italic">c</Emphasis></Subscript>-colorings of nearly bipartite graphs

Let G be a simple graph, let d(v) denote the degree of a vertex v and let g be a nonnegative integer function on V (G) with 0 ≤ g(v) ≤ d(v) for each vertex v ∈ V (G). A g _c -coloring of G is an edge coloring such that for each vertex v ∈ V (G) and each color c, there are at least g(v) edges colored c incident with v. The g _c -chromatic index of G, denoted by χ′g _c (G), is the maximum number of colors such that a gc-coloring of G exists. Any simple graph G has the g _c -chromatic index equal to δ _g (G) or δ _g (G) ? 1, where \({\delta _g}\left( G \right) = \mathop {\min }\limits_{v \in V\left( G \right)} \left\lfloor {d\left( v \right)/g\left( v \right)} \right\rfloor \). A graph G is nearly bipartite, if G is not bipartite, but there is a vertex u ∈ V (G) such that G ? u is a bipartite graph. We give some new sufficient conditions for a nearly bipartite graph G to have χ′g _c (G) = δ _g (G). Our results generalize some previous results due to Wang et al. in 2006 and Li and Liu in 2011.     

Super (<Emphasis Type="Italic">a</Emphasis>, <Emphasis Type="Italic">d</Emphasis>)-edge-antimagic total labelings of complete bipartite graphs

An (a, d)-edge-antimagic total labeling of a graph G is a bijection f from V(G) ∪ E(G) onto {1, 2,…,|V(G)| + |E(G)|} with the property that the edge-weight set {f(x) + f(xy) + f(y) | xy ∈ E(G)} is equal to {a, a + d, a + 2d,...,a + (|E(G)| ? 1)d} for two integers a > 0 and d ? 0. An (a, d)-edge-antimagic total labeling is called super if the smallest possible labels appear on the vertices. In this paper, we completely settle the problem of the super (a, d)-edge-antimagic total labeling of the complete bipartite graph K_m,n and obtain the following results: the graph K_m,n has a super (a, d)-edge-antimagic total labeling if and only if either (i) m = 1, n = 1, and d ? 0, or (ii) m = 1, n ? 2 (or n = 1 and m ? 2), and d ∈ {0, 1, 2}, or (iii) m = 1, n = 2 (or n = 1 and m = 2), and d = 3, or (iv) m, n ? 2, and d = 1.     

Some relations among multiplicative and <Emphasis Type="Italic">q</Emphasis>-additive functions

We give all solutions of the equation f(n) = g(n) + h(n) for every n ∈ ?, where f is a completely multiplicative, g is a 2-additive, and h is a 3-additive function. We also determine all completely multiplicative functions f and all q-additive functions g for which f(n) = g ²(n) for every n ∈ ?.     

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).     

Neighbor sum distinguishing total chromatic number of <Emphasis Type="Italic">K</Emphasis><Subscript>4</Subscript>-minor free graph

A k-total coloring of a graph G is a mapping ?: V (G) ? E(G) → {1; 2,..., k} such that no two adjacent or incident elements in V (G) ? E(G) receive the same color. Let f(v) denote the sum of the color on the vertex v and the colors on all edges incident with v: We say that ? is a k-neighbor sum distinguishing total coloring of G if f(u) 6 ≠ f(v) for each edge uv ∈ E(G): Denote χ _Σ ^″ (G) the smallest value k in such a coloring of G: Pil?niak and Wo?niak conjectured that for any simple graph with maximum degree Δ(G), χ _Σ ^″ ≤ Δ(G)+3. In this paper, by using the famous Combinatorial Nullstellensatz, we prove that for K ₄-minor free graph G with Δ(G) > 5; χ _Σ ^″ = Δ(G) + 1 if G contains no two adjacent Δ-vertices, otherwise, χ _Σ ^″ (G) = Δ(G) + 2.     

Holomorphic injective extensions of functions in <Emphasis Type="Italic">P</Emphasis>(<Emphasis Type="Italic">K</Emphasis>) and algebra generators

We present necessary and sufficient conditions on planar compacta K and continuous functions f on K in order that f generate the algebras P(K), R(K), A(K) or C(K). We also unveil quite surprisingly simple examples of non-polynomial convex compacta K ? C and f ∈ P(K) with the property that f ∈ P(K) is a homeomorphism of K onto its image, but for which f ^?1 ? P(f(K)). As a consequence, such functions do not admit injective holomorphic extensions to the interior of the polynomial convex hull \(\widehat K\). On the other hand, it is shown that the restriction f*|_G of the Gelfand-transform f* of an injective function f ∈ P(K) is injective on every regular, bounded complementary component G of K. A necessary and sufficient condition in terms of the behaviour of f on the outer boundary of K is given in order that f admit a holomorphic injective extension to \(\widehat K\). We also include some results on the existence of continuous logarithms on punctured compacta containing the origin in their boundary.     

Intersections of Primary Subgroups in Nonsoluble Finite Groups Isomorphic to <Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>(2<Superscript><Emphasis Type="Italic">m</Emphasis></Superscript>)

Given a finite group G with socle isomorphic to L _n (2 ^m ), we describe (up to conjugacy) all ordered pairs of primary subgroups A and B in G such that A ∩ B ^g ≠ 1 for all g ∈ g.     

Neighborhood Conditions for Fractional ID-<Emphasis Type="Italic">k</Emphasis>-factor-critical Graphs

Let G be a graph and k ≥ 2 a positive integer. Let h: E(G) → [0, 1] be a function. If \(\sum\limits_{e \mathrel\backepsilon x} {h(e) = k} \) holds for each x ∈ V (G), then we call G[F_h] a fractional k-factor of G with indicator function h where F_h = {e ∈ E(G): h(e) > 0}. A graph G is fractional independent-set-deletable k-factor-critical (in short, fractional ID-k-factor-critical), if G ? I has a fractional k-factor for every independent set I of G. In this paper, we prove that if n ≥ 9k ? 14 and for any subset X ? V (G) we have

$${N_G}(X) = V(G)if|X| \geqslant \left\lfloor {\frac{{kn}}{{3k - 1}}} \right\rfloor ;or|{N_G}(X)| \geqslant \frac{{3k - 1}}{k}|X|if|X| < \left\lfloor {\frac{{kn}}{{3k - 1}}} \right\rfloor ,$$

then G is fractional ID-k-factor-critical.

     

Processes of <Emphasis Type="Italic">r</Emphasis><Superscript><Emphasis Type="Italic">t</Emphasis><Emphasis Type="Italic">h</Emphasis></Superscript> largest

For integers n ≥ r, we treat the rth largest of a sample of size n as an \(\mathbb {R}^{\infty }\)-valued stochastic process in r which we denote as M^(r). We show that the sequence regarded in this way satisfies the Markov property. We go on to study the asymptotic behavior of M^(r) as r → ∞, and, borrowing from classical extreme value theory, show that left-tail domain of attraction conditions on the underlying distribution of the sample guarantee weak limits for both the range of M^(r) and M^(r) itself, after norming and centering. In continuous time, an analogous process Y^(r) based on a two-dimensional Poisson process on \(\mathbb {R}_{+}\times \mathbb {R}\) is treated similarly, but we note that the continuous time problems have a distinctive additional feature: there are always infinitely many points below the rth highest point up to time t for any t >?0. This necessitates a different approach to the asymptotics in this case.     

The general rigidity result for bundles of <Emphasis Type="Italic">A</Emphasis>-covelocities and <Emphasis Type="Italic">A</Emphasis>-jets

Let M be an m-dimensional manifold and A = D _k ^r /I = R⊕N _A a Weil algebra of height r. We prove that any A-covelocity T _x ^A f ∈ T _x ^A *M, x ∈ M is determined by its values over arbitrary max{width A,m} regular and under the first jet projection linearly independent elements of T _x ^A M. Further, we prove the rigidity of the so-called universally reparametrizable Weil algebras. Applying essentially those partial results we give the proof of the general rigidity result T ^A *M ? T ^r *M without coordinate computations, which improves and generalizes the partial result obtained in Tomá? (2009) from m ≥ k to all cases of m.We also introduce the space J ^A (M,N) of A-jets and prove its rigidity in the sense of its coincidence with the classical jet space J ^r (M,N).     

The strong <Emphasis Type="Italic">L</Emphasis><Superscript>1</Superscript>-<Emphasis Type="Italic">greedy</Emphasis> property of the Walsh system

For any 0 < ? < 1 one can find a measurable set E ? [0, 1] with the measure |E| > 1 ? ? such that for each function f(x) ε L ¹ (0, 1) a function g(x) ε L ¹ (0, 1) exists such that it coincides with f (x) on E, its Fourier—Walsh series converges to it in the metric of L ¹ (0, 1), and all nonzero terms of the sequence of Fourier coefficients of the new function obtained by the Walsh system have the modulo decreasing order; consequently, the greedy algorithm for this function converges to it in the L ¹ (0, 1)-norm.     

Planar Graded Lattices and the <Emphasis Type="Bold">c</Emphasis><Subscript>1</Subscript>-Median Property

Let L be a lattice of finite length, ξ = (x ₁,…, x _k )∈L ^k , and y ∈ L. The remoteness r(y, ξ) of y from ξ is d(y, x ₁)+?+d(y, x _k ), where d stands for the minimum path length distance in the covering graph of L. Assume, in addition, that L is a graded planar lattice. We prove that whenever r(y, ξ) ≤ r(z, ξ) for all z ∈ L, then y ≤ x ₁∨?∨x _k . In other words, L satisfies the so-called c ₁ -median property.     

Inverse problem with nonlocal observation of finding the coefficient multiplying <Emphasis Type="Italic">u</Emphasis> <Subscript> <Emphasis Type="Italic">t</Emphasis> </Subscript> in the parabolic equation

We study the inverse problem of the reconstruction of the coefficient ?(x, t) = ?⁰(x, t) + r(x) multiplying u_t in a nonstationary parabolic equation. Here ?⁰(x, t) ≥ ?⁰ > 0 is a given function, and r(x) ≥ 0 is an unknown function of the class L_∞(Ω). In addition to the initial and boundary conditions (the data of the direct problem), we pose the problem of nonlocal observation in the form ∫₀^Tu(x, t) dμ(t) = χ(x) with a known measure dμ(t) and a function χ(x). We separately consider the case dμ(t) = ω(t)dt of integral observation with a smooth function ω(t). We obtain sufficient conditions for the existence and uniqueness of the solution of the inverse problem, which have the form of ready-to-verify inequalities. We suggest an iterative procedure for finding the solution and prove its convergence. Examples of particular inverse problems for which the assumptions of our theorems hold are presented.     

Largest <Emphasis Type="Italic">H</Emphasis>-eigenvalue of uniform <Emphasis Type="Italic">s</Emphasis>-hypertrees

The k-uniform s-hypertree G = (V,E) is an s-hypergraph, where 1 ≤ s ≤ k - 1; and there exists a host tree T with vertex set V such that each edge of G induces a connected subtree of T. In this paper, some properties of uniform s-hypertrees are establised, as well as the upper and lower bounds on the largest H-eigenvalue of the adjacency tensor of k-uniform s-hypertrees in terms of the maximal degree Δ. Moreover, we also show that the gap between the maximum and the minimum values of the largest H-eigenvalue of k-uniform s-hypertrees is just Θ(Δ ^s/k ).     

On <Emphasis Type="Italic">k</Emphasis>- critical 2<Emphasis Type="Italic">k</Emphasis>- connected graphs

A graph G is called an (n,k)-graph if κ(G-S)=n-|S| for any S ? V(G) with |S| ≤ k, where ?(G) denotes the connectivity of G. Mader conjectured that for k ≥ 3 the graph K_2k+2?(1-factor) is the unique (2k, k)-graph. Kriesell has settled two special cases for k = 3,4. We prove the conjecture for the general case k ≥ 5.     

Intersections of two nilpotent subgroups in finite groups with socle <Emphasis Type="Italic">L</Emphasis><Subscript>2</Subscript>(<Emphasis Type="Italic">q</Emphasis>)

Given a finite group G with socle isomorphic to L ₂(q), q ≥ 4, we describe, up to conjugacy, all pairs of nilpotent subgroups A and B of G such that A ∩ B ^g ≠ 1 for all g ∈ G.     

Periodic Groups Saturated with the Groups <Emphasis Type="Italic">L</Emphasis><Subscript>2</Subscript>(<Emphasis Type="Italic">p</Emphasis><Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>)

Given an indexing set I and a finite field K_α for each α ∈ I, let ? = {L₂(K_α) | α ∈ I} and \(\mathfrak{N} = \{ SL_2 (K_\alpha )|\alpha \in I\}\). We prove that each periodic group G saturated with groups in \(\Re (\mathfrak{N})\) is isomorphic to L₂(P) (respectively SL₂(P)) for a suitable locally finite field P.     

The maximum and minimum degree of the random <Emphasis Type="Italic">r</Emphasis>-uniform <Emphasis Type="Italic">r</Emphasis>-partite hypergraphs

In this paper we consider the random r-uniform r-partite hypergraph model H(n ₁, n ₂, ···, n _r; n, p) which consists of all the r-uniform r-partite hypergraphs with vertex partition {V ₁, V ₂, ···, V _r} where |V _i| = n _i = n _i(n) (1 ≤ i ≤ r) are positive integer-valued functions on n with n ₁ +n ₂ +···+n _r = n, and each r-subset containing exactly one element in V _i (1 ≤ i ≤ r) is chosen to be a hyperedge of H _p ∈ H (n ₁, n ₂, ···, n _r; n, p) with probability p = p(n), all choices being independent. Let

$${\Delta _{{V_1}}} = {\Delta _{{V_1}}}\left( H \right)$$

and

$${\delta _{{V_1}}} = {\delta _{{V_1}}}\left( H \right)$$

be the maximum and minimum degree of vertices in V ₁ of H, respectively;

$${X_{d,{V_1}}} = {X_{d,{V_1}}}\left( H \right),{Y_{d,{V_1}}} = {Y_{d,{V_1}}}\left( H \right)$$

,

$${Z_{d,{V_1}}} = {Z_{d,{V_1}}}\left( H \right)and{Z_{c,d,{V_1}}} = {Z_{c,d,{V_1}}}\left( H \right)$$

be the number of vertices in V ₁ of H with degree d, at least d, at most d, and between c and d, respectively. In this paper we obtain that in the space H(n ₁, n ₂, ···, n _r; n, p),

$${X_{d,{V_1}}},{Y_{d,{V_1}}},{Z_{d,{V_1}}}and{Z_{c,d,{V_1}}}$$

all have asymptotically Poisson distributions. We also answer the following two questions. What is the range of p that there exists a function D(n) such that in the space H(n ₁, n ₂, ···, n _r; n, p),

$$\mathop {\lim }\limits_{n \to \infty } P\left( {{\Delta _{{V_1}}} = D\left( n \right)} \right) = 1$$

? What is the range of p such that a.e., H _p ∈ H (n ₁, n ₂, ···, n _r; n, p) has a unique vertex in V ₁ with degree

$${\Delta _{{V_1}}}\left( {{H_p}} \right)$$

? Both answers are p = o (log n ₁/N), where

$$N = \mathop \prod \limits_{i = 2}^r {n_i}$$

. The corresponding problems on

$${\delta _{{V_i}}}\left( {{H_p}} \right)$$

also are considered, and we obtained the answers are p ≤ (1 + o(1))(log n ₁/N) and p = o (log n ₁/N), respectively.

     

(<Emphasis Type="Italic">m</Emphasis>,<Emphasis Type="Italic">r</Emphasis>)-central Riordan arrays and their applications

For integers m > r ≥ 0, Brietzke (2008) defined the (m, r)-central coefficients of an infinite lower triangular matrix G = (d, h) = (d_n,k)_n,k∈N as d_{mn+r,(m?1)n+r}, with n = 0, 1, 2,..., and the (m, r)-central coefficient triangle of G as

$${G^{\left( {m,r} \right)}} = {\left( {{d_{mn + r,\left( {m - 1} \right)n + k + r}}} \right)_{n,k \in \mathbb{N}}}.$$

It is known that the (m, r)-central coefficient triangles of any Riordan array are also Riordan arrays. In this paper, for a Riordan array G = (d, h) with h(0) = 0 and d(0), h′(0) ≠ 0, we obtain the generating function of its (m, r)-central coefficients and give an explicit representation for the (m, r)-central Riordan array G^(m,r) in terms of the Riordan array G. Meanwhile, the algebraic structures of the (m, r)-central Riordan arrays are also investigated, such as their decompositions, their inverses, and their recessive expressions in terms of m and r. As applications, we determine the (m, r)-central Riordan arrays of the Pascal matrix and other Riordan arrays, from which numerous identities are constructed by a uniform approach.