A positive integer code by coding multiple length information

2001 ◽  
Vol 84 (8) ◽  
pp. 46-56 ◽  
Author(s):  
Hirofumi Nakamura ◽  
Sadayuki Murashima
Keyword(s):  
Positive Integer ◽  
Integer Code

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.

Extensions of Rings Having McCoy Condition

2009 ◽  
Vol 52 (2) ◽  
pp. 267-272 ◽  
Author(s):  
Muhammet Tamer Koşan
Keyword(s):  
Positive Integer ◽  
Associative Ring ◽  
Nonzero Element ◽  
Ring Extensions

AbstractLet R be an associative ring with unity. Then R is said to be a right McCoy ring when the equation f (x)g(x) = 0 (over R[x]), where 0 ≠ f (x), g(x) ∈ R[x], implies that there exists a nonzero element c ∈ R such that f (x)c = 0. In this paper, we characterize some basic ring extensions of right McCoy rings and we prove that if R is a right McCoy ring, then R[x]/(xn) is a right McCoy ring for any positive integer n ≥ 2.

EVALUATION OF CONVOLUTION SUMS AND FOR k = a · b = 21, 33, AND 35

2021 ◽  
pp. 1-20
Author(s):  
K. PUSHPA ◽  
K. R. VASUKI
Keyword(s):  
Positive Integer ◽  
Quadratic Form ◽  
Eisenstein Series ◽  
Modular Forms ◽  
Divisor Function ◽  
Convolution Sums

Abstract The article focuses on the evaluation of convolution sums $${W_k}(n): = \mathop \sum \nolimits_{_{m < {n \over k}}} \sigma (m)\sigma (n - km)$$ involving the sum of divisor function $$\sigma (n)$$ for k =21, 33, and 35. In this article, our aim is to obtain certain Eisenstein series of level 21 and use them to evaluate the convolution sums for level 21. We also make use of the existing Eisenstein series identities for level 33 and 35 in evaluating the convolution sums for level 33 and 35. Most of the convolution sums were evaluated using the theory of modular forms, whereas we have devised a technique which is free from the theory of modular forms. As an application, we determine a formula for the number of representations of a positive integer n by the octonary quadratic form $$(x_1^2 + {x_1}{x_2} + ax_2^2 + x_3^2 + {x_3}{x_4} + ax_4^2) + b(x_5^2 + {x_5}{x_6} + ax_6^2 + x_7^2 + {x_7}{x_8} + ax_8^2)$$ , for (a, b)=(1, 7), (1, 11), (2, 3), and (2, 5).

scholarly journals On the Ternary Exponential Diophantine Equation Equating a Perfect Power and Sum of Products of Consecutive Integers

Mathematics ◽  
2021 ◽  
Vol 9 (15) ◽  
pp. 1813
Author(s):  
S. Subburam ◽  
Lewis Nkenyereye ◽  
N. Anbazhagan ◽  
S. Amutha ◽  
M. Kameswari ◽  
...  
Keyword(s):  
Positive Integer ◽  
Diophantine Equation ◽  
Upper Bound ◽  
Exponential Diophantine Equation ◽  
Research Article ◽  
All Solutions ◽  
Sum Of Products ◽  
Consecutive Integers ◽  
Sums Of Products ◽  
Positive Integers

Consider the Diophantine equation yn=x+x(x+1)+⋯+x(x+1)⋯(x+k), where x, y, n, and k are integers. In 2016, a research article, entitled – ’power values of sums of products of consecutive integers’, primarily proved the inequality n= 19,736 to obtain all solutions (x,y,n) of the equation for the fixed positive integers k≤10. In this paper, we improve the bound as n≤ 10,000 for the same case k≤10, and for any fixed general positive integer k, we give an upper bound depending only on k for n.

scholarly journals Repdigits as products of consecutive Padovan or Perrin numbers

2021 ◽  
Author(s):  
Salah Eddine Rihane ◽  
Alain Togbé
Keyword(s):  
Positive Integer ◽  
Decimal Expansion

AbstractA repdigit is a positive integer that has only one distinct digit in its decimal expansion, i.e., a number of the form $$a(10^m-1)/9$$ a ( 10 m - 1 ) / 9 , for some $$m\ge 1$$ m ≥ 1 and $$1 \le a \le 9$$ 1 ≤ a ≤ 9 . Let $$\left( P_n\right) _{n\ge 0}$$ P n n ≥ 0 and $$\left( E_n\right) _{n\ge 0}$$ E n n ≥ 0 be the sequence of Padovan and Perrin numbers, respectively. This paper deals with repdigits that can be written as the products of consecutive Padovan or/and Perrin numbers.

On the prime factors of the iterates of the Ramanujan τ–function

2020 ◽  
Vol 63 (4) ◽  
pp. 1031-1047
Author(s):  
Florian Luca ◽  
Sibusiso Mabaso ◽  
Pantelimon Stănică
Keyword(s):  
Positive Integer ◽  
Prime Factors

AbstractIn this paper, for a positive integer n ≥ 1, we look at the size and prime factors of the iterates of the Ramanujan τ function applied to n.

scholarly journals On the least common multiple of random q-integers

2021 ◽  
Vol 7 (1) ◽  
Author(s):  
Carlo Sanna
Keyword(s):  
Positive Integer ◽  
Asymptotic Formula ◽  
Probabilistic Model ◽  
Expected Value ◽  
Random Set ◽  
Common Multiple ◽  
Least Common Multiple

AbstractFor every positive integer n and for every $$\alpha \in [0, 1]$$ α ∈ [ 0 , 1 ] , let $${\mathcal {B}}(n, \alpha )$$ B ( n , α ) denote the probabilistic model in which a random set $${\mathcal {A}} \subseteq \{1, \ldots , n\}$$ A ⊆ { 1 , … , n } is constructed by picking independently each element of $$\{1, \ldots , n\}$$ { 1 , … , n } with probability $$\alpha $$ α . Cilleruelo, Rué, Šarka, and Zumalacárregui proved an almost sure asymptotic formula for the logarithm of the least common multiple of the elements of $${\mathcal {A}}$$ A .Let q be an indeterminate and let $$[k]_q := 1 + q + q^2 + \cdots + q^{k-1} \in {\mathbb {Z}}[q]$$ [ k ] q : = 1 + q + q 2 + ⋯ + q k - 1 ∈ Z [ q ] be the q-analog of the positive integer k. We determine the expected value and the variance of $$X := \deg {\text {lcm}}\!\big ([{\mathcal {A}}]_q\big )$$ X : = deg lcm ( [ A ] q ) , where $$[{\mathcal {A}}]_q := \big \{[k]_q : k \in {\mathcal {A}}\big \}$$ [ A ] q : = { [ k ] q : k ∈ A } . Then we prove an almost sure asymptotic formula for X, which is a q-analog of the result of Cilleruelo et al.

Some generalized characters associated to a transitive permutation group

2020 ◽  
Vol 23 (3) ◽  
pp. 393-397
Author(s):  
Wolfgang Knapp ◽  
Peter Schmid
Keyword(s):  
Positive Integer ◽  
Permutation Group ◽  
Frobenius Group ◽  
Sufficient Conditions ◽  
Necessary Condition ◽  
Transitive Permutation Group ◽  
Point Stabilizer ◽  
Necessary And Sufficient ◽  
Regular Character ◽  
Permutation Character

AbstractLet G be a finite transitive permutation group of degree n, with point stabilizer {H\neq 1} and permutation character π. For every positive integer t, we consider the generalized character {\psi_{t}=\rho_{G}-t(\pi-1_{G})}, where {\rho_{G}} is the regular character of G and {1_{G}} the 1-character. We give necessary and sufficient conditions on t (and G) which guarantee that {\psi_{t}} is a character of G. A necessary condition is that {t\leq\min\{n-1,\lvert H\rvert\}}, and it turns out that {\psi_{t}} is a character of G for {t=n-1} resp. {t=\lvert H\rvert} precisely when G is 2-transitive resp. a Frobenius group.

scholarly journals A new characterization of L2(p2)

2020 ◽  
Vol 18 (1) ◽  
pp. 907-915
Author(s):  
Zhongbi Wang ◽  
Chao Qin ◽  
Heng Lv ◽  
Yanxiong Yan ◽  
Guiyun Chen
Keyword(s):  
Positive Integer ◽  
Irreducible Character ◽  
Character Degrees ◽  
Prime Divisors

Abstract For a positive integer n and a prime p, let {n}_{p} denote the p-part of n. Let G be a group, \text{cd}(G) the set of all irreducible character degrees of G , \rho (G) the set of all prime divisors of integers in \text{cd}(G) , V(G)=\left\{{p}^{{e}_{p}(G)}|p\in \rho (G)\right\} , where {p}^{{e}_{p}(G)}=\hspace{.25em}\max \hspace{.25em}\{\chi {(1)}_{p}|\chi \in \text{Irr}(G)\}. In this article, it is proved that G\cong {L}_{2}({p}^{2}) if and only if |G|=|{L}_{2}({p}^{2})| and V(G)=V({L}_{2}({p}^{2})) .

Sign in / Sign up

Export Citation Format

Share Document