中文
相关论文

相关论文: A simpler $\mathbb R^3$ realization of the M\"obiu…

200 篇论文

Generalized M\"obius-Listing bodies and surfaces are generalizations of the classic M\"obius band. The original motivation is that for solutions of boundary value problems the knowledge of the domain is essential. In previous papers cutting…

综合数学 · 数学 2019-04-03 Johan Gielis , Ilia Tavkhelidze

In this note we present a short alternative proof of an estimate obtained by A.B.-Mantel, C.B. Muratov and T.M. Simon in [3] regarding the rigidity of degree {$\pm 1$} conformal maps of $\mathbb{S}^2$, i.e. its M\"obius transformations.

偏微分方程分析 · 数学 2021-03-10 Jonas Hirsch , Konstantinos Zemas

An obstacle representation of a graph is a mapping of the vertices onto points in the plane and a set of connected regions of the plane (called obstacles) such that the straight-line segment connecting the points corresponding to two…

A disk graph is the intersection graph of disks in the plane, a unit disk graph is the intersection graph of same radius disks in the plane, and a segment graph is an intersection graph of line segments in the plane. It can be seen that…

度量几何 · 数学 2015-03-19 Colin McDiarmid , Tobias Muller

A median graph is a connected graph, such that for any three vertices $u,v,w$ there is exactly one vertex $x$ that lies simultaneously on a shortest $(u,v)$-path, a shortest $(v,w)$-path and a shortest $(w,u)$-path. Examples of median…

组合数学 · 数学 2016-01-29 Konstantinos Stavropoulos

A $3$-uniform hypergraph is a generalization of simple graphs where each hyperedge is a subset of vertices of size $3$. The degree of a vertex in a hypergraph is the number of hyperedges incident with it. The degree sequence of a hypergraph…

组合数学 · 数学 2023-12-04 Runze Li , Istvan Miklos

A universal representation theorem is derived that shows any graph is the intersection graph of one chordal graph, a number of co-bipartite graphs, and one unit interval graph. Central to the the result is the notion of the clique cover…

组合数学 · 数学 2015-04-21 Farhad Shahrokhi

In this purely experimental work we try to represent the set of plane maps with 3 vertices and 3 faces as a bipartite ribbon graph. In particular, this construction allows one to estimate the genus of the initial set.

组合数学 · 数学 2023-08-30 Yury Kochetkov

Complete intersections may be unexpectedly simple over fields of positive characteristic: for instance, they may be unirational despite being of general type. One explanation is given by profiles, structure that tracks the special shape of…

代数几何 · 数学 2025-08-13 Raymond Cheng

Mutual visibility in graphs provides a framework for analysing how vertices can observe one another along shortest paths free of internal obstructions. The visibility polynomial, which enumerates mutual-visibility sets of all orders, has…

组合数学 · 数学 2026-04-10 Tonny K B , Shikhi M

Let G be a graph in a 3-manifold M. We compress the pair (M,G) along admissible 2-spheres as long as possible. What we get is a root of (M,G). Our main result is that for any pair (M,G) the root exists and is unique. As a corollary we get…

几何拓扑 · 数学 2007-05-23 Sergei Matveev

A matching cut is a matching that is also an edge cut. In the problem Minimum Matching Cut, we ask for a matching cut with the minimum number of edges in the matching. We investigate the differences in complexity between Minimum Matching…

组合数学 · 数学 2026-02-20 Felicia Lucke , Joseph Marchand , Jannik Olbrich

We study the relations between the triviality of the tangent bundle $TM$ and the generalized tangent bundle $\mathbb{T}M = TM\oplus T^*M$ of a manifold. We show that the generalized tangent bundle of a paralellizable manifold is trivial. We…

微分几何 · 数学 2026-05-18 Fernando Etayo , Pablo Gómez-Nicolás , Rafael Santamaría

The M\"obius polynomial is an invariant of ranked posets, closely related to the M\"obius function. In this paper, we study the M\"obius polynomial of face posets of convex polytopes. We present formulas for computing the M\"obius…

组合数学 · 数学 2016-08-18 Meena Jagadeesan , Susan Durst

Given the set of paths through a digraph, the result of uniformly deleting some vertices and identifying others along each path is coherent in such a way as to yield the set of paths through another digraph, called a \emph{path abstraction}…

组合数学 · 数学 2017-01-27 Steve Huntsman

This is the third of a series of papers studying real algebraic threefolds, but the methods are mostly independent from the previous two. Let $f:X\to S$ be a map of a smooth projective real algebraic 3-fold to a surface $S$ whose general…

代数几何 · 数学 2007-05-23 János Kollár

We calculate the intersection ring of three-dimensional graph manifolds with rational coefficients and give an algebraic characterization of these rings when the manifold's underlying graph is a tree. We are able to use this…

几何拓扑 · 数学 2015-03-23 Margaret I. Doig , Peter D. Horn

All rational homology groups of unordered configuration spaces of the Moebius strip and the projective plane are calculated

几何拓扑 · 数学 2017-03-21 Victor A. Vassiliev

We give a new answer to so-called realization problems of graphs as Reeb graphs of smooth functions with prescribed preimages of regular values having nice structures. We present a best possible answer for functions on 3-dimensional closed…

一般拓扑 · 数学 2022-01-04 Naoki Kitazawa

We develop contractive finite dimensional realizations for rational matrix functions of one variable on domains that are not simply connected, such as the annulus. The proof uses multivariable contractive realization results as well as…

泛函分析 · 数学 2025-04-07 Radomił Baran , Piotr Pikul , Hugo J. Woerdeman , Michał Wojtylak