English
Related papers

Related papers: Combinatorial modifications of Reeb graphs and the…

200 papers

Let $M$ be a compact two-dimensional manifold and, $f \in C^{\infty}(M,\mathbb{R})$ be a Morse function, and $\Gamma_f$ be its Kronrod-Reeb graph. Denote by $\mathcal{O}_{f}=\{f \circ h \mid h \in \mathcal{D}\}$ the orbit of $f$ with…

Geometric Topology · Mathematics 2019-12-16 Anna Kravchenko , Sergiy Maksymenko

Graphings serve as limit objects for bounded-degree graphs. We define the ``cycle matroid'' of a graphing as a submodular setfunction, with values in [0,1], which generalizes (up to normalization) the cycle matroid of finite graphs. We…

Combinatorics · Mathematics 2023-11-08 László Lovász

We prove that the Reeb space of a proper definable map $f:X \rightarrow Y$ in an arbitrary o-minimal expansion of a real closed field is realizable as a proper definable quotient. This result can be seen as an o-minimal analog of Stein…

Algebraic Topology · Mathematics 2020-07-29 Saugata Basu , Nathanael Cox , Sarah Percival

In our paper, we construct a real-algebraic function whose Reeb (Kronrod-Reeb) graph is a graph respecting some algebraic domain: a graph for this is called Poincar\'e-Reeb graph. The Reeb graph of a smooth function is defined as a natural…

General Topology · Mathematics 2023-02-21 Naoki Kitazawa

To investigate the topological structure of Morse functions on the projective plane we use the Reeb graphs. We describe it properties and prove that it is a complete topological invariant of simple Morse function on $\mathbb{R} P^2$. We…

Geometric Topology · Mathematics 2023-03-08 Svitlana Bilun , Alexandr Prishlyak , Serhii Stas , Alina Vlasenko

We develop a new purely combinatorial approach to N. Steenrod's problem on realisation of cycles. We prove that every n-dimensional homology class of every topological space can be realised with some multiplicity by an image of a…

Algebraic Topology · Mathematics 2024-11-20 Alexander A. Gaifullin

We show that for any closed surface of genus greater than one and for any finite weighted graph filling the surface, there exists a hyperbolic metric which realizes the least Dirichlet energy harmonic embedding of the graph among a fixed…

Differential Geometry · Mathematics 2020-07-27 Toru Kajigaya , Ryokichi Tanaka

As a branch of algebraic and differential topology of manifolds, the theory of Morse functions and their higher dimensional versions or fold maps and its application to algebraic and differential topology of manifolds is fundamental,…

K-Theory and Homology · Mathematics 2020-05-26 Naoki Kitazawa

We conjecture that the balanced complete bipartite graph $K_{\lfloor n/2 \rfloor,\lceil n/2 \rceil}$ contains more cycles than any other $n$-vertex triangle-free graph, and we make some progress toward proving this. We give equivalent…

Combinatorics · Mathematics 2014-10-30 Stephane Durocher , David S. Gunderson , Pak Ching Li , Matthew Skala

Let C be a general curve of genus g, embedded in P^r via a general linear series of degree d. In this paper, we prove the Maximal Rank Conjecture, which determines the Hilbert function of C.

Algebraic Geometry · Mathematics 2018-09-20 Eric Larson

From a graph $G$ with constant valency $v$ and a (non-compact) manifold $C$ with $v$ boundary components, we build a $G$-periodic manifold $M$. This process gives a class of topologically infinite manifolds which generalizes periodic…

Differential Geometry · Mathematics 2010-01-15 Samuel Tapie

Let $G$ be a connected graph and $\mathcal{P}(G)$ a graph parameter. We say that $\mathcal{P}(G)$ is feasible if $\mathcal{P}(G)$ satisfies the following properties: (I) $\mathcal{P}(G)\leq \mathcal{P}(G_{uv})$, if $G_{uv}=G[u\to v]$ for…

Combinatorics · Mathematics 2026-04-09 Jiangdong Ai , Hui Lei , Bo Ning , Yongtang Shi

Let $M$ be a compact connected orientable Seifert manifold with hyperbolic orbifold $B_M$, and $f_{\pi}: \pi_1(M)\rightarrow\pi_1(M)$ be an automorphism induced by an orientation-reversing homeomorphism $f$ of $M$. We give a bound on the…

Geometric Topology · Mathematics 2019-06-24 Qiang Zhang

The max-cut problem is a classical graph theory problem which is NP-complete. The best polynomial time approximation scheme relies on \emph{semidefinite programming} (SDP). We study the conditions under which graphs of certain classes have…

Optimization and Control · Mathematics 2021-09-07 Daniel Hong , Hyunwoo Lee , Alex Wei

In this paper, we prove that for every $k$ and every graph $H$ with $m$ edges and no isolated vertices, the Ramsey number $R(C_k,H)$ is at most $2m+\lfloor \frac{k-1}{2} \rfloor$, provided $m$ is sufficiently large with respect to $k$. This…

Combinatorics · Mathematics 2026-01-16 Stijn Cambie , Andrea Freschi , Patryk Morawski , Kalina Petrova , Alexey Pokrovskiy

We offer a new, gradual approach to the largest girth problem for cubic graphs. It is easily observed that the largest possible girth of all $n$-vertex cubic graphs is attained by a $2$-connected graph $G=(V,E)$. By Petersen's graph…

Combinatorics · Mathematics 2022-06-30 Aya Bernstine , Nati Linial

We show that for any countable homogeneous ordered graph $G$, the conjugacy problem for automorphisms of $G$ is Borel complete. In fact we establish that each such $G$ satisfies a strong extension property called ABAP, which implies that…

Logic · Mathematics 2019-08-16 Samuel Coskey , Paul Ellis

Reeb graphs are structural descriptors that capture shape properties of a topological space from the perspective of a chosen function. In this work we define a combinatorial metric for Reeb graphs of orientable surfaces in terms of the cost…

Computational Geometry · Computer Science 2014-11-07 Barbara Di Fabio , Claudia Landi

Let $M$ be a closed connected manifold, $f$ be a Morse map from $M$ to a circle, $v$ be a gradient-like vector field satisfying the transversality condition. The Novikov construction associates to these data a chain complex $C_*=C_*(f,v)$.…

Differential Geometry · Mathematics 2007-05-23 A. Pajitnov

In a graph whose vertices are assigned integer ranks, a path is well-ranked if the endpoints have distinct ranks or some interior point has a higher rank than the endpoints. A ranking is an assignment of ranks such that all nontrivial paths…

Combinatorics · Mathematics 2016-07-26 Jordan Almeter , Samet Demircan , Andrew Kallmeyer , Kevin G. Milans , Robert Winslow