English
Related papers

Related papers: An effective version of Nadkarni's Theorem

200 papers

We give a simpler proof of a result of Hodkinson in the context of a blow and blur up construction argueing that the idea at heart is similar to that adopted by Andr\'eka et all \cite{sayed}. The idea is to blow up a finite structure,…

Logic · Mathematics 2013-05-21 Tarek Sayed Ahmed

Euler's theorem asserts that $A(n)=B(n)$ where $A(n)$ is the number of partitions of $n$ into distinct parts and $B(n)$ is the number of partitions of $n$ into odd parts. In this paper, it is proved that for $n>0$, \begin{align*}…

Combinatorics · Mathematics 2025-11-07 George E. Andrews , Rahul Kumar , Ae Ja Yee

Let $\sigma:\boldsymbol{\Sigma}\to\boldsymbol{\Sigma}$ be the left shift acting on $ \boldsymbol{\Sigma} $, a one-sided Markov subshift on a countable alphabet. Our intention is to guarantee the existence of $\sigma$-invariant Borel…

Dynamical Systems · Mathematics 2010-03-30 Rodrigo Bissacot , Eduardo Garibaldi

We identify the measurable absorbing obstruction to uniqueness of invariant probability measures for a Markov kernel. Ordinary absorbing decompositions obstruct global irreducibility and recurrence, but not necessarily uniqueness: an…

Mathematical Finance · Quantitative Finance 2026-05-13 Jean-Gabriel Attali

We introduce a notion of density point and prove results analogous to Lebesgue's density theorem for various well-known ideals on Cantor space and Baire space. In fact, we isolate a class of ideals for which our results hold. In contrast to…

Logic · Mathematics 2022-10-07 Sandra Müller , Philipp Schlicht , David Schrittesser , Thilo Weinert

A (vector space) basis B of a Lie algebra is said to be very nilpotent if all the iterated brackets of elements of B are nilpotent. In this note, we prove a refinement of Engel's Theorem. We show that a Lie algebra has a very nilpotent…

Representation Theory · Mathematics 2010-11-24 Bulois Michael

The purpose of this survey is to present analytic versions of the injectivity theorem and their applications. The proof of our injectivity theorems is based on a combination of the L^2-method for the dbar-equation and the theory of harmonic…

Complex Variables · Mathematics 2015-11-16 Shin-ichi Matsumura

Let $E$ be a countable Borel equivalence relation on the space $\mathcal{E}_{\infty}$ of all infinite partitions of the natural numbers. We show that $E$ coincides with equality below a Carlson-Simpson generic element of…

Logic · Mathematics 2022-06-30 Aristotelis Panagiotopoulos , Allison Wang

We prove that if a Borel probability measure (\mu) on (\T) is invariant under the action of a "large" multiplicative semigroup (lower logarithmic density is positive) and the action of the whole semigroup is ergodic then (\mu) is either…

Dynamical Systems · Mathematics 2008-09-04 Manfred Einsiedler , Alexander Fish

We extend the classical Mercer theorem to reproducing kernel Hilbert spaces whose elements are functions from a measurable space $X$into $\mathbb C^n$. Given a finite measure $\mu$ on $X$, we represent the reproducing kernel $K$ as…

Functional Analysis · Mathematics 2011-10-19 Ernesto De Vito , Veronica Umanita` , Silvia Villa

Ergodic systems, being indecomposable are important part of the study of dynamical systems but if a system is not ergodic, it is natural to ask the following question: Is it possible to split it into ergodic systems in such a way that the…

Dynamical Systems · Mathematics 2020-12-01 Sakshi Jain , Shah Faisal

We show that if an equivalence relation $E$ on a Polish space is a countable union of smooth Borel subequivalence relations, then there is either a Borel reduction of $E$ to a countable Borel equivalence relation on a Polish space or a…

Logic · Mathematics 2025-01-22 N. de Rancourt , B. D. Miller

The forcing theorem is the most fundamental result about set forcing, stating that the forcing relation for any set forcing is definable and that the truth lemma holds, that is everything that holds in a generic extension is forced by a…

Logic · Mathematics 2017-10-31 Peter Holy , Regula Krapf , Philipp Lücke , Ana Njegomir , Philipp Schlicht

It is shown that the power set of $\kappa$ ordered by the subset relation modulo various versions of the non-stationary deal can be embedded into the partial order of Borel equivalence relations on $2^\kappa$ under Borel reducibility. Here…

Logic · Mathematics 2025-11-25 Vadim Kulikov

We show that every countable Borel equivalence relation structurable by $n$-dimensional contractible simplicial complexes embeds into one which is structurable by such complexes with the further property that each vertex belongs to at most…

Logic · Mathematics 2017-09-22 Ruiyuan Chen

We present two alternative proofs of Mandrekar's theorem, which states that an invariant subspaces of the Hardy space on the bidisc is of Beurling type precisely when the shifts satisfy a doubly commuting condition. The first proof uses…

Complex Variables · Mathematics 2022-09-30 Linus Bergqvist

The Born rule assigns a probability to any possible outcome of a quantum measurement, but leaves open the question how these probabilities are to be interpreted and, in particular, how they relate to the outcome observed in an actual…

Quantum Physics · Physics 2017-10-17 Daniela Frauchiger , Renato Renner

We consider a class of second order ordinary differential equations describing one-dimensional systems with a quasi-periodic analytic forcing term and in the presence of damping. As a physical application one can think of a…

Dynamical Systems · Mathematics 2014-03-21 Guido Gentile , Michele V. Bartuccelli , Jonathan H. B. Deane

The cut pseudo-metric on the space of graph limits induces an equivalence relation. The quotient space obtained by collapsing each equivalence class to a point is a metric space with appealing analytic properties. We show that the…

Probability · Mathematics 2013-12-31 Peter Orbanz , Balazs Szegedy

We upgrade [1] to a complete proof of the conjecture NP = PSPACE. [1]: L. Gordeev, E. H. Haeusler, Proof Compression and NP Versus PSPACE, Studia Logica (107) (1): 55-83 (2019)

Logic in Computer Science · Computer Science 2022-01-11 Lev Gordeev
‹ Prev 1 4 5 6 7 8 10 Next ›