English
Related papers

Related papers: A Block-theoretic Proof of Burnside's Normal $p$-c…

200 papers

We prove $p$-complete arc-descent results for finite projective modules and perfect complexes over integral perfectoid rings. Using our results, we clarify a reduction argument in the proof of the classification of $p$-divisible groups over…

Algebraic Geometry · Mathematics 2022-06-22 Kazuhiro Ito

Following Nazarov's suggestion~\cite{Naz1}, we refer to the cyclotomic Nazarov-Wenzl algebra as the cyclotomic Brauer algebra. When the cyclotomic Brauer algebra is isomorphic to the endomorphism algebra of $M_{I_i, r}$-- the tensor product…

Representation Theory · Mathematics 2025-02-04 Mengmeng Gao , Hebing Rui

We introduce Brauer algebras associated to complex reflection groups of type $G(m,p,n)$, and study their representation theory via Clifford theory. In particular, we determine the decomposition numbers of these algebras in characteristic…

Representation Theory · Mathematics 2013-03-13 C. Bowman , A. G. Cox

We start with a bijective proof of Schur's theorem due to Alladi and Gordon and describe how a particular iteration of it leads to some very general theorems on colored partitions. These theorems imply a number of important results,…

Combinatorics · Mathematics 2007-09-11 Sylvie Corteel , Jeremy Lovejoy

In this short note, we give a proof, conditional on the Generalized Riemann Hypothesis, that there exist numbers x which are normal with respect to the continued fraction expansion but not to any base b expansion. This partially answers a…

Number Theory · Mathematics 2015-12-02 Joseph Vandehey

Let $p$ be a prime number. As a standard application of the irreducibility criterion of Eisenstein, it is well known that the $p$-th cyclotomic polynomial $\Phi_p(t)=1+t+\dots+t^{p-1}$ is the minimal polynomial of $e^{2\pi i/p}$ over…

History and Overview · Mathematics 2022-10-28 Tom Moshaiov

The goal of this paper is to lay the foundations for a combinatorial study, via orthogonal functions and intertwining operators, of category O for the rational Cherednik algebra of type G(r,p,n). As a first application, we give a…

Representation Theory · Mathematics 2008-08-23 Stephen Griffeth

An elementary approach is shown which derives the values of the Gauss sums over $\mathbb F_{p^r}$, $p$ odd, of a cubic character without using Davenport-Hasse's theorem. New links between Gauss sums over different field extensions are shown…

Number Theory · Mathematics 2011-11-22 Michele Elia , Davide Schipani

Let n,d be positive integers, with d even (say d=2e). Let X_(n,d) denote the locus of degree d hypersurfaces in P^n which consist of two e-fold hyperplanes. We bound the regularity of the ideal of this variety. Moreover, we show that this…

Algebraic Geometry · Mathematics 2009-09-29 Abdelmalek Abdesselam , Jaydeep Chipalkatti

For a $p$-permutation equivalence between two block algebras of finite groups, we introduce new square diagrams that link the $p$-permutation equivalence via the Brauer construction to local equivalences between stabilizers of corresponding…

Representation Theory · Mathematics 2025-12-23 Robert Boltje , John Revere McHugh

Using a clear and straightforward approach, we discover and prove new binary digit extraction BBP-type formulas for polylogarithm constants. Some known results are also rediscovered in a more direct and elegant manner. Numerous…

Number Theory · Mathematics 2016-03-21 Kunle Adegoke

We give two proofs of a folkore result relating numerical semigroups of embedding dimension two and binary cyclotomic polynomials and explore some consequences. In particular, we give a more conceptual reproof of a result of Hong et al.…

Number Theory · Mathematics 2020-08-27 Pieter Moree

Recently, Malle and Navarro obtained a Galois strengthening of Brauer's height zero conjecture for principal $p$-blocks when $p=2$, considering a particular Galois automorphism of order~$2$. In this paper, for any prime $p$ we consider a…

Representation Theory · Mathematics 2024-02-27 Gunter Malle , Alexander Moretó , Noelia Rizo , A. A. Schaeffer Fry

To verify the universal validity of the "two-sided" monotonicity condition introduced in [8], we will apply it to include more classical examples. The present paper selects the $L^{p}$ convergence case for this purpose. Furthermore, Theorem…

Classical Analysis and ODEs · Mathematics 2007-05-23 Rui-Jun Le , Song-Ping Zhou

We present an elementary combinatorial proof of the celebrated Friendship theorem. The proof involves looking at independent sets and constructing a bound on their size which forces a contradiction.

Combinatorics · Mathematics 2024-02-13 Vineeth Chintala

A purity conjecture due to Grothendieck and Auslander--Goldman predicts that the Brauer group of a regular scheme does not change after removing a closed subscheme of codimension $\ge 2$. The combination of several works of Gabber settles…

Algebraic Geometry · Mathematics 2019-05-29 Kestutis Cesnavicius

The Brill-Noether Theorem gives necessary and sufficient conditions for the existence of a linear series. Here we consider a general n-fold, etale cyclic cover p of a curve C of genus g and investigate for which numbers r,d a linear series…

Algebraic Geometry · Mathematics 2018-11-16 Irene Schwarz

In an earlier article [3], we presented an algorithm that can be used to rigorously check whether a specific cosine or sine polynomial is nonnegative in a given interval or not. The algorithm proves to be an indispensable tool in…

Classical Analysis and ODEs · Mathematics 2015-07-06 Man Kam Kwong

A perfect isometry $I$ (introduced by Brou\'e) between two blocks $B$ and $C$ is a frequent phenomenon in the block theory of finite groups. It maps an irreducible character $\psi$ of $C$ to $\pm$ an irreducible character of $B$. Brou\'e…

Group Theory · Mathematics 2022-07-22 Robert Boltje

The assumptions needed to prove Cox's Theorem are discussed and examined. Various sets of assumptions under which a Cox-style theorem can be proved are provided, although all are rather strong and, arguably, not natural.

Artificial Intelligence · Computer Science 2007-05-23 Joseph Y. Halpern