English
Related papers

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

200 papers

Gives the most precise available description of the p-Frattini module for any p-perfect finite group G=G_0 (Thm. 2.8), and therefore of the groups G_{k,ab}, k \ge 0, from which we form the abelianized M(odular) T(ower). \S 4 includes a…

Number Theory · Mathematics 2010-01-18 Michael D. Fried

It has been known that categorical interpretations of dependent type theory with Sigma- and Id-types induce weak factorization systems. When one has a weak factorization system (L, R) on a category C in hand, it is then natural to ask…

Category Theory · Mathematics 2019-06-03 Paige Randall North

In this note we discuss an analog of the classical Waring problem for C[x_0, x_1,...,x_n]. Namely, we show that a general homogeneous polynomial p \in C[x_0,x_1,...,x_n] of degree divisible by k\ge 2 can be represented as a sum of at most…

Algebraic Geometry · Mathematics 2015-06-03 Ralf Fröberg , Giorgio Ottaviani , Boris Shapiro

In 2012, F.Leonetti and F.Siepe [1] considered solutions to boundary value problems of some anisotropic elliptic equations of the type $$ \left\{ \begin{array}{llll} \sum\limits _{i=1}\limits^{n} D_i (a_i(x,Du(x)))=0, &x\in \Omega,\\…

Analysis of PDEs · Mathematics 2018-12-20 Hongya Gao , Chao Liu , Hong Tian

We continue the work of \cite{TLNT}. Let $E$ be a non-Blaschke subset of the unit disc $\mathbb{D}$ of the complex plane $\mathbb{C}$. Fixed $1\leq p\leq \infty$, let $H^p(\mathbb{D})$ be the Hardy space of holomorphic functions in the disk…

Complex Variables · Mathematics 2008-12-02 Dang Duc Trong , Tuyen Trung Truong

The Algebraic Dichotomy Conjecture states that the Constraint Satisfaction Problem over a fixed template is solvable in polynomial time if the algebra of polymorphisms associated to the template lies in a Taylor variety, and is NP-complete…

Logic in Computer Science · Computer Science 2015-07-01 Libor Barto , Marcin Kozik

In this paper we raise the realisability problem in arrow categories. Namely, for a fixed category $\mathcal{C}$ and for arbitrary groups $H\le G_1\times G_2$, is there an object $\phi \colon A_1 \rightarrow A_2$ in…

Algebraic Topology · Mathematics 2019-10-09 Cristina Costoya , David Méndez , Antonio Viruel

Let $P$ be a convex $d$-polytope and $0 \leq k \leq d-1$. In 2023, this author proved the following inequalities, resolving a question of B\'ar\'any: \[ \frac{f_k(P)}{f_0(P)} \geq \frac{1}{2}\biggl[{\lceil \frac{d}{2} \rceil \choose k} +…

Combinatorics · Mathematics 2024-01-30 Joshua Hinman

We present a performant and rigorous algorithm for certifying that a matrix is close to being a projection onto an irreducible subspace of a given group representation. This addresses a problem arising when one seeks solutions to…

Representation Theory · Mathematics 2021-08-30 Felipe Montealegre-Mora , Denis Rosset , Jean-Daniel Bancal , David Gross

Any satisfiability problem in conjunctive normal form can be solved in polynomial time by reducing it to a 3-sat formulation and transforming this to a Linear Complementarity problem (LCP) which is then solved as a linear program (LP). Any…

Computational Complexity · Computer Science 2018-01-31 Giacomo Patrizi

We give a complexity dichotomy theorem for the counting Constraint Satisfaction Problem (#CSP in short) with complex weights. To this end, we give three conditions for its tractability. Let F be any finite set of complex-valued functions,…

Computational Complexity · Computer Science 2015-03-19 Jin-Yi Cai , Xi Chen

For n>1 and -1<p<1, we prove that if q is close to n and the qth Lp dual curvature is Holder close to be the constant one function, then this "near isotropic" qth Lp dual Minkowski problem on the (n-1)-dimensional sphere has a unique…

Analysis of PDEs · Mathematics 2025-05-06 Karoly J. Boroczky , Shibing Chen , Weiru Liu , Christos Saroglou

Existence of solutions to the Lp Minkowski problem is proved for all p less than 0. For the cirtical case of p=-n, which is known as the centro-affine Minkowski problem, this paper contains the main result in [71] as a special case.

Metric Geometry · Mathematics 2016-05-10 Guangxian Zhu

Let $X$ be a finite CW complex and let $h_1, h_2: C(X)\to A$ be two unital \hm s, where $A$ is a unital C*-algebra. We study the problem when $h_1$ and $h_2$ are approximately homotopic. We present a $K$-theoretical necessary and sufficient…

Operator Algebras · Mathematics 2008-01-28 Huaxin Lin

In this paper, we establish hardness and approximation results for various $L_p$-ball constrained homogeneous polynomial optimization problems, where $p \in [2,\infty]$. Specifically, we prove that for any given $d \ge 3$ and $p \in…

Optimization and Control · Mathematics 2012-11-01 Ke Hou , Anthony Man-Cho So

On the sad occasion of contributing to the memorial volume ``Fundamental Interactions'' for my teacher Wolfgang Kummer I decided to recollect and extend some unpublished notes from the mid 90s when I started to build up a string theory…

High Energy Physics - Theory · Physics 2016-12-21 Maximilian Kreuzer

Inspired by Emerton's work for GL(2), we study the completed cohomology of the tower of finite sets associated with a definite unitary group in two variables. When p splits (and other technical assumptions are fulfilled), we show that the…

Number Theory · Mathematics 2013-04-18 Przemyslaw Chojecki , Claus Sorensen

A 3D-2D dimension reduction for $-\Delta_1$ is obtained. A power law approximation from $-\Delta_p$ as $p \to 1$ in terms of $\Gamma$- convergence, duality and asymptotics for least gradient functions has also been provided.

Analysis of PDEs · Mathematics 2012-11-13 Maria Emilia Amendola , Giuliano Gargiulo , Elvira Zappale

We study the $L^p$ Dirichlet problem for the Stokes system on Lipschitz domains. For any fixed $p>2$, we show that a reverse H\"{o}lder condition with exponent $p$ is sufficient for the solvability of the Dirichlet problem with boundary…

Analysis of PDEs · Mathematics 2009-05-01 Joel Kilty

Higher-dimensional rewriting systems are tools to analyse the structure of formally reducing terms to normal forms, as well as comparing the different reduction paths that lead to those normal forms. This higher structure can be captured by…

Logic in Computer Science · Computer Science 2023-02-15 Nicolai Kraus , Jakob von Raumer