English
Related papers

Related papers: Polynomial-time right-ideal morphisms and congruen…

200 papers

We study $\mathbb{E}_\infty$-monoids on which a prime $p$ acts invertibly, which we call $p$-perfect, in the non-group-complete situation. In particular, we prove that in many examples, they almost embed in their group-completion. We…

K-Theory and Homology · Mathematics 2025-05-13 Maxime Ramzi , Maria Yakerson

In this paper we define a construct called a time-graph. A complete time-graph of order n is the cartesian product of a complete graph with n vertices and a linear graph with n vertices. A time-graph of order n is given by a subset of the…

Computational Complexity · Computer Science 2008-12-31 Malay Dutta

Pursuing ideas of Jeff Smith, we develop a homotopy theory of ideals of monoids in a symmetric monoidal model category. This includes Smith ideals of structured ring spectra and of differential graded algebras. Such Smith ideals are NOT…

Algebraic Topology · Mathematics 2014-01-14 Mark Hovey

We prove classical Taylor polynomial theorems for sub-Riemannian manifolds that are obtained as the submetric image of a Carnot group. For these theorems we also prove a sufficient condition for real analyticity and a result on…

Analysis of PDEs · Mathematics 2026-02-05 Alessandro Ottazzi

We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…

Optimization and Control · Mathematics 2023-10-02 Levent Tunçel , Stephen A. Vavasis , Jingye Xu

It is undecidable in general whether a given finitely presented group is word hyperbolic. We use the concept of pregroups, introduced by Stallings, to define a new class of van Kampen diagrams, which represent groups as quotients of…

We study the complexity of symmetric assembly puzzles: given a collection of simple polygons, can we translate, rotate, and possibly flip them so that their interior-disjoint union is line symmetric? On the negative side, we show that the…

The "relating" entwines three problems: 1. Davenport's Problem, describing pairs of polynomials over Q whose ranges on Z/p are the same for almost all p. 2. Showing that the monodromy groups of rational function maps over the complexes are…

Algebraic Geometry · Mathematics 2009-10-22 Michael D. Fried

A spectral sequence calculating the homology groups of some spaces of maps equivariant under compact group actions is described. For the main example, we calculate the rational homology groups of spaces of even and odd maps $S^m \to S^M$,…

Algebraic Topology · Mathematics 2021-07-01 Victor Vassiliev

In this paper, we study the polyhedral structure of an integrated minimum-up/-down time and ramping polytope, which has broad applications in variant industries. The polytope we studied includes minimum-up/-down time, generation…

Optimization and Control · Mathematics 2016-04-11 Kai Pan , Yongpei Guan

Let $R$ be a finite ring and let $M, N$ be two finite left $R$-modules. We present two distinct deterministic algorithms that decide in polynomial time whether or not $M$ and $N$ are isomorphic, and if they are, exhibit an isomorphism. As…

Rings and Algebras · Mathematics 2015-12-29 Iuliana Ciocănea-Teodorescu

Let M denote either Euclidean or hyperbolic n-space, and let G be a discrete group of isometries of M, with the property that G respects and acts tile-transitively on a convex-polyhedral tesselation of M. Given an arbitrary base point p in…

Group Theory · Mathematics 2016-06-27 Robert Bieri , Heike Sach

We show that the group of type-preserving automorphisms of any irreducible semi-regular thick right-angled building is abstractly simple. When the building is locally finite, this gives a large family of compactly generated (abstractly)…

Group Theory · Mathematics 2014-05-15 Pierre-Emmanuel Caprace

We generalize the Brin-Higman-Thompson groups $n G_{k,1}$ to monoids $n M_{k,1}$, for $n \ge 1$ and $k \ge 2$, by replacing bijections by partial functions. The monoid $n M_{k,1}$ has $n G_{k,1}$ as its group of units, and is…

Group Theory · Mathematics 2020-06-30 J. C. Birget

We propose a way of associating to each finitely generated monoid or semigroup a formal language, called its loop problem. In the case of a group, the loop problem is essentially the same as the word problem in the sense of combinatorial…

Rings and Algebras · Mathematics 2019-05-01 Mark Kambites

We generalize the classical Post correspondence problem ($\mathbf{PCP}_n$) and its non-homogeneous variation ($\mathbf{GPCP}_n$) to non-commutative groups and study the computational complexity of these new problems. We observe that…

Group Theory · Mathematics 2015-08-12 Alexei Myasnikov , Andrey Nikolaev , Alexander Ushakov

We treat the following "polynomial moment problem": for a complex polynomial P(z) and distinct complex numbers a,b such that P(a)=P(b) to describe polynomials q(z)=Q'(z) orthogonal to all degrees of P(z) on the segment [a,b]. We show that…

Complex Variables · Mathematics 2007-05-23 F. Pakovich

We consider moments of the normalized volume of a symmetric or nonsymmetric random polytope in a fixed symmetric convex body. We investigate for which bodies these moments are extremized, and calculate exact values in some of the extreme…

Metric Geometry · Mathematics 2007-05-23 Mark W. Meckes

We introduce a concept of efficiency for which we can prove that it applies to all paddable languages, but still does not conflict with potential worst case intractability. Note that the family of paddable languages apparently includes all…

Computational Complexity · Computer Science 2016-09-01 Andras Farago

We produce two separate algebraic descriptions of the isomorphism classes of the solvable subgroups of the group PLo(I) of piecewise-linear orientation-preserving homeomorphisms of the unit interval under the operation of composition, and…

Group Theory · Mathematics 2007-05-23 Collin Bleak