English
Related papers

Related papers: Local loop lemma

200 papers

This work is devoted to the study of the existence of at least one weak solution to nonlocal equations involving a general integro-differential operator of fractional type. As a special case, we derive an existence theorem for the…

Analysis of PDEs · Mathematics 2020-04-22 Giovanni Molica Bisci , Dušan D. Repovš

The paper is devoted to the study of local derivations and automorphisms of nilpotent Lie algebras. Namely, we proved that nilpotent Lie algebras with indices of nilpotency $3$ and $4$ admit local derivation (local automorphisms) which is…

Rings and Algebras · Mathematics 2024-05-08 Abror Khudoyberdiyev , Doston Jumaniyozov

We examine cyclic, non-well-founded and well-founded derivations in the provability logic $\mathsf{GLP}$. While allowing cyclic derivations does not change the system, the non-well-founded and well-founded derivations we consider define the…

Logic · Mathematics 2025-04-03 Daniyar Shamkanov

Let $K$ be an algebraically closed field of characteristic zero and $A$ an integral $K$-domain. The Lie algebra $Der_{K}(A)$ of all $K$-derivations of $A$ contains the set $LND(A)$ of all locally nilpotent derivations. The structure of…

Rings and Algebras · Mathematics 2016-08-05 A. P. Petravchuk , K. Ya. Sysak

Let k be an algebraically closed field of characteristic 0, let X=P^1\times A^N and let f be a rational endomorphism of X given by (x,y)--->(g(x), A(x)y), where g is a rational function, while A is an N-by-N matrix with entries in k(x). We…

Number Theory · Mathematics 2018-03-13 Dragos Ghioca , Junyi Xie , with an appendix written by Michael Wibmer

Let $D$ be a strong digraph on $n\geq 4$ vertices. In [3, Discrete Applied Math., 95 (1999) 77-87)], J. Bang-Jensen, Y. Guo and A. Yeo proved the following theorem: if (*) $d(x)+d(y)\geq 2n-1$ and $min \{d^+(x)+ d^-(y),d^-(x)+ d^+(y)\}\geq…

Combinatorics · Mathematics 2012-09-21 S. Kh. Darbinyan , I. A. Karapetyan

We prove a Borel version of the local lemma, i.e. we show that, under suitable assumptions, if the set of variables in the local lemma has a structure of a Borel space, then there exists a satisfying assignment which is a Borel function.…

Combinatorics · Mathematics 2024-03-05 Endre Csóka , Łukasz Grabowski , András Máthé , Oleg Pikhurko , Konstantinos Tyros

We carry on a more detailed investigation of the composition of locally solid convergences as introduced in [BCTvdW24], as well as the corresponding notion of idempotency considered in [Bil23]. In particular, we study the interactions…

Functional Analysis · Mathematics 2024-08-05 Eugene Bilokopytov

We prove measurable analogues of Whitney's classical theorems on weak isomorphisms of finite graphs. In the setting of locally finite graphings, we introduce a notion of weak isomorphism as an edge-measure-preserving Borel bijection that…

Combinatorics · Mathematics 2026-05-18 Márton Borbényi , Grigory Terlov , László Márton Tóth

This article introduces and studies the tight approximation property, a property of algebraic varieties defined over the function field of a complex or real curve that refines the weak approximation property (and the known cohomological…

Algebraic Geometry · Mathematics 2024-06-18 Olivier Benoist , Olivier Wittenberg

We establish the existence of loop type subcontinua of nonnegative solutions for a class of concave-convex type elliptic equations with indefinite weights, under Dirichlet and Neumann boundary conditions. Our approach depends on local and…

Analysis of PDEs · Mathematics 2024-01-22 Uriel Kaufmann , Humberto Ramos Quoirin , Kenichiro Umezu

A \emph{locally irregular graph} is a graph whose adjacent vertices have distinct degrees. We say that a graph $G$ can be decomposed into $k$ locally irregular subgraphs if its edge set may be partitioned into $k$ subsets each of which…

Combinatorics · Mathematics 2017-03-02 Jakub Przybyło

A graph G is locally isometric if the subgraph induced by the neighbourhood of every vertex is an isometric subgraph of G. It is shown that the hamilton cycle problem for locally isometric graphs with maximum degree at most 8 is…

Combinatorics · Mathematics 2016-01-08 Adam Borchert , Skylar Nicol , Ortrud R. Oellermann

We introduce a weak version of the classical length function, termed the weak length function, defined on subsets of $R$-modules over a unital ring $R$, and further consider the concept of mean weak length for $R\Gamma$-modules associated…

Rings and Algebras · Mathematics 2026-05-11 Zihan Bai , Bingbing Liang

In this article, we study the pointwise asymptotic behavior of iterated convolutions on the one dimensional lattice Z. We generalize the so-called local limit theorem in probability theory to complex valued sequences. A sharp rate of…

Probability · Mathematics 2025-02-25 Lucas Coeuret

We prove several new versions of the Hadamard-Perron Theorem, which relates infinitesimal dynamics to local dynamics for a sequence of local diffeomorphisms, and in particular establishes the existence of local stable and unstable…

Dynamical Systems · Mathematics 2017-10-25 Vaughn Climenhaga , Yakov Pesin

We construct loops which are semidirect products of groups of affinities. As their elements in many cases one may take transversal subspaces of an affine space. In particular we obtain in this manner smooth loops having Lie groups of affine…

Group Theory · Mathematics 2015-07-01 Ágota Figula , Karl Strambach

The research in the present paper was motivated by the conjecture of Ryj\'{a}\v{c}ek that every locally connected graph is weakly pancyclic. For a connected locally connected graph $G$ of order at least $3$, our results are as follows: If…

Combinatorics · Mathematics 2015-07-28 Christoph Brause , Dieter Rautenbach , Ingo Schiermeyer

We study the existence of a directed Hamilton cycle in random digraphs with $m$ edges where we condition on minimum in- and out-degree at least one. Denote such a random graph by $D_{n,m}^{(\delta\geq1)}$. We prove that if $m=\tfrac n2(\log…

Combinatorics · Mathematics 2025-06-17 Colin Cooper , Alan Frieze

Let $D=(V,A)$ be a digraph whose underlying undirected graph is $2$-edge-connected, and let $P$ be the polytope whose vertices are the incidence vectors of arc sets whose reversal makes $D$ strongly connected. We study the lattice theoretic…

Combinatorics · Mathematics 2026-02-17 Ahmad Abdi , Gérard Cornuéjols , Siyue Liu , Olha Silina
‹ Prev 1 3 4 5 6 7 10 Next ›