相关论文: There is No McLaughlin Geometry

We provide an explicit construction of finite 4-regular graphs $(\Gamma_k)_{k\in \mathbb N}$ with ${girth \Gamma_k\to\infty}$ as $k\to\infty$ and $\frac{diam \Gamma_k}{girth \Gamma_k}\leqslant D$ for some $D>0$ and all $k\in\mathbb{N}$. For…

A lifting of a semilattice S is an algebra A such that the semilattice of compact (=finitely generated) congruences of A is isomorphic to S. The aim of this work is to give a categorical theory of partial algebras endowed with a partial…

Let $L$ be a compact oriented Lagrangian surface in a K\"ahler surface endowed with a complete Riemannian metric (compatible with the symplectic structure and the complex structure) with bounded sectional curvatures and a positive lower…

In this paper, we address problems related to parameters concerning edge mappings of graphs. The quantity $h(n,G)$ is defined to be the maximum number of edges in an $n$-vertex graph $H$ such that there exists a mapping $f: E(H)\rightarrow…

The attempts to prove the Four Color Problem last for long years. A little hope arises that the properties of the minimal partial triangulations will be very useful for the solution of the Four Color Problem. That is why the material of…

A triangle decomposition of a graph is a partition of its edges into triangles. A fractional triangle decomposition of a graph is an assignment of a non-negative weight to each of its triangles such that the sum of the weights of the…

We provide sharp bounds for the isoperimetric constants of infinite plane graphs (tessellations) with bounded vertex and face degrees. For example, if $G$ is a plane graph satisfying the inequalities $p_1 \leq \mbox{deg}\ v \leq p_2$ for $v…

One unsolved mathematical problem remains the perfect cuboid problem. A perfect cuboid is a rectangular parallelepiped whose edges, face diagonals and space diagonal are all expressed as integers. No such cuboid has yet been discovered and…

A planar orthogonal drawing of a planar 4-graph G (i.e., a planar graph with vertex-degree at most four) is a crossing-free drawing that maps each vertex of G to a distinct point of the plane and each edge of $G$ to a sequence of horizontal…

This paper surveys results related to well-known works of B. Plotkin and V. Remeslennikov on the edge of algebra, logic and geometry. We start from a brief review of the paper and motivations. The first sections deal with model theory. In…

Let $E$ be a directed graph, $\mathbb K$ be a field, and $\mathbb F$ be the free group on the edges of $E$. In this work, we use the isomorphism between Leavitt path algebras and partial skew group rings to endow $L_{\mathbb K}(E)$ with an…

In this article, we aim at obtaining the analytical expressions ({\bf not previously found and not recorded in the literature}) for the exact curved surface area of a hemiellpsoid in terms of Appell's double hypergeometric function of first…

Given a simple graph $G$, the {\it irregularity strength} of $G$, denoted by $s(G)$, is the least positive integer $k$ such that there is a weight assignment on edges $f: E(G) \to \{1,2,\dots, k\}$ attributing distinct weighted degrees:…

We study $ \mathcal{H}ol(\Gamma\cup\text{Int}(\Gamma)) $, the normed algebra of all holomorphic functions defined on some simply connected neighbourhood of a simple closed curve $\Gamma$ in $\mathbb{C} $, equipped with the supremum norm on…

Let $P$ be a set of $n$ points in the plane. A geometric graph $G$ on $P$ is said to be {\it locally Gabriel} if for every edge $(u,v)$ in $G$, the disk with $u$ and $v$ as diameter does not contain any points of $P$ that are neighbors of…

We prove a nonexistence result for nonnegative solutions of the quasi-linear elliptic inequality \[ -\Delta_p u\ge u^\sigma \] on infinite locally finite connected weighted graphs, where $1<p<\infty$ and $\sigma>p-1$. Under the…

We study graphs that are simultaneously regular with respect to the ordinary vertex degree and regular with respect to the triangle degree, that is, the number of triangles containing a given vertex. We call such graphs regular…

For $S \subset \mathbb{R}^n$ and $d > 0$, denote by $G(S, d)$ the graph with vertex set $S$ with any two vertices being adjacent if and only if they are at a Euclidean distance $d$ apart. Deem such a graph to be ``non-trivial" if $d$ is…

Let $f(n,k)$ be the minimum number of edges that must be removed from some complete geometric graph $G$ on $n$ points, so that there exists a tree on $k$ vertices that is no longer a planar subgraph of $G$. In this paper we show that…

We introduce real-valued $(p,q)$-forms on weighted metric graphs with boundary similar to Lagerberg forms on polyhedral spaces. We compute the Dolbeault cohomology and prove Poincar\'e duality. Using Thuillier's thesis, the skeleton of a…