English
Related papers

Related papers: The closed graph function from plane with the netw…

200 papers

A result is given to find points where a real valued function on the plane is not smooth. Provided this function is induced by a smooth mapping from three dimensions to the plane, from a function on surfaces in three dimensions. This has…

Differential Geometry · Mathematics 2009-03-12 Burzin Bhavnagri

It is shown that a set in product of $n$ metrizable spaces is the discontinuity points set of some separately continuous function if and only if this set can be represented as the union of a sequence of $F_{\sigma}$-sets which are locally…

General Topology · Mathematics 2015-12-29 V. K. Maslyuchenko , V. V. Mykhaylyuk

The $L^2$-zeta function of an infinite graph Y (defined previously in a ball around zero) has an analytic extension. For a tower of finite graphs covered by Y, the normalized zeta functions of the finite graphs converge to the $L^2$-zeta…

Number Theory · Mathematics 2007-05-23 Bryan Clair , Shahriar Mokhtari-Sharghi

Generalized (rational) graph contractions in the framework of a dislocated metric space endowed with a directed graph are investigated. Fixed point results for set-contractions are obtained. We also provide some examples to illustrate our…

Combinatorics · Mathematics 2023-08-09 Talat Nazir , Zakaria Ali , Shahin Nosrat Jogan , Sergei Silvestrov

We prove a fixed point theorem for closed-graphed, decomposable-valued correspondences whose domain and range is a decomposable set of functions from an atomless measure space to a topological space. One consequence is an improvement of the…

Functional Analysis · Mathematics 2013-06-20 Idione Meneghel , Rabee Tourky

We prove that a function $f:X\to Y$ from a first-countable (more generally, Preiss-Simon) space $X$ to a regular space $Y$ is weakly discontinuous (which means that every subspace $A\subset X$ contains an open dense subset $U\subset A$ such…

General Topology · Mathematics 2017-06-21 Taras Banakh , Bogdan Bokalo

The theory of graphons has proven to be a powerful tool in many areas of graph theory. In this paper, we introduce several foundational aspects of the theory of digraphons -- asymmetric two-variable functions that arise as limits of…

Combinatorics · Mathematics 2025-12-16 Jan Hladký , Petr Savický

Let $x,y\in(0,1]$ and let $A,B,C$ be disjoint nonempty subsets of a graph $G$, where every vertex in $A$ has at least $x|B|$ neighbours in $B$, and every vertex in $B$ has at least $y|C|$ neighbours in $C$. We denote by $\phi(x,y)$ the…

Combinatorics · Mathematics 2020-12-08 Maria Chudnovsky , Patrick Hompe , Alex Scott , Paul Seymour , Sophie Spirkl

Let X and Y be compact, simply connected and locally connected subsets of R^2, and let f : X -> Y be a homeomorphism isotopic to the identity on X. Generalizing Brouwer's plane translation theorem for self-maps of the plane, we prove that f…

Dynamical Systems · Mathematics 2013-05-06 Georg Ostrovski

The zero locus of a function f on a graph G is defined as the graph with vertex set consisting of all complete subgraphs of G, on which f changes sign and where x,y are connected if one is contained in the other. For d-graphs, finite simple…

Discrete Mathematics · Computer Science 2015-08-25 Oliver Knill

Let $M$ be a graph manifold such that each piece of its JSJ decomposition has the $\Bbb H^2 \times \Bbb R$ geometry. Assume that the pieces are glued by isometries. Then, there exists a complete Riemannian metric on $\Bbb R \times M$ which…

Differential Geometry · Mathematics 2020-11-18 Koji Fujiwara , Takashi Shioya

We extend the closed graph theorem and the open mapping theorem to a context in which a natural duality interchanges their extensions.

Functional Analysis · Mathematics 2019-12-06 R. S. Monahan , P. L. Robinson

We define the notion of affine rigidity of a hypergraph and prove a variety of fundamental results for this notion. First, we show that affine rigidity can be determined by the rank of a specific matrix which implies that affine rigidity is…

Computational Geometry · Computer Science 2013-08-14 Steven J. Gortler , Craig Gotsman , Ligang Liu , Dylan P. Thurston

The {\em disjointness graph} of a set system is a graph whose vertices are the sets, two being connected by an edge if and only if they are disjoint. It is known that the disjointness graph $G$ of any system of segments in the plane is {\em…

Combinatorics · Mathematics 2021-12-14 János Pach , Gábor Tardos , Géza Tóth

Let S denote the family of all subspaces of the plane that are graphs of functions from the real line R to itself. We prove that S has two subfamilies G,H of spaces such that the cardinality of G is c (the cardinality of the continuum) and…

General Topology · Mathematics 2026-03-12 Gerald Kuba

We study the question of reconstructing a weighted, directed network up to isomorphism from its motifs. In order to tackle this question we first relax the usual (strong) notion of graph isomorphism to obtain a relaxation that we call weak…

Discrete Mathematics · Computer Science 2022-12-20 Samir Chowdhury , Facundo Mémoli

A tuple (s1,t1,s2,t2) of vertices in a simple undirected graph is 2-linked when there are two vertex-disjoint paths respectively from s1 to t1 and s2 to t2. A graph is 2-linked when all such tuples are 2-linked. We give a new and simple…

Data Structures and Algorithms · Computer Science 2025-08-15 Samuel Humeau , Damien Pous

A function $f:X\to Y$ between topological spaces is said to be a {\it weakly Gibson function} if $f(\overline{G})\subseteq \overline{f(G)}$ for any open connected set \mbox{$G\subseteq X$}. We call a function $f:X\to Y$ {\it segmentary…

General Topology · Mathematics 2014-07-25 Olena Karlova , Volodymyr Mykhaylyuk

We show that the space of continuous functions over a compact space X admits an equivalent pointwise-lowersemicontinuous locally uniformly rotund norm whenever X admits a fully closed map onto a compact Y such that C(Y) and the spaces of…

Functional Analysis · Mathematics 2023-12-27 Todor Manev

Free-minor closed classes [2] and free-planar graphs [3] are considered. Versions of Kuratowski-like theorem for free-planar graphs and Kuratowski theorem for planar graphs are considered.

Combinatorics · Mathematics 2009-09-03 Dainis Zeps