English
Related papers

Related papers: Weak closure and Oliver's p-group conjecture

200 papers

The Alperin weight conjecture was reduced to simple groups by the work of Navarro, Tiep and Sp\"ath. To prove Alperin weight conjecture, it suffices to show that all finite non-abelian simple groups are BAW-good. We reduce the verification…

Representation Theory · Mathematics 2022-07-12 Zhicheng Feng , Zhenye Li , Jiping Zhang

We disprove a well-known conjecture of Boston (2000), which claims that a just-infinite pro-$p$ group is branch if and only if it admits a positive-dimensional embedding in the group of $p$-adic automorphisms. This is obtained as a result…

Group Theory · Mathematics 2025-07-31 Jorge Fariña-Asategui

Starting from an Enriques surface over $\mathbb{Q}(t)$ considered by Lafon, we give the first examples of smooth projective weakly special threefolds which fibre over the projective line in Enriques surfaces (resp. K3 surfaces) with nowhere…

Algebraic Geometry · Mathematics 2026-02-10 Finn Bartsch , Frédéric Campana , Ariyan Javanpeykar , Olivier Wittenberg

A special case of a conjecture raised by Forrest and Runde (Math. Zeit., 2005) asserts that the Fourier algebra of every non-abelian connected Lie group fails to be weakly amenable; this was aleady known to hold in the non-abelian compact…

Functional Analysis · Mathematics 2015-03-13 Yemon Choi , Mahya Ghandehari

We identify all small groups of order up to 288 in the GAP Library for which the Zassenhaus conjecture on rational conjugacy of units of finite order in the integral group ring cannot be established by an existing method. The groups must…

Rings and Algebras · Mathematics 2017-04-20 Andreas Bächle , Allen Herman , Alexander Konovalov , Leo Margolis , Gurmail Singh

We disprove a conjecture of Frank stating that each weakly 2k-connected has a k-vertex-connected orientation. For k at least 3, we also prove that the problem of deciding whether a graph has a k-vertex-connected orientation is NP-complete.

Combinatorics · Mathematics 2012-12-18 Olivier Durand de Gevigney

We consider triangular P\'olya urns and show under very weak conditions a general strong limit theorem of the form $X_{ni}/a_{ni}\to \mathcal{X}_i$ a.s., where $X_{ni}$ is the number of balls of colour $i$ after $n$ draws; the constants…

Probability · Mathematics 2024-03-22 Svante Janson

We show that $3$-graphs on $n$ vertices whose codegree is at least $(2/3 + o(1))n$ can be decomposed into tight cycles and admit Euler tours, subject to the trivial necessary divisibility conditions. We also provide a construction showing…

Combinatorics · Mathematics 2021-02-02 Simón Piga , Nicolás Sanhueza-Matamala

In this paper, we introduce a weak group inverse (called the WG inverse in the present paper) for square matrices of an arbitrary index, and give some of its characterizations and properties. Furthermore, we introduce two orders: one is a…

Rings and Algebras · Mathematics 2017-04-28 Hongxing Wang , Jianlong Chen

We define a new invariant for a $p$-block, the strong Frobenius number, which we use to address the problem of reducing Donovan's conjecture to normal subgroups of index p. As an application we use the strong Frobenius number to complete…

Representation Theory · Mathematics 2018-06-08 Charles Eaton , Michael Livesey

We provide two new proofs of a theorem of Cooper, Long and Reid which asserts that, apart from an explicit finite list of exceptional manifolds, any compact orientable irreducible 3-manifold with non-empty boundary has large fundamental…

Geometric Topology · Mathematics 2007-05-23 Marc Lackenby

We prove the Banach strong Novikov conjecture for groups having polynomially bounded higher-order combinatorial functions. This includes all automatic groups.

K-Theory and Homology · Mathematics 2018-04-11 Alexander Engel

Let $G$ be a graph of girth $g$ and circumference $c.$ A vertex $v$ of $G$ is called weakly pancyclic if $v$ lies on an $\ell$-cycle for every integer $\ell$ with $g\le \ell\le c.$ We prove that if $G$ is a nonbipartite graph of order $n\ge…

Combinatorics · Mathematics 2026-01-23 Yurui Tang , Xingzhi Zhan

A well-known result of Stanley from 1980 implies that the weak order on a maximal parabolic quotient of the symmetric group $S_n$ has the Sperner property; this same property was recently established for the weak order on all of $S_n$ by…

Combinatorics · Mathematics 2021-11-12 Christian Gaetz , Katherine Tung

Let $G$ be a finite non-solvable group. We prove that there exists a proper subgroup $A$ of $G$ such that $G$ is the product of three conjugates of $A$, thus replacing an earlier upper bound of $36$ with the smallest possible value. The…

Group Theory · Mathematics 2015-01-26 John Cannon , Martino Garonzi , Dan Levy , Attila Maróti , Iulian I. Simion

We show that if a finite point set $P\subseteq \mathbb{R}^2$ has the fewest congruence classes of triangles possible, up to a constant $M$, then at least one of the following holds. (1) There is a $\sigma>0$ and a line $l$ which contains…

Combinatorics · Mathematics 2023-10-25 Sam Mansfield , Jonathan Passant

We prove that algebras are left weakly Gorenstein in case the subcategory $^{\perp}A \cap \Omega^n(A)$ is representation-finite. This applies in particular to all monomial algebras and endomorphism algebras of modules over…

Representation Theory · Mathematics 2023-10-30 Rene Marczinzik

We confirm Martin's conjecture for a broad subclass of weakly quasi-o-minimal theories.

Logic · Mathematics 2026-03-09 Slavko Moconja , Predrag Tanović

In this paper we prove the blockwise Alperin weight conjecture for finite special linear and unitary groups, for finite groups with abelian Sylow $3$-subgroups, and verify the inductive blockwise Alperin weight condition for certain cases…

Representation Theory · Mathematics 2022-07-05 Zhicheng Feng , Conghui Li , Jiping Zhang

We prove that there are 3-CNF formulas over n variables that can be refuted in resolution in width w but require resolution proofs of size n^Omega(w). This shows that the simple counting argument that any formula refutable in width w must…

Computational Complexity · Computer Science 2014-09-10 Albert Atserias , Massimo Lauria , Jakob Nordström