English
Related papers

Related papers: There are only countably many sets

200 papers

We prove that there are only finitely many arithmetic Kleinian maximal reflection groups.

Geometric Topology · Mathematics 2007-05-23 Ian Agol

We prove that every distinct covering system has a modulus divisible by either 2 or 3.

Number Theory · Mathematics 2021-05-25 Robert D. Hough , Pace P. Nielsen

In this article, we consider the notion of almost irredundant sets: A subset $\mathcal{X}$ of a C*-algebra $\mathcal{A}$ is called almost irredundant if and only if for every $a\in \mathcal{X}$, the element $a$ does not belong to the…

Operator Algebras · Mathematics 2020-12-29 Clayton Suguio Hida

For a set $A$, let $P(A)$ be the set of all finite subset sums of $A$. In this paper, for a sequence of integers $B=\{1<b_1<b_2<\cdots\}$ and $3b_1+5\leq b_2\leq 6b_1+10$, we determine the critical value for $b_3$ such that there exists an…

Number Theory · Mathematics 2020-05-20 Min Tang , Hongwei Xu

We study a class of overdetermined algebraic systems of equations. We prove that the number of distinct solutions equals to the maximal possible if and only if certain matrices are commuting and semisimple. This gives a characterization of…

Algebraic Geometry · Mathematics 2025-10-20 H. Hakopian , M. Tonoyan

Derivation of the full set of Bell inequalities involving correlation functions, for two parties, with binary observables, and N possible local settings is not as easy as it seemed. The proof of v1 is wrong. Additionaly one can find a…

Quantum Physics · Physics 2007-06-13 Piotr Badziag , Marek Zukowski

A set of $N$ permutations of $\{1,2,\dots,v\}$ is $(N,v,t)$-suitable if each symbol precedes each subset of $t-1$ others in at least one permutation. The central problems are to determine the smallest $N$ for which such a set exists for…

Combinatorics · Mathematics 2016-12-02 Justin H. C. Chan , Jonathan Jedwab

In this article we present set of infinite natural numbers which satisfies the conjecture $3n+1$.

General Mathematics · Mathematics 2016-08-05 G. H. S. Costa , A. C. Souza Filho

We give a notably simpler and shorter proof of H. B. Neumann's result which is stated, cursorly, like this. For any well-ordered subset, A, of a totally ordered semigroup, the set of products of any finite number of elements of A is itself…

Combinatorics · Mathematics 2022-03-03 Labib Haddad

In 1924, S. Banach and A. Tarski proved an astonishing, yet rather counterintuitive paradox: given a solid ball in $\mathbb{R}^3$, it is possible to partition it into finitely many pieces and reassemble them to form two solid balls, each…

History and Overview · Mathematics 2022-06-01 Katie Buchhorn

A question is proposed whether or not set theory is consistent.

General Mathematics · Mathematics 2007-05-23 Hitoshi Kitada

For a given subset $A\subseteq \mathbb F_q^*$, we study the problem of finding a large packing set $B$ of $A$, that is, a set $B \subseteq \mathbb F_q^*$ such that $|AB|=|A||B|$. We prove the existence of such a $B$ of size $|B|\ge…

Combinatorics · Mathematics 2017-05-04 Oliver Roche-Newton , Ilya D. Shkredov , Arne Winterhof

For any cardinal $\kappa \geq 2$, there is a unique complete real tree whose points all have valence $\kappa$. In this note, we show that, when $\kappa \geq 3$, it is necessary to assume completeness. More precisely, we show that there…

Metric Geometry · Mathematics 2025-11-06 Pénélope Azuelos

In this paper we prove that if $S$ is any finite configuration of points in $\mathbb{Z}^2$, then any finite coloring of $\mathbb{E}^2$ must contain uncountably many monochromatic subsets homothetic to $S$. We extend a result of Brown,…

Combinatorics · Mathematics 2013-04-09 Jeremy F. Alm

We investigate dense lineability and spaceability of subsets of $\ell_\infty$ with a prescribed number of accumulation points. We prove that the set of all bounded sequences with exactly countably many accumulation points is densely…

Functional Analysis · Mathematics 2023-05-18 Paolo Leonetti , Tommaso Russo , Jacopo Somaglia

Given three permutations on the integers 1 through n, consider the set system consisting of each interval in each of the three permutations. Jozsef Beck conjectured (c. 1987) that the discrepancy of this set system is O(1). We give a…

Discrete Mathematics · Computer Science 2011-04-18 Alantha Newman , Aleksandar Nikolov

We prove that a set of finite perimeter is indecomposable if and only if it is, up to a choice of suitable representative, connected in the 1-fine topology. This gives a topological characterization of indecomposability which is new even in…

Metric Geometry · Mathematics 2025-12-23 Paolo Bonicatto , Panu Lahti , Enrico Pasqualetto

In this paper, we prove the Bounded Height Conjecture which the author formulated in [2]. As a corollary, it follows that there are only a finite number of hyperbolic three manifolds of bounded volume and trace field degree.

Geometric Topology · Mathematics 2014-09-09 BoGwang Jeon

A maximal independent set is an independent set that is not a subset of any other independent set. It is also the key problem of mathematics, computer science, and other fields. A counting problem is a type of computational problem that…

Computational Complexity · Computer Science 2024-09-16 Hao Zhang , Tonghua Su

It is known that if a subset of $\mathbb{R}$ has positive Lebesgue measure, then it contains arbitrarily long finite arithmetic progressions. We prove that this result does not extend to infinite arithmetic progressions in the following…

Classical Analysis and ODEs · Mathematics 2023-04-21 Laurestine Bradford , Hannah Kohut , Yuveshen Mooroogen
‹ Prev 1 8 9 10 Next ›