Related papers: Brauer's Height Zero Conjecture
We provide a proof of a variant of the Landau-Siegel Zeros conjecture.
In this note we improve on the results of our earlier paper[BLGG12], proving a near-optimal theorem on the existence of ordinary lifts of a mod l Hilbert modular form for any odd prime l.
Brouwer's fixed point theorem states that any continuous function from a closed $n$-dimensional ball to itself has a fixed point. In 1961, Klee showed that if such a function has discontinuities that are bounded, then it has a point that is…
M. Kiyota, T. Okuyama and T. Wada recently proved that each 2-block of a finite symmetric group contains a unique irreducible Brauer character that has height 0. We present a more conceptual proof of this result.
The Eaton--Moret\'o conjecture extends the recently-proven Brauer height zero conjecture to blocks with non-abelian defect group, positing equality between the minimal positive heights of a block of a finite group and its defect group. Here…
In 1845, Bertrand conjectured that twice any prime strictly exceeds the next prime. Tchebichef proved Bertrand's postulate in 1850. In 1934, Ishikawa proved a stronger result: the sum of any two consecutive primes strictly exceeds the next…
Let $(\mathcal{A},\Theta)$ be a length category. We introduce the notation of Gabriel-Roiter measure with respect to $\Theta$ and extend Gabriel's main property to this setting. Using this measure, when $(\mathcal{A},\Theta)$ satisfies some…
It is shown that if every odd integer $n > 5$ is the sum of three primes, then every even integer $n > 2$ is the sum of two primes. A conditional proof of Goldbach's conjecture, based on Cram\'er's conjecture, is presented. Theoretical and…
Conjecture A of \cite{EM14} predicts the equality between the smallest positive height of the irreducible characters in a $p$-block of a finite group and the smallest positive height of the irreducible characters in its defect group. Hence,…
We prove the Aharoni Berger Conjecture
In order to give a unified generalization of the BW inequality and the DDVV inequality, Lu and Wenzel proposed three Conjectures 1, 2, 3 and an open Question 1 in 2016. In this paper we discuss further these conjectures and put forward…
The Brauer-Siegel theorem concerns the size of the product of the class number and the regulator of a number field $K$. We derive bounds for this product in case $K$ is a prime cyclotomic field, distinguishing between whether there is a…
We present a solution of Exercise 1.2.1 of [2] which yields a short new proof of a key step in one of proofs of Brouwer's fixed point theorem, 1910. A few people asked the author about the details of the solution and they might be…
A short and elementary proof is given of a celebrated eigenvalue-perturbation result due to Alfred Brauer.
In this article, we prove the remaining open cases of the Fontaine-Mazur conjecture on two-dimensional regular Galois representations over $\Gal(\overline{\Q}/\Q)$ when $p=3$, hence concluding the conjecture in the regular case for all odd…
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…
In this paper, we obtained an equivalent proposition of Brennan`s conjecture. And given two lower bound estimation of the conjecture one of them connected with Schwarzian derivative. The present study also verified the correctness of the…
We determine the blocks of the periplectic Brauer algebra over any field of odd characteristic.
It is known that Szpiro's conjecture, or equivalently the ABC-conjecture, implies Lang's conjecture giving a uniform lower bound for the canonical height of nontorsion points on elliptic curves. In this note we show that a significantly…
Problem 21 of Brauer's list of problems from 1963 asks whether for any positive integer k there are finitely many isomorphism classes of groups that occur as the defect group of a block with k irreducible characters. We solve this problem…