English
Related papers

Related papers: Column convex matrices, $G$-cyclic orders, and flo…

200 papers

In the paper "Formality conjecture" (1996) Kontsevich designed a universal flow $\dot{\mathcal{P}}=\mathcal{Q}_{a:b}(\mathcal{P})=a\Gamma_{1}+b\Gamma_{2}$ on the spaces of Poisson structures $\mathcal{P}$ on all affine manifolds of…

Differential Geometry · Mathematics 2017-02-21 Anass Bouisaghouane

The one-way model of quantum computation is an alternative to the circuit model. A one-way computation is driven entirely by successive adaptive measurements of a pre-prepared entangled resource state. For each measurement, only one outcome…

Quantum Physics · Physics 2026-02-02 Piotr Mitosek , Miriam Backens

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

For an integral convex polytope $\Pc \subset \RR^N$ of dimension $d$, we call $\delta(\Pc)=(\delta_0, \delta_1,..., \delta_d)$ the $\delta$-vector of $\Pc$ and $\vol(\Pc)=\sum_{i=0}^d\delta_i$ its normalized volume. In this paper, we will…

Combinatorics · Mathematics 2012-10-12 Akihiro Higashitani

This dissertation investigates the geometric combinatorics of convex polytopes and connections to the behavior of the simplex method for linear programming. We focus our attention on transportation polytopes, which are sets of all tables of…

Combinatorics · Mathematics 2010-06-15 Edward D. Kim

In this paper we developed an analysis of the compressible, isentropic Euler equations in two spatial dimensions for a generalized polytropic gas law. The main focus is rotational flows in the subsonic regimes, described through the…

Analysis of PDEs · Mathematics 2026-04-02 Talita Mello , Wladimir Neves

We construct a quasi-polynomial time deterministic approximation algorithm for computing the volume of an independent set polytope with restrictions. Randomized polynomial time approximation algorithms for computing the volume of a convex…

Data Structures and Algorithms · Computer Science 2023-12-08 David Gamarnik , Devin Smedira

For certain pseudo-Anosov flows $\phi$ on closed $3$-manifolds, unpublished work of Agol--Gu\'eritaud produces a veering triangulation $\tau$ on the manifold $M$ obtained by deleting $\phi$'s singular orbits. We show that $\tau$ can be…

Geometric Topology · Mathematics 2022-08-09 Michael P. Landry , Yair N. Minsky , Samuel J. Taylor

We present an explicit closed-form formula for the vertices of the classical cut polytope $\operatorname{CUT}(n)$, defined as the convex hull of cut vectors of the complete graph $K_n$. Our derivation proceeds via a related polytope,…

Combinatorics · Mathematics 2025-07-22 Nevena Marić

Intrinsic volumes are fundamental geometric invariants generalizing volume, surface area, and mean width for convex bodies. We establish a unified Laplace-Grassmannian representation for intrinsic and dual volumes of convex polynomial…

Metric Geometry · Mathematics 2025-11-04 Trí Minh Lê , Khai-Hoan Nguyen-Dang

We demonstrate the common bihamiltonian nature of several integrable systems. The first one is an elliptic rotator that is an integrable Euler-Arnold top on the complex group GL(N) for any $N$, whose inertia ellipsiod is related to a choice…

Exactly Solvable and Integrable Systems · Physics 2009-11-10 B. Khesin , A. Levin , M. Olshanetsky

There has been extensive research on cycle lengths in graphs with large minimum degree. In this paper, we obtain several new and tight results in this area. Let $G$ be a graph with minimum degree at least $k+1$. We prove that if $G$ is…

Combinatorics · Mathematics 2015-09-01 Chun-Hung Liu , Jie Ma

We study the convex hull of the graph of a quadratic function $f(\mathbf{x})=\sum_{ij\in E}x_ix_j$, where the sum is over the edge set of a graph $G$ with vertex set $\{1,\dots,n\}$. Using an approach proposed by Gupte et al. (Discrete…

Optimization and Control · Mathematics 2020-07-14 Mitchell Harris , Thomas Kalinowski

Given a formal map $F=(F_1...,F_n)$ of the form $z+\text{higher}$ order terms, we give tree expansion formulas and associated algorithms for the D-Log of F and the formal flow F_t. The coefficients which appear in these formulas can be…

Complex Variables · Mathematics 2009-02-02 David Wright , Wenhua Zhao

We construct a complete invariant for non-wandering surface flows with finitely many singular points but without locally dense orbits. Precisely, we show that a flow $v$ with finitely many singular points on a compact connected surface $S$…

Dynamical Systems · Mathematics 2017-03-17 Tomoo Yokoyama

We develop a family-based route to unicyclic graphs whose independence polynomials are unimodal but not log-concave. The paper is organized around one flagship statement: for the explicit KL-closure family $U_{k,r}$, with $r\in\{0,1,2\}$…

Combinatorics · Mathematics 2026-03-19 Vadim E. Levit , Ohr Kadrawi

The goal of this article is to obtain bounds on the coefficients of modular and integral flow and tension polynomials of graphs. To this end we make use of the fact that these polynomials can be realized as Ehrhart polynomials of inside-out…

Combinatorics · Mathematics 2010-04-21 Felix Breuer , Aaron Dall

Understanding complexity in fluid mechanics is a major problem that has attracted the attention of physicists and mathematicians during the last decades. Using the concept of renormalization in dynamics, we show the existence of a locally…

Dynamical Systems · Mathematics 2023-03-22 Pierre Berger , Anna Florio , Daniel Peralta-Salas

We establish the existence and uniqueness of some smooth accelerating transonic flows governed by the three dimensional steady compressible Euler equations with an external force in cylinders with arbitrary cross sections, which include…

Analysis of PDEs · Mathematics 2024-11-08 Shangkun Weng , Zhouping Xin

Inspired by computational complexity results for the quantified constraint satisfaction problem, we study the clones of idempotent polymorphisms of certain digraph classes. Our first results are two algebraic dichotomy, even "gap",…

Computational Complexity · Computer Science 2015-05-13 Catarina Carvalho , Florent Madelaine , Barnaby Martin