The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper we study the inverse of so-called unfair permutations. Our investigation begins with comparing this class of permutations with uniformly random permutations, and showing that they behave very much alike in case of locally dependent random variables. As an example of a globally dependent statistic we use the number of inversions, and show that this statistic satisfies a central limit...
Let Γ ⊂ ℚ * be a finitely generated subgroup and let p be a prime such that the reduction group Γₚ is a well defined subgroup of the multiplicative group 𝔽ₚ*. We prove an asymptotic formula for the average of the number of primes p ≤ x for which [𝔽ₚ*:Γₚ] = m. The average is taken over all finitely generated subgroups $Γ =⟨a₁,...,a_{r}⟩⊂ ℚ *$, with and $a_{i} ≤ T_{i}$, with a range of uniformity...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.