English
Related papers

Related papers: Zero-sum flows for Steiner systems

200 papers

We study several different types of BPS flows within minimal $\mathcal{N}=1$, $D=7$ supergravity with $\textrm{SU}(2)$ gauge group and non-vanishing topological mass. After reviewing some known domain wall solutions involving only the…

High Energy Physics - Theory · Physics 2018-01-17 Giuseppe Dibitetto , Nicolò Petri

We investigate the incompressible flow past a square cylinder immersed in the wake of an upstream nearby splitter plate separating two streams of different velocity. The bottom stream Reynolds number, based on the square side, $Re_B=56$ is…

Fluid Dynamics · Physics 2022-11-09 Reda El Mansy , Wasim Sarwar , Josep M Bergada , Fernando Mellibovsky

We explain the construction of some solutions of the Stokes system with a given set of singular points, in the sense of Caffarelli, Kohn and Nirenberg. By means of a partial regularity theorem (proved elsewhere), it turns out that we are…

Analysis of PDEs · Mathematics 2007-05-23 M. Romito

Using time-series of stereoscopic particle image velocimetry data, we study the response of a turbulent von K\'{a}rm\'{a}n swirling flow to a continuous breaking of its forcing symmetry. Experiments are carried over a wide Reynolds number…

Statistical Mechanics · Physics 2012-05-22 P. -P. Cortet , E. Herbert , A. Chiffaudel , F. Daviaud , B. Dubrulle , V. Padilla

We investigate multidimensional nowhere-zero flows of bridgeless graphs. By extending the established use of the Euclidean norm, this paper considers the Manhattan and Chebyshev norms, leading to the definition of the flow numbers…

Combinatorics · Mathematics 2025-10-28 Lukáš Gáborik , Sascha Kurz , Giuseppe Mazzuoccolo , Jozef Rajník , Florian Rieg

We prove that every regular graph of valency at least four whose automorphism group contains a nilpotent subgroup acting transitively on the vertex set admits a nowhere-zero 3-flow.

Combinatorics · Mathematics 2022-03-28 Junyang Zhang , Sanming Zhou

To overcome topological constraints and improve the expressiveness of normalizing flow architectures, Wu, K\"ohler and No\'e introduced stochastic normalizing flows which combine deterministic, learnable flow transformations with stochastic…

Machine Learning · Computer Science 2022-12-02 Paul Hagemann , Johannes Hertrich , Gabriele Steidl

The existence of stationary points for the dynamical system of ABC-flow is considered. The ABC-flow, a three-parameter velocity field that provides a simple stationary solution of Euler's equations in three dimensions for incompressible,…

General Physics · Physics 2016-01-11 Sergey V. Ershkov

We propose a new approach to studies on partial Steiner triple systems consisting in determining complete graphs contained in them. We establish the structure which complete graphs yield in a minimal PSTS that contains them. As a by-product…

Combinatorics · Mathematics 2014-10-30 M. Prażmowska , K. Prażmowski

X. Hou, H.-J. Lai, P. Li and C.-Q. Zhang [J. Graph Theory 69 (2012) 464-470] showed that for a simple graph $G$ with $|V(G)|\ge 44$, if $\min\{\delta(G),\delta(G^c)\}\ge 4$, then either $G$ or its complementary graph $G^c$ has a…

Combinatorics · Mathematics 2019-03-15 Jiaao Li , Xueliang Li , Meiling Wang

In this paper, fast and efficient discrete sine transformation (DST) algorithms are presented based on the factorization of sparse, scaled orthogonal, rotation, rotation-reflection, and butterfly matrices. These algorithms are completely…

Information Theory · Computer Science 2016-01-19 Sirani M. Perera

The well-known 5-flow Conjecture of Tutte, stated originally for integer flows, claims that every bridgeless graph has circular flow number at most 5. It is a classical result that the study of the 5-flow Conjecture can be reduced to cubic…

Combinatorics · Mathematics 2018-04-04 Jan Goedgebeur , Davide Mattiolo , Giuseppe Mazzuoccolo

We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow problems. Each electrical flow is given by the solution of a…

Data Structures and Algorithms · Computer Science 2010-10-20 Paul Christiano , Jonathan A. Kelner , Aleksander Madry , Daniel A. Spielman , Shang-Hua Teng

The general solutions of the radial attractor flow equations for extremal black holes, both for non-BPS with non-vanishing central charge Z and for Z=0, are obtained for the so-called stu model, the minimal rank-3 N=2 symmetric supergravity…

High Energy Physics - Theory · Physics 2015-05-13 S. Bellucci , S. Ferrara , A. Marrani , A. Yeranyan

In this paper we describe protocols which use a standard deck of cards to provide a perfectly sound zero-knowledge proof for Hamiltonian cycles and Flow Free puzzles. The latter can easily be extended to provide a protocol for a…

Cryptography and Security · Computer Science 2022-02-10 Eammon Hart , Joshua A. McGinnis

Let (x_n; n\in Z) be a bisequence of elements x_n in the 1-dimensional torus R/Z, which is called a stream over R/Z. Let P(z)=a_k z^k+...+a_1 z+a_0 be a polynomial with integer coefficients. Define the set of streams over R/Z such that the…

Number Theory · Mathematics 2026-05-21 Shigeki Akiyama , Xiang Gao , Teturo Kamae

Let a flow $T_t$ preserve an ergodic probability measure $\mu$, $\int f\,d\mu=0$, and $\mu(A)>0$. Then for almost all $x\in A$, for which $f(x)\neq 0$, there is a sequence ${t_k}\to \infty$ such that $T_{t_k}x\in A$ and $\int_0^{t_k}…

Dynamical Systems · Mathematics 2025-02-04 Valery V. Ryzhikov

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

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

Let $H$ be a random $k$-uniform $n$-vertex hypergraph where every $k$-tuple belongs to $H$ independently with probability $p$. We show that for some $\varepsilon_k > 0$, if $p \geq n^{-\varepsilon_k}$, then asymptotically almost surely $H$…

Combinatorics · Mathematics 2017-11-07 Michael Simkin