English
Related papers

Related papers: An algorithmic approach to perverse derived equiva…

200 papers

Any simple group-grading of a finite dimensional complex algebra induces a natural family of digraphs. We prove that $|E\circ E^{\text{op}}\cup E^{\text{op}}\circ E|\geq |E|$ for any digraph $\Gamma =(V,E)$ without parallel edges, and…

Rings and Algebras · Mathematics 2013-05-22 Yuval Ginosar , Ofir Schnabel

We study blocks of the double covers of symmetric and alternating groups. The main result is a `local' description, up to Morita equivalence, of arbitrary defect RoCK blocks of these groups in terms of generalized Schur superalgebras…

Representation Theory · Mathematics 2024-11-07 Alexander Kleshchev

Given an arbitrary ordered pair of coprime integers (a,b) we obtain a pair of identities of the Rogers--Ramanujan type. These identities have the same product side as the (first) Andrews--Gordon identity for modulus 2ab\pm 1, but an…

Combinatorics · Mathematics 2007-05-23 S. Ole Warnaar

We introduce the Binary Matrix Guessing Problem and provide two algorithms to solve this problem. The first algorithm we introduce is Elementwise Probing Algorithm (EPA) which is very fast under a score which utilizes Frobenius Distance.…

Artificial Intelligence · Computer Science 2018-10-17 Çağrı Latifoğlu

We have previously shown that the isomorphism classes of orientable locally trivial fields of $C^*$-algebras over a compact metrizable space $X$ with fiber $D\otimes \mathbb{K}$, where $D$ is a strongly self-absorbing $C^*$-algebra, form an…

Operator Algebras · Mathematics 2019-10-03 Marius Dadarlat , Ulrich Pennig

We study the local epsilon constant conjecture as formulated by Breuning. This conjecture fits into the general framework of the equivariant Tamagawa number conjecture (ETNC) and should be interpreted as a consequence of the expected…

Number Theory · Mathematics 2016-02-26 Werner Bley , Alessandro Cobbe

Motivated by the Beauville decomposition of an abelian scheme and the "Perverse = Chern" phenomenon for a compactified Jacobian fibration, we study in this paper splittings of the perverse filtration for compactified Jacobian fibrations. On…

Algebraic Geometry · Mathematics 2026-01-21 Younghan Bae , Davesh Maulik , Junliang Shen , Qizheng Yin

We prove that the alternating groups of degree at least $5$ are uniquely determined up to an abelian direct factor by the degrees of their irreducible complex representations. This confirms Huppert's Conjecture for alternating groups.

Group Theory · Mathematics 2015-02-12 Christine Bessenrodt , Hung P. Tong-Viet , Jiping Zhang

The McKay Conjecture (MC) asserts the existence of a bijection between the (inequivalent) complex irreducible representations of degree coprime to $p$ ($p$ a prime) of a finite group $G$ and those of the subgroup $N$, the normalizer of…

Representation Theory · Mathematics 2008-07-23 Geoffrey Mason

In this article, we study the modular representations of the special linear group of degree two over a finite field in defining characteristic. In particular, we study the automorphisms of derived category of representations. We have been…

Representation Theory · Mathematics 2017-07-19 William Wong

Let $G$ be an arbitrary finite group and fix a prime number $p$. The McKay conjecture asserts that $G$ and the normalizer in $G$ of a Sylow $p$-subgroup have equal numbers of irreducible characters with degrees not divisible by $p$. The…

Group Theory · Mathematics 2007-05-23 I. M. Isaacs , G. Navarro

Various recurrence relations between formal orthogonal polynomials can be used to derive Lanczos-type algorithms. In this paper, we consider recurrence relation $A_{12}$ for the choice $U_i(x)=P_i(x)$, where $U_i$ is an auxiliary family of…

Numerical Analysis · Mathematics 2014-05-08 Saif Ullah , Muhammad Farooq , Abdellah Salhi

We propose an approach based on function evaluations and Bayesian inference to extract higher-order differential information of objective functions {from a given ensemble of particles}. Pointwise evaluation $\{V(x^i)\}_i$ of some potential…

Machine Learning · Statistics 2023-03-02 Claudia Schillings , Claudia Totzeck , Philipp Wacker

We consider the problem of reconstructing sparse symmetric block models with two blocks and connection probabilities $a/n$ and $b/n$ for inter- and intra-block edge probabilities, respectively. It was recently shown that one can do better…

Probability · Mathematics 2016-09-28 Elchanan Mossel , Joe Neeman , Allan Sly

We prove the Alperin-McKay Conjecture for all $p$-blocks of finite groups with metacyclic, minimal non-abelian defect groups. These are precisely the metacyclic groups whose derived subgroup have order $p$. In the special case $p=3$, we…

Representation Theory · Mathematics 2014-03-21 Benjamin Sambale

The nonconforming virtual element method (NCVEM) for the approximation of the weak solution to a general linear second-order non-selfadjoint indefinite elliptic PDE in a polygonal domain is analyzed under reduced elliptic regularity. The…

Numerical Analysis · Mathematics 2022-03-15 Carsten Carstensen , Rekha Khot , Amiya K. Pani

In this note, we prove that $D_8\times C_2^{n-3}$ is the non-elementary abelian $2$-group of order $2^n$, $n\geq 3$, whose number of subgroups of possible orders is maximal. This solves a conjecture by Haipeng Qu [7]. A formula for counting…

Group Theory · Mathematics 2018-11-20 Marius Tărnăuceanu

We classify up to Morita equivalence all blocks whose defect groups are Suzuki $2$-groups. The classification holds for blocks over a suitable discrete valuation ring as well as for those over an algebraically closed field, and in fact…

Group Theory · Mathematics 2024-09-16 Charles W. Eaton

In this paper, assuming the low-degree conjecture, we provide evidence of computational hardness for two problems: (1) the (partial) matching recovery problem in the sparse correlated Erd\H{o}s-R\'enyi graphs $\mathcal G(n,q;\rho)$ when the…

Machine Learning · Statistics 2025-12-30 Zhangsong Li

Doubly intractable problems occur when both the likelihood and the posterior are available only in unnormalised form, with computationally intractable normalisation constants. Bayesian inference then typically requires direct approximation…