Related papers: On a bounded remainder set for $(t,s)$ sequences I

Let us call a simple graph on $n\geq 2$ vertices a prime gap graph if its vertex degrees are $1$ and the first $n-1$ prime gaps. We show that such a graph exists for every large $n$, and in fact for every $n\geq 2$ if we assume the Riemann…

A planar point set of $n$ points is called {\em $\gamma$-dense} if the ratio of the largest and smallest distances among the points is at most $\gamma\sqrt{n}$. We construct a dense set of $n$ points in the plane with…

A set $S$ of vertices in a graph $G(V,E)$ is called a dominating set if every vertex $v\in V$ is either an element of $S$ or is adjacent to an element of $S$. A set $S$ of vertices in a graph $G(V,E)$ is called a total dominating set if…

In 1971 Cusick proved that every real number $x\in[0,1]$ can be expressed as a sum of two continued fractions with no partial quotients equal to $1$. In other words, if we define a set $$ S(k):= \{ x\in[0,1] : a_n(x) \geq k \text{ for all }…

A subset $D \subseteq V $of a graph $G = (V, E)$ is a $(1, j)$-set if every vertex $v \in V \setminus D$ is adjacent to at least $1$ but not more than $j$ vertices in D. The cardinality of a minimum $(1, j)$-set of $G$, denoted as…

Let S be a subset of the unit disk, and let F(s) denote the class of completely multiplicative functions f such that f(p) is in S for all primes p. The authors' main concern is which numbers arise as mean-values of functions in F(s). More…

Let T be a C_0-semigroup on X with generator A. We prove that if the abscissa of uniform boundedness of the resolvent A is non-negative then for each a non-decreasing function h:[0,\infty] -> [0,\infty], there are x' in X' and x in X such…

Let $ (H_s(n))_{n \geq 1} $ be an $s-$dimensional Halton's sequence. Let $D_N$ be the discrepancy of the sequence $ (H_s(n))_{n = 1}^{N} $. It is known that $ND_N =O(\ln^s N)$ as $N \to \infty $. In this paper we prove that this estimate is…

We characterize observable sets for 1-dim Schr\"{o}dinger equations in $\mathbb{R}$: $i \partial_t u = (-\partial_x^2+x^{2m})u$ (with $m\in \mathbb{N}:=\{0,1,\dots\}$). More precisely, we obtain what follows: First, when $m=0$,…

We consider the following conjecture (from Huang, et al): Let $\Delta^+$ denote the upper half disc in $\mathbb{C}$ and let $\gamma = ( - 1, 1)$ (viewed as an interval in the real axis in $\mathbb{C}$). Assume that $F$ is a holomorphic…

The sequence reconstruction problem asks for the recovery of a sequence from multiple noisy copies, where each copy may contain up to $r$ errors. In the case of permutations on \(n\) letters under the Hamming metric, this problem is closely…

A permutation sequence is said to be convergent if the density of occurrences of every fixed permutation in the elements of the sequence converges. We prove that such a convergent sequence has a natural limit object, namely a Lebesgue…

We derive new bounds of the remainder in a combinatorial central limit theorem without assumptions on independence and existence of moments of summands. For independent random variables our theorems imply Esseen and Berry-Esseen type…

A set of vertices $X\subseteq V$ in a simple graph $G(V,E)$ is irredundant (CO-irredundant) if each vertex $x\in X$ is either isolated in the induced subgraph $G[X]$ or else has a private neighbor $y\in V\setminus X$ ($y\in V$) that is…

Lower and upper bounds $B_a(x)$ on the incomplete gamma function $\Gamma(a,x)$ are given for all real $a$ and all real $x>0$. These bounds $B_a(x)$ are exact in the sense that $B_a(x)\underset{x\downarrow0}\sim\Gamma(a,x)$ and…

We call a family $\mathcal{F}$ of subsets of $[n]$ $s$-saturated if it contains no $s$ pairwise disjoint sets, and moreover no set can be added to $\mathcal{F}$ while preserving this property (here $[n] = \{1,\ldots,n\}$). More than 40…

Given a group $G$, we write $g^G$ for the conjugacy class of $G$ containing the element $g$. A theorem of B. H. Neumann states that if $G$ is a group in which all conjugacy classes are finite with bounded size, then the commutator subgroup…

A nonempty set $F$ is Schreier if $\min F\ge |F|$. Bird observed that counting Schreier sets in a certain way produces the Fibonacci sequence. Since then, various connections between variants of Schreier sets and well-known sequences have…

Given an integer $d \geq 2$, $s \in (0,1]$, and $t \in [0,2(d-1)]$, suppose a set $X$ in $\mathbb{R}^d$ has the following property: there is a collection of lines of packing dimension $t$ such that every line from the collection intersects…

We say that a sequence $\{x_n\}_{n \geq 1}$ in $[0,1)$ has Poissonian pair correlations if \begin{equation*} \lim_{N \rightarrow \infty} \frac{1}{N} \# \left\{ 1 \leq l \neq m \leq N \, : \, \left\lVert x_l-x_m \right\rVert < \frac{s}{N}…