English
Related papers

Related papers: A candidate for a solution to Wall's D(2) problem

200 papers

In this paper we prove a partial $C^{1,\alpha}$ regularity result in dimension $N=2$ for the optimal $p$-compliance problem, extending for $p\not = 2$ some of the results obtained by A. Chambolle, J. Lamboley, A. Lemenant, E. Stepanov…

Optimization and Control · Mathematics 2025-02-10 Bohdan Bulanyi , Antoine Lemenant

The notion of adequate subgroups was introduced by Jack Thorne [59]. It is a weakening of the notion of big subgroups used by Wiles and Taylor in proving automorphy lifting theorems for certain Galois representations. Using this idea,…

Representation Theory · Mathematics 2017-03-20 Robert Guralnick , Florian Herzig , Pham Huu Tiep

We examine second bounded cohomology and mod p homology in finite index subgroups of 1-relator groups and groups with a presentation of deficiency at least one. We use this to determine exactly which 1-relator groups are boundedly…

Group Theory · Mathematics 2025-10-20 J O Button

This work contributes to clarifying several relationships between certain higher categorical structures and the homotopy types of their classifying spaces. Double categories (Ehresmann, 1963) have well-understood geometric realizations, and…

Algebraic Topology · Mathematics 2010-03-22 Antonio M. Cegarra , Benjamín A. Heredia , Josué Remedios

Stanley proved that for any centrally symmetric simplicial $d$-polytope $P$ with $d\geq 3$, $g_2(P) \geq {d \choose 2}-d$. We provide a characterization of centrally symmetric $d$-polytopes with $d\geq 4$ that satisfy this inequality as…

Combinatorics · Mathematics 2018-11-13 Steven Klee , Eran Nevo , Isabella Novik , Hailun Zheng

We show that for a Hecke pair $(G, \Gamma)$ the $C^*$-completions $C^*(L^1(G, \Gamma))$ and $pC^*(\bar{G})p$ of its Hecke algebra coincide whenever the group algebra $L^1(\bar{G})$ satisfies a spectral property which we call…

Operator Algebras · Mathematics 2012-10-16 Rui Palma

Given a finite connected 3-complex with cohomological dimension 2, we show it may be constructed up to homotopy by applying the Quillen plus construction to the Cayley complex of a finite group presentation. This reduces the D(2) problem to…

Algebraic Topology · Mathematics 2023-08-25 Wajid Mannan

One of the two basic theorems in [5] on the existence of solutions of PDEs is improved with the use of a group analysis type argument.

General Mathematics · Mathematics 2007-05-23 Elemer E Rosinger

Let \Gamma be a finitely presentable pro-p group with a nontrivial finitely generated closed normal subgroup N of infinite index. Then def(\Gamma)\leq 1, and if def(\Gamma)=1 then \Gamma is a pro-p duality group of dimension 2, N is a free…

Group Theory · Mathematics 2014-02-26 Jonathan A. Hillman , Alexander Schmidt

Given a commutative ring $R$ and finitely generated ideal $I$, one can consider the classes of $I$-adically complete, $L_0^I$-complete and derived $I$-complete complexes. Under a mild assumption on the ideal $I$ called weak pro-regularity,…

Commutative Algebra · Mathematics 2025-05-29 Luca Pol , Jordan Williamson

The central focus of this paper is the $L_p$ dual Minkowski problem for $C$-compatible sets, where $C$ is a pointed closed convex cone in $\mathbb{R}^n$ with nonempty interior. Such a problem deals with the characterization of the $(p,…

Metric Geometry · Mathematics 2024-04-16 Wen Ai , Yunlong Yang , Deping Ye

Symmetry is a central concept for classical and quantum field theory, usually, symmetry is described by a finite group or Lie group. In this work, we introduce the weak Hopf algebra extension of symmetry, which arises naturally in anyonic…

High Energy Physics - Theory · Physics 2023-07-21 Zhian Jia , Sheng Tan , Dagomir Kaszlikowski , Liang Chang

The Milnor Problem (modified) in the theory of group growth asks whether any finite presented group of vanishing algebraic entropy has at most polynomial growth. We show that a positive answer to the Milnor Problem (modified) is equivalent…

Differential Geometry · Mathematics 2023-05-16 Lina Chen , Xiaochun Rong , Shicheng Xu

The notion of a subproduct system, a generalization of that of a product system, is introduced. We show that there is an essentially 1 to 1 correspondence between cp-semigroups and pairs (X,T) where X is a subproduct system and T is an…

Operator Algebras · Mathematics 2010-01-28 Orr Shalit , Baruch Solel

An instance of Max CSP is a finite collection of constraints on a set of variables, and the goal is to assign values to the variables that maximises the number of satisfied constraints. Max CSP captures many well-known problems (such as Max…

Computational Complexity · Computer Science 2007-12-11 Peter Jonsson , Andrei Krokhin , Fredrik Kuivinen

The literature provides dichotomies involving homomorphisms (like the G 0 dichotomy) or reductions (like the characterization of sets potentially in a Wadge class of Borel sets, which holds on a subset of a product). However, part of the…

Logic · Mathematics 2016-07-15 Dominique Lecomte

We continue the analysis of the Modular Isomorphism Problem for $2$-generated $p$-groups with cyclic derived subgroup, $p>2$, started in [D. Garc\'ia-Lucas, \'A. del R\'io, and M. Stanojkovski. On group invariants determined by modular…

Group Theory · Mathematics 2024-06-13 Diego García-Lucas , Ángel del Río

We present a structural classification of constraint satisfaction problems (CSP) described by reflexive complete $2$-edge-coloured graphs. In particular, this classification extends the structural dichotomy for graph homomorphism problems…

Computational Complexity · Computer Science 2026-02-11 Alexey Barsukov , Santiago Guzmán-Pro

We show existence and uniqueness for the solutions of the regularity and the Neumann problems for harmonic functions on Lipschitz domains with data in the Hardy spaces H^p, p>2/3, where This in turn implies that solutions to the Dirichlet…

Classical Analysis and ODEs · Mathematics 2007-05-23 Atanas Stefanov , Gregory Verchota

In a non-uniform Constraint Satisfaction problem CSP(G), where G is a set of relations on a finite set A, the goal is to find an assignment of values to variables subject to constraints imposed on specified sets of variables using the…

Computational Complexity · Computer Science 2020-07-20 Andrei A. Bulatov