Rota conjectured that, given n disjoint bases of a rank-n matroid M , there are n disjoint transversals of these bases that are all bases of M . We prove a stronger statement for the class of paving matroids.

In this article the elementary mathematical methods are used to prove Beal’s Conjecture, Fermat’s Collatz Conjecture and Goldbach Conjecture.

in this paper, we investigate the zassenhaus conjecture for $psl(4,3)$ and $psl(5,2)$. consequently, we prove that the prime graph question is true for both groups.

Let $R$ be an associative ring and let $M$ be a left $R$-module.Let $Spec_{R}(M)$ be the collection of all prime submodules of $M$ (equipped with classical Zariski topology). There is a conjecture which says that every irreducible closed subset of $Spec_{R}(M)$ has a generic point. In this article we give an affirmative answer to this conjecture and show that if $M$ has a Noetherian spectrum, t...

In this paper, we mainly investigate the uniqueness of the entire function sharing a small entire function with its high difference operators. We obtain one results, which can give a negative answer to an uniqueness question relate to the Bruck conjecture dealt by Liu and Yang. Meanwhile, we also establish a difference analogue of the Bruck conjecture for entire functions of order less than 2, ...

ardy and littlewood conjectured that every large integer $n$ that is not a square is the sum of a prime and a square. they believed that the number $mathcal{r}(n)$ of such representations for $n = p+m^2$ is asymptotically given by begin{equation*} mathcal{r}(n) sim frac{sqrt{n}}{log n}prod_{p=3}^{infty}left(1-frac{1}{p-1}left(frac{n}{p}right)right), end{equation*} where $p$ is a prime, $m$ is a...

Let $P$ be a complex polynomial of the form $P(z)=zdisplaystyleprod_{k=1}^{n-1}(z-z_{k})$,where $|z_k|ge 1,1le kle n-1$ then $ P^prime(z)ne 0$. If $|z|

This poster presents EV, a new ExecuteVerify architecture that allows state machine replication to scale to multi-core servers. EV departs from the traditional agree-execute architecture of state machine replication: replicas first concurrently and nondeterministically execute requests; then they verify, agree, and converge on the state and the outputs produced by a correct replica. EV minimize...