English
Related papers

Related papers: A New Kim's Lemma

200 papers

According to the Weinstein splitting theorem, any Poisson manifold is locally, near any given point, a product of a symplectic manifold with another Poisson manifold whose Poisson structure vanishes at the point. Similar splitting results…

Differential Geometry · Mathematics 2020-01-29 Henrique Bursztyn , Hudson Lima , Eckhard Meinrenken

Neglecting many motivating details for the Park-Pham theorem (previously known as the Kahn-Kalai conjecture), the result starts with a finite set $X$, a non-trivial upper set $\mathcal{F} \subseteq 2^X$, and a particular parameterized…

Combinatorics · Mathematics 2024-08-16 Bryce Alan Christopherson , Darian Colgrove

We analyze quantum Yang-Mills theory on $\mathbb{R}^2$ using a novel discretization method based on an algebraic analogue of stochastic calculus. Such an analogue involves working with "Gaussian" free fields whose covariance matrix is…

Mathematical Physics · Physics 2018-02-21 Timothy Nguyen

Dependency distance minimization (DDm) is a well-established principle of word order. It has been predicted theoretically that DDm implies compression, namely the minimization of word lengths. This is a second order prediction because it…

Computation and Language · Computer Science 2023-10-16 Ramon Ferrer-i-Cancho , Carlos Gómez-Rodríguez

Team semantics is a semantical framework for the study of dependence and independence concepts ubiquitous in many areas such as databases and statistics. In recent works team semantics has been generalised to accommodate also multisets and…

Logic in Computer Science · Computer Science 2018-03-07 Arnaud Durand , Miika Hannula , Juha Kontinen , Arne Meier , Jonni Virtema

We obtain a new quantitative deformation lemma, and then gain a new mountain pass theorem. More precisely, the new mountain pass theorem is independent of the functional value on the boundary of the mountain, which improves the well known…

Dynamical Systems · Mathematics 2018-01-04 Liang Ding , Jinlong Wei , Shiqing Zhang

A set of independence statements may define the independence structure of interest in a family of joint probability distributions. This structure is often captured by a graph that consists of nodes representing the random variables and of…

Methodology · Statistics 2011-07-15 Nanny Wermuth

The paper introduces a generalization for known probabilistic models such as log-linear and graphical models, called here multiplicative models. These models, that express probabilities via product of parameters are shown to capture…

Artificial Intelligence · Computer Science 2012-06-18 Ydo Wexler , Christopher Meek

For an $\omega$-categorical theory $T$ and model $\mathcal{M}$ of $T$ we define a hierarchy of ranks, the $n$-ranks for $n < \omega$ which only care about imaginary elements ``up to level $n$'', where level $n$ contains every element of $M$…

Logic · Mathematics 2026-05-28 Vera Koponen

Combinatorial rigidity theory seeks to describe the rigidity or flexibility of bar-joint frameworks in R^d in terms of the structure of the underlying graph G. The goal of this article is to broaden the foundations of combinatorial rigidity…

Combinatorics · Mathematics 2011-10-05 Mike Develin , Jeremy L. Martin , Victor Reiner

A dichotomy result of Sevenster (2014) completely classified the quantifier prefixes of regular Independence-Friendly (IF) logic according to the patterns of quantifier dependence they contain. On one hand, prefixes that contain "Henkin" or…

Logic · Mathematics 2019-10-01 Fausto Barbero

A logic for specification and verification is derived from the axioms of Zermelo-Fraenkel set theory. The proofs are performed using the proof assistant Isabelle. Isabelle is generic, supporting several different logics. Isabelle has the…

Logic in Computer Science · Computer Science 2008-02-03 Lawrence C. Paulson

In this sequel to my previous paper, "Is String Theory in Knots?" I explore ways of constructing symmetries through an algebraic stepping process using knotted graphs. The hope is that this may lead to an algebraic formulation of string…

High Energy Physics - Theory · Physics 2007-05-23 Phil E. Gibbs

We study hidden-variable models from quantum mechanics, and their abstractions in purely probabilistic and relational frameworks, by means of logics of dependence and independence, based on team semantics. We show that common desirable…

Logic in Computer Science · Computer Science 2022-01-28 Rafael Albert , Erich Grädel

We show that for each property $\mathsf{P}\in \{\mathsf{OP}, \mathsf{IP}, \mathsf{TP}_1, \mathsf{TP}_2, \mathsf{ATP}, \mathsf{SOP}_3\}$ there is a poset $\Sigma_{\mathsf{P}}$ such that a theory has property $\mathsf{P}$ if and only if some…

Logic · Mathematics 2022-09-02 Darío García , Rosario Mennuni

Recently, Cohen and Glashow pointed out that all known experimental tests of relativistic kinematics are consistent with invariance of physics under the four-parameter subgroup Sim(2) of the Lorentz group. The massive one-particle…

High Energy Physics - Phenomenology · Physics 2008-11-26 JiJi Fan , Walter D. Goldberger , Witold Skiba

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

By using Lie symmetry methods, we identify a class of second order nonlinear ordinary differential equations invariant under at least one dimensional subgroup of the symmetry group of the Ermakov-Pinney equation. In this context, nonlinear…

Exactly Solvable and Integrable Systems · Physics 2017-03-23 F. Güngör , P. J. Torres

We provide elementary and uniform proofs of order independence for various strategy elimination procedures for finite strategic games, both for dominance by pure and by mixed strategies. The proofs follow the same pattern and focus on the…

Computer Science and Game Theory · Computer Science 2007-05-23 Krzysztof R. Apt

Recently, state-of-the-art NLP models gained an increasing syntactic and semantic understanding of language, and explanation methods are crucial to understand their decisions. Occlusion is a well established method that provides…

Computation and Language · Computer Science 2020-04-22 David Harbecke , Christoph Alt