Related papers: A combinatorial property of flows on a cycle

This paper proposes that common measures for network transitivity, based on the enumeration of transitive triples, do not reflect the theoretical statements about transitivity they aim to describe. These statements are often formulated as…

We prove that an Anosov flow with $\mathcal{C}^{1}$ stable bundle mixes exponentially whenever the stable and unstable bundles are not jointly integrable. This allows us to show that if a flow is sufficiently close to a volume-preserving…

Let $P$ be a pointed, closed convex cone in $\mathbb{R}^d$. We prove that for two pure isometric representations $V^{(1)}$ and $V^{(2)}$ of $P$, the associated CAR flows $\beta^{V^{(1)}}$ and $\beta^{V^{(2)}}$ are cocycle conjugate if and…

The cycle double cover conjecture is a long standing problem in graph theory, which links local properties, the valency of a vertex and no bridges, and a global property of the graph, being covered by a particular set of cycles. We prove…

Let $\mathcal{S}$ be a family of sets with VC-codensity less than $2$. We prove that, if $\mathcal{S}$ has the $(\omega, 2)$-property (for any infinitely many sets in $\mathcal{S}$, at least $2$ among them intersect), then $\mathcal{S}$ can…

This paper continues the study of equilibria for flows over time in the fluid queueing model recently considered by Koch and Skutella [10]. We provide a constructive proof for the existence and uniqueness of equilibria in the case of a…

Understanding the dependencies among features of a dataset is at the core of most unsupervised learning tasks. However, a majority of generative modeling approaches are focused solely on the joint distribution $p(x)$ and utilize models…

This paper investigates the independence polynomials arising from iterated strong products of cycle graphs, examining their algebraic symmetries and combinatorial structures. Leveraging modular arithmetic and Galois theory, we establish…

A common generalization for the chromatic polynomial and the flow polynomial of a graph $G$ is the Tutte polynomial $T(G;x,y)$. The combinatorial meaning for the coefficients of $T$ was discovered by Tutte at the beginning of its…

For triangulated surfaces locally embedded in the standard hyperbolic space, we introduce combinatorial Calabi flow as the negative gradient flow of combinatorial Calabi energy. We prove that the flow produces solutions which converge to…

We consider the problem of multicommodity flows in outerplanar graphs. Okamura and Seymour showed that the cut-condition is sufficient for routing demands in outerplanar graphs. We consider the unsplittable version of the problem and prove…

In this paper, for each graph G, a free edge set F is defined. To study the existence of cycle double cover, the naive cycle double cover of G and F have been defined and studied. In the main theorem, the paper, based on the Kuratowski…

We prove a combinatorial reciprocity theorem for the enumeration of non-intersecting paths in a linearly growing sequence of acyclic planar networks. We explain two applications of this theorem: reciprocity for fans of bounded Dyck paths,…

In this paper, we extend the work of Ge-Hua-Zhou \cite{GHZ} on combinatorial Ricci flows for ideal circle patterns to combinatorial Calabi flows in both hyperbolic and Euclidean background geometry. We prove the solution to the…

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…

We isolate two combinatorial properties, each expressible by a $\Pi_2$-sentence over the structure $(H(\omega_3),\in,\omega_1,\omega_2,\text{NS}_{\omega_2})$, such that each property is consistent with CH, and their conjunction together…

We try to bring to light some combinatorial structure underlying formal proofs in logic. We do this through the study of the Craig Interpolation Theorem which is properly a statement about the structure of formal derivations. We show that…

We introduce Neural Conjugate Flows (NCF), a class of neural network architectures equipped with exact flow structure. By leveraging topological conjugation, we prove that these networks are not only naturally isomorphic to a continuous…

Affine flows on vector bundles with chain transitive base flow are lifted to linear flows and the decomposition into exponentially separated subbundles provided by Selgrade's theorem is determined. The results are illustrated by an…

In this paper, we revisit Arveson's characterisation of CCR flows in terms of decomposibility of the product system in the multiparameter context. We show that a multiparameter $E_0$-semigroup is a CCR flow if and only if it is decomposable…