scholarly journals A Note on the Abelian Complexity of the Rudin-Shapiro Sequence

Mathematics ◽  
2022 ◽  
Vol 10 (2) ◽  
pp. 221
Author(s):  
Xiaotao Lü ◽  
Pengju Han
Keyword(s):  
Positive Integer ◽  
Complexity Function ◽  
Summatory Function ◽  
Point Set

Let {r(n)}n≥0 be the Rudin-Shapiro sequence, and let ρ(n):=max{∑j=ii+n−1r(j)∣i≥0}+1 be the abelian complexity function of the Rudin-Shapiro sequence. In this note, we show that the function ρ(n) has many similarities with the classical summatory function Sr(n):=∑i=0nr(i). In particular, we prove that for every positive integer n, 3≤ρ(n)n≤3. Moreover, the point set {ρ(n)n:n≥1} is dense in [3,3].

scholarly journals ON INTEGER SEQUENCES GENERATED BY LINEAR MAPS

2009 ◽  
Vol 51 (2) ◽  
pp. 243-252
Author(s):  
ARTŪRAS DUBICKAS
Keyword(s):  
Lower Bound ◽  
Positive Integer ◽  
Real Number ◽  
Constant Independent ◽  
Integer Sequences ◽  
Real Numbers ◽  
Complexity Function ◽  
Linear Maps ◽  
Coprime Integers ◽  
Positive Integers

AbstractLetx0<x1<x2< ⋅⋅⋅ be an increasing sequence of positive integers given by the formulaxn=⌊βxn−1+ γ⌋ forn=1, 2, 3, . . ., where β > 1 and γ are real numbers andx0is a positive integer. We describe the conditions on integersbd, . . .,b0, not all zero, and on a real number β > 1 under which the sequence of integerswn=bdxn+d+ ⋅⋅⋅ +b0xn,n=0, 1, 2, . . ., is bounded by a constant independent ofn. The conditions under which this sequence can be ultimately periodic are also described. Finally, we prove a lower bound on the complexity function of the sequenceqxn+1−pxn∈ {0, 1, . . .,q−1},n=0, 1, 2, . . ., wherex0is a positive integer,p>q> 1 are coprime integers andxn=⌈pxn−1/q⌉ forn=1, 2, 3, . . . A similar speculative result concerning the complexity of the sequence of alternatives (F:x↦x/2 orS:x↦(3x+1)/2) in the 3x+1 problem is also given.

On the minimum cardinality of a planar point set containing two disjoint convex polygons

2013 ◽  
Vol 50 (3) ◽  
pp. 331-354
Author(s):  
Liping Wu ◽  
Wanbing Lu
Keyword(s):  
Positive Integer ◽  
Convex Hulls ◽  
Convex Polygons ◽  
Minimum Cardinality ◽  
Planar Point ◽  
Point Set ◽  
Disjoint Convex

Let N(k, l) be the smallest positive integer such that any set of N(k, l) points in the plane, no three collinear, contains both a convex k-gon and a convex l-gon with disjoint convex hulls. In this paper, we prove that N(3, 4) = 7, N(4, 4) = 9, N(3, 5) = 10 and N(4, 5) = 11.

On differences of two squares

2006 ◽  
Vol 4 (1) ◽  
pp. 110-122
Author(s):  
Manfred Kühleitner ◽  
Werner Nowak
Keyword(s):  
Lower Bound ◽  
Positive Integer ◽  
Error Term ◽  
Arithmetic Function ◽  
Close Connection ◽  
Mean Square ◽  
Number Of Divisors ◽  
Summatory Function ◽  
Average Size ◽  
Sharp Lower Bound

AbstractThe arithmetic function ρ(n) counts the number of ways to write a positive integer n as a difference of two squares. Its average size is described by the Dirichlet summatory function Σn≤x ρ(n), and in particular by the error term R(x) in the corresponding asymptotics. This article provides a sharp lower bound as well as two mean-square results for R(x), which illustrates the close connection between ρ(n) and the number-of-divisors function d(n).

Weak Normality and Related Properties

1970 ◽  
Vol 22 (5) ◽  
pp. 997-1001
Author(s):  
Eugene S. Ball
Keyword(s):  
Positive Integer ◽  
Topological Space ◽  
Closed Set ◽  
Common Part ◽  
Closed Sets ◽  
Open Set ◽  
Point Set ◽  
Weak Normality ◽  
Definition Of

In [5], Zenor stated the definition of weakly normal. In the main, since weak normality does not imply either normality or regularity, various properties related to either normality or regularity will be considered in the context of weak normality.Throughout this paper the word “space” will mean topological space. The closure of a point set M will be denoted by cl(M). The closure of a point set M with respect to the subspace K will be denoted by cl(M, K).Definition 1. A space S is weakly normal provided that if is a monotonically decreasing sequence of closed sets in S with no common part and H is a closed set in S not intersecting H1, then there is a positive integer N and an open set D such that HN ⊂ D and cl(D) does not intersect H.

Computational Micrograph Registration with Sieve Processes

1996 ◽  
Vol 54 ◽  
pp. 440-441
Author(s):  
P.J. Phillips ◽  
J. Huang ◽  
S. M. Dunn
Keyword(s):  
Planar Graph ◽  
Efficient Algorithm ◽  
Spatial Organization ◽  
Spatial Arrangement ◽  
Stereo Image ◽  
Image Model ◽  
Geometric Invariants ◽  
Point Set

In this paper we present an efficient algorithm for automatically finding the correspondence between pairs of stereo micrographs, the key step in forming a stereo image. The computation burden in this problem is solving for the optimal mapping and transformation between the two micrographs. In this paper, we present a sieve algorithm for efficiently estimating the transformation and correspondence.In a sieve algorithm, a sequence of stages gradually reduce the number of transformations and correspondences that need to be examined, i.e., the analogy of sieving through the set of mappings with gradually finer meshes until the answer is found. The set of sieves is derived from an image model, here a planar graph that encodes the spatial organization of the features. In the sieve algorithm, the graph represents the spatial arrangement of objects in the image. The algorithm for finding the correspondence restricts its attention to the graph, with the correspondence being found by a combination of graph matchings, point set matching and geometric invariants.

Almost empty polygons

2003 ◽  
Vol 40 (3) ◽  
pp. 269-286 ◽  
Author(s):  
H. Nyklová
Keyword(s):  
Exact Results ◽  
Point Sets ◽  
Planar Point ◽  
Convex Position ◽  
Vertex Set ◽  
Point Set ◽  
Empty Polygons

In this paper we study a problem related to the classical Erdos--Szekeres Theorem on finding points in convex position in planar point sets. We study for which n and k there exists a number h(n,k) such that in every planar point set X of size h(n,k) or larger, no three points on a line, we can find n points forming a vertex set of a convex n-gon with at most k points of X in its interior. Recall that h(n,0) does not exist for n = 7 by a result of Horton. In this paper we prove the following results. First, using Horton's construction with no empty 7-gon we obtain that h(n,k) does not exist for k = 2(n+6)/4-n-3. Then we give some exact results for convex hexagons: every point set containing a convex hexagon contains a convex hexagon with at most seven points inside it, and any such set of at least 19 points contains a convex hexagon with at most five points inside it.

The Order of Monochromatic Subgraphs with a Given Minimum Degree

10.37236/1725 ◽  
2003 ◽  
Vol 10 (1) ◽  
Author(s):  
Yair Caro ◽  
Raphael Yuster
Keyword(s):  
Positive Integer ◽  
Minimum Degree

Let $G$ be a graph. For a given positive integer $d$, let $f_G(d)$ denote the largest integer $t$ such that in every coloring of the edges of $G$ with two colors there is a monochromatic subgraph with minimum degree at least $d$ and order at least $t$. Let $f_G(d)=0$ in case there is a $2$-coloring of the edges of $G$ with no such monochromatic subgraph. Let $f(n,k,d)$ denote the minimum of $f_G(d)$ where $G$ ranges over all graphs with $n$ vertices and minimum degree at least $k$. In this paper we establish $f(n,k,d)$ whenever $k$ or $n-k$ are fixed, and $n$ is sufficiently large. We also consider the case where more than two colors are allowed.

Sign in / Sign up

Export Citation Format

Share Document