2000
DOI: 10.1016/s0024-3795(00)00125-7
|View full text |Cite
|
Sign up to set email alerts
|

The invariant polynomials degrees of the Kronecker sum of two linear operators and additive theory

Abstract: Let G be an abelian group. Let A and B be finite non-empty subsets of G. By A + B we denote the set of all elements a + b with a ∈ A and b ∈ B. For c ∈ A + B, ν c (A, B) is the cardinality of the set of pairs (a, b) such that a + b = c. We call ν c (A, B) the multiplicity of c (in A + B). Let i be a positive integer. We denote by µ i (A, B) or briefly by µ i the cardinality of the set of the elements of A + B that have multiplicity greater than or equal to i. Let F be a field. Let p be the characteristic of F … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2002
2002
2004
2004

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 10 publications
0
3
0
Order By: Relevance
“…The next theorem is proved in [1] and states a necessary condition for the existence of nice bases with prescribed indices when the constraint of complete controllability is skipped.…”
Section: Auxiliary Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…The next theorem is proved in [1] and states a necessary condition for the existence of nice bases with prescribed indices when the constraint of complete controllability is skipped.…”
Section: Auxiliary Resultsmentioning
confidence: 99%
“…If |X| =k we say that X is a k-set. In [1] we prove the following theorem: This result is an extension to an arbitrary field of a theorem proved by Pollard [4,5], for Z p =ZÂp Z, where p is a prime number. Notice that the case where t=1 is the well known Cauchy Davenport Theorem.…”
Section: Introductionmentioning
confidence: 90%
“…Caldeira and Dias da Silva gave in [2] an extension of the Pollard's theorem to an arbitrary field, and in [1] an analogue for restricted sums.…”
Section: B) T \ > Min(«p T(\a\ + \B\ -T))mentioning
confidence: 99%