Related papers: Local loop lemma
A \emph{loop} $(B,\cdot)$ is a set $B$ together with a binary operation $\cdot$ such that (i) for each $a\in B$, the left and right translation mappings $L_{a}:B\to B: x \mapsto a\cdot x$ and $R_{a}:B\to B: x \mapsto x\cdot a$ are…
We fully disprove a conjecture of Haythorpe on the minimum number of hamiltonian cycles in regular hamiltonian graphs, thereby extending a result of Zamfirescu, as well as correct and complement Haythorpe's computational enumerative results…
A classical theorem of Ghouila-Houri from 1960 asserts that every directed graph on $n$ vertices with minimum out-degree and in-degree at least $n/2$ contains a directed Hamilton cycle. In this paper we extend this theorem to a random…
We prove that every locally constant constructive function on an interval is in fact a constant function. This answers a question formulated by Andrej Bauer. As a related result we show that an interval consisting of constructive real…
We prove a compactness result with respect to $\Gamma$-convergence for a class of integral functionals which are expressed as a sum of a local and a non-local term. The main feature is that, under our hypotheses, the local part of the…
In this paper, we prove a tight minimum degree condition in general graphs for the existence of paths between two given endpoints, whose lengths form a long arithmetic progression with common difference one or two. This allows us to obtain…
A compact graph rule for the effective action $\Gamma[\phi]$ of a local composite operator is given in this paper. This long-standing problem of obtaining $\Gamma[\phi]$ in this case is solved directly without using the auxiliary field. The…
We show that a torsion-free nilpotent loop (that is, a loop nilpotent with respect to the dimension filtration) has a torsion-free nilpotent left multiplication group of, at most, the same class. We also prove that a free loop is residually…
An open problem in theory of loops is to find the variety of non- Moufang loops satisfying the Moufang Theorem. In this note, we present a variety of local smooth diassociative loops with such property.
In directed graphs, a cycle can be seen as a structure that allows its vertices to loop back to themselves, or as a structure that allows pairs of vertices to reach each other through distinct paths. We extend these concepts to temporal…
Let $J$ be a semisimple Lie group with all simple factors of real rank at least two. Let $\Gamma<J$ be a lattice. We prove a very general local rigidity result about actions of $J$ or $\Gamma$. This shows that almost all so-called "standard…
We establish the (non-lattice) local limit theorem for products of i.i.d. random variables on an arbitrary simply connected nilpotent Lie group $G$, where the variables are allowed to be non-centered. Our result also improves on the known…
We give a simple proof of a crucial lemma that is established in [1, Lemma 2.1] by induction, and plays important roles in that paper and [2].
The purpose of this note is to prove a version of the Trace Theorem for domains which are locally subgraph of a H\" older continuous function. More precisely, let $\eta\in C^{0,\alpha}(\omega)$, $0<\alpha<1$ and let $\Omega_{\eta}$ be a…
A digraph is semicomplete if any two vertices are connected by at least one arc and is locally semicomplete if the out-neighbourhood and the in-neighbourhood of any vertex induce a semicomplete digraph. In this paper we study various…
It is known that isomorphisms of graph Jacobians induce cyclic bijections on the associated graphs. We characterize when such cyclic bijections can be strengthened to graph isomorphisms, in terms of an easily computed divisor. The result…
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",…
We show a new functional limit theorem for weakly dependent regularly varying sequences of random vectors. As it turns out, the convergence takes place in the space of R^d valued c\`{a}dl\`{a}g functions endowed with the so-called weak M1…
A particular case of Caccetta-H\"{a}ggkvist conjecture, says that a digraph of order $n$ with minimum out-degree at least $1/3n$ contains a directed cycle of length at most 3. Recently, Kral, Hladky and Norine proved that a digraph of order…
We discuss such Maltsev conditions that consist of just one linear equation, we call them loop conditions. To every such condition can be assigned a graph. We provide a classification of conditions with undirected graphs. It follows that…