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.     

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

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.     

Valuation ideals and primary <Emphasis Type="Italic">w</Emphasis>-ideals

Let D be an integral domain, V (D) (resp., t-V (D)) be the set of all valuation (resp., t-valuation) ideals of D, and w-P(D) be the set of primary w-ideals of D. Let D[X] be the polynomial ring over D, c(f) be the ideal of D generated by the coefficients of f ∈ D[X], and N _v = {f ∈ D[X] | c(f) _v = D}. In this paper, we study integral domains D in which w-P(D) ? t-V (D), t-V (D) ? w-P(D), or t-V (D) = w-P(D). We also study the relationship between t-V (D) and \(V\left( {D{{\left[ X \right]}_{{N_v}}}} \right)\), and characterize when t-V (A + XB[X]) ? w-P(A + XB[X]) holds for a proper extension A ? B of integral domains.     

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.     

Non-triviality of a product in the Adams <Emphasis Type="Italic">E</Emphasis> <Subscript>2</Subscript>-term

Let p be a prime greater than five and A the mod p Steenrod algebra. In this paper, we prove that \(h_n h_m \tilde \delta _{s + 4} \in Ext_A^{s + 6,t(s,n,m) + s} (Z/p,Z/p)\) is nontrivial in the Adams E₂-term when m ≥ n + 2 ≥ 7 and 0 ≤ s < p ? 4, and trivial in the Adams E₂-term when m ≥ n + 2 = 6 and 0 ≤ s < p ? 4, where \(\tilde \delta _{s + 4} \) stands for the fourth Greek letter element and t(s, n, m) = 2(p ? 1)[(s + 1) + (s + 2)p + (s + 3)p² + (s + 4)p³ + pⁿ + p^m].     

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.     

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.     

Spherical means in annular regions in the <Emphasis Type="Italic">n</Emphasis>-dimensional real hyperbolic spaces

Let Z _r,R be the class of all continuous functions f on the annulus Ann(r, R) in the real hyperbolic space \(\mathbb B^n\) with spherical means M _s f(x)?=?0, whenever s?>?0 and \(x\in\mathbb B^n\) are such that the sphere S _s (x)???Ann(r, R) and \(B_r(o)\subseteq B_s(x).\) In this article, we give a characterization for functions in Z _r,R . In the case R?=?∞, this result gives a new proof of Helgason’s support theorem for spherical means in the real hyperbolic spaces.     

Some Existence Theorems on All Fractional (<Emphasis Type="Italic">g</Emphasis>, <Emphasis Type="Italic">f</Emphasis>)-factors with Prescribed Properties

Let G be a graph, and g, f: V (G) → Z⁺ with g(x) ≤ f(x) for each x ∈ V (G). We say that G admits all fractional (g, f)-factors if G contains an fractional r-factor for every r: V (G) → Z⁺ with g(x) ≤ r(x) ≤ f(x) for any x ∈ V (G). Let H be a subgraph of G. We say that G has all fractional (g, f)-factors excluding H if for every r: V (G) → Z⁺ with g(x) ≤ r(x) ≤ f(x) for all x ∈ V (G), G has a fractional r-factor F _h such that E(H) ∩ E(F _h ) = θ, where h: E(G) → [0, 1] is a function. In this paper, we show a characterization for the existence of all fractional (g, f)-factors excluding H and obtain two sufficient conditions for a graph to have all fractional (g, f)-factors excluding H.     

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.     

Divergent solutions to the <Emphasis Type="Italic">L</Emphasis><Superscript>2</Superscript>-supercritical NLS equations

We investigate the nonlinear Schrödinger equation iu _t +Δu+|u| ^p?1 u = 0with 1+ 4/N < p < 1+ 4/N?2 (when N = 1, 2, 1 + 4/N < p < ∞) in energy space H ¹ and study the divergent property of infinite-variance and nonradial solutions. If \(M{\left( u \right)^{\frac{{1 - {s_C}}}{{{s_C}}}}}E\left( u \right) \prec M{\left( Q \right)^{\frac{{1 - {s_C}}}{{{s_C}}}}}E\left( Q \right)\) and \(\left\| {{u_0}} \right\|_2^{\frac{{1 - {s_c}}}{{{s_c}}}}\left\| {\nabla {u_0}} \right\|_2^{\frac{{1 - {s_c}}}{{{s_c}}}}{\left\| {\nabla Q} \right\|_2}\), then either u(t) blows up in finite forward time or u(t) exists globally for positive time and there exists a time sequence t _n → +∞ such that \({\left\| {\nabla u\left( {{t_n}} \right)} \right\|_2} \to + \infty \). Here Q is the ground state solution of ?(1?s _c )Q+ΔQ+Q ^p?1 Q = 0. A similar result holds for negative time. This extend the result of the 3D cubic Schrödinger equation obtained by Holmer to the general mass-supercritical and energy-subcritical case.     

Pointwise estimates of polynomials orthogonal on a circle with respect to a weight not belonging to the spaces <Emphasis Type="Italic">L</Emphasis><Superscript><Emphasis Type="Italic">r</Emphasis></Superscript> (<Emphasis Type="Italic">r</Emphasis> &gt; 1)

Two-sided pointwise estimates are established for polynomials that are orthogonal on the circle |z| = 1 with respect to the weight ?(τ): = h(τ)|sin(τ/2)|^?1 g(|sin(τ/2)|) (τ ∈ ?), where g(t) is a concave modulus of continuity slowly changing at zero such that t ^?1 g(t) ∈ L ¹[0, 1] and h(τ) is a positive function from the class C _2π with a modulus of continuity satisfying the integral Dini condition. The obtained estimates are applied to find the order of the distance from the point t = 1 to the greatest zero of a polynomial orthogonal on the segment [?1, 1].     

<Emphasis Type="Italic">r</Emphasis>-Dynamic Chromatic Number of Some Line Graphs

An r-dynamic coloring of a graph G is a proper coloring c of the vertices such that |c(N(v))| ≥ min {r, deg(v)}, for each v ∈ V (G). The r-dynamic chromatic number of a graph G is the smallest k such that G admits an r-dynamic coloring with k colors. In this paper, we obtain the r-dynamic chromatic number of the line graph of helm graphs H_n for all r between minimum and maximum degree of H_n. Moreover, our proofs are constructive, what means that we give also polynomial time algorithms for the appropriate coloring. Finally, as the first, we define an equivalent model for edge coloring.     

On (<Emphasis Type="Italic">m</Emphasis>, <Emphasis Type="Italic">n</Emphasis>)-absorbing ideals of commutative rings

Let R be a commutative ring with 1 ≠ 0 and U(R) be the set of all unit elements of R. Let m, n be positive integers such that m > n. In this article, we study a generalization of n-absorbing ideals. A proper ideal I of R is called an (m, n)-absorbing ideal if whenever a ₁?a _m ∈I for a ₁,…, a _m ∈R?U(R), then there are n of the a _i ’s whose product is in I. We investigate the stability of (m, n)-absorbing ideals with respect to various ring theoretic constructions and study (m, n)-absorbing ideals in several commutative rings. For example, in a Bézout ring or a Boolean ring, an ideal is an (m, n)-absorbing ideal if and only if it is an n-absorbing ideal, and in an almost Dedekind domain every (m, n)-absorbing ideal is a product of at most m ? 1 maximal ideals.     

On the phase transitions of (<Emphasis Type="Italic">k</Emphasis>, <Emphasis Type="Italic">q</Emphasis>)-SAT

Call a sequence of k Boolean variables or their negations a k-tuple. For a set V of n Boolean variables, let T _k (V) denote the set of all 2 ^k n ^k possible k-tuples on V. Randomly generate a set C of k-tuples by including every k-tuple in T _k (V) independently with probability p, and let Q be a given set of q “bad” tuple assignments. An instance I = (C,Q) is called satisfiable if there exists an assignment that does not set any of the k-tuples in C to a bad tuple assignment in Q. Suppose that θ, q > 0 are fixed and ε = ε(n) > 0 be such that εlnn/lnlnn→∞. Let k ≥ (1 + θ) log₂ n and let \({p_0} = \frac{{\ln 2}}{{q{n^{k - 1}}}}\). We prove that

$$\mathop {\lim }\limits_{n \to \infty } P\left[ {I is satisfiable} \right] = \left\{ {\begin{array}{*{20}c} {1,} & {p \leqslant (1 - \varepsilon )p_0 ,} \\ {0,} & {p \geqslant (1 + \varepsilon )p_0 .} \\ \end{array} } \right.$$

     

Finite Groups Whose <Emphasis Type="Italic">n</Emphasis>-Maximal Subgroups Are Modular

Let G be a finite group. If M_n< M_n?1< · · · < M₁< M₀ = G with Mi a maximal subgroup of M_i?1 for all i = 1,..., n, then M_n (n > 0) is an n-maximal subgroup of G. A subgroup M of G is called modular provided that (i) 〈X,M ∩ Z〉 = 〈X,M〉 ∩ Z for all X ≤ G and Z ≤ G such that X ≤ Z, and (ii) 〈M,Y ∩ Z〉 = 〈M,Y 〉 ∩ Z for all Y ≤ G and Z ≤ G such that M ≤ Z. In this paper, we study finite groups whose n-maximal subgroups are modular.     

An improved approximation algorithm for the <Emphasis Type="Italic">k</Emphasis>-level facility location problem with soft capacities

We consider the k-level facility location problem with soft capacities (k-LFLPSC). In the k-LFLPSC, each facility i has a soft capacity u _i along with an initial opening cost f _i ≥ 0, i.e., the capacity of facility i is an integer multiple of u _i incurring a cost equals to the corresponding multiple of f _i . We firstly propose a new bifactor (ln(1/β)/(1 ?β),1+2/(1 ?β))-approximation algorithm for the k-level facility location problem (k-LFLP), where β ∈ (0, 1) is a fixed constant. Then, we give a reduction from the k-LFLPSC to the k-LFLP. The reduction together with the above bifactor approximation algorithm for the k-LFLP imply a 5.5053-approximation algorithm for the k-LFLPSC which improves the previous 6-approximation.     

On <Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis>,<Emphasis Type="Italic">q</Emphasis></Subscript>-factorization of complete bipartite multigraphs

Let λK _m,n be a complete bipartite multigraph with two partite sets having m and n vertices, respectively. A K _p,q -factorization of λK _m,n is a set of edge-disjoint K _p,q -factors of λK _m,n which partition the set of edges of λK _m,n . When p = 1 and q is a prime number, Wang, in his paper [On K _1,q -factorization of complete bipartite graph, Discrete Math., 126: (1994), 359-364], investigated the K _1,q -factorization of K _m,n and gave a sufficient condition for such a factorization to exist. In papers [K _1,k -factorization of complete bipartite graphs, Discrete Math., 259: 301-306 (2002),; K _p,q -factorization of complete bipartite graphs, Sci. China Ser. A-Math., 47: (2004), 473-479], Du and Wang extended Wang’s result to the case that p and q are any positive integers. In this paper, we give a sufficient condition for λK _m,n to have a K _p,q -factorization. As a special case, it is shown that the necessary condition for the K _p,q -factorization of λK _m,n is always sufficient when p : q = k : (k + 1) for any positive integer k.     

Differences of Idempotents In <Emphasis Type="Italic">C</Emphasis>*-Algebras and the Quantum Hall Effect

Let ? be a trace on the unital C*-algebra A and M _? be the ideal of the definition of the trace ?. We obtain a C*analogue of the quantum Hall effect: if P,Q ∈ A are idempotents and P ? Q ∈ M _? , then ?((P ? Q)²ⁿ⁺¹) = ?(P ? Q) ∈ R for all n ∈ N. Let the isometries U ∈ A and A = A*∈ A be such that I+A is invertible and U-A ∈ M _? with ?(U-A) ∈ R. Then I-A, I?U ∈ M _? and ?(I?U) ∈ R. Let n ∈ N, dimH = 2n + 1, the symmetry operators U, V ∈ B(H), and W = U ? V. Then the operator W is not a symmetry, and if V = V*, then the operator W is nonunitary.