English
Related papers

Related papers: There are only countably many sets

200 papers

Label the vertices of the complete graph $K_v$ with the integers $\{ 0, 1, \ldots, v-1 \}$ and define the length of the edge between $x$ and $y$ to be $\min( |x-y| , v - |x-y| )$. Let $L$ be a multiset of size $v-1$ with underlying set…

Combinatorics · Mathematics 2021-05-04 M. A. Ollis , Anita Pasotti , Marco A. Pellegrini , John R. Schmitt

We present a new approach to the problem of mutually unbiased bases (MUBs), based on positive definite functions on the unitary group. The method provides a new proof of the fact that there are at most $d+1$ MUBs in ${\mathbb C}^d$. It may…

Quantum Physics · Physics 2016-12-30 Mihail N. Kolountzakis , Máté Matolcsi , Mihály Weiner

A formalisation of G\"odel's incompleteness theorems using the Isabelle proof assistant is described. This is apparently the first mechanical verification of the second incompleteness theorem. The work closely follows {\'S}wierczkowski…

Logic · Mathematics 2021-04-30 Lawrence C. Paulson

Polignac [1] conjectured that for every even natural number $2k (k\geq1)$, there exist infinitely many consecutive primes $p_n$ and $p_{n+1}$ such that $p_{n+1}-p_n=2k$. A weakened form of this conjecture states that for every $k\geq1$,…

General Mathematics · Mathematics 2009-09-14 Shaohua Zhang

Pilz's conjecture states that for any finite set $A=\{a_1,a_2,\dots,a_k\}$ of positive integers and positive integer $n$ in the union of the sets $\{a_1,2a_1,\dots,na_1\},\dots, \{a_k,2a_k,\dots,na_k\}$ (considered as a multiset) at least…

Combinatorics · Mathematics 2024-09-24 János Nagy , Péter Pál Pach

The Buratti-Horak-Rosa Conjecture concerns the possible multisets of edge-labels of a Hamiltonian path in the complete graph with vertex labels $0, 1, \ldots, {v-1}$ under a particular induced edge-labeling. The conjecture has been shown to…

Combinatorics · Mathematics 2022-02-17 Pranit Chand , M. A. Ollis

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

We answer a question of Darji and Keleti by proving that there exists a compact set $C_0\subset\RR$ of measure zero such that for every perfect set $P\subset\RR$ there exists $x\in\RR$ such that $(C_0+x)\cap P$ is uncountable. Using this…

Logic · Mathematics 2011-09-27 Márton Elekes , Juris Steprāns

We give a simplified proof of analyticity of pluripolar multifunctions

Complex Variables · Mathematics 2007-05-23 A. Edigarian

Let X be a countably infinite set, and let f, g, and h be any three injective self-maps of X, each having at least one infinite cycle. (For instance, this holds if f, g, and h are not bijections.) We show that there are permutations a and b…

Group Theory · Mathematics 2010-08-30 Zachary Mesyan

Hamkins and Kikuchi (2016 and 2017) show that in both set theory and class theory the definable subset ordering of the universe interprets a complete and decidable theory. If $\mathcal{M}$ is a model of set theory, then $\langle M,…

Logic · Mathematics 2022-09-13 Zachiri McKenzie

Let $\mathbb{Z}$ be the additive (semi)group of integers. We prove that for a finite semigroup $S$ the direct product $\mathbb{Z}\times S$ contains only countably many subdirect products (up to isomorphism) if and only if $S$ is regular. As…

Group Theory · Mathematics 2024-04-30 Ashley Clayton , Catherine Reilly , Nik Ruškuc

We prove two completeness results, one for the extension of dependence logic by a monotone generalized quantifier Q with weak interpretation, weak in the meaning that the interpretation of Q varies with the structures. The second result…

Logic · Mathematics 2013-04-03 Fredrik Engström , Juha Kontinen , Jouko Väänänen

We investigate sumset decompositions of quite general sets with restricted prime factors. We manage to handle certain sets, such as the smooth numbers, even though they have little sieve amenability, and conclude that these sets cannot be…

Number Theory · Mathematics 2013-09-04 Christian Elsholtz , Adam J. Harper

Let $m\geq 3$ be a positive integer. We prove that there are uncountably many non-commensurable metabelian uniform pro-$p$ groups of dimension $m$. Consequently, there are uncountably many non-commensurable finitely presented pro-$p$ groups…

Group Theory · Mathematics 2015-04-02 Ilir Snopce

A binary matrix satisfies the consecutive ones property (COP) if its columns can be permuted such that the ones in each row of the resulting matrix are consecutive. Equivalently, a family of sets F = {Q_1,..,Q_m}, where Q_i is subset of R…

Data Structures and Algorithms · Computer Science 2015-03-18 Giovanni Battaglia , Roberto Grossi , Noemi Scutellà

For an irrational $\alpha\in \mathbb{R}$, we consider additive problems with the set of primes satisfying $\lVert\alpha p\rVert\leq \frac{1}{p^\tau}$ for some fixed $\tau>0$. In particular, we show that there exist infinitely many…

Number Theory · Mathematics 2025-08-19 Sarvagya Jain

In this note we generalize the Moroianu's fixed point theorem. We propose a very elegant common proof of the Bourbaki's fixed point theorem and our result. We apply our result to give a very elegant proof of the fact that, in the…

Logic · Mathematics 2019-06-05 Mohssin Zarouali-Darkaoui

In this article we prove that the singular set of Dirichlet-minimizing $Q$-valued functions is countably $(m-2)$-rectifiable and we give upper bounds for the $(m-2)$-dimensional Minkowski content of the set of singular points with…

Analysis of PDEs · Mathematics 2020-10-14 Camillo de Lellis , Andrea Marchese , Emanuele Spadaro , Daniele Valtorta

The finite satisfiability problem of monadic second order logic is decidable only on classes of structures of bounded tree-width by the classic result of Seese (1991). We prove the following problem is decidable: Input: (i) A monadic second…

Logic in Computer Science · Computer Science 2016-04-19 Tomer Kotek , Helmut Veith , Florian Zuleger