English
Related papers

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

200 papers

For all $k \ge 2$, we show that there exists a group $G$ and a non-free stably free $\mathbb{Z} G$-module of rank $k$. We use this to show that, for all $k \ge 2$, there exist homotopically distinct finite $2$-complexes with fundamental…

Algebraic Topology · Mathematics 2025-10-15 John Nicholson

A problem of the erroneous duality gap caused by the presence of symmetries is solved in this paper utilizing point group theory. The optimization problems are first divided into two classes based on their predisposition to suffer from this…

Computational Physics · Physics 2021-06-23 Miloslav Capek , Lukas Jelinek , Michal Masek

Given two nonlinear input-output systems written in terms of Chen-Fliess functional expansions, it is known that the feedback interconnected system is always well defined and in the same class. An explicit formula for the generating series…

Optimization and Control · Mathematics 2015-07-28 W. Steven Gray , Luis A. Duffaut Espinosa , Kurusch Ebrahimi-Fard

We study the complexity of constraint satisfaction problems for templates $\Gamma$ that are first-order definable in $(\Bbb Z; succ)$, the integers with the successor relation. Assuming a widely believed conjecture from finite domain…

Computational Complexity · Computer Science 2016-04-27 Manuel Bodirsky , Victor Dalmau , Barnaby Martin , Antoine Mottet , Michael Pinsker

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 extend the decomposition conjecture to 2d quantum field theories with a gauged $\text{Rep}(H)$ symmetry category for $H$ a finite-dimensional semisimple Hopf algebra with $\text{Rep}(G)$ trivially-acting and $\text{Vec}(\Gamma)$ the…

High Energy Physics - Theory · Physics 2026-02-27 Alonso Perez-Lona

It is a well-known result of C.T.C. Wall's that one may decompose a simply connected 6-manifold as a connected sum of two simpler manifolds. Recent work of Beben and Theriault on decomposing based loop spaces of highly connected Poincar\'e…

Algebraic Topology · Mathematics 2023-04-27 Sebastian Chenery

Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on the form of the constraints can ensure tractability. The…

Computational Complexity · Computer Science 2020-10-05 Dmitriy Zhuk

We prove a complexity dichotomy theorem for a class of Holant problems on planar 3-regular bipartite graphs. The complexity dichotomy states that for every weighted constraint function $f$ defining the problem (the weights can even be…

Computational Complexity · Computer Science 2023-03-30 Jin-Yi Cai , Austen Z. Fan

We prove the consistency (modulo supercompact) of a negative answer to Arhangelskii's problem (some Hausdorff compact space cannot be partitioned to two sets not containing a closed copy of Cantor discontinuum). In this model we have CH.…

Logic · Mathematics 2007-05-23 Saharon Shelah

In the constraint satisfaction problem ($CSP$), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost homomorphism problem ($MinHom$), one is additionally given weights…

Machine Learning · Computer Science 2010-04-06 Rustem Takhanov

Homotopy type theory is a logical setting based on Martin-L\"of type theory in which geometric constructions and proofs can be carried out synthetically. Here, types can be interpreted as spaces up to homotopy, and proofs as…

Logic in Computer Science · Computer Science 2026-05-01 Camil Champin , Samuel Mimram , Emile Oleon

This article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…

Computational Complexity · Computer Science 2023-12-25 Rami Zaidan

We consider the set multi-cover problem in geometric settings. Given a set of points P and a collection of geometric shapes (or sets) F, we wish to find a minimum cardinality subset of F such that each point p in P is covered by (contained…

Computational Geometry · Computer Science 2009-09-04 Chandra Chekuri , Kenneth L. Clarkson , Sariel Har-Peled

Fix an odd prime $p$ and let $X$ be the $p$-localization of a finite suspended $CW$-complex. Given certain conditions on the reduced mod-$p$ homology $\bar H_*(X;\zmodp)$ of $X$, we use a decomposition of $\Omega\Sigma X$ due to the second…

Algebraic Topology · Mathematics 2012-04-10 Piotr Beben , Jie Wu

We show that a rank reduction technique for string C-group representations first used for the symmetric groups generalizes to arbitrary settings. The technique permits us, among other things, to prove that orthogonal groups defined on…

Group Theory · Mathematics 2019-05-06 Peter A. Brooksbank , Dimitri Leemans

We discuss some new results concerning Gap Conjecture on group growth and present a reduction of it (and its *-version) to several special classes of groups. Namely we show that its validity for the classes of simple groups and residually…

Group Theory · Mathematics 2012-09-19 Rostislav Grigorchuk

We introduce a new real valued invariant for finitely presented groups called residual deficiency. Its main property is the following. Let G be a finitely presented group. If the residual deficiency of G is greater than one, then G has a…

Group Theory · Mathematics 2013-06-12 Mariano Zeron-Medina Laris

The Grothendieck--Katz $p$-curvature conjecture predicts that an arithmetic differential equation whose reduction modulo $p$ has vanishing $p$-curvatures for {\em almost all} $p,$ has finite monodromy. It is known that it suffices to prove…

Algebraic Geometry · Mathematics 2018-06-04 Yunqing Tang

We develop a group-theoretic approach to the Shannon capacity problem. Using this approach we extend and recover, in a structured and unified manner, various families of previously known lower bounds on the Shannon capacity. Bohman (2003)…

Combinatorics · Mathematics 2025-06-18 Pjotr Buys , Sven Polak , Jeroen Zuiddam