English
Related papers

Related papers: Volume inequalities for flow polytopes of full dir…

200 papers

An inverse cascade - energy transfer to progressively larger scales - is a salient feature of two-dimensional turbulence. If the cascade reaches the system scale, it creates a coherent flow expected to have the largest available scale and…

Chaotic Dynamics · Physics 2017-04-05 Anna Frishman , Jason Laurie , Gregory Falkovich

The vertices of the Cayley graph of a finitely generated semigroup form a set of sites which can be labeled by elements of a finite alphabet in a manner governed by a nonnegative real interaction matrix, respecting nearest neighbor…

Dynamical Systems · Mathematics 2022-10-07 Karl Petersen , Ibrahim Salama

The massless flow between successive minimal models of conformal field theory is related to a flow within the sine-Gordon model when the coefficient of the cosine potential is imaginary. This flow is studied, partly numerically, from three…

High Energy Physics - Theory · Physics 2015-06-26 P. Fendley , H. Saleur , Al. B. Zamolodchikov

We introduce a new geometric flow called the chord shortening flow which is the negative gradient flow for the length functional on the space of chords with end points lying on a fixed submanifold in Euclidean space. As an application, we…

Differential Geometry · Mathematics 2019-06-05 Martin Li

We study the question of polytopality of graphs: when is a given graph the graph of a polytope? We first review the known necessary conditions for a graph to be polytopal, and we provide several families of graphs which satisfy all these…

Metric Geometry · Mathematics 2013-04-30 Julian Pfeifle , Vincent Pilaud , Francisco Santos

The dynamics along the particle trajectories for the 3D axisymmetric Euler equations are considered. It is shown that if the inflow is rapidly increasing (pushy) in time, the corresponding laminar profile of the incompressible Euler flow is…

Analysis of PDEs · Mathematics 2017-05-15 Tsuyoshi Yoneda

In this paper, we investigate the relationships between the volumes of four convex bodies: the cut polytope, metric polytope, rooted metric polytope, and elliptope, defined on graphs with $n$ vertices. The cut polytope is contained in each…

Discrete Mathematics · Computer Science 2026-04-21 David Avis , Luc Devroye

We prove an asymptotic estimate for the number of mxn non-negative integer matrices (contingency tables) with prescribed row and column sums and, more generally, for the number of integer feasible flows in a network. Similarly, we estimate…

Combinatorics · Mathematics 2008-08-21 Alexander Barvinok

The paper is devoted to the study of topological properties, structure and classification of Morse flows with fixed points on the boundary of three-dimensional manifolds. We construct a complete topological invariant of a Morse flow,…

Geometric Topology · Mathematics 2022-09-12 Svitlana Bilun , Alexandr Prishlyak , Andrii Prus

A bridgeless graph $G$ is called $3$-flow-critical if it does not admit a nowhere-zero $3$-flow, but $G/e$ has for any $e\in E(G)$. Tutte's $3$-flow conjecture can be equivalently stated as that every $3$-flow-critical graph contains a…

Combinatorics · Mathematics 2020-03-23 Jiaao Li , Yulai Ma , Yongtang Shi , Weifan Wang , Yezhou Wu

The conditions in which meridional recirculations appear in swirling flows above a fixed wall are analysed. In the classical Bodew\"adt problem, where the swirl tends towards an aysmptotic value away from the wall, the well-known "tea-cup…

Fluid Dynamics · Physics 2013-09-24 A. Pothérat , F. Rubiconi , Y. Charles , V. Dousset

Given an acyclic directed graph (DAG), the space of strength one flows is a lattice polytope called the flow polytope of the DAG. If the DAG admits an ample framing, then the flow polytope is Gorenstein and it linearly projects onto a…

Given a set D of nonnegative integers, we derive the asymptotic number of graphs with a givenvnumber of vertices, edges, and such that the degree of every vertex is in D. This generalizes existing results, such as the enumeration of graphs…

Combinatorics · Mathematics 2015-07-22 Élie de Panafieu , Lander Ramos

To any finite group $G$, we may associate a graph whose vertices are the elements of $G$ and where two distinct vertices $x$ and $y$ are adjacent if and only if the order of the subgroup $\langle x, y\rangle$ is divisible by at least 3…

Group Theory · Mathematics 2023-09-12 Karmele Garatea-Zaballa , Andrea Lucchini

This article studies real roots of the flow polynomial $F(G,\lambda)$ of a bridgeless graph $G$. For any integer $k\ge 0$, let $\xi_k$ be the supremum in $(1,2]$ such that $F(G,\lambda)$ has no real roots in $(1,\xi_k)$ for all graphs $G$…

Combinatorics · Mathematics 2014-03-11 Fengming Dong

The main contribution of this paper is a formula for the number of acyclic orientations of a complete bipartite, $K_{n_1,n_2},$ revealing that it is equal to the poly-Bernoulli number $B_{n_1}^{(-n_2)}$ introduced in 1997 by Kaneko. We also…

Combinatorics · Mathematics 2022-11-09 Peter J. Cameron , C. A. Glass , Kamilla Rekvényi , R. U. Schumacher

Let $G$ be a graph. A zero-sum flow in $G$ is an assignment of nonzero real number to the edges such that the sum of the values of all edges incident with each vertex is zero. Let $k$ be naturel number. A zero-sum $k$-flow is a flow with…

Combinatorics · Mathematics 2015-03-13 S. Akbari , N. Ghareghani , G. B. Khosrovshahi , S. Zare

By studying the weak closure of multidimensional off-diagonal self-joinings we provide a criterion for non-isomorphism of a flow with its inverse, hence the non-reversibility of a flow. This is applied to special flows over rigid…

Dynamical Systems · Mathematics 2014-05-13 K. Fraczek , J. Kulaga , M. Lemanczyk

In this paper, we examine a time-dependent family of two-dimensional algebras. We investigate the conditions under which any two algebras from this family, formed at different times, are isomorphic. Our findings reveal that the flow…

Commutative Algebra · Mathematics 2024-01-22 U. A. Rozikov , M. V. Velasco , B. A. Narkuziev

The presented material is devoted to the equivalent conversion from the vertex graphs to the edge graphs. We suggest that the proved theorems solve the problem of the isomorphism of graphs, the problem of the graph's enumeration with the…

Computational Complexity · Computer Science 2012-10-22 Leonid Malinin , Natalia Malinina
‹ Prev 1 8 9 10 Next ›