中文
相关论文

相关论文: On the Wu invariants for immersions of a graph int…

200 篇论文

We study families of superelliptic curves with fixed automorphism groups. Such families are parametrized with invariants expressed in terms of the coefficients of the curves. Algebraic relations among such invariants determine the lattice…

代数几何 · 数学 2012-09-05 Lubjana Beshaj , Valmira Hoxha , Tony Shaska

We study embeddings of a graph $G$ in a surface $S$ by considering representatives of different classes of $H_1(S)$ and their intersections. We construct a matrix invariant that can be used to detect homological invariance of elements of…

组合数学 · 数学 2015-01-07 Steven Schluchter

A coloured graph is k-ultrahomogeneous if every isomorphism between two induced subgraphs of order at most k extends to an automorphism. A coloured graph is t-tuple regular if the number of vertices adjacent to every vertex in a set S of…

组合数学 · 数学 2021-02-23 Irene Heinrich , Thomas Schneider , Pascal Schweitzer

We show that the groupoids of two directed graphs are isomorphic if and only if the two graphs are orbit equivalent by an orbit equivalence that preserves isolated eventually periodic points. We also give a complete description of the…

动力系统 · 数学 2018-10-08 Toke Meier Carlsen , Marius Lie Winger

Implementing an idea due to John Baez and James Dolan we define new invariants of Whitney stratified manifolds by considering the homotopy theory of smooth transversal maps. To each Whitney stratified manifold we assign transversal homotopy…

代数拓扑 · 数学 2009-10-20 Jonathan Woolf

Over all graphs (or unicyclic graphs) of a given order, we characterise those graphs that minimise or maximise the number of connected induced subgraphs. For each of these classes, we find that the graphs that minimise the number of…

组合数学 · 数学 2019-09-18 Audace A. V. Dossou-Olory

Modern methods of graph theory describe a graph up to isomorphism, which makes it difficult to create mathematical models for visualizing graph drawings on a plane. The topological drawing of the planar part of a graph allows representing…

组合数学 · 数学 2024-08-01 Sergey Kurapov , Maxim Davidovsky

We determine all possible triples of depth, dimension, and regularity of edge ideals of weighted oriented graphs with a fixed number of vertices. Also, we compute all the possible Betti table sizes of edge ideals of weighted oriented trees…

交换代数 · 数学 2025-04-18 Trung Chau , Richie Sheng , Deborah Wooton

A map is a connected topological graph cellularly embedded in a surface and a complete map is a cellularly embedded complete graph in a surface. In this paper, all automorphisms of complete maps of order n are determined by permutations on…

综合数学 · 数学 2009-09-29 Linfan Mao , Yanpei Liu , Feng Tian

Kuo introduced his 4-point condensation in 2003 for bipartite planar graphs. In 2006 Kuo generalized this 4-point condensation to planar graphs that are not necessarily bipartite. His formula expressed the product between the number of…

组合数学 · 数学 2014-04-22 Mihai Ciucu

Unpublished results of S Straus and W Browder state that two notions of homotopy equivalence for manifolds with smooth group actions - isovariant and equivariant - often coincide under a condition called the Gap Hypothesis; the proofs use…

几何拓扑 · 数学 2009-04-06 Reinhard Schultz

In the paper, we investigate properties of the nine-dimensional variety of the inflection points of the plane cubic curves. The description of local monodromy groups of the set of inflection points near singular cubic curves is given. Also,…

代数几何 · 数学 2020-01-08 Vik. S. Kulikov

Recently Bowden, Hensel and Webb defined the fine curve graph for surfaces, extending the notion of curve graphs for the study of homeomorphism or diffeomorphism groups of surfaces. Later Long, Margalit, Pham, Verberne and Yao proved that…

几何拓扑 · 数学 2024-12-25 Frédéric Le Roux , Maxime Wolff

A graph is said to be globally rigid if almost all embeddings of the graph's vertices in the Euclidean plane will define a system of edge-length equations with a unique (up to isometry) solution. In 2007, Jackson, Servatius and Servatius…

组合数学 · 数学 2024-01-29 Sean Dewar

In the first part of the paper, we give an explicit algorithm to compute the (genus zero) Gromov-Witten invariants of blow-ups of an arbitrary convex projective variety in some points if one knows the Gromov-Witten invariants of the…

代数几何 · 数学 2009-09-25 Andreas Gathmann

Computing a morph between two drawings of a graph is a classical problem in computational geometry and graph drawing. While this problem has been widely studied in the context of planar graphs, very little is known about the existence of…

计算几何 · 计算机科学 2021-05-28 Patrizio Angelini , Michael A. Bekos , Fabrizio Montecchiani , Maximilian Pfister

The $k$-dimensional Weisfeiler-Leman algorithm is a powerful tool in graph isomorphism testing. For an input graph $G$, the algorithm determines a canonical coloring of $s$-tuples of vertices of $G$ for each $s$ between 1 and $k$. We say…

计算复杂性 · 计算机科学 2020-05-20 Frank Fuhlbrück , Johannes Köbler , Oleg Verbitsky

The main intention of the paper is to investigate an osculating curve under the conformal map. We obtain a sufficient condition for the conformal invariance of an osculating curve. We also find an equivalent system of a geodesic curve under…

综合数学 · 数学 2020-03-18 Absos Ali Shaikh , Mohamd Saleem Lone , Pinaki Ranjan Ghosh

We introduce four invariants of algebraic varieties over imperfect fields, each of which measures either geometric non-normality or geometric non-reducedness. The first objective of this article is to establish fundamental properties of…

代数几何 · 数学 2020-10-14 Hiromu Tanaka

Graph embeddings, wherein the nodes of the graph are represented by points in a continuous space, are used in a broad range of Graph ML applications. The quality of such embeddings crucially depends on whether the geometry of the space…

机器学习 · 统计学 2022-02-03 Francesco Di Giovanni , Giulia Luise , Michael Bronstein