Related papers: Local loop lemma
In this paper we study for the incompressible Euler equations the global structure of the bifurcation diagram for the rotating doubly connected patches near the degenerate case. We show that the branches with the same symmetry merge forming…
This paper presents a theory of non-linear integer/real arithmetic and algorithms for reasoning about this theory. The theory can be conceived as an extension of linear integer/real arithmetic with a weakly-axiomatized multiplication…
We prove that there does not exist any connected topological proper loop homeomorphic to a quasi-simple Lie group and having a compact Lie group as the group topologically generated by its left translations. Moreover, any connected…
A loop is automorphic if its inner mappings are automorphisms. Using so-called associated operations, we show that every commutative automorphic loop of odd prime power order is centrally nilpotent. Starting with anisotropic planes in the…
We extend the soft theorems for scattering amplitudes of scalar effective field theories to one-loop order. Our analysis requires carefully accounting for the fact that the soft limit is not guaranteed to commute with evaluating…
We prove that every locally finite, quasi-transitive graph with a thick end whose cycle space is generated by cycles of bounded length contains the full-grid as an asymptotic minor and as a diverging minor. This in particular includes all…
In this paper, we present an algebraic approach to idempotent functional analysis, which is an abstract version of idempotent analysis. The basic concepts and results are expressed in purely algebraic terms. We consider idempotent versions…
We give a direct proof of the local $Tb$ Theorem, in the Euclidean setting, and under the assumption of dual exponents. This Theorem provides a flexible framework for proving the boundedness of a Calder\'on-Zygmund operator, supposing the…
The notion of robust expansion has played a central role in the solution of several conjectures involving the packing of Hamilton cycles in graphs and directed graphs. These and other results usually rely on the fact that every robustly…
A digraph $G$ is weightable if its edges can be weighted with real numbers such that the total weight in each directed cycle equals 1. There are several equivalent conditions: that $G$ admits a 0/1-weighting with the same property, or that…
We explore the connections between the linear algebra of symmetric matrices over GF(2) and the circuit theory of 4-regular graphs. In particular, we show that the equivalence relation on simple graphs generated by local complementation can…
Linear-constraint loops are programs whose transition relation is specified by a system of linear inequalities. The termination problem asks, given a loop, whether it admits an infinite computation. Decidability of termination remains open…
We derive an asymptotic formula for the number of strongly connected digraphs with $n$ vertices and $m$ arcs (directed edges), valid for $m-n\to\infty$ as $n\to \infty$ provided $m=O(n\log n)$. This fills the gap between Wright's results…
The famous 1960s Lumer-Phillips Theorem states that a closed and densely defined operator $A\colon D(A)\subseteq X\rightarrow X$ on a Banach space $X$ generates a strongly continuous contraction semigroup if and only if $(A,D(A))$ is…
Let $\cF$ be a family of finite loops closed under subloops and factor loops. Then every loop in $\cF$ has the strong Lagrange property if and only if every simple loop in $\cF$ has the weak Lagrange property. We exhibit several such…
In this work the implicit function theorem is used for searching local symbolic resolution of differential equations. General results of existence for first order equations are proven and some examples, one relative to cavitation in a…
We refine and advance the study of the local structure of idempotent finite algebras started in [A.Bulatov, The Graph of a Relational Structure and Constraint Satisfaction Problems, LICS, 2004]. We introduce a graph-like structure on an…
A conjecture by Lichiardopol states that for every $k \ge 1$ there exists an integer $g(k)$ such that every digraph of minimum out-degree at least $g(k)$ contains $k$ vertex-disjoint directed cycles of pairwise distinct lengths. Motivated…
We prove the transversality result necessary for defining local Morse chain complexes with finite cyclic group symmetry. Our arguments use special regularized distance functions constructed using classical covering lemmas, and an inductive…
An \emph{automorphic loop} (or \emph{A-loop}) is a loop whose inner mappings are automorphisms. Every element of a commutative A-loop generates a group, and $(xy)^{-1} = x^{-1}y^{-1}$ holds. Let $Q$ be a finite commutative A-loop and $p$ a…