The fractional Neumann and Robin type boundary conditions for the regional fractional <Emphasis Type="Italic">p</Emphasis>-Laplacian

Let \({p \in (1,\infty)}\), \({s \in (0,1)}\) and \({\Omega \subset {\mathbb{R}^{N}}}\) a bounded open set with boundary \({\partial\Omega}\) of class C ^1,1. In the first part of the article we prove an integration by parts formula for the fractional p-Laplace operator \({(-\Delta)_{p}^{s}}\) defined on \({\Omega \subset {\mathbb{R}^{N}}}\) and acting on functions that do not necessarily vanish at the boundary \({\partial\Omega}\). In the second part of the article we use the above mentioned integration by parts formula to clarify the fractional Neumann and Robin boundary conditions associated with the fractional p-Laplacian on open sets.     

On von Neumann regular elements in <Emphasis Type="Italic">f</Emphasis>-rings

Let B be an Archimedean reduced f-ring. A positive element \({\omega}\) in B is said to satisfy the property \({(\ast)}\) if for every f-ring A with identity e and every \({\ell}\)-group homomorphism \({\gamma : A \rightarrow B}\) with \({\gamma(e) = \omega}\), there exists a unique \({\ell}\)-ring homomorphism \({\rho: B \rightarrow B}\) such that \({\gamma = \omega \rho}\) and \({\rho(e)^{\perp \perp} = \omega^{\perp \perp}}\). Boulabiar and Hager proved that any (positive) von Neumann regular element in B satisfies the property \({(\ast)}\) and proved that the converse holds in the C(X)-case. In this regard, they asked about this converse in the general case. Our main purpose in this note is to prove, via a counter-example, that the converse in question fails in general. In addition, we shall take the opportunity to extend the direct result obtained by Boulabiar and Hager, and to get the C(X)-case we were talking about in an easier way.     

Joint universality for dependent <Emphasis Type="Italic">L</Emphasis>-functions

We prove that, for arbitrary Dirichlet L-functions \(L(s;\chi _1),\ldots ,L(s;\chi _n)\) (including the case when \(\chi _j\) is equivalent to \(\chi _k\) for \(j\ne k\)), suitable shifts of type \(L(s+i\alpha _jt^{a_j}\log ^{b_j}t;\chi _j)\) can simultaneously approximate any given set of analytic functions on a simply connected compact subset of the right open half of the critical strip, provided the pairs \((a_j,b_j)\) are distinct and satisfy certain conditions. Moreover, we consider a discrete analogue of this problem where t runs over the set of positive integers.     

A spectral method for nonlinear elliptic equations

Let Ω be an open, simply connected, and bounded region in \(\mathbb {R}^{d}\), d ≥ 2, and assume its boundary ?Ω is smooth and homeomorphic to \(\mathbb {S}^{d-1}\). Consider solving an elliptic partial differential equation L u = f(?, u) over Ω with zero Dirichlet boundary value. The function f is a nonlinear function of the solution u. The problem is converted to an equivalent elliptic problem over the open unit ball \(\mathbb {B}^{d}\) in \(\mathbb {R}^{d}\), say \(\widetilde {L}\widetilde {u} =\widetilde {f}(\cdot ,\widetilde {u})\). Then a spectral Galerkin method is used to create a convergent sequence of multivariate polynomials \(\widetilde {u} _{n}\) of degree ≤ n that is convergent to \(\widetilde {u}\). The transformation from Ω to \(\mathbb {B}^{d}\) requires a special analytical calculation for its implementation. With sufficiently smooth problem parameters, the method is shown to be rapidly convergent. For \(u\in C^{\infty } \left (\overline {\Omega }\right ) \) and assuming ?Ω is a C ^∞ boundary, the convergence of \(\left \Vert \widetilde {u} -\widetilde {u}_{n}\right \Vert _{H^{1}}\) to zero is faster than any power of 1/n. The error analysis uses a reformulation of the boundary value problem as an integral equation, and then it uses tools from nonlinear integral equations to analyze the numerical method. Numerical examples illustrate experimentally an exponential rate of convergence. A generalization to ?Δu + γ u = f(u) with a zero Neumann boundary condition is also presented.     

On the Generalized Stochastic Dirichlet Problem—Part I: The Stochastic Weak Maximum Principle

We treat the stochastic Dirichlet problem \(L\lozenge u = h+\nabla f\) in the framework of white noise analysis combined with Sobolev space methods. The input data and the boundary condition are generalized stochastic processes regarded as linear continuous mappings from the Sobolev space \(W_0^{1,2}\) into the Kondratiev space (S)_???1. The operator L is assumed to be strictly elliptic in divergence form \(L\lozenge u=\nabla(A\lozenge\nabla u+b\lozenge u)+c\lozenge\nabla u+d\lozenge u\). Its coefficients: the elements of the matrix A and of the vectors b, c and d are assumed to be generalized random processes, and the product of two generalized processes, denoted by \(\lozenge\), is interpreted as the Wick product. In this paper we prove the weak maximum principle for the operator L, which will imply the uniqueness of the solution to \(L\lozenge u = h+\nabla f\).     

Dirichlet and Neumann eigenvalue problems on CR manifolds

We study the properties of Carnot–Carathéodory spaces attached to a strictly pseudoconvex CR manifold M, in a neighborhood of each point \(x \in M\), versus the pseudohermitian geometry of M arising from a fixed positively oriented contact form \(\theta \) on M. The weak Dirichlet problem for the sublaplacian \(\Delta _b\) on \((M, \theta )\) is solved on domains \(\Omega \subset M\) supporting the Poincaré inequality. The solution to Neumann problem for the sublaplacian \(\Delta _b\) on a \(C^{1,1}\) connected \((\epsilon , \delta )\)-domain \(\Omega \subset {{\mathbb {G}}}\) in a Carnot group (due to Danielli et al. in: Memoirs of American Mathematical Society 2006) is revisited for domains in a CR manifold. As an application we prove discreetness of the Dirichlet and Neumann spectra of \(\Delta _b\) on \(\Omega \subset M\) in a Carnot–Carthéodory complete pseudohermitian manifold \((M, \theta )\).     

Universal Cycle Packings and Coverings for <Emphasis Type="Italic">k</Emphasis>-Subsets of an <Emphasis Type="Italic">n</Emphasis>-Set

A cyclic sequence of elements of [n] is an (n, k)-Ucycle packing (respectively, (n, k)-Ucycle covering) if every k-subset of [n] appears in this sequence at most once (resp. at least once) as a subsequence of consecutive terms. Let \(p_{n,k}\) be the length of a longest (n, k)-Ucycle packing and \(c_{n,k}\) the length of a shortest (n, k)-Ucycle covering. We show that, for a fixed \(k,p_{n,k}={n\atopwithdelims ()k}-O(n^{\lfloor k/2\rfloor })\). Moreover, when k is not fixed, we prove that if \(k=k(n)\le n^{\alpha }\), where \(0<\alpha <1/3\), then \(p_{n,k}={n\atopwithdelims ()k}-o({n\atopwithdelims ()k}^\beta )\) and \(c_{n,k}={n\atopwithdelims ()k}+o({n\atopwithdelims ()k}^\beta )\), for some \(\beta <1\). Finally, we show that if \(k=o(n)\), then \(p_{n,k}={n\atopwithdelims ()k}(1-o(1))\).     

Quantum Ergodic Restriction Theorems. I: Interior Hypersurfaces in Domains with Ergodic Billiards

Quantum ergodic restriction (QER) is the problem of finding conditions on a hypersurface H so that restrictions \({\phi_j |_H}\) to H of Δ-eigenfunctions of Riemannian manifolds (M, g) with ergodic geodesic flow are quantum ergodic on H. We prove two kinds of results: First (i) for any smooth hypersurface H in a piecewise-analytic Euclidean domain, the Cauchy data \({(\phi_j|H,\partial_{\nu}^H \phi_j|H)}\) is quantum ergodic if the Dirichlet and Neumann data are weighted appropriately. Secondly, (ii) we give conditions on H so that the Dirichlet (or Neumann) data is individually quantum ergodic. The condition involves the almost nowhere equality of left and right Poincaré maps for H. The proof involves two further novel results: (iii) a local Weyl law for boundary traces of eigenfunctions, and (iv) an ‘almost-orthogonality’ result for Fourier integral operators whose canonical relations almost nowhere commute with the geodesic flow.     

A Compactness Theorem of the Space of Free Boundary <Emphasis Type="Italic">f</Emphasis>-Minimal Surfaces in Three-Dimensional Smooth Metric Measure Space with Boundary

Let \((M^3,g,e^{-f}d\mu _M)\) be a compact three-dimensional smooth metric measure space with nonempty boundary. Suppose that M has nonnegative Bakry–Émery Ricci curvature and the boundary \(\partial M\) is strictly f-mean convex. We prove that there exists a properly embedded smooth f-minimal surface \(\Sigma \) in M with free boundary \(\partial \Sigma \) on \(\partial M\). If we further assume that the boundary \(\partial M\) is strictly convex, then we prove that \(M^3\) is diffeomorphic to the 3-ball \(B^3\), and a compactness theorem for the space of properly embedded f-minimal surfaces with free boundary in such \((M^3,g,e^{-f}d\mu _M)\), when the topology of these f-minimal surfaces is fixed.     

Total Rainbow Connection Number and Complementary Graph

A vertex-colored graph G is rainbow vertex connected if any two distinct vertices are connected by a path whose internal vertices have distinct colors. The rainbow vertex connection number of G, denoted by rvc(G), is the smallest number of colors that are needed in order to make G rainbow vertex connected. In this paper, we prove that for a connected graph G, if \({{\rm diam}(\overline{G}) \geq 3}\), then \({{\rm rvc}(G) \leq 2}\), and this bound is tight. Next, we obtain that for a triangle-free graph \({\overline{G}}\) with \({{\rm diam}(\overline{G}) = 2}\), if G is connected, then \({{\rm rvc}(G) \leq 2}\), and this bound is tight. A total-colored path is total rainbow if its edges and internal vertices have distinct colors. A total-colored graph G is total rainbow connected if any two distinct vertices are connected by some total rainbow path. The total rainbow connection number of G, denoted by trc(G), is the smallest number of colors required to color the edges and vertices of G in order to make G total rainbow connected. In this paper, we prove that for a triangle-free graph \({\overline{G}}\) with \({{\rm diam}(\overline{G}) = 3}\), if G is connected, then trc\({(G) \leq 5}\), and this bound is tight. Next, a Nordhaus–Gaddum-type result for the total rainbow connection number is provided. We show that if G and \({\overline{G}}\) are both connected, then \({6 \leq {\rm trc} (G) + {\rm trc}(\overline{G}) \leq 4n - 6.}\) Examples are given to show that the lower bound is tight for \({n \geq 7}\) and n = 5. Tight lower bounds are also given for n = 4, 6.     

Approximate results for rainbow labelings

A simple graph \(G=(V,\,E)\) is said to be antimagic if there exists a bijection \(f{\text {:}}\,E\rightarrow [1,\,|E|]\) such that the sum of the values of f on edges incident to a vertex takes different values on distinct vertices. The graph G is distance antimagic if there exists a bijection \(f{\text {:}}\,V\rightarrow [1,\, |V|],\) such that \(\forall x,\,y\in V,\)

$$\begin{aligned} \sum _{x_i\in N(x)}f\left( x_i\right) \ne \sum _{x_j\in N(y)}f\left( x_j\right) . \end{aligned}$$

Using the polynomial method of Alon we prove that there are antimagic injections of any graph G with n vertices and m edges in the interval \([1,\,2n+m-4]\) and, for trees with k inner vertices, in the interval \([1,\,m+k].\) In particular, a tree all of whose inner vertices are adjacent to a leaf is antimagic. This gives a partial positive answer to a conjecture by Hartsfield and Ringel. We also show that there are distance antimagic injections of a graph G with order n and maximum degree \(\Delta \) in the interval \([1,\,n+t(n-t)],\) where \( t=\min \{\Delta ,\,\lfloor n/2\rfloor \},\) and, for trees with k leaves, in the interval \([1,\, 3n-4k].\) In particular, all trees with \(n=2k\) vertices and no pairs of leaves sharing their neighbour are distance antimagic, a partial solution to a conjecture of Arumugam.

     

Anti-Ramsey Numbers of Graphs with Small Connected Components

The anti-Ramsey number, AR(n, G), for a graph G and an integer \(n\ge |V(G)|\), is defined to be the minimal integer r such that in any edge-colouring of \(K_n\) by at least r colours there is a multicoloured copy of G, namely, a copy of G that each of its edges has a distinct colour. In this paper we determine, for large enough \(n,\, AR(n,L\cup tP_2)\) and \(AR(n,L\cup kP_3)\) for any large enough t and k, and a graph L satisfying some conditions. Consequently, we determine AR(n, G), for large enough n, where G is \(P_3\cup tP_2\) for any \(t\ge 3,\, P_4\cup tP_2\) and \(C_3\cup tP_2\) for any \(t\ge 2,\, kP_3\) for any \(k\ge 3,\, tP_2\cup kP_3\) for any \(t\ge 1,\, k\ge 2\), and \(P_{t+1}\cup kP_3\) for any \(t\ge 3,\, k\ge 1\). Furthermore, we obtain upper and lower bounds for AR(n, G), for large enough n, where G is \(P_{k+1}\cup tP_2\) and \(C_k\cup tP_2\) for any \(k\ge 4,\, t\ge 1\).     

Sharp boundary behaviour of solutions to semilinear nonlocal elliptic equations

We investigate quantitative properties of nonnegative solutions \(u(x)\ge 0\) to the semilinear diffusion equation \(\mathcal {L}u= f(u)\), posed in a bounded domain \(\Omega \subset \mathbb {R}^N\) with appropriate homogeneous Dirichlet or outer boundary conditions. The operator \(\mathcal {L}\) may belong to a quite general class of linear operators that include the standard Laplacian, the two most common definitions of the fractional Laplacian \((-\Delta )^s\) (\(0<s<1\)) in a bounded domain with zero Dirichlet conditions, and a number of other nonlocal versions. The nonlinearity f is increasing and looks like a power function \(f(u)\sim u^p\), with \(p\le 1\). The aim of this paper is to show sharp quantitative boundary estimates based on a new iteration process. We also prove that, in the interior, solutions are Hölder continuous and even classical (when the operator allows for it). In addition, we get Hölder continuity up to the boundary. Particularly interesting is the behaviour of solution when the number \(\frac{2s}{1-p}\) goes below the exponent \(\gamma \in (0,1]\) corresponding to the Hölder regularity of the first eigenfunction \(\mathcal {L}\Phi _1=\lambda _1 \Phi _1\). Indeed a change of boundary regularity happens in the different regimes \(\frac{2s}{1-p} \gtreqqless \gamma \), and in particular a logarithmic correction appears in the “critical” case \(\frac{2s}{1-p} = \gamma \). For instance, in the case of the spectral fractional Laplacian, this surprising boundary behaviour appears in the range \(0<s\le (1-p)/2\).     

$$L^{p}$$-Norms a nd Mahler’s Measure of Poly nomials o n the n-Dime nsio nal Torus

We prove Nikol’skii type inequalities that, for polynomials on the n-dimensional torus \(\mathbb {T}^n\), relate the \(L^p\)-norm with the \(L^q\)-norm (with respect to the normalized Lebesgue measure and \(0 <p <q < \infty \)). Among other things, we show that \(C=\sqrt{q/p}\) is the best constant such that \(\Vert P\Vert _{L^q}\le C^{\text {deg}(P)} \Vert P\Vert _{L^p}\) for all homogeneous polynomials P on \(\mathbb {T}^n\). We also prove an exact inequality between the \(L^p\)-norm of a polynomial P on \(\mathbb {T}^n\) and its Mahler measure M(P), which is the geometric mean of |P| with respect to the normalized Lebesgue measure on \(\mathbb {T}^n\). Using extrapolation, we transfer this estimate into a Khintchine–Kahane type inequality, which, for polynomials on \(\mathbb {T}^n\), relates a certain exponential Orlicz norm and Mahler’s measure. Applications are given, including some interpolation estimates.     

The Regularity Problems with Data in Hardy–Sobolev Spaces for Singular Schrödinger Equation in Lipschitz Domains

Let the nonnegative singular potential V belong to the reverse Hölder class \({\mathcal B}_n\) on \({\mathbb R}^n\), and let (n???1)/n?p?≤?2, we establish the solvability and derivative estimates for the solutions to the Neumann problem and the regularity problem of the Schrödinger equation ??Δu?+?Vu?=?0 in a connected Lipschitz domain Ω, with boundary data in the Hardy space \(H^p(\partial \Omega)\) and the modified Hardy–Sobolev space \(H_{1, V}^p(\partial \Omega)\) related to the potential V. To deal with the H ^p regularity problem, we construct a new characterization of the atomic decomposition for \(H_{1, V}^p(\partial \Omega)\) space. The invertibility of the boundary layer potentials on Hardy spaces and Hölder spaces are shown in this paper.     

Equilibrium Diffusion on the Cone of Discrete Radon Measures

Let \({\mathbb {K}(\mathbb {R}^{d})}\) denote the cone of discrete Radon measures on \(\mathbb {R}^{d}\). There is a natural differentiation on \(\mathbb {K}(\mathbb {R}^{d})\): for a differentiable function \(F:\mathbb {K}(\mathbb {R}^{d})\to \mathbb {R}\), one defines its gradient \(\nabla ^{\mathbb {K}}F\) as a vector field which assigns to each \(\eta \in \mathbb {K}(\mathbb {R}^{d})\) an element of a tangent space \(T_{\eta }(\mathbb {K}(\mathbb {R}^{d}))\) to \(\mathbb {K}(\mathbb {R}^{d})\) at point η. Let \(\phi :\mathbb {R}^{d}\times \mathbb {R}^{d}\to \mathbb {R}\) be a potential of pair interaction, and let μ be a corresponding Gibbs perturbation of (the distribution of) a completely random measure on \(\mathbb {R}^{d}\). In particular, μ is a probability measure on \(\mathbb {K}(\mathbb {R}^{d})\) such that the set of atoms of a discrete measure \(\eta \in \mathbb {K}(\mathbb {R}^{d})\) is μ-a.s. dense in \(\mathbb {R}^{d}\). We consider the corresponding Dirichlet form

$$\mathcal{E}^{\mathbb{K}}(F,G)={\int}_{\mathbb K(\mathbb{R}^{d})}\langle\nabla^{\mathbb{K}} F(\eta), \nabla^{\mathbb{K}} G(\eta)\rangle_{T_{\eta}(\mathbb{K})}\,d\mu(\eta). $$

Integrating by parts with respect to the measure μ, we explicitly find the generator of this Dirichlet form. By using the theory of Dirichlet forms, we prove the main result of the paper: If d ≥ 2, there exists a conservative diffusion process on \(\mathbb {K}(\mathbb {R}^{d})\) which is properly associated with the Dirichlet form \(\mathcal {E}^{\mathbb {K}}\).

     

A partition-based relaxation for Steiner trees

The Steiner tree problem is a classical NP-hard optimization problem with a wide range of practical applications. In an instance of this problem, we are given an undirected graph G = (V, E), a set of terminals \({R\subseteq V}\) , and non-negative costs c _e for all edges \({e \in E}\) . Any tree that contains all terminals is called a Steiner tree; the goal is to find a minimum-cost Steiner tree. The vertices \({V \backslash R}\) are called Steiner vertices. The best approximation algorithm known for the Steiner tree problem is a greedy algorithm due to Robins and Zelikovsky (SIAM J Discrete Math 19(1):122–134, 2005); it achieves a performance guarantee of \({1+\frac{\ln 3}{2}\approx 1.55}\) . The best known linear programming (LP)-based algorithm, on the other hand, is due to Goemans and Bertsimas (Math Program 60:145–166, 1993) and achieves an approximation ratio of 2?2/|R|. In this paper we establish a link between greedy and LP-based approaches by showing that Robins and Zelikovsky’s algorithm can be viewed as an iterated primal-dual algorithm with respect to a novel LP relaxation. The LP used in the first iteration is stronger than the well-known bidirected cut relaxation. An instance is b-quasi-bipartite if each connected component of \({G \backslash R}\) has at most b vertices. We show that Robins’ and Zelikovsky’s algorithm has an approximation ratio better than \({1+\frac{\ln 3}{2}}\) for such instances, and we prove that the integrality gap of our LP is between \({\frac{8}{7}}\) and \({\frac{2b+1}{b+1}}\) .     

Packing Chromatic Number of Base-3 Sierpiński Graphs

The packing chromatic number \(\chi _{\rho }(G)\) of a graph G is the smallest integer k such that there exists a k-vertex coloring of G in which any two vertices receiving color i are at distance at least \(i+1\). Let \(S^n\) be the base-3 Sierpiński graph of dimension n. It is proved that \(\chi _{\rho }(S^1) = 3\), \(\chi _{\rho }(S^2) = 5\), \(\chi _{\rho }(S^3) = \chi _{\rho }(S^4) = 7\), and that \(8\le \chi _\rho (S^n) \le 9\) holds for any \(n\ge 5\).     

Popular edges and dominant matchings

Given a bipartite graph \(G = (A \cup B,E)\) with strict preference lists and given an edge \(e^* \in E\), we ask if there exists a popular matching in G that contains \(e^*\). We call this the popular edge problem. A matching M is popular if there is no matching \(M'\) such that the vertices that prefer \(M'\) to M outnumber those that prefer M to \(M'\). It is known that every stable matching is popular; however G may have no stable matching with the edge \(e^*\). In this paper we identify another natural subclass of popular matchings called “dominant matchings” and show that if there is a popular matching that contains the edge \(e^*\), then there is either a stable matching that contains \(e^*\) or a dominant matching that contains \(e^*\). This allows us to design a linear time algorithm for identifying the set of popular edges. When preference lists are complete, we show an \(O(n^3)\) algorithm to find a popular matching containing a given set of edges or report that none exists, where \(n = |A| + |B|\).     

On a problem of Erdős and Moser

A set A of vertices in an r-uniform hypergraph \(\mathcal H\) is covered in \(\mathcal H\) if there is some vertex \(u\not \in A\) such that every edge of the form \(\{u\}\cup B\), \(B\in A^{(r-1)}\) is in \(\mathcal H\). Erd?s and Moser (J Aust Math Soc 11:42–47, 1970) determined the minimum number of edges in a graph on n vertices such that every k-set is covered. We extend this result to r-uniform hypergraphs on sufficiently many vertices, and determine the extremal hypergraphs. We also address the problem for directed graphs.