English
Related papers

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

200 papers

Let $x\in\mathbb{R}^{n}$. For $\phi:\mathbb{R}^{n}\mapsto\mathbb{R}^{n}$ and $t\in\mathbb{R}$, we put $\phi^{t}=t^{-1}\phi(xt)$. A projective flow is a solution to the projective translation equation $\phi^{t+s}=\phi^{t}\circ\phi^{s}$,…

Algebraic Geometry · Mathematics 2018-02-06 Giedrius Alkauskas

A graph is called Ricci-flat if its Ricci-curvatures vanish on all edges. Here we use the definition of Ricci-cruvature on graphs given in [Lin-Lu-Yau, Tohoku Math., 2011], which is a variation of [Ollivier, J. Funct. Math., 2009]. In this…

Combinatorics · Mathematics 2013-01-03 Yong Lin , Linyuan Lu , S. -T. Yau

In the present paper, non-singular Morse-Smale flows on closed orientable 3-manifolds under the assumption that among the periodic orbits of the flow there is only one saddle one and it is twisted are considered. An exhaustive description…

Dynamical Systems · Mathematics 2023-01-05 Olga Pochinka , Danila Shubin

A rich $k$-flow is a nowhere-zero $k$-flow $\phi$ such that, for every pair of adjacent edges $e$ and $f$, $|\phi(e)| \neq |\phi(f)|$. A graph is rich flow admissible if it admits a rich $k$-flow for some integer $k$. In this paper, we…

Combinatorics · Mathematics 2026-01-23 Robert Lukoťka

We determine all modular curves $X_0(N)$ with density degree $5$, i.e. all curves $X_0(N)$ with infinitely many points of degree $5$ and only finitely many points of degree $d\leq4$. As a consequence, the problem of determining all curves…

Number Theory · Mathematics 2026-02-20 Maarten Derickx , Wontae Hwang , Daeyeol Jeon , Petar Orlić

Given a graph $G$ in which each edge fails independently with probability $q\in[0,1],$ the all-terminal reliability of $G$ is the probability that all vertices of $G$ can communicate with one another, that is, the probability that the…

Combinatorics · Mathematics 2018-02-14 Jason Brown , Lucas Mol

The theory of flows was used as a crucial tool in the recent proof by Margolis, Rhodes and Schilling that Krohn-Rhodes complexity is decidable. In this paper we begin a systematic study of aperiodic flows. We give the foundations of the…

Dynamical Systems · Mathematics 2025-02-04 Stuart Margolis , John Rhodes

Flow criteria are used to efficiently extract computations, either in the form of measurement patterns or quantum circuits, from ZX-diagrams. Existing criteria such as causal flow, generalised flow, and Pauli flow, were all originally…

Quantum Physics · Physics 2026-03-11 Aleks Kissinger , John van de Wetering

We consider the following question: if a simplicial complex $\Delta$ has $d$-homology, then does the corresponding $d$-cycle always induce cycles of smaller dimension that are not boundaries in $\Delta$? We provide an answer to this…

Commutative Algebra · Mathematics 2022-01-27 Sara Faridi , Mayada Shahada

We investigate the computationally hard problem whether a random graph of finite average vertex degree has an extensively large $q$-regular subgraph, i.e., a subgraph with all vertices having degree equal to $q$. We reformulate this problem…

Statistical Mechanics · Physics 2007-05-23 Marco Pretti , Martin Weigt

In this paper we introduce a method which allows us to study properties of the random uniform simplicial complex. That is, we assign equal probability to all simplicial complexes with a given number of vertices and then consider properties…

Combinatorics · Mathematics 2020-01-08 Klas Markström , Trevor Pinto

A hypersymplectic structure on a 4-manifold is a triple $\omega_1, \omega_2, \omega_3$ of 2-forms for which every non-trivial linear combination $a^1\omega_1 + a^2 \omega_2 + a^3 \omega_3$ is a symplectic form. Donaldson has conjectured…

Differential Geometry · Mathematics 2026-01-27 Joel Fine , Weiyong He , Chengjian Yao

The theory of $k$-regular graphs is closely related to group theory. Every $k$-regular, bipartite graph is a Schreier graph with respect to some group $G$, a set of generators $S$ (depending only on $k$) and a subgroup $H$. The goal of this…

Combinatorics · Mathematics 2016-07-27 Alexander Lubotzky , Zur Luria , Ron Rosenthal

This article is concerned with Kronecker flows on the infinite torus. The work is partly motivated by the fact that many Hamiltonian PDEs and systems on infinite lattices admit invariant tori, of possibly infinite dimension, on which the…

Dynamical Systems · Mathematics 2026-04-03 Lorenzo Baroni

We provide new bounds on a flux integral over the portion of the boundary of one regular domain contained inside a second regular domain, based on properties of the second domain rather than the first one. This bound is amenable to…

Differential Geometry · Mathematics 2016-01-20 Ido Bright , John M. Lee

In a proper edge-coloring of a cubic graph, an edge $e$ is normal if the set of colors used by the edges adjacent to $e$ has cardinality 3 or 5. The Petersen coloring conjecture asserts that every bridgeless cubic graph has a normal…

Combinatorics · Mathematics 2019-11-18 Ligang Jin , Yingli Kang

We find an obstruction to the existence of non-singular solutions to the normalized Ricci flow on four-manifolds with $b^+=1$. By using this obstruction, we study the relationship between the existence or non-existence of non-singular…

Differential Geometry · Mathematics 2008-10-15 Masashi Ishida , Rares Rasdeaconu , Ioana Suvaina

Benjamini, Kalifa and Tzalik recently proved that there is an absolute constant $c>0$ such that any graph with at most $c\cdot2^d/d$ edges and no isolated vertices is a minor of the $d$-dimensional hypercube $Q_d$, while there is an…

Combinatorics · Mathematics 2025-02-11 Emma Hogan , Lukas Michel , Alex Scott , Youri Tamitegama , Jane Tan , Dmitry Tsarev

We analyze the global symmetries and anomalies of 4d $\mathcal{N} = 1$ field theories that arise from a stack of $N$ M5-branes probing a class of flux backgrounds. These backgrounds consist of a resolved $\mathbb{C}^2 / \mathbb{Z}_k$…

High Energy Physics - Theory · Physics 2022-11-09 Ibrahima Bah , Federico Bonetti , Enoch Leung , Peter Weck

The max-flow and max-coflow problem on directed graphs is studied in the common generalization to regular spaces, i.e., to kernels or row spaces of totally unimodular matrices. Exhibiting a submodular structure of the family of paths within…

Combinatorics · Mathematics 2012-06-25 Ulrich Faigle , Walter Kern , Britta Peis
‹ Prev 1 8 9 10 Next ›