Related papers: On Sets Containing an Affine Copy of Bounded Decre…
A set $X \subseteq 2^\omega$ with positive measure contains a perfect subset. We study such perfect subsets from the viewpoint of computability and prove that these sets can have weak computational strength. Then we connect the existence of…
We construct a nonrecursive set \(A\le_T\emptyset'\) and a uniformly computable family of sets \(C_0,C_1,\dots\), all bounded finite-one equivalent to \(A\), such that the corresponding \(1\)-degrees form a copy of the dense linear order…
This note is motivated by the article of Bamerni, Kadets and Kili\c{c}man [J. Math. Anal. Appl. 435 (2), 1812--1815 (2016)]. We consider the remaining problem which claims that if $A$ is a dense subset of a finite dimensional space $X$,…
Every conditionally convergent series of real numbers has a divergent subseries. How many subsets of the natural numbers are needed so that every conditionally convergent series diverges on the subseries corresponding to one of these sets?…
We consider the problem of lower bounding a generalized Minkowski measure of subsets of a convex body with a log-concave probability measure, conditioned on the set size. A bound is given in terms of diameter and set size, which is sharp…
Embedding models are central to dense retrieval, semantic search, and recommendation systems, but their size often makes them impractical to deploy in resource-constrained environments such as browsers or edge devices. While smaller…
Given a non-negative real sequence $\{c_n\}_n$ such that the series $\sum_{n=1}^{\infty}c_n$ diverges, it is known that the size of an infinite subset $A\subset\mathbb{N}$ can be measured in terms of the linear density such that the…
We contribute to the study of $\aleph_1$-dense sets of reals, a mainstay in set theoretic research since Baumgartner's seminal work in the 70s. In particular, we show that it is consistent with $\textsf{MA}$ that there exists an…
We show that the problem of counting perfect matchings remains #P-complete even if we restrict the input to very dense graphs, proving the conjecture in [5]. Here "dense graphs" refer to bipartite graphs of bipartite independence number…
Given a dominating set, how much smaller a dominating set can we find through elementary operations? Here, we proceed by iterative vertex addition and removal while maintaining the property that the set forms a dominating set of bounded…
In this paper we present new ways to construct external subsets of nonstandard models of arithmetic using mostly internal sets, and show that if an ultraproduct of prime finite fields includes a copy of the algebraic real numbers then…
We consider compressed sampling over finite fields and investigate the number of compressed measurements needed for successful L0 recovery. Our results are obtained while the sparseness of the sensing matrices as well as the size of the…
We describe small dominating sets of the incidence graphs of finite projective planes by establishing a stability result which shows that dominating sets are strongly related to blocking and covering sets. Our main result states that if a…
Let $E$ be a subset of the affine plane over a finite field $\mathbb{F}_q$. We bound the size of the subgroup of $SL_2(\mathbb{F}_q)$ that preserves $E$. As a consequence, we show that if $E$ has size $\ll q^\alpha$ and is preserved by $\gg…
Let $S$ be a finitely generated abelian semigroup of invertible linear operators on a finite dimensional real or complex vector space $V$. We show that every coarsely dense orbit of $S$ is actually dense in $V$. More generally, if the orbit…
We answer a question of Darji and Keleti by proving in $ZFC$ that there exists a compact nullset $C_0\subset\RR$ 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 $C_0$…
We give a comprehensive description of the sets $A$ in finite cyclic groups such that $|2A|<\frac94|A|$; namely, we show that any set with this property is densely contained in a (one-dimensional) coset progression. This improves earlier…
Using a slight modification of an argument of Croot, Ruzsa and Schoen we establish a quantitative result on the existence of a dilated copy of any given configuration of integer points in sparse difference sets. More precisely, given any…
The author, together with Nagy, studied the following problem on unavoidable intersections of given size in binary affine spaces. Given an $m$-element set $S\subseteq \mathbb{F}_2^n$, is there guaranteed to be a $[k,t]$-flat, that is, a…
We consider large uniform labeled random graphs in different classes with prescribed decorations in their modular decomposition. Our main result is the estimation of the number of copies of every graph as an induced subgraph. As a…