Related papers: Counterexamples for Frobenius primality test

In 2005 Wolfgang Willems put forward a conjecture proposing a lower bound for the sum of squares of the degrees of the irreducible $p$-Brauer characters of a finite group $G$. We prove this conjecture for the prime $p=2$. For this we rely…

This paper has been withdrawn by the author becouse the conjecture presented in this paper is false. The correct study of metrics in interpolation spaces for and applcation to nonharmonic Fourier series will be published in S.Petersburg…

For many years, I have been interested in introducing students to the development of complex systems by means of modelling and refinement. To this end, I did not find anything better than presenting many examples of system developments.…

This paper contains two finite-sample results concerning the sign test. First, we show that the sign-test is unbiased with independent, non-identically distributed data for both one-sided and two-sided hypotheses. The proof for the…

We dedicate this paper to investigate the most generalized form of Fibonacci Sequence, one of the most studied sections of the mathematical literature. One can notice that, we have discussed even a more general form of the conventional one.…

We obtain upper bounds on the number of solutions to congruences of the type $$ (x_1+s)...(x_{\nu}+s)\equiv (y_1+s)...(y_{\nu}+s)\not\equiv0 \pmod p $$ modulo a prime $p$ with variables from some short intervals. We give some applications…

Let $p_n$ denote the $n^{th}$ prime. Goldston, Pintz, and Yildirim recently proved that $ \liminf_{n\to \infty} \frac{(p_{n+1}-p_n)}{\log p_n} =0.$ We give an alternative proof of this result. We also prove some corresponding results for…

In this note, we are going to introduce some recurrence divisibility tests for all primes except than 2 and 5.

Let $q$ be a prime power, $2\le r\le q$, and $f=a{\tt X}+{\tt X}^{r(q-1)+1}\in\Bbb F_{q^2}[{\tt X}]$, where $a\ne 0$. The conditions on $r,q,a$ that are necessary and sufficient for $f$ to be a permutation polynomial (PP) of ${\Bbb…

We give a triplet of short proofs, each of which answers a question raised by Erd\H{o}s. The first concerns the small prime factors of $\binom{n}{k}$, the second concerns whether an additive basis $A$ can always be split into pieces $A_1$…

We survey some different results on the digits of prime numbers, giving a simplified proof of weak forms of a result of Maynard and Mauduit-Rivat.

In this article, we shall generalize a theorem due to Frobenius in group theory, which asserts that if $p$ is a prime and $p^{r}$ divides the order of a finite group, then the number of subgroups of order $p^{r}$ is $\equiv$ 1(mod $p$).…

Feasible interpolation is a general technique for proving proof complexity lower bounds. The monotone version of the technique converts, in its basic variant, lower bounds for monotone Boolean circuits separating two NP-sets to proof…

We provide new non-asymptotic false discovery proportion (FDP) confidence envelopes in several multiple testing settings relevant for modern high dimensional-data methods. We revisit the multiple testing scenarios considered in the recent…

A lower bound on the minimum error probability for multihypothesis testing is established. The bound, which is expressed in terms of the cumulative distribution function of the tilted posterior hypothesis distribution given the observation…

Given a Galois extension $L/K$ of number fields, we describe fine distribution properties of Frobenius elements via invariants from representations of finite Galois groups and ramification theory. We exhibit explicit families of extensions…

Given a predictor of outcome derived from a high-dimensional dataset, pre-validation is a useful technique for comparing it to competing predictors on the same dataset. For microarray data, it allows one to compare a newly derived predictor…

We prove, under certain conditions on $(\alpha,\beta)$, that each Schwartz function $f$ such that $f(\pm n^{\alpha}) = \hat{f}(\pm n^{\beta}) = 0, \forall n \ge 0$ must vanish identically, complementing a series of recent results involving…

This paper explores the well known approximation approach to decide weak bisimilarity of Basic Parallel Processes. We look into how different refinement functions can be used to prove weak bisimilarity decidable for certain subclasses. We…

This paper is the second in a series of planned papers which provide first bijective proofs of alternating sign matrix results. Based on the main result from the first paper, we construct a bijective proof of the enumeration formula for…