English
Related papers

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

200 papers

The Constraint Satisfaction Problem (CSP) is a problem of computing a homomorphism $\mathbf{R}\to \mathbf{\Gamma}$ between two relational structures, where $\mathbf{R}$ is defined over a domain $V$ and $\mathbf{\Gamma}$ is defined over a…

Computational Complexity · Computer Science 2023-11-21 Rustem Takhanov

For a $d$-dimensional polytope with $v$ vertices, $d+1\le v\le2d$, we calculate precisely the minimum possible number of $m$-dimensional faces, when $m=1$ or $m\ge0.62d$. This confirms a conjecture of Gr\"unbaum, for these values of $m$.…

Combinatorics · Mathematics 2019-01-17 Guillermo Pineda-Villavicencio , Julien Ugon , David Yost

In this article, we consider a class of degenerate singular problems. The degeneracy is captured by the presence of a class of $p$-admissible weights, which may vanish or blow up near the origin. Further, the singularity is allowed to vary…

Analysis of PDEs · Mathematics 2023-04-28 Prashanta Garain

A connection between the Galois-theoretic approach to semi-abelian homology and the homological closure operators is established. In particular, a generalised Hopf formula for homology is obtained, allowing the choice of a new kind of…

Category Theory · Mathematics 2014-10-14 Mathieu Duckerts-Antoine , Tomas Everaert , Marino Gran

In this paper we address the classification problem for locally compact (n-1)-connected CW-complexes with dimension less or equal than n+2 up to proper homotopy type. We obtain complete classification theorems in terms of purely algebraic…

Algebraic Topology · Mathematics 2007-05-23 Fernando Muro

The dictionary matching with gaps problem is to preprocess a dictionary $D$ of $d$ gapped patterns $P_1,\ldots,P_d$ over alphabet $\Sigma$, where each gapped pattern $P_i$ is a sequence of subpatterns separated by bounded sequences of don't…

Data Structures and Algorithms · Computer Science 2014-08-12 Amihood Amir , Avivit Levy , Ely Porat , B. Riva Shalom

Necessary and sufficient conditions for the existence of solutions to the asymmetric $L_p$ Minkowski problem in $\mathbb{R}^2$ are established for $0 < p < 1$.

Analysis of PDEs · Mathematics 2016-12-23 Karoly J. Boroczky , Hai Trinh

It is an immediate consequence of the results by Yiftach and Schlage-Puchta that a presentation with p-deficiency greater than one defines a group with positive rank gradient. By results of Button and Thillaisundaram, a finite presentation…

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

We consider the weak version of the Deligne-Simpson problem: give necessary and sufficient conditions upon the conjugacy classes $c_j\subset gl(n,{\bf C})$ (resp. $C_j\subset GL(n,{\bf C})$) so that there exist $(p+1)$-tuples of matrices…

Algebraic Geometry · Mathematics 2007-05-23 Vladimir Petrov Kostov

We define unstable $p$-completion in general $\infty$-topoi and the unstable motivic homotopy category, and prove that the $p$-completion of a nilpotent sheaf or motivic space can be computed on its Postnikov tower. We then show that the…

Algebraic Geometry · Mathematics 2024-02-02 Klaus Mattis

Let k be an algebraically closed field of characteristic p>>0. Let $X\rightarrow Y$ be a symplectic resolution. There are two questions which motivates this work. One question is a construction of an action of a group on the category…

Algebraic Geometry · Mathematics 2016-01-12 Dorin Boger

We construct several new classes of bifunctors $(A,B)\mapsto A\otimes_{\alpha} B$, where $A\otimes_\alpha B$ is a cross norm completion of $A\odot B$ for each pair of C*-algebras $A$ and $B$. For the first class of bifunctors considered…

Operator Algebras · Mathematics 2024-05-01 Hun Hee Lee , Ebrahim Samei , Matthew Wiersma

Given a finite structure $M$ and property $p$, it is a natural to study the degree of satisfiability of $p$ in $M$; i.e. to ask: what is the probability that uniformly randomly chosen elements in $M$ satisfy $p$? In group theory, a…

Logic · Mathematics 2025-07-16 Benjamin Merlin Bumpus , Zoltan A. Kocsis

We prove a complexity dichotomy theorem for Holant problems over an arbitrary set of complex-valued symmetric constraint functions F on Boolean variables. This extends and unifies all previous dichotomies for Holant problems on symmetric…

Computational Complexity · Computer Science 2018-01-11 Jin-Yi Cai , Heng Guo , Tyson Williams

Given an algebraic differential equation of order greater than one, it is shown that if there is any nontrivial algebraic relation amongst any number of distinct nonalgebraic solutions, along with their derivatives, then there is already…

Algebraic Geometry · Mathematics 2022-11-23 James Freitag , Rémi Jaoui , Rahim Moosa

We consider the {\em Deligne-Simpson problem (DSP) (resp. the weak DSP): Give necessary and sufficient conditions upon the choice of the $p+1$ conjugacy classes $c_j\subset gl(n,{\bf C})$ or $C_j\subset GL(n,{\bf C})$ so that there exist…

Algebraic Geometry · Mathematics 2007-05-23 Vladimir Petrov Kostov

The main result of this paper are dimension-free $L^p$ inequalities, $1<p<\infty$, for low degree scalar-valued functions on the Hamming cube. More precisely, for any $p>2,$ $\varepsilon>0,$ and $\theta=\theta(\varepsilon,p)\in (0,1)$…

We prove that a group obtained as a quotient of the free product of finitely many cubulable groups by a finite set of relators satisfying the classical $C'(1/6)$--small cancellation condition is cubulable. This yields a new large class of…

Group Theory · Mathematics 2015-12-24 Alexandre Martin , Markus Steenbock

We introduce a reduction from the distinct distances problem in ${\mathbb R}^d$ to an incidence problem with $(d-1)$-flats in ${\mathbb R}^{2d-1}$. Deriving the conjectured bound for this incidence problem (the bound predicted by the…

Combinatorics · Mathematics 2019-04-09 Sam Bardwell-Evans , Adam Sheffer

There has been a great of work on characterizing the complexity of the satisfiability and validity problem for modal logics. In particular, Ladner showed that the validity problem for all logics between K, T, and S4 is {\sl…

Logic in Computer Science · Computer Science 2007-05-23 Joseph Y. Halpern , Leandro Chaves Rego