scholarly journals On the Minimum Number of Monochromatic Generalized Schur Triples

10.37236/6490 ◽  
2017 ◽  
Vol 24 (2) ◽  
Author(s):  
Thotsaporn Thanatipanonda ◽  
Elaine Wong
Keyword(s):  
Positive Integer ◽  
General Problem ◽  
Original Proof ◽  
Minimum Number ◽  
Fixed Positive Integer

The solution to the problem of finding the minimum number of monochromatic triples $(x,y,x+ay)$ with $a\geq 2$ being a fixed positive integer over any 2-coloring of $[1,n]$ was conjectured by Butler, Costello, and Graham (2010) and Thanathipanonda (2009). We solve this problem using a method based on Datskovsky's proof (2003) on the minimum number of monochromatic Schur triples $(x,y,x+y)$. We do this by exploiting the combinatorial nature of the original proof and adapting it to the general problem.

Note Upon The Generalized Cayleyan Operator

1949 ◽  
Vol 1 (1) ◽  
pp. 48-56 ◽  
Author(s):  
H. W. Turnbull
Keyword(s):  
Positive Integer ◽  
Original Proof ◽  
Image Position

The following note which deals with the effect of a certain determinantal operator when it acts upon a product of determinants was suggested by the original proof which Dr. Alfred Young gave of the propertysubsisting between the positive P and the negative N substitutional operators, θ being a positive integer. This result which establishes the idempotency of the expression θ−1NP within an appropriate algebra is fundamental in the Quantitative Substitutional Analysis that Young developed.

A Combinatorial Theorem

1966 ◽  
Vol 9 (4) ◽  
pp. 515-516
Author(s):  
Paul G. Bassett
Keyword(s):  
Positive Integer ◽  
Combinatorial Theorem ◽  
Image Position ◽  
Fixed Positive Integer ◽  
Positive Integers

Let n be an arbitrary but fixed positive integer. Let Tn be the set of all monotone - increasing n-tuples of positive integers:1Define2In this note we prove that ϕ is a 1–1 mapping from Tn onto {1, 2, 3,…}.

On the metric dimension and diameter of circulant graphs with three jumps

2018 ◽  
Vol 10 (01) ◽  
pp. 1850008
Author(s):  
Muhammad Imran ◽  
A. Q. Baig ◽  
Saima Rashid ◽  
Andrea Semaničová-Feňovčíková
Keyword(s):  
Positive Integer ◽  
Connected Graph ◽  
Metric Spaces ◽  
Metric Dimension ◽  
Resolving Set ◽  
Circulant Graphs ◽  
Infinite Class ◽  
Metric Properties ◽  
Minimum Number ◽  
Metric Basis

Let [Formula: see text] be a connected graph and [Formula: see text] be the distance between the vertices [Formula: see text] and [Formula: see text] in [Formula: see text]. The diameter of [Formula: see text] is defined as [Formula: see text] and is denoted by [Formula: see text]. A subset of vertices [Formula: see text] is called a resolving set for [Formula: see text] if for every two distinct vertices [Formula: see text], there is a vertex [Formula: see text], [Formula: see text], such that [Formula: see text]. A resolving set containing the minimum number of vertices is called a metric basis for [Formula: see text] and the number of vertices in a metric basis is its metric dimension, denoted by [Formula: see text]. Metric dimension is a generalization of affine dimension to arbitrary metric spaces (provided a resolving set exists). Let [Formula: see text] be a family of connected graphs [Formula: see text] depending on [Formula: see text] as follows: the order [Formula: see text] and [Formula: see text]. If there exists a constant [Formula: see text] such that [Formula: see text] for every [Formula: see text] then we shall say that [Formula: see text] has bounded metric dimension, otherwise [Formula: see text] has unbounded metric dimension. If all graphs in [Formula: see text] have the same metric dimension, then [Formula: see text] is called a family of graphs with constant metric dimension. In this paper, we study the metric properties of an infinite class of circulant graphs with three generators denoted by [Formula: see text] for any positive integer [Formula: see text] and when [Formula: see text]. We compute the diameter and determine the exact value of the metric dimension of these circulant graphs.

scholarly journals Hyperstability of the k -Cubic Functional Equation in Non-Archimedean Banach Spaces

2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Youssef Aribou ◽  
Mohamed Rossafi
Keyword(s):  
Functional Equation ◽  
Fixed Point ◽  
Positive Integer ◽  
Banach Spaces ◽  
Functional Equations ◽  
Cubic Functional Equation ◽  
Fixed Point Approach ◽  
Fixed Positive Integer

Using the fixed point approach, we investigate a general hyperstability results for the following k -cubic functional equations f k x + y + f k x − y = k f x + y + k f x − y + 2 k k 2 − 1 f x , where k is a fixed positive integer ≥ 2 , in ultrametric Banach spaces.

scholarly journals On the sum of digits of some sequences of integers

2013 ◽  
Vol 11 (1) ◽  
Author(s):  
Javier Cilleruelo ◽  
Florian Luca ◽  
Juanjo Rué ◽  
Ana Zumalacárregui
Keyword(s):  
Number Theory ◽  
Positive Integer ◽  
Integer Sequences ◽  
Sum Of Digits ◽  
Fixed Positive Integer ◽  
Almost All

AbstractLet b ≥ 2 be a fixed positive integer. We show for a wide variety of sequences {a n}n=1∞ that for almost all n the sum of digits of a n in base b is at least c b log n, where c b is a constant depending on b and on the sequence. Our approach covers several integer sequences arising from number theory and combinatorics.

Upper and Lower Bounds for a Function Related to Brown's Lemma

Integers ◽  
2010 ◽  
Vol 10 (6) ◽  
Author(s):  
Hayri Ardal
Keyword(s):  
Positive Integer ◽  
Lower Bounds ◽  
Upper And Lower Bounds ◽  
Fixed Positive Integer ◽  
Positive Integers

AbstractThe well-known Brown's lemma says that for every finite coloring of the positive integers, there exist a fixed positive integer

scholarly journals On the Stability of Quadratic Functional Equations

2008 ◽  
Vol 2008 ◽  
pp. 1-8 ◽  
Author(s):  
Jung Rye Lee ◽  
Jong Su An ◽  
Choonkil Park
Keyword(s):  
Functional Equation ◽  
Positive Integer ◽  
Banach Spaces ◽  
Functional Equations ◽  
Vector Spaces ◽  
Quadratic Functional ◽  
The Stability ◽  
Fixed Positive Integer ◽  
Rassias Stability

LetX,Ybe vector spaces andka fixed positive integer. It is shown that a mappingf(kx+y)+f(kx-y)=2k2f(x)+2f(y)for allx,y∈Xif and only if the mappingf:X→Ysatisfiesf(x+y)+f(x-y)=2f(x)+2f(y)for allx,y∈X. Furthermore, the Hyers-Ulam-Rassias stability of the above functional equation in Banach spaces is proven.

scholarly journals Region Coloring in Minahasa Regency Using Sequential Color Algorithm

d'CARTESIAN ◽  
2019 ◽  
Vol 8 (2) ◽  
pp. 86
Author(s):  
Yevie Ingamita ◽  
Nelson Nainggolan ◽  
Benny Pinontoan
Keyword(s):  
Graph Theory ◽  
Positive Integer ◽  
Chromatic Number ◽  
Human Life ◽  
Minimum Number ◽  
Mathematical Sciences ◽  
Map Coloring ◽  
Graph Application

Graph Theory is one of the mathematical sciences whose application is very wide in human life. One of theory graph application is Map Coloring. This research discusses how to color the map of Minahasa Regency by using the minimum color that possible. The algorithm used to determine the minimum color in coloring the region of Minahasa Regency that is Sequential Color Algorithm. The Sequential Color Algorithm is an algorithm used in coloring a graph with k-color, where k is a positive integer. Based on the results of this research was found that the Sequential Color Algorithm can be used to color the map of Minahasa Regency with the minimum number of colors or chromatic number χ(G) obtained in the coloring of 25 sub-districts on the map of Minahasa Regency are 3 colors (χ(G) = 3).

scholarly journals On the generalized Ramanujan-Nagell equation $ x^2+(2k-1)^y = k^z $ with $ k\equiv 3 $ (mod 4)

2021 ◽  
Vol 6 (10) ◽  
pp. 10596-10601
Author(s):  
Yahui Yu ◽  
◽  
Jiayuan Hu ◽  
Keyword(s):  
Positive Integer ◽  
Unsolved Problem ◽  
Integer Solution ◽  
Positive Integer Solution ◽  
Elementary Methods ◽  
Fixed Positive Integer ◽  
Almost All ◽  
Terai’S Conjecture ◽  
Positive Integers

<abstract><p>Let $ k $ be a fixed positive integer with $ k &gt; 1 $. In 2014, N. Terai <sup>[<xref ref-type="bibr" rid="b6">6</xref>]</sup> conjectured that the equation $ x^2+(2k-1)^y = k^z $ has only the positive integer solution $ (x, y, z) = (k-1, 1, 2) $. This is still an unsolved problem as yet. For any positive integer $ n $, let $ Q(n) $ denote the squarefree part of $ n $. In this paper, using some elementary methods, we prove that if $ k\equiv 3 $ (mod 4) and $ Q(k-1)\ge 2.11 $ log $ k $, then the equation has only the positive integer solution $ (x, y, z) = (k-1, 1, 2) $. It can thus be seen that Terai's conjecture is true for almost all positive integers $ k $ with $ k\equiv 3 $(mod 4).</p></abstract>

An optimal algorithm to find minimum k-hop dominating set of interval graphs

2019 ◽  
Vol 11 (02) ◽  
pp. 1950016 ◽  
Author(s):  
Sambhu Charan Barman ◽  
Madhumangal Pal ◽  
Sukumar Mondal
Keyword(s):  
Positive Integer ◽  
Optimal Algorithm ◽  
Dominating Set ◽  
Interval Graphs ◽  
Fixed Positive Integer

For a fixed positive integer [Formula: see text], a [Formula: see text]-hop dominating set [Formula: see text] of a graph [Formula: see text] is a subset of [Formula: see text] such that every vertex [Formula: see text] is within [Formula: see text]-steps from at least one vertex [Formula: see text], i.e., [Formula: see text]. A [Formula: see text]-hop dominating set [Formula: see text] is said to be minimal if there does not exist any [Formula: see text] such that [Formula: see text] is a [Formula: see text]-hop dominating set of G. A dominating set [Formula: see text] is said to be minimum [Formula: see text]-hop dominating set, if it is minimal as well as it is [Formula: see text]-hop dominating set. In this paper, we present an optimal algorithm to find a minimum [Formula: see text]-hop dominating set of interval graphs with [Formula: see text] vertices which runs in [Formula: see text] time.

Sign in / Sign up

Export Citation Format

Share Document