English
Related papers

Related papers: A graphon counter example

200 papers

We define a weakly threshold sequence to be a degree sequence $d=(d_1,\dots,d_n)$ of a graph having the property that $\sum_{i \leq k} d_i \geq k(k-1)+\sum_{i > k} \min\{k,d_i\} - 1$ for all positive $k \leq \max\{i:d_i \geq i-1\}$. The…

Combinatorics · Mathematics 2023-06-22 Michael D. Barrus

For all integers $g \geq 6$ we prove the existence of a metric graph $G$ with $w^1_4=1$ such that $G$ has Clifford index 2 and there is no tropical modification $G'$ of $G$ such that there exists a finite harmonic morphism of degree 2 from…

Algebraic Geometry · Mathematics 2015-01-16 Marc Coppens

The article contains a construction of a self-similar dendryte which cannot be the attractor of any self-similar zipper.

Geometric Topology · Mathematics 2008-12-15 O. Purevdorj , A. V. Tetenov

Staircase words are words in which consecutive letters do not differ by more than $1$. We generalize this by extending the restriction to letters lying further apart from each other and obtain the corresponding generating functions, which…

Combinatorics · Mathematics 2025-02-04 Sela Fried

We study sampling methods for Paley-Wiener functions on graphons, thereby adapting and generalizing methods initially developed for graphs to the graphon setting. We then derive conditions under which such a sampling estimate is consistent…

Signal Processing · Electrical Eng. & Systems 2025-02-11 Hartmut Führ , Mahya Ghandehari

We construct an example of a subperiodic tree whose intermediate branching number is strictly less than the lower intermediate growth rate. This answers a question of Amir and Yang (2022) in the negative.

Probability · Mathematics 2024-02-06 Pengfei Tang

The Takagi function is a classical example of a continuous nowhere differentiable function. In this paper we prove that it is nowhere approximately derivable.

Classical Analysis and ODEs · Mathematics 2019-06-26 Juan Ferrera , Javier Gómez Gil

The inverse degree of a graph is the sum of the reciprocals of the degrees of its vertices. We prove that in any connected planar graph, the diameter is at most 5/2 times the inverse degree, and that this ratio is tight. To develop a…

Combinatorics · Mathematics 2010-06-15 Radoslav Fulek , Filip Morić , David Pritchard

In his Ph.D. thesis, Farber proved that every strongly chordal graph can be represented as intersection graph of subtrees of a weighted tree, and these subtrees are ``compatible''. Moreover, this is an equivalent characterization of…

Combinatorics · Mathematics 2025-03-13 Therese Biedl

These are classified by the direction of approximation (from above or below), the set family types (partition or covering) of simple functions, the coefficient signature (non-negative or signed), and cardinal number of terms of simple…

General Mathematics · Mathematics 2021-08-23 Ryoji Fukuda

For metric spaces with curvature less than or equal to x, x<0, it is shown that a recurrent geodesic can be approximated by closed geodesics. A counter example is provided for the converse.

Geometric Topology · Mathematics 2007-05-23 Ch. Charitos , G. Tsapogas

We extend the definition of weak symmetric continuity to be applicable for functions defined on any nonempty subset of $\R$. Then we investigate basic properties of weakly symmetrically continuous functions and compare them with those of…

Classical Analysis and ODEs · Mathematics 2014-05-29 Prapanpong Pongsriiam , Teraporn Thongsiri

The parametric geometry of numbers has allowed to visualize the simultaneous approximation properties of a collection of real numbers through the combined graph of the related successive minima functions. Several inequalities among…

Number Theory · Mathematics 2021-03-18 Wolfgang M. Schmidt , Leonhard Summerer

We give a language for geometry which makes curves and number fields look alike.

Number Theory · Mathematics 2009-11-19 Shai M. J. Haran

In comparing well-known CRDTs representing sets that can grow and shrink, we find caveats. In one, the removal of an element cannot be reliably undone. In another, undesirable states are attainable, such as when an element is present -1…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-06-19 Stephen Dolan

For every positive integer $n$, we find a complete classification for planar graphs according to the collection of numbers of common neighbours for every $n$-tuple of distinct vertices. Our results expand the literature on planar graphical…

Combinatorics · Mathematics 2025-11-25 Riccardo W. Maffucci

We give conditions on a knot on which the Morton-Franks-Williams inequality is not sharp. As applications, we show infinitely many examples of knots where the inequality is not sharp and also prove (by giving examples) that the deficit of…

Geometric Topology · Mathematics 2007-05-23 Keiko Kawamuro

A graphon satisfies the $H$-property if graphs sampled from it contain a Hamiltonian decomposition almost surely, which in turn implies that the corresponding network topologies are, e.g., structurally stable and structurally ensemble…

Optimization and Control · Mathematics 2024-02-16 Mohamed-Ali Belabbas , Xudong Chen

A finite non-increasing sequence of positive integers $d = (d_1\geq \cdots\geq d_n)$ is called a degree sequence if there is a graph $G = (V,E)$ with $V = \{v_1,\ldots,v_n\}$ and $deg(v_i)=d_i$ for $i=1,\ldots,n$. In that case we say that…

Combinatorics · Mathematics 2021-01-08 Atabey Kaygun

In this short note we show how the higher index theory can be used to prove results concerning the non-existence of complete riemannian metric with uniformly positive scalar curvature at infinity. By improving some classical results due to…

Differential Geometry · Mathematics 2009-12-18 Mostafa Esfahani Zadeh