English
Related papers

Related papers: Removable singularities for nonlocal minimal graph…

200 papers

It is well known that sets of $p$-capacity zero are removable for bounded $p$-harmonic functions, but on metric spaces there are examples of removable sets of positive capacity. In this paper, we show that this can happen even on unweighted…

Analysis of PDEs · Mathematics 2023-02-15 Anders Björn

Recently M.E. Shirokov introduced the non-commutative operator graph depending on the complex parameter $\theta $ to construct channels with positive quantum zero-error capacity having vanishing n-shot capacity. We study the algebraic…

Quantum Physics · Physics 2016-06-01 Grigori G. Amosov , I. Yu. Zhdanovskiy

Let G be a locally compact group, and let U be its unitary representation on a Hilbert space H. Endow the space L(H) of linear bounded operators on H with weak operator topology. We prove that if U is a measurable map from G to L(H) then it…

Functional Analysis · Mathematics 2021-05-27 Yulia Kuznetsova

Let $G$ be a non-abelian group and $Z(G)$ be the center of $G$. The non-commuting graph $\Gamma_G$ associated to $G$ is the graph whose vertex set is $G\setminus Z(G)$ and two distinct elements $x,y$ are adjacent if and only if $xy\neq yx$.…

Group Theory · Mathematics 2013-04-18 Alireza Abdollahi , Hamid Shahverdi

In this paper, we study meromorphic functions on a domain $\Omega \subset \mathbb{C}$ whose image has finite spherical area, counted with multiplicity. The paper is composed of two parts. In the first part, we show that the limit of a…

Complex Variables · Mathematics 2022-11-03 Oleg Ivrii

A graph ${\mathcal G}$ is locally X if the graphs induced on the neighbours of every vertex of ${\mathcal G}$ are isomorphic to the graph $X$. We prove that the infinite family of incidence graphs of the $r$-rank incidence geometries,…

Combinatorics · Mathematics 2018-11-29 Natalia Garcia-Colin , Dimitri Leemans

Let $G$ be a finite group. The solubility graph associated with the finite group $G$, denoted by $\Gamma_{\cal S}(G)$, is a simple graph whose vertices are the non-trivial elements of $G$, and there is an edge between two distinct elements…

Group Theory · Mathematics 2020-03-04 B. Akbari , Mark L. Lewis , J. Mirzajani , A. R. Moghaddamfar

Given a finite set $E$, a subset $D\sub E$ (viewed as a function $E\to \F_2$) is orthogonal to a given subspace $\FF$ of the $\F_2$-vector space of functions $E\to \F_2$ as soon as $D$ is orthogonal to every $\sub$-minimal element of $\FF$.…

Combinatorics · Mathematics 2013-08-14 Reinhard Diestel , Julian Pott

Let $\Gamma$ be a simple connect graph on a finite vertex set $V$ and let $A$ be its adjacency matrix. Then $\Gamma$ is said to be \textit{singular} if and only if $0$ is an eigenvalue of $A.$ The \textit{nullity (singularity)} of $\Gamma,$…

Combinatorics · Mathematics 2018-10-09 Ali Sltan Ali AL-Tarimshawy

A graph is a ``$k$-Kuratowski graph'' if it has exactly $k$ components, each isomorphic to $K_5$ or to $K_{3,3}$. We prove that if a graph $G$ contains no $k$-Kuratowski graph as a minor,then there is a set $X$ of boundedly many vertices…

Combinatorics · Mathematics 2024-05-10 Neil Robertson , Paul Seymour

We study the geometry and dynamics of discrete subgroups $\Gamma$ of $\PSL(3,\mathbb{C})$ with an open invariant set $\Omega \subset \PC^2$ where the action is properly discontinuous and the quotient $\Omega/\Gamma$ contains a connected…

Dynamical Systems · Mathematics 2012-09-07 Angel Cano , José Seade

We investigate the structure of $\omega$-limit (resp. $\alpha$-limit) sets for a monotone map $f$ on a regular curve $X$. %Let $X$ be a regular curve and let $f: X\longrightarrowX$ be a monotone map. We show that for any $x\in X$ (resp. for…

Dynamical Systems · Mathematics 2021-06-24 Aymen Daghar , Habib Marzougui

Local certification consists in assigning labels to the nodes of a network to certify that some given property is satisfied, in such a way that the labels can be checked locally. In the last few years, certification of graph classes…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-09-14 Nicolas Bousquet , Laurent Feuilloley , Théo Pierron

We prove the existence and uniqueness of geometric models of local isometry classes of locally homogeneous spaces with sectional curvature $|\operatorname{sec}|\leq 1$. Moreover, we show that the set of geometric models is compact in the…

Differential Geometry · Mathematics 2021-01-19 Francesco Pediconi

We prove an arithmetic removal result for all compact abelian groups, generalizing a finitary removal result of Kr\'al', Serra and the third author. To this end, we consider infinite measurable hypergraphs that are invariant under certain…

Combinatorics · Mathematics 2015-07-28 Pablo Candela , Balázs Szegedy , Lluís Vena

In this paper, we define natural capacities using a relative volume of graphs over manifolds, which can be characterized by solutions of bounded variation to Dirichlet problems of minimal hypersurface equation. Using the capacities, we…

Differential Geometry · Mathematics 2023-08-30 Qi Ding

Let $G$ be a finite non-solvable group with solvable radical $Sol(G)$. The solvable graph $\Gamma_s(G)$ of $G$ is a graph with vertex set $G\setminus Sol(G)$ and two distinct vertices $u$ and $v$ are adjacent if and only if $\langle u, v…

Group Theory · Mathematics 2019-03-06 Parthajit Bhowal , Deiborlang Nongsiang , Rajat Kanti Nath

Consider a `dense' Erd\H{o}s--R\'enyi random graph model $G=G_{n,M}$ with $n$ vertices and $M$ edges, where we assume the edge density $M/\binom{n}{2}$ is bounded away from 0 and 1. Fix $k=k(n)$ with $k/n$ bounded away from 0 and~1, and let…

Combinatorics · Mathematics 2025-04-01 Paul Balister , Emil Powierski , Alex Scott , Jane Tan

One of the major results of [N. Robertson and P. D. Seymour. Graph minors. XIII. The disjoint paths problem. J. Combin. Theory Ser. B, 63(1):65--110, 1995], also known as the weak structure theorem, revealed the local structure of graphs…

Combinatorics · Mathematics 2011-03-01 Archontia C. Giannopoulou , Dimitrios M. Thilikos

A graph $G = (V,E)$ is globally rigid in $\mathbb{R}^d$ if for any generic placement $p : V \rightarrow \mathbb{R}^d$ of the vertices, the edge lengths $||p(u) - p(v)||, uv \in E$ uniquely determine $p$, up to congruence. In this paper we…

Combinatorics · Mathematics 2025-02-14 Dániel Garamvölgyi , Tibor Jordán
‹ Prev 1 3 4 5 6 7 10 Next ›