English
Related papers

Related papers: Complexity of Ramsey null sets

200 papers

A $\sigma$-ideal $\cal{I}$ on a set $X$ is supersaturated if for every family $\cal{F}$ of $\cal{I}$-positive sets with $|\cal{F}| < \mathrm{add}(\cal{I})$, there exists a countable set that meets every set in $\cal{F}$. We show that many…

Logic · Mathematics 2021-07-01 Ashutosh Kumar , Dilip Raghavan

We prove an asymptotic analog of the classical Hurewicz theorem on mappings which lower dimension. This theorem allows us to find sharp upper bound estimates for the asymptotic dimension of groups acting on finite dimensional metric spaces…

Group Theory · Mathematics 2007-05-23 G. C. Bell , A. N. Dranishnikov

A Mazurkiewicz set is a plane subset that intersect every straight line at exactly two points, and a Sierpi\'{n}ski-Zygmund function is a function from $\mathbb{R}$ into $\mathbb{R}$ that has as little of the standard continuity as…

Logic · Mathematics 2025-07-02 Cheng-Han Pan

The Minkowski content of a compact set is a fine measure of its geometric scaling. For Lebesgue null sets it measures the decay of the Lebesgue measure of epsilon neighbourhoods of the set. It is well known that self-similar sets,…

Dynamical Systems · Mathematics 2023-03-14 Sascha Troscheit

We discuss non-compact WZW sigma models, especially the ones with symmetric space $H^{\bf C}/H$ as the target, for $H$ a compact Lie group. They offer examples of non-rational conformal field theories. We remind their relation to the…

High Energy Physics - Theory · Physics 2007-05-23 Krzysztof Gawedzki

The computational complexity of the partition, 0-1 subset sum, unbounded subset sum, 0-1 knapsack and unbounded knapsack problems and their multiple variants were studied in numerous papers in the past where all the weights and profits were…

Discrete Mathematics · Computer Science 2018-02-27 Dominik Wojtczak

The rational homology group of the order complex of non-even partitions of a finite set is calculated. A twisted version of the Goresky-MacPherson approach to similar homology calculations is proposed.

Combinatorics · Mathematics 2018-07-17 Victor A. Vassiliev

We show that the analogues of the Hamkins embedding theorems, proved for the countable models of set theory, do not hold when extended to the uncountable realm of $\omega_1$-like models of set theory. Specifically, under the $\diamondsuit$…

Logic · Mathematics 2015-01-07 Gunter Fuchs , Victoria Gitman , Joel David Hamkins

Given $b=-A\pm i$ with $A$ being a positive integer, we can represent any complex number as a power series in $b$ with coefficients in $\mathcal A=\{0,1,\ldots, A^2\}$. We prove that, for any real $\tau\geq 2$ and any non-empty proper…

Number Theory · Mathematics 2023-10-19 Gerardo González Robert , Mumtaz Hussain , Nikita Shulga

In this paper we study a very general finite Ramsey theorem, where both the sets being colored and the homogeneous set must satisfy some largeness notion. For the homogeneous set this has already been done using the notion of…

Logic · Mathematics 2026-03-03 Alberto Marcone , Antonio Montalbán , Andrea Volpi

Suppose $\Lambda$ is a discrete infinite set of nonnegative real numbers. We say that $ {\Lambda}$ is type $1$ if the series $s(x)=\sum_{\lambda\in\Lambda}f(x+\lambda)$ satisfies a zero-one law. This means that for any non-negative…

Classical Analysis and ODEs · Mathematics 2018-06-01 Zoltán Buczolich , Bruce Hanson , Balázs Maga , Gáspár Vértesy

It is proved that the sum of the Loewy lengths of the homology modules of a finite free complex F over a local ring R is bounded below by a number depending only on R. This result uncovers, in the structure of modules of finite projective…

Commutative Algebra · Mathematics 2010-05-20 L. L. Avramov , R. -O. Buchweitz , S. B. Iyengar , C. Miller

It is well known that in Zermelo-Fraenkel (ZF) set theory any finite set is decidable. In this paper we discuss an extension of ZF where this result is no longer valid. Such an extension is quasi-set theory and it has its origin on problems…

Quantum Physics · Physics 2007-05-23 Adonai S. Sant'Anna

We study the topological, dynamical, and descriptive set theoretic properties of Hurwitz continued fractions. Hurwitz continued fractions associate an infinite sequence of Gaussian integers to every complex number which is not a Gaussian…

Number Theory · Mathematics 2025-01-30 Felipe García-Ramos , Gerardo González Robert , Mumtaz Hussain

We construct explicit tableau-level maps between indecomposable projective modules for the type A 0-Hecke algebra that assemble into canonical split short exact sequences lifting the basic ribbon product rule in NSym via concatenation and…

Combinatorics · Mathematics 2026-01-21 Ayah Almousa , Bryan Lu

We present an extension to the quantifier-free theory of integer arrays which allows us to express counting. The properties expressible in Array Folds Logic (AFL) include statements such as "the first array cell contains the array length,"…

Formal Languages and Automata Theory · Computer Science 2016-05-13 Przemysław Daca , Thomas A. Henzinger , Andrey Kupriyanov

Recently, Solecki introduced the notion of Ramsey monoid to produce a common generalization to theorems such as Hindman's theorem, Carlson's theorem, and Gowers' FIN$_k$ theorem. He proved that an entire class of finite monoids is Ramsey.…

Combinatorics · Mathematics 2021-11-10 Claudio Agostini , Eugenio Colla

We show that over the weak base theory $\mathrm{RCA}_0^*$, cohesive Ramsey's theorem for pairs $\mathrm{CRT}^2_2$ implies exponential closure of the definable cut $\mathrm{I}^0_1$, which is the intersection of all $\Sigma^0_1$-definable…

Logic · Mathematics 2026-05-12 Leszek Aleksander Kołodziejczyk , Mengzhou Sun

In this paper we show that it is relatively consistent with ZFC that every gamma-set is countable while not every strong measure zero set is countable. This answers a question of Paul Szeptycki. A set is a gamma-set iff every omega-cover…

Logic · Mathematics 2007-05-23 Arnold W. Miller

We present the concept of the \emph{information efficiency of functions} as a technique to understand the interaction between information and computation. Based on these results we identify a new class of objects that we call…

Computational Complexity · Computer Science 2019-04-09 P. W. Adriaans
‹ Prev 1 4 5 6 7 8 10 Next ›