Displaying similar documents to “Waring's number for large subgroups of ℤ*ₚ*”

A note on sumsets of subgroups in * p

Derrick Hart (2013)

Acta Arithmetica

Similarity:

Let A be a multiplicative subgroup of * p . Define the k-fold sumset of A to be k A = x 1 + . . . + x k : x i A , 1 i k . We show that 6 A * p for | A | > p 11 / 23 + ϵ . In addition, we extend a result of Shkredov to show that | 2 A | | A | 8 / 5 - ϵ for | A | p 5 / 9 .

On solvability of finite groups with some s s -supplemented subgroups

Jiakuan Lu, Yanyan Qiu (2015)

Czechoslovak Mathematical Journal

Similarity:

A subgroup H of a finite group G is said to be s s -supplemented in G if there exists a subgroup K of G such that G = H K and H K is s -permutable in K . In this paper, we first give an example to show that the conjecture in A. A. Heliel’s paper (2014) has negative solutions. Next, we prove that a finite group G is solvable if every subgroup of odd prime order of G is s s -supplemented in G , and that G is solvable if and only if every Sylow subgroup of odd order of G is s s -supplemented in G . These results...

On R -conjugate-permutability of Sylow subgroups

Xianhe Zhao, Ruifang Chen (2016)

Czechoslovak Mathematical Journal

Similarity:

A subgroup H of a finite group G is said to be conjugate-permutable if H H g = H g H for all g G . More generaly, if we limit the element g to a subgroup R of G , then we say that the subgroup H is R -conjugate-permutable. By means of the R -conjugate-permutable subgroups, we investigate the relationship between the nilpotence of G and the R -conjugate-permutability of the Sylow subgroups of A and B under the condition that G = A B , where A and B are subgroups of G . Some results known in the literature are improved...

On the conjugate type vector and the structure of a normal subgroup

Ruifang Chen, Lujun Guo (2022)

Czechoslovak Mathematical Journal

Similarity:

Let N be a normal subgroup of a group G . The structure of N is given when the G -conjugacy class sizes of N is a set of a special kind. In fact, we give the structure of a normal subgroup N under the assumption that the set of G -conjugacy class sizes of N is ( p 1 n 1 a 1 n 1 , , p 1 1 a 11 , 1 ) × × ( p r n r a r n r , , p r 1 a r 1 , 1 ) , where r > 1 , n i > 1 and p i j are distinct primes for i { 1 , 2 , , r } , j { 1 , 2 , , n i } .

On a system of equations with primes

Paolo Leonetti, Salvatore Tringali (2014)

Journal de Théorie des Nombres de Bordeaux

Similarity:

Given an integer n 3 , let u 1 , ... , u n be pairwise coprime integers 2 , 𝒟 a family of nonempty proper subsets of { 1 , ... , n } with “enough” elements, and ε a function 𝒟 { ± 1 } . Does there exist at least one prime q such that q divides i I u i - ε ( I ) for some I 𝒟 , but it does not divide u 1 u n ? We answer this question in the positive when the u i are prime powers and ε and 𝒟 are subjected to certain restrictions. We use the result to prove that, if ε 0 { ± 1 } and A is a set of three or more primes that contains all prime divisors of any...

A note on infinite a S -groups

Reza Nikandish, Babak Miraftab (2015)

Czechoslovak Mathematical Journal

Similarity:

Let G be a group. If every nontrivial subgroup of G has a proper supplement, then G is called an a S -group. We study some properties of a S -groups. For instance, it is shown that a nilpotent group G is an a S -group if and only if G is a subdirect product of cyclic groups of prime orders. We prove that if G is an a S -group which satisfies the descending chain condition on subgroups, then G is finite. Among other results, we characterize all abelian groups for which every nontrivial quotient group...

A new characterization of symmetric group by NSE

Azam Babai, Zeinab Akhlaghi (2017)

Czechoslovak Mathematical Journal

Similarity:

Let G be a group and ω ( G ) be the set of element orders of G . Let k ω ( G ) and m k ( G ) be the number of elements of order k in G . Let nse ( G ) = { m k ( G ) : k ω ( G ) } . Assume r is a prime number and let G be a group such that nse ( G ) = nse ( S r ) , where S r is the symmetric group of degree r . In this paper we prove that G S r , if r divides the order of G and r 2 does not divide it. To get the conclusion we make use of some well-known results on the prime graphs of finite simple groups and their components.

Differences of two semiconvex functions on the real line

Václav Kryštof, Luděk Zajíček (2016)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

It is proved that real functions on which can be represented as the difference of two semiconvex functions with a general modulus (or of two lower C 1 -functions, or of two strongly paraconvex functions) coincide with semismooth functions on (i.e. those locally Lipschitz functions on for which f + ' ( x ) = lim t x + f + ' ( t ) and f - ' ( x ) = lim t x - f - ' ( t ) for each x ). Further, for each modulus ω , we characterize the class D S C ω of functions on which can be written as f = g - h , where g and h are semiconvex with modulus C ω (for some C > 0 ) using a new...

On a generalization of a theorem of Burnside

Jiangtao Shi (2015)

Czechoslovak Mathematical Journal

Similarity:

A theorem of Burnside asserts that a finite group G is p -nilpotent if for some prime p a Sylow p -subgroup of G lies in the center of its normalizer. In this paper, let G be a finite group and p the smallest prime divisor of | G | , the order of G . Let P Syl p ( G ) . As a generalization of Burnside’s theorem, it is shown that if every non-cyclic p -subgroup of G is self-normalizing or normal in G then G is solvable. In particular, if P a , b | a p n - 1 = 1 , b 2 = 1 , b - 1 a b = a 1 + p n - 2 , where n 3 for p > 2 and n 4 for p = 2 , then G is p -nilpotent or p -closed. ...

Variations on a question concerning the degrees of divisors of x n - 1

Lola Thompson (2014)

Journal de Théorie des Nombres de Bordeaux

Similarity:

In this paper, we examine a natural question concerning the divisors of the polynomial x n - 1 : “How often does x n - 1 have a divisor of every degree between 1 and n ?” In a previous paper, we considered the situation when x n - 1 is factored in [ x ] . In this paper, we replace [ x ] with 𝔽 p [ x ] , where p is an arbitrary-but-fixed prime. We also consider those n where this condition holds for all p .

Capacitary estimates of positive solutions of semilinear elliptic equations with absorbtion

Moshe Marcus, Laurent Véron (2004)

Journal of the European Mathematical Society

Similarity:

Let Ω be a bounded domain of class C 2 in N and let K be a compact subset of Ω . Assume that q ( N + 1 ) / ( N 1 ) and denote by U K the maximal solution of Δ u + u q = 0 in Ω which vanishes on Ω K . We obtain sharp upper and lower estimates for U K in terms of the Bessel capacity C 2 / q , q ' and prove that U K is σ -moderate. In addition we describe the precise asymptotic behavior of U K at points σ K , which depends on the “density” of K at σ , measured in terms of the capacity C 2 / q , q ' .

Proof of a conjectured three-valued family of Weil sums of binomials

Daniel J. Katz, Philippe Langevin (2015)

Acta Arithmetica

Similarity:

We consider Weil sums of binomials of the form W F , d ( a ) = x F ψ ( x d - a x ) , where F is a finite field, ψ: F → ℂ is the canonical additive character, g c d ( d , | F × | ) = 1 , and a F × . If we fix F and d, and examine the values of W F , d ( a ) as a runs through F × , we always obtain at least three distinct values unless d is degenerate (a power of the characteristic of F modulo | F × | ). Choices of F and d for which we obtain only three values are quite rare and desirable in a wide variety of applications. We show that if F is a field of order 3ⁿ with n...

The number of solutions to the generalized Pillai equation ± r a x ± s b y = c .

Reese Scott, Robert Styer (2013)

Journal de Théorie des Nombres de Bordeaux

Similarity:

We consider N , the number of solutions ( x , y , u , v ) to the equation ( - 1 ) u r a x + ( - 1 ) v s b y = c in nonnegative integers x , y and integers u , v { 0 , 1 } , for given integers a > 1 , b > 1 , c > 0 , r > 0 and s > 0 . When gcd ( r a , s b ) = 1 , we show that N 3 except for a finite number of cases all of which satisfy max ( a , b , r , s , x , y ) < 2 · 10 15 for each solution; when gcd ( a , b ) > 1 , we show that N 3 except for three infinite families of exceptional cases. We find several different ways to generate an infinite number of cases giving N = 3 solutions.