Results 1 to 10 of about 3,439 (166)
Early postural dynamics reveal the rapid processing of fake social cues for deceptive actions in sports [PDF]
Deceptive actions such as head fakes are a hallmark of interactive sports, yet it is not well understood how decisions and whole-body responses to head fakes unfold over time.
Iris Güldenpenning +4 more
doaj +2 more sources
On Generalized σ-Subnormal Subgroups of Finite Groups [PDF]
Let σ = {σi | i ∈ I} be some partition of the set of all primes P, G a finite group and σ(G) = {σi | σi ∩ π(G) ≠ ∅}. A subgroup A of G is said to be generalized σ-subnormal in G if A = ⟨L, T⟩, where L is a modular subgroup and T is a σ-subnormal subgroup
Muhammad Tanveer Hussain
doaj +1 more source
Finite Groups with Partially σ-Subnormal Subgroups in Short Maximal Chains [PDF]
Throughout this paper, all groups are finite and G always denotes a finite group. Let sigma be a partition of the set of all primes. The group G is said to be sigma-primary if G is a sigma_i-group for some sigma_i, and sigma-soluble if every chief factor
Viktoria S. Zakrevskaya
doaj +1 more source
Profinite Groups with Many Elements of Bounded Order [PDF]
Lévai and Pyber proposed the following as a conjecture: if G is a profinite group such that the set of solutions of the equation x^n = 1 has positive Haar measure, then G has an open subgroup H and an element t such that all elements of the coset tH have
Alireza Abdollahi +1 more
doaj +1 more source
Primes Generated by Recurrence Sequences [PDF]
We consider primitive divisors of terms of integer sequences defined by quadratic polynomials. Apart from some small counterexamples, when a term has a primitive divisor, that primitive divisor is unique. It seems likely that the number of terms with a primitive divisor has a natural density.
Everest, G. +3 more
openaire +4 more sources
On some links between the generalised Lucas pseudoprimes of level k
Pseudoprimes are composite integers sharing behaviours of the prime numbers, often used in practical applications like public-key cryptography. Many pseudoprimality notions known in the literature are defined by recurrent sequences.
Andrica Dorin +2 more
doaj +1 more source
The Bombieri-Vinogradov theorem for nilsequences
The Bombieri-Vinogradov theorem for nilsequences, Discrete Analysis 2021:21, 55 pp. The prime number theorem asserts that the density of the primes in the vicinity of a large integer $n$ is approximately $1/\log n$, or equivalently that the number of ...
Xuancheng Shao, Joni Teräväinen
doaj +1 more source
A Generalization of the Prime Radical of Rings
Let $R$ be a ring, $I$ be an ideal of $R$, and $\sqrt{I}$ be a prime radical of $I$. This study generalizes the prime radical of $\sqrt{I}$ where it denotes by $\sqrt[n+1]{I}$, for $n\in \mathbb{Z}^{+}$. This generalization is called $n$-prime radical of ideal $I$.
Didem KARALARLIOĞLU CAMCI +3 more
openaire +3 more sources
Linear complexity is an important criterion to characterize the unpredictability of pseudo-random sequences, and large linear complexity corresponds to high cryptographic strength.
Jiang Ma +3 more
doaj +1 more source
Numerical semigroups generated by primes [PDF]
Let p(1) = 2, p(2) = 3, p(3) = 5,. be the consecutive prime numbers, S-n the numerical semigroup generated by the primes not less than p(n) and u(n) the largest irredundant generator of S-n. We will show, that u(n) similar to 3p(n). Similarly, for the largest integer f(n) not contained in S-n, by computational evidence (https://www.uni-regensburg.de ...
Hellus, Michael +2 more
openaire +3 more sources

