Projective semimodules over semirings with valuations in nonnegative integers

We introduce semirings with valuations in nonnegative integers and prove that all projective semimodules over them are free.     

Representations of integers by linear forms in nonnegative integers

Let Ω be the set of positive integers that are omitted values of the form f = Σ_i=1ⁿa_ix_i, where the a_i are fixed and relatively prime natural numbers and the x_i are variable nonnegative integers. Set ω = #Ω and κ = max Ω + 1 (the conductor). Properties of ω and κ are studied, such as an estimate for ω (similar to one found by Brauer) and the inequality 2ω ≥ κ. The so-called Gorenstein condition is shown to be equivalent to 2ω = κ.     

Solution to a linear diophantine equation for nonnegative integers

We solve the 3-variable problem: find integers x ≥ 0, y ≥ 0, z ≥ 0 that satisfy ax + by + cz = L for given integers a, b, c, L, where 1 < a < b < c < L. The method of solution is related to the one for the Frobenius problem in three variables, which has been solved by Selmer and Beyer and by Rödseth (J. Reine Angew. Math.301 (1978), 161–178). These methods take O(a) steps, in the worst case, to find the Frobenius value. The method here, for the Frobenius value, is shown to be rapid, requiring less than O(log a) steps. The diophantine equation is then solved with little extra effort to result in an O(log a) method overall.     

A rank characterization of the number of final classes of a nonnegative matrix

Let A be a nonnegative square matrix, and let D be a diagonal matrix whose iith element is $\text{(Ax)}{}_{\mathrm{i}}\text{x}{}_{\mathrm{i}}$, where x is a (fixed) positive vector. It is shown that the number of final classes of A equals n?rank(A?D). We also show that null(A?D) = null(A?D)², and that this subspace is spanned by a set of nonnegative elements. Our proof uses a characterization of nonnegative matrices having a positive eigenvector corresponding to their spectral radius.     

Two cores of a nonnegative matrix

We prove that the sequence of eigencones (i.e., cones of nonnegative eigenvectors) of positive powers A^k$A^k$ of a nonnegative square matrix A is periodic both in max algebra and in nonnegative linear algebra. Using an argument of Pullman, we also show that the Minkowski sum of the eigencones of powers of A is equal to the core of A defined as the intersection of nonnegative column spans of matrix powers, also in max algebra. Based on this, we describe the set of extremal rays of the core.     

On an additive property of sequences of nonnegative integers

Periodica Mathematica Hungarica - Let a1&;lt;... be an infinite sequence of positive integers, let k≥2 be a fixed integer and denote by Rk(n) the number of solutions of n=ai1+ai2+...+aik....     

The numerical range of a nonnegative matrix

We offer an almost self-contained development of Perron–Frobenius type results for the numerical range of an (irreducible) nonnegative matrix, rederiving and completing the previous work of Issos, Nylen and Tam, and Tam and Yang on this topic. We solve the open problem of characterizing nonnegative matrices whose numerical ranges are regular convex polygons with center at the origin. Some related results are obtained and some open problems are also posed.     

Note on the rings of integers of certain tame 2-galois extensions over a number field

For a number fieldF, we prove that any tame D4-extensionN/F has a normal integral basis (NIB) if and only if any tame (2, 2)-extensionK/F has a NIB.     

Codes over Hurwitz integers

In this study, we obtain new classes of linear codes over Hurwitz integers equipped with a new metric. We refer to the metric as the Hurwitz metric. Also, we define decoding algorithms for these codes when up to two coordinates of a transmitted code vector are affected by the error of arbitrary Hurwitz weight. The interest in the codes with respect to the Hurwitz metric is their use in coded modulation schemes based on quadrature amplitude modulation (QAM)-type constellations where the Hamming metric and the Lee metric are not appropriate.     

On a nonnegative irreducible matrix that is similar to a positive matrix

Let A be an n×n irreducible nonnegative (elementwise) matrix. Borobia and Moro raised the following question: Suppose that every diagonal of A contains a positive entry. Is A similar to a positive matrix? We give an affirmative answer in the case n = 4.     

Noncanonical number systems in the integers

The well-known binary and decimal representations of the integers, and other similar number systems, admit many generalisations. Here, we investigate whether still every integer could have a finite expansion on a given integer base b, when we choose a digit set that does not contain 0. We prove that such digit sets exist and we provide infinitely many examples for every base b with |b|?4, and for b=−2. For the special case b=−2, we give a full characterisation of all valid digit sets.     

Prime and composite integers close to powers of a number

We prove that, for any real numbers ξ ≠ 0 and ν, the sequence of integer parts [ξ2 ⁿ  + ν], n = 0, 1, 2, . . . , contains infinitely many composite numbers. Moreover, if the number ξ is irrational, then the above sequence contains infinitely many elements divisible by 2 or 3. The same holds for the sequence [ξ( ? 2) ⁿ  + ν _n ], n = 0, 1, 2, . . . , where ν ₀, ν ₁, ν ₂, . . . all lie in a half open real interval of length 1/3. For this, we show that if a sequence of integers x ₁, x ₂, x ₃, . . . satisfies the recurrence relation x _n+d  = cx _n  + F(x _n+1, . . . , x _n+d-1) for each n  ≥  1, where c ≠ 0 is an integer, \({F(z_1,\dots,z_{d-1}) \in \mathbb {Z}[z_1,\dots,z_{d-1}],}\) and lim _{n→ ∞}|x _n | = ∞, then the number |x _n | is composite for infinitely many positive integers n. The proofs involve techniques from number theory, linear algebra, combinatorics on words and some kind of symbolic computation modulo 3.     

Prime and composite integers close to powers of a number

We prove that, for any real numbers ξ ≠ 0 and ν, the sequence of integer parts [ξ2 ⁿ  + ν], n = 0, 1, 2, . . . , contains infinitely many composite numbers. Moreover, if the number ξ is irrational, then the above sequence contains infinitely many elements divisible by 2 or 3. The same holds for the sequence [ξ( − 2) ⁿ  + ν _n ], n = 0, 1, 2, . . . , where ν ₀, ν ₁, ν ₂, . . . all lie in a half open real interval of length 1/3. For this, we show that if a sequence of integers x ₁, x ₂, x ₃, . . . satisfies the recurrence relation x _n+d  = cx _n  + F(x _n+1, . . . , x _n+d-1) for each n  ≥  1, where c ≠ 0 is an integer, F(z₁,...,z_d-1) ? \mathbb Z[z₁,...,z_d-1],{F(z_1,\dots,z_{d-1}) \in \mathbb {Z}[z_1,\dots,z_{d-1}],} and lim _{n→ ∞}|x _n | = ∞, then the number |x _n | is composite for infinitely many positive integers n. The proofs involve techniques from number theory, linear algebra, combinatorics on words and some kind of symbolic computation modulo 3.     

On the spectral radius of a nonnegative centrosymmetric matrix

In this paper, we discuss the spectral radius of nonnegative centrosymmetric matrices. By using the centrosymmetric structure, we establish some estimations of the spectral radius.     

New bounds for Perron root of a nonnegative matrix

In this paper, we obtain some new bounds for Perron root of a nonnegative matrix, which are expressed by easily calculated function in element of matrix. These new results generalize and improve the bounds of G. Frobenius [1] and H. Minc [2], and also extend the known results by Liu [6].