English
Related papers

Related papers: A New Kim's Lemma

200 papers

I develop in depth the machinery of $(\mathcal L, n)$-models originally introduced by Shelah and, independently in a slightly different form by Kripke. This machinery allows fairly routine constructions of true but unprovable sentences in…

Logic · Mathematics 2021-08-12 Corey Bacal Switzer

The theme of the first two sections, is to prepare the framework of how from a "complicated" family of index models I in K_1 we build many and/or complicated structures in a class K_2. The index models are characteristically linear orders,…

Logic · Mathematics 2016-02-09 Saharon Shelah

Let $G$ be an acylic directed graph. For each vertex $g \in G$, we define an involution on the independent sets of $G$. We call these involutions flips, and use them to define a new partial order on independent sets of $G$. Trim lattices…

Combinatorics · Mathematics 2019-04-01 Hugh Thomas , Nathan Williams

"Theorems for Free!" (Wadler, FPCA 1989) is a slogan for a technique that allows to derive statements about functions just from their types. So far, the statements considered have always had a purely extensional flavor: statements relating…

Programming Languages · Computer Science 2011-07-07 Daniel Seidel , Janis Voigtländer

The purpose of this paper is twofold. First, we provide a novel characterization of independence of random vectors based on the checkerboard approximation to a multivariate copula. Using this result, we then propose a new family of tests of…

Statistics Theory · Mathematics 2019-06-07 José M. González-Barrios , Eduardo Gutiérrez-Peña , Juan D. Nieves , Raúl Rueda

We provide a version of the celebrated theorem of Koml\'os in which, rather then random quantities, a sequence of finitely additive measures is considered. We obtain a form of the subsequence principle and some applications.

Functional Analysis · Mathematics 2021-03-26 Gianluca Cassese

We study multiplicative dependence between terms of the $k$-generalized Pell sequence $(P_n^{(k)})_{n\ge 2-k}$, defined by the linear recurrence \[ P_n^{(k)} = 2P_{n-1}^{(k)} + P_{n-2}^{(k)} + \dots + P_{n-k}^{(k)}, \] with initial…

Number Theory · Mathematics 2026-05-19 Cherif B. Deme , Kancou D. Fall , Khady Faye , Bernadette Faye

In this paper, we introduce a concept of non-dependence of variables in formulas. A formula in first-order logic is non-dependent of a variable if the truth value of this formula does not depend on the value of that variable. This variable…

Logic · Mathematics 2025-01-29 Koen Lefever , Gergely Székely

We study model theoretic tree properties ($\text{TP}, \text{TP}_1, \text{TP}_2$) and their associated cardinal invariants ($\kappa_{\text{cdt}}, \kappa_{\text{sct}}, \kappa_{\text{inp}}$, respectively). In particular, we obtain a…

Logic · Mathematics 2016-10-24 Artem Chernikov , Nicholas Ramsey

Copulas are mathematical objects that fully capture the dependence structure among random variables and hence, offer a great flexibility in building multivariate stochastic models. In statistics, a copula is used as a general way of…

Methodology · Statistics 2013-10-01 Abhik Ghosh , Aritra Chakravorty

We study the theory $T_{m,n}$ of existentially closed incidence structures omitting the complete incidence structure $K_{m,n}$, which can also be viewed as existentially closed $K_{m,n}$-free bipartite graphs. In the case $m = n = 2$, this…

Logic · Mathematics 2019-06-12 Gabriel Conant , Alex Kruckman

The multivariate covering lemma states that given a collection of $k$ codebooks, each of sufficiently large cardinality and independently generated according to one of the marginals of a joint distribution, one can always choose one…

Information Theory · Computer Science 2016-01-22 Parham Noorzad , Michelle Effros , Michael Langberg

The \emph{Separation Lemma} is a simple yet powerful tool, akin to the well-known \emph{Isolation Lemma}, that guarantees the uniqueness of certain set sums. Bandopadhyay et al.\ introduced this lemma to establish lower bounds for the \ALP…

Data Structures and Algorithms · Computer Science 2026-05-28 Abhishek Sahu

Recent work has shown that integrating large language models (LLMs) with theorem provers (TPs) in neuro-symbolic pipelines helps with entailment verification and proof-guided refinement of explanations for natural language inference (NLI).…

Computation and Language · Computer Science 2026-01-28 Xin Quan , Marco Valentino , Louise A. Dennis , André Freitas

The enumeration of independent sets of regular graphs is of interest in statistical mechanics, as it corresponds to the solution of hard-particle models. In 2004, it was conjectured by Fendleyet al. that for some rectangular grids, with…

Combinatorics · Mathematics 2008-10-31 Mireille Bousquet-Mélou , Svante Linusson , Eran Nevo

We establish the Composition-Diamond lemma for non-associative algebras over a free commutative algebra. As an application, we prove that every countably generated non-associative algebra over an arbitrary commutative algebra $K$ can be…

Rings and Algebras · Mathematics 2010-11-24 Yuqun Chen , Jing Li , Mingjun Zeng

Decomposition of text into atomic propositions is a flexible framework allowing for the closer inspection of input and output text. We use atomic decomposition of hypotheses in two natural language reasoning tasks, traditional NLI and…

Computation and Language · Computer Science 2025-03-10 Neha Srikanth , Rachel Rudinger

We introduce the concept of mutual independence -- correlations shared between distant parties which are independent of the environment. This notion is more general than the standard idea of a secret key -- it is a fully quantum and more…

Quantum Physics · Physics 2009-11-05 Michal Horodecki , Jonathan Oppenheim , Andreas Winter

In this article, we propose a new method for the fundamental task of testing for dependence between two groups of variables. The response densities under the null hypothesis of independence and the alternative hypothesis of dependence are…

Methodology · Statistics 2015-01-29 Yimin Kao , Brian J Reich , Howard D Bondell

The survey is devoted to the combinatorial and metric theory of filtrations, i.\,e., decreasing sequences of $\sigma$-algebras in measure spaces or decreasing sequences of subalgebras of certain algebras. One of the key notions, that of…

Dynamical Systems · Mathematics 2017-08-02 Anatoly Vershik
‹ Prev 1 4 5 6 7 8 10 Next ›