English
Related papers

Related papers: The Complexity of Surjective Homomorphism Problems…

200 papers

We present the notion of injective hom-complexity, leading to a connection between the covering number of a group and the sectional number of a group homomorphism, and provide estimates for computing this invariant.

Group Theory · Mathematics 2026-01-01 Cesar A. Ipanaque Zapata , Martha O. Gonzales Bohorquez

Several characterizations of complex ellipsoids among convex bodies in Cn, in terms of their sections and projections are proved. Characterizing complex symmetry in similar terms is an important tool.

Metric Geometry · Mathematics 2021-11-30 Jorge Arocha , Javier Bracho , Luis Montejano

We first study the higher version of the relative topological complexity by using the homotopic distance. We also introduced the generalized version of the relative topological complexity of a topological pair on both the Schwarz genus and…

Algebraic Topology · Mathematics 2022-03-07 Melih İs , İsmet Karaca

The constraint satisfaction problem (CSP) involves deciding, given a set of variables and a set of constraints on the variables, whether or not there is an assignment to the variables satisfying all of the constraints. One formulation of…

Computational Complexity · Computer Science 2017-01-09 Hubie Chen , Benoit Larose

Homotopy coherence has a considerable history, albeit also by other names. We provide a brief semi-historical survey providing some links that may not be common knowledge.

Algebraic Topology · Mathematics 2022-10-04 Tim Porter , Jim Stasheff

In this paper we collect the main properties of free curves in the complex projective plane and a lot of conjectures and open problems, both old and new. In the quest to understand the mystery of free curves, many tools were developed and…

Algebraic Geometry · Mathematics 2023-12-22 Alexandru Dimca

Trigraph list homomorphism problems (also known as list matrix partition problems) have generated recent interest, partly because there are concrete problems that are not known to be polynomial time solvable or NP-complete. Thus while…

Computational Complexity · Computer Science 2010-09-03 Tomás Feder , Pavol Hell , David G. Schell , Juraj Stacho

A general problem in complex cobordism theory is to find useful representatives for cobordism classes. One particularly convenient class of complex manifolds consists of smooth projective toric varieties. The bijective correspondence…

Algebraic Topology · Mathematics 2013-12-17 Andrew Wilfong

A list of open problems on holomorphic symplectic, contact and Poisson manifolds.

Algebraic Geometry · Mathematics 2010-02-24 Arnaud Beauville

In this note we present a brief overview of variational methods to solve homogenization problems. The purpose is to give a first insight on the subject by presenting some fundamental theoretical tools, both classical and modern. We conclude…

Optimization and Control · Mathematics 2015-03-19 José Matias , Marco Morandotti

This thesis investigates the central role of homomorphism problems (structure-preserving maps) in two complementary domains: database querying over finite, graph-shaped data, and constraint solving over (potentially infinite) structures.…

Logic in Computer Science · Computer Science 2025-10-10 Rémi Morvan

We define a simpler notion of symmetric topological complexity more ad hoc to the motion planning problem which was the original motivation for the definition of topological complexity. This is a homotopy invariant that we call…

Algebraic Topology · Mathematics 2021-01-25 Enrique Torres-Giese

For complexity of the heterogeneous minimum spanning forest problem has not been determined, we reduce 3-SAT which is NP-complete to 2-heterogeneous minimum spanning forest problem to prove this problem is NP-hard and spread result to…

Computational Complexity · Computer Science 2016-01-19 Zhujun Zhang , Qiang Sun

We provide an overview of some recent progress on the complexity of election systems. The issues studied include the complexity of the winner, manipulation, bribery, and control problems.

Computer Science and Game Theory · Computer Science 2007-05-23 Piotr Faliszewski , Edith Hemaspaandra , Lane A. Hemaspaandra , Joerg Rothe

In this article we give a survey on open problems and conjectures concerning L^2-invariants. We cover the whole portfolio and not only certain aspects as they are considered in the previous more specialized (and within their scope more…

Algebraic Topology · Mathematics 2023-11-30 Dominik Kirstein , Christian Kremer , Wolfgang Lueck

This work is motivated by two problems: 1) The approach of manifolds and spaces by triangulations. 2) The complexity growth in sequences of polyhedra. Considering both problems as related, new criteria and methods for approximating smooth…

Differential Geometry · Mathematics 2012-05-22 Daniel J. Pons

We survey results on the hardness of approximating combinatorial optimization problems.

Computational Complexity · Computer Science 2007-05-23 Luca Trevisan

We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a…

Combinatorics · Mathematics 2007-05-23 Volker Kaibel , Alexander Schwartz

Assembling parts into an object is a combinatorial problem that arises in a variety of contexts in the real world and involves numerous applications in science and engineering. Previous related work tackles limited cases with identical unit…

Computer Vision and Pattern Recognition · Computer Science 2022-06-22 Jinhwi Lee , Jungtaek Kim , Hyunsoo Chung , Jaesik Park , Minsu Cho

We formalize the concept of a centralizer-respecting homomorphism, surjective homomorphisms which are equivariant with respect to taking the centralizer of a subgroup. There is a functor from the category of centralizer-respecting…

Group Theory · Mathematics 2026-05-15 William Cocke , Mark L. Lewis , Ryan McCulloch