Displaying 281 – 300 of 507

Showing per page

On some subgroup chains related to Kneser’s theorem

Yahya Ould Hamidoune, Oriol Serra, Gilles Zémor (2008)

Journal de Théorie des Nombres de Bordeaux

A recent result of Balandraud shows that for every subset S of an abelian group G there exists a non trivial subgroup H such that | T S | | T | + | S | - 2 holds only if H S t a b ( T S ) . Notice that Kneser’s Theorem only gives { 1 } S t a b ( T S ) .This strong form of Kneser’s theorem follows from some nice properties of a certain poset investigated by Balandraud. We consider an analogous poset for nonabelian groups and, by using classical tools from Additive Number Theory, extend some of the above results. In particular we obtain short proofs of Balandraud’s...

On some universal sums of generalized polygonal numbers

Fan Ge, Zhi-Wei Sun (2016)

Colloquium Mathematicae

For m = 3,4,... those pₘ(x) = (m-2)x(x-1)/2 + x with x ∈ ℤ are called generalized m-gonal numbers. Sun (2015) studied for what values of positive integers a,b,c the sum ap₅ + bp₅ + cp₅ is universal over ℤ (i.e., any n ∈ ℕ = 0,1,2,... has the form ap₅(x) + bp₅(y) + cp₅(z) with x,y,z ∈ ℤ). We prove that p₅ + bp₅ + 3p₅ (b = 1,2,3,4,9) and p₅ + 2p₅ + 6p₅ are universal over ℤ, as conjectured by Sun. Sun also conjectured that any n ∈ ℕ can be written as p ( x ) + p ( y ) + p 11 ( z ) and 3p₃(x) + p₅(y) + p₇(z) with x,y,z ∈ ℕ; in...

On square classes in generalized Fibonacci sequences

Zafer Şiar, Refik Keskin (2016)

Acta Arithmetica

Let P and Q be nonzero integers. The generalized Fibonacci and Lucas sequences are defined respectively as follows: U₀ = 0, U₁ = 1, V₀ = 2, V₁ = P and U n + 1 = P U + Q U n - 1 , V n + 1 = P V + Q V n - 1 for n ≥ 1. In this paper, when w ∈ 1,2,3,6, for all odd relatively prime values of P and Q such that P ≥ 1 and P² + 4Q > 0, we determine all n and m satisfying the equation Uₙ = wUₘx². In particular, when k|P and k > 1, we solve the equations Uₙ = kx² and Uₙ = 2kx². As a result, we determine all n such that Uₙ = 6x².

On substitution invariant Sturmian words: an application of Rauzy fractals

Valérie Berthé, Hiromi Ei, Shunji Ito, Hui Rao (2007)

RAIRO - Theoretical Informatics and Applications

Sturmian words are infinite words that have exactly n+1 factors of length n for every positive integer n. A Sturmian word sα,p is also defined as a coding over a two-letter alphabet of the orbit of point ρ under the action of the irrational rotation Rα : x → x + α (mod 1). A substitution fixes a Sturmian word if and only if it is invertible. The main object of the present paper is to investigate Rauzy fractals associated with two-letter invertible substitutions. As an application, we give...

On sum-product representations in q

Mei-Chu Chang (2006)

Journal of the European Mathematical Society

The purpose of this paper is to investigate efficient representations of the residue classes modulo q , by performing sum and product set operations starting from a given subset A of q . We consider the case of very small sets A and composite q for which not much seemed known (nontrivial results were recently obtained when q is prime or when log | A | log q ). Roughly speaking we show that all residue classes are obtained from a k -fold sum of an r -fold product set of A , where r log q and log k log q , provided the residue sets...

On sums of binomial coefficients modulo p²

Zhi-Wei Sun (2012)

Colloquium Mathematicae

Let p be an odd prime and let a be a positive integer. In this paper we investigate the sum k = 0 p a - 1 ( h p a - 1 k ) ( 2 k k ) / m k ( m o d p ² ) , where h and m are p-adic integers with m ≢ 0 (mod p). For example, we show that if h ≢ 0 (mod p) and p a > 3 , then k = 0 p a - 1 ( h p a - 1 k ) ( 2 k k ) ( - h / 2 ) k ( ( 1 - 2 h ) / ( p a ) ) ( 1 + h ( ( 4 - 2 / h ) p - 1 - 1 ) ) ( m o d p ² ) , where (·/·) denotes the Jacobi symbol. Here is another remarkable congruence: If p a > 3 then k = 0 p a - 1 ( p a - 1 k ) ( 2 k k ) ( - 1 ) k 3 p - 1 ( p a / 3 ) ( m o d p ² ) .

Currently displaying 281 – 300 of 507