Distinct Natural Numbers Research Articles

Tiling Rectangles and the Plane Using Squares of Integral Sides

We study the problem of perfect tiling in the plane and explore the possibility of tiling a rectangle using integral distinct squares. Assume a set of distinguishable squares (or equivalently a set of distinct natural numbers) is given, and one has to decide whether it can tile the plane or a rectangle or not. Previously, it has been proved that tiling the plane is not feasible using a set of odd numbers or an infinite sequence of natural numbers including exactly two odd numbers. The problem is open for different situations in which the number of odd numbers is arbitrary. In addition to providing a solution to this special case, we discuss some open problems to tile the plane and rectangles in this paper.

Spectral disjointness of rescalings of some surface flows

We study self-similarity problem for two classes of flows: (1) special flows over circle rotations and under roof functions with symmetric logarithmic singularities (2) special flows over interval exchange transformations and under roof functions which are of two types * piecewise constant with one additional discontinuity which is not a discontinuity of the IET; * piecewise linear over exchanged intervals with non-zero slope. We show that if $\{T^f_t\}_{t\in\mathbb R}$ is as in (1) then for a full measure set of rotations, and for every two distinct natural numbers $K$ and $L$, we have that $\{T^f_{Kt}\}_{t\in\mathbb R}$ and $\{T^f_{Lt}\}_{t\in\mathbb R}$ are spectrally disjoint. Similarly, if $\{T^f_t\}_{t\in\mathbb R}$ is as in (2), then for a full measure set of IET's, a.e. position of the additional discontinuity (of $f$, in piecewise constant case) and every two distinct natural numbers $K$ and $L$, the flows $\{T^f_{Kt}\}_{t\in\mathbb R}$ and $\{T^f_{Lt}\}_{t\in\mathbb R}$ are spectrally disjoint.

An averaged form of Chowla’s conjecture

Let $\lambda$ denote the Liouville function. A well known conjecture of Chowla asserts that for any distinct natural numbers $h_1,\dots,h_k$, one has $\sum_{1 \leq n \leq X} \lambda(n+h_1) \dotsm \lambda(n+h_k) = o(X)$ as $X \to \infty$. This conjecture remains unproven for any $h_1,\dots,h_k$ with $k \geq 2$. In this paper, using the recent results of the first two authors on mean values of multiplicative functions in short intervals, combined with an argument of Katai and Bourgain-Sarnak-Ziegler, we establish an averaged version of this conjecture, namely $$\sum_{h_1,\dots,h_k \leq H} \left|\sum_{1 \leq n \leq X} \lambda(n+h_1) \dotsm \lambda(n+h_k)\right| = o(H^kX)$$ as $X \to \infty$ whenever $H = H(X) \leq X$ goes to infinity as $X \to \infty$, and $k$ is fixed. Related to this, we give the exponential sum estimate $$ \int_0^X \left|\sum_{x \leq n \leq x+H} \lambda(n) e(\alpha n)\right| dx = o( HX )$$ as $X \to \infty$ uniformly for all $\alpha \in \mathbb{R}$, with $H$ as before. Our arguments in fact give quantitative bounds on the decay rate (roughly on the order of $\frac{\log\log H}{\log H}$), and extend to more general bounded multiplicative functions than the Liouville function, yielding an averaged form of a (corrected) conjecture of Elliott.

The Interleaved Multichromatic Number of a Graph

For $k\ge 1$, we consider interleaved $k$-tuple colorings of the nodes of a graph, that is, assignments of $k$ distinct natural numbers to each node in such a way that nodes that are connected by an edge receive numbers that are strictly alternating between them with respect to the relation $<$. If it takes at least $\chi_{int}^k(G)$ distinct numbers to provide graph $G$ with such a coloring, then the interleaved multichromatic number of $G$ is $\chi_{int}^*(G)=\inf_{k\ge 1}\chi_{int}^k(G)/k$ and is known to be given by a function of the simple cycles of $G$ under acyclic orientations if $G$ is connected [1]. This paper contains a new proof of this result. Unlike the original proof, the new proof makes no assumptions on the connectedness of $G$, nor does it resort to the possible applications of interleaved $k$-tuple colorings and their properties.

Equitable labelings of cycles

AbstractEvery labeling of the vertices of a graph with distinct natural numbers induces a natural labeling of its edges: the label of an edge (x, y) is the absolute value of the difference of the labels of x and y. By analogy with graceful labelings, we say that a labeling of the vertices of a graph of order n is minimally k‐equitable if the vertices are labeled with 1,2,…, n and in the induced labeling of its edges every label either occurs exactly k times or does not occur at all. Bloom [3] posed the following question: Is the condition that k is a proper divisor of n sufficient for the cycle Cn to have a minimal k‐equitable labeling? We give a positive answer to this question. © 1993 John Wiley &amp; Sons, Inc.

Frequency computations and the cardinality theorem

In 1960 G. F. Rose [R] made the following definition: A function f: ω → ω is (m, n)-computable, where 1 ≤ m ≤ n, iff there exists a recursive function R: ωn → ωn such that, for all n-tuples (x1,…, xn) of distinct natural numbers,J. Myhill (see [McN, p. 393]) asked if f had to be recursive if m was close to n; B. A. Trakhtenbrot [T] responded by showing in 1963 that f is recursive whenever 2m &gt; n. This result is optimal, because, for example, the characteristic function of any semirecursive set is (1,2)-computable. Trakhtenbrot's work was extended by E. B. Kinber [Ki1], using similar techniques. In 1986 R. Beigel [B] made a powerful conjecture, much more general than the above results. Partial verification, falling short of a full proof, appeared in [O]. Using new techniques, M. Kummer has recently established the conjecture, which will henceforth be referred to as the cardinality theorem (CT). It is the goal of this paper to show the connections between these various theorems, to review the methods used by Trakhtenbrot, and to use them to prove a special case of CT strong enough to imply Kinber's theorem (see §3). We thus have a hierarchy of results, with CT at the top. We will also include a discussion of Kummer's methods, but not a proof of CT.

Stability in the I. V. Ostrovskii-R. Cuppens theorem on groups

Let X be a locally compact separable metric Abelian group. Unimprovable estimates are obtained for the stability of the decompositions of the generalized Poisson distribution e(F) on X, where F is a completely finite measure on X such that its powers fn* with respect to convolution are pairwise singular for distinct natural numbers n.

On sequences of positive integers

Let a 1 , a 2 ,..., a m be any finite set of distinct natural numbers, and let b 1 , b 2 ,...be the sequence formed by all those numbers which are divisible by any of a 1 , a 2 ..., a m . This sequence has a density in the obvious sense and we denote this density by A(a 1 a 2 ,...a m ).