Related papers: There is No McLaughlin Geometry

Let $\Omega \subset \mathbb{R}^N$, $N \geq 2$, be a smooth bounded domain. For $s \in (1/2,1)$, we consider a problem of the form \[ \left\{\begin{aligned} (-\Delta)^s u & = \mu(x)\, \mathbb{D}_s^{2}(u) + \lambda f(x)\,, & \quad \mbox{in}…

We prove that a distance-regular graph with intersection array {56,36,9;1,3,48} does not exist. This intersection array is from the table of feasible parameters for distance-regular graphs in "Distance-regular graphs"\ by A.E. Brouwer, A.M.…

We show a non existence result for solutions of the prescribed mean curvature equation in the product manifold $\mathbb{H}^2 \times \R$, where $\mathbb{H}^2$ is the real hyperbolic plane. More precisely we prove a-priori estimates for…

We define, for any graph $G=(V,E)$, a boundary $\partial G \subseteq V$. The definition coincides with what one would expected for the discretization of (sufficiently nice) Euclidean domains and contains all vertices from the…

Let $G$ be a graph with adjacency matrix $A(G)$ and let $D(G)$ be the diagonal matrix of the degrees of $G$. For every real $\alpha\in\left[ 0,1\right] $, write $A_{\alpha}\left( G\right) $ for the matrix \[ A_{\alpha}\left( G\right)…

The purpose of this paper is to prove some results on the absence of bound states for certain nonlinear Schr\"odinger equations on noncompact metric graphs with localized nonlinearity. In particular, we show how the topological and metric…

DISCLAIMER: Due to an error in the literature, we cannot be sure that the conclusions drawn in this paper are correct. The goal of this note is to connect some interesting results in the literature on algebraic graph theory and finite…

A Kaehler metric $g$ with integral Kaehler form is said to be partially regular if the partial Bergman kernel associated to mg is a positive constant for all integer m sufficiently large. The aim of this paper is to prove that for all n\geq…

The problem of arrangement of a real algebraic curve on a real algebraic surface is related to the 16th Hilbert problem. We prove in this paper new restrictions on arrangement of nonsingular real algebraic curves on an ellipsoid. These…

In this paper, we introduce the graph $G(S)$ of a bounded semilattice $S$, which is a generalization of the intersection graph of the substructures of an algebraic structure. We prove some general theorems about these graphs; as an example,…

We initiate the study of the following problem: Given a non-planar graph G and a planar subgraph S of G, does there exist a straight-line drawing {\Gamma} of G in the plane such that the edges of S are not crossed in {\Gamma} by any edge of…

Let $G$ be a graph and $\gamma (G)$ denote the domination number of $G$, i.e. the cardinality of a smallest set of vertices $S$ such that every vertex of $G$ is either in $S$ or adjacent to a vertex in $S$. Matheson and Tarjan conjectured…

Let $P$ be a set of $n$ points in general position in the plane. Given a convex geometric shape $S$, a geometric graph $G_S(P)$ on $P$ is defined to have an edge between two points if and only if there exists an empty homothet of $S$ having…

Given a strict partial order $\Delta$ on a set $\Lambda$ and an arbitrary ring $R$ with $1\neq 0$, the corresponding McLain group $M(\Delta)$ has been studied in depth. We construct a larger family of McLain groups $G(\Delta)$, where…

Recently, we have shown that there do not exist the warped product semi-slant submanifolds of cosymplectic manifolds [10]. As nearly cosymplectic structure generalizes cosymplectic ones same as nearly Kaehler generalizes Kaehler structure…

In this paper we show that a nonlocal minimal surface which is a graph outside a cylinder is in fact a graph in the whole of the space. As a consequence, in dimension~$3$, we show that the graph is smooth. The proofs rely on convolution…

In this paper we study the non-existence of solutions to the Dirichlet problem for minimal graphs of codimension $\geq 2$, including certain situations over domain $\Omega$ even with non-$C^1$ boundary $\partial \Omega$.

Given a polyhedron (planar, $3$-connected graph) $G$, we investigate its common neighbourhood graph con($G$). For cubic ($3$-regular) polyhedra, we show that the planarity of con($G$) depends on the number of odd faces of $G$, and on their…

This introduction to graphs and graph algebras provides the optimal bound for the number of all paths of length $k$ in a graph with $N\geq k$ edges and no loops. Our proof relies on a construction of a number of terminating algorithms that…

A geometric graph is a graph drawn in the plane with vertices represented by points and edges as straight-line segments. A geometric graph contains a (k,l)-crossing family if there is a pair of edge subsets E_1,E_2 such that |E_1| = k and…