English
Related papers

Related papers: Local loop lemma

200 papers

The law of a finite graph is a probability measure induced by the orbits of the graph under its automorphism group. Every law satisfies the intrinsic mass transport principle, which is also known as unimodularity. We discuss the convergence…

Combinatorics · Mathematics 2011-03-30 Igor Artemenko

$Local^{3}$ Index Theorem means $Local(Local(Local \;Index \; Theorem)))$. $Local \; Index \; Theorem$ is the Connes-Moscovici local index theorem \cite{Connes-Moscovici1}, \cite{Connes-Moscovici2}. The second "Local" refers to the cyclic…

K-Theory and Homology · Mathematics 2011-09-29 Nicolae Teleman

We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for checking a first-order formula with free set variables in the…

Data Structures and Algorithms · Computer Science 2014-07-09 Bruno Courcelle , Cyril Gavoille , Mamadou Moustapha Kanté

A linear different operator L is called weakly hypoelliptic if any local solution u of Lu=0 is smooth. We allow for systems, that is, the coefficients may be matrices, not necessarily of square size. This is a huge class of important…

Analysis of PDEs · Mathematics 2013-08-02 Christian Baer

We consider the nearest-neighbor simple random walk on $\Z^d$, $d\ge2$, driven by a field of i.i.d. random nearest-neighbor conductances $\omega_{xy}\in[0,1]$. Apart from the requirement that the bonds with positive conductances percolate,…

Probability · Mathematics 2007-10-30 Marek Biskup , Timothy M. Prescott

We show that diagrammatic sets, a topologically sound alternative to polygraphs and strict $\omega$-categories, admit an internal notion of equivalence in the sense of coinductive weak invertibility. We prove that equivalences have the…

Category Theory · Mathematics 2025-12-23 Clémence Chanavat , Amar Hadzihasanovic

We consider the call-by-value lambda-calculus extended with a may-convergent non-deterministic choice and a must-convergent parallel composition. Inspired by recent works on the relational semantics of linear logic and non-idempotent…

Logic in Computer Science · Computer Science 2014-01-08 Alejandro Díaz-Caro , Giulio Manzonetto , Michele Pagani

We study the complexity of isomorphism of classes of metric structures using methods from infinitary continuous logic. For Borel classes of locally compact structures, we prove that if the equivalence relation of isomorphism is potentially…

Logic · Mathematics 2021-09-20 Andreas Hallbäck , Maciej Malicki , Todor Tsankov

Let F be a finite field and R = M2(F) be 2x2 matrix ring over F. In this paper, we explicitly determine all the idempotents in R. Using these idempotents, we study the idempotent graph of R whose vertex set is the set of non-trivial…

Combinatorics · Mathematics 2024-02-20 Avinash Patil , P. S. Momale , C. M. Jadhav

Let $\mathbf G$ be a graphing, that is a Borel graph defined by $d$ measure preserving involutions. We prove that if $\mathbf G$ is {\em treeable} then it arises as the local limit of some sequence $(G_n)_{n\in\mathbb{N}}$ of graphs with…

Combinatorics · Mathematics 2016-01-22 Lucas Hosseini , Patrice Ossona de Mendez

In this paper we study possibilities of efficient reasoning in combinations of theories over possibly non-disjoint signatures. We first present a class of theory extensions (called local extensions) in which hierarchical reasoning is…

Logic in Computer Science · Computer Science 2008-10-16 Viorica Sofronie-Stokkermans

The aim of this paper is investigating the existence and multiplicity of weak solutions to non--local equations involving the {\em magnetic fractional Laplacian}, when the nonlinearity is subcritical and asymptotically linear at infinity.…

Analysis of PDEs · Mathematics 2023-12-08 Rossella Bartolo , Pietro d'Avenia , Giovanni Molica Bisci

We describe a procedure to attach a nilpotent strong homotopy Lie algebra to every simple hypergraph and prove that two hypergraphs are isomorphic if and only if the corresponding strong homotopy Lie algebras are isomorphic. As an…

Combinatorics · Mathematics 2024-02-23 Marco Aldi , Samuel Bevins

The weak operator topology closed operator algebra on $L^2(R)$ generated by the one-parameter semigroups for translation, dilation and multiplication by $exp(i\lambda x), \lambda \geq 0$, is shown to be a reflexive operator algebra, in the…

Operator Algebras · Mathematics 2015-03-06 Eleftherios Kastis , Stephen Power

The aim of this paper is to deal with the elliptic pdes involving a nonlinear integrodifferential operator, which are possibly degenerate and covers the case of fractional $p$-Laplacian operator. We prove the existence of a solution in the…

Analysis of PDEs · Mathematics 2017-07-13 Ratan Kr. Giri , D. Choudhuri , Amita Soni

We propose a homology theory for locally compact spaces with ends in which the ends play a special role. The approach is motivated by results for graphs with ends, where it has been highly successful. But it was unclear how the original…

Algebraic Topology · Mathematics 2011-05-26 Reinhard Diestel , Philipp Sprüssel

We prove that if nonlinear complex polynomials of the same degree have orbits with infinite intersection, then the polynomials have a common iterate. We also prove a special case of a conjectured dynamical analogue of the Mordell-Lang…

Number Theory · Mathematics 2009-11-13 Dragos Ghioca , Thomas J. Tucker , Michael E. Zieve

We study local Lie algebras of pairs of functions which generate infinitesimal symmetries of almost-cosymplectic-contact structures of odd dimensional manifolds.

Differential Geometry · Mathematics 2016-10-28 Josef Janyška

We present formalized proofs verifying that the first-order unification algorithm defined over lists of satisfiable constraints generates a most general unifier (MGU), which also happens to be idempotent. All of our proofs have been…

Logic in Computer Science · Computer Science 2010-12-23 Sunil Kothari , James Caldwell

We give two new characterizations of ($\F_2$-linear) locally testable error-correcting codes in terms of Cayley graphs over $\F_2^h$: \begin{enumerate} \item A locally testable code is equivalent to a Cayley graph over $\F_2^h$ whose set of…

Computational Complexity · Computer Science 2013-08-26 Parikshit Gopalan , Salil Vadhan , Yuan Zhou