English
Related papers

Related papers: A Simplicial Tutte "5"-flow Conjecture

200 papers

The multivariate Tutte polynomial (known to physicists as the Potts-model partition function) can be defined on an arbitrary finite graph G, or more generally on an arbitrary matroid M, and encodes much important combinatorial information…

Combinatorics · Mathematics 2021-01-01 Alan D. Sokal

We construct topological invariants, called abstract weak orbit spaces, of flows and homeomorphisms on topological spaces, to describe both gradient dynamics and recurrent dynamics. In particular, the abstract weak orbit spaces of flows on…

Dynamical Systems · Mathematics 2020-12-03 Tomoo Yokoyama

In this article, we shall investigate the relationship between the existence or non-existence of non-singular solutions to the normalized Ricci flow and smooth structures on closed 4-manifolds, where non-singular solutions to the normalized…

Differential Geometry · Mathematics 2008-07-15 Masashi Ishida

The complex potentials representing flows around a vertical plate semi-submerged in a uniform stream are derived in analytical forms by the reduction method. They are composed from the regular solution and a weak singular eigen solution.…

Fluid Dynamics · Physics 2018-03-26 Katsuo Suzuki , Shigeyuki Hibi

We construct the moduli space of index 2 flowlines of a discrete Morse function, giving a new proof that the Morse differential squares to zero in discrete Morse homology.

Combinatorics · Mathematics 2023-10-05 Sophie Bleau

A simplicial complex of dimension $d-1$ is said to be balanced if its graph is $d$-colorable. Juhnke-Kubitzke and Murai proved an analogue of the generalized lower bound theorem for balanced simplicial polytopes. We establish a…

Combinatorics · Mathematics 2016-08-30 Martina Juhnke-Kubitzke , Satoshi Murai , Isabella Novik , Connor Sawaske

We characterise all vertex-transitive finite connected graphs as essentially 5-connected or on a short list of explicit graph-classes. Our proof heavily uses Tutte-type canonical decompositions.

Combinatorics · Mathematics 2026-02-11 Jan Kurkofka , Tim Planken

Let $\mathcal{G}$ be the class of all graphs with no induced four-edge path or four-edge antipath. Hayward and Nastos \cite{MS} conjectured that every prime graph in $\mathcal{G}$ not isomorphic to the cycle of length five is either a split…

Combinatorics · Mathematics 2021-10-07 Maria Chudnovsky , Peter Maceli

We study nontrivial entropy invariants in the class of parabolic flows on homogeneous spaces, quasi-unipotent flows. We show that topological complexity (ie, slow entropy) can be computed directly from the Jordan block structure of the…

Dynamical Systems · Mathematics 2019-08-27 Adam Kanigowski , Kurt Vinhage , Daren Wei

This paper investigates which smooth manifolds arise as quotients (orbit spaces) of flows of vector fields. Such quotient maps were already known to be surjective on fundamental groups, but this paper shows that every epimorphism of…

Dynamical Systems · Mathematics 2017-03-14 Robert E. Gompf

The famous flow decomposition theorem of Gallai (1985) states that any static edge $s$,$d$-flow in a directed graph can be decomposed into a nonnegative linear combination of incidence vectors of paths and cycles. In this paper, we study…

Data Structures and Algorithms · Computer Science 2026-02-05 Lukas Graf , Tobias Harks , Julian Schwarz

The topological containment problem is known to be polynomial-time solvable for any fixed pattern graph $H$, but good characterisations have been found for only a handful of non-trivial pattern graphs. The complete graph on five vertices,…

Discrete Mathematics · Computer Science 2017-05-05 Rebecca Robinson , Graham Farr

We provide a unique decomposition of every 4-connected graph into parts that are either quasi-5-connected, cycles of triangle-torsos and 3-connected torsos on $\leq 5$ vertices, generalised double-wheels, or thickened $K_{4,m}$'s. The…

Combinatorics · Mathematics 2026-02-12 Jan Kurkofka , Tim Planken

We consider the partial theta function $\theta (q,z):=\sum _{j=0}^{\infty}q^{j(j+1)/2}z^j$, where $z\in \mathbb{C}$ is a variable and $q\in \mathbb{C}$, $0<|q|<1$, is a parameter. Set $D(a):=\{ q\in \mathbb{C}$, $0<|q|\leq a$, $\arg (q)\in…

Classical Analysis and ODEs · Mathematics 2021-02-24 Vladimir Petrov Kostov

Large $N_c$ and holographic arguments, as well as Monte Carlo results, suggest that the topological structure of the QCD vacuum is dominated by codimension-one membranes which appear as thin dipole layers of topological charge. Such…

High Energy Physics - Theory · Physics 2013-05-30 H. B. Thacker , Chi Xiong

We present exact calculations of flow polynomials $F(G,q)$ for lattice strips of various fixed widths $L_y$ and arbitrarily great lengths $L_x$, with several different boundary conditions. Square, honeycomb, and triangular lattice strips…

Statistical Mechanics · Physics 2007-05-23 Shu-Chiuan Chang , Robert Shrock

We consider AF-flows, i.e., one-parameter automorphism groups of a unital simple C*-algebra which leave invariant the dense union of an increasing sequence of finite-dimensional *-subalgebras, and derive two properties for these; an absence…

Operator Algebras · Mathematics 2009-10-31 Ola Bratteli , Akitaka Kishimoto

We study a natural model of random 2-dimensional cubical complex which is a subcomplex of an n-dimensional cube, and where every possible square $2$-face is included independently with probability p. Our main result is to exhibit a sharp…

Combinatorics · Mathematics 2020-09-21 Matthew Kahle , Elliot Paquette , Érika Roldán

Let $X = G/\Gamma$, where $G$ is a Lie group and $\Gamma$ is a lattice in $G$, let $O$ be an open subset of $X$, and let $F = \{g_t: t\ge 0\}$ be a one-parameter subsemigroup of $G$. Consider the set of points in $X$ whose $F$-orbit misses…

Dynamical Systems · Mathematics 2022-08-08 Dmitry Kleinbock , Shahriar Mirzadeh

We prove that a class of graphs with an excluded minor and with the maximum degree sublinear in the number of edges is maximally modular, that is, modularity tends to 1 as the number of edges tends to infinity.

Combinatorics · Mathematics 2021-02-16 Michał Lasoń , Małgorzata Sulkowska