English
Related papers

Related papers: The Complexity of Surjective Homomorphism Problems…

200 papers

In this paper we study the computational complexity of the (extended) minimum cost homomorphism problem (Min-Cost-Hom) as a function of a constraint language, i.e. a set of constraint relations and cost functions that are allowed to appear…

Computational Complexity · Computer Science 2013-10-01 Hannes Uppman

The (n,k)-hypersimplex is the convex hull of all 0/1-vectors of length n with coordinate sum k. We explicitly determine the extension complexity of all hypersimplices as well as of certain classes of combinatorial hypersimplices. To that…

Metric Geometry · Mathematics 2017-02-28 Francesco Grande , Arnau Padrol , Raman Sanyal

We determine under which conditions certain natural models of random constraint satisfaction problems have sharp thresholds of satisfiability. These models include graph and hypergraph homomorphism, the $(d,k,t)$-model, and binary…

Combinatorics · Mathematics 2007-05-23 Hamed Hatami , Michael Molloy

We present an analysis of eight measures used for quantifying morphological complexity of natural languages. The measures we study are corpus-based measures of morphological complexity with varying requirements for corpus annotation. We…

Computation and Language · Computer Science 2022-04-12 Çağrı Çöltekin , Taraka Rama

We construct examples of nonresolvable generalized $n$-manifolds, $n\geq 6$, with arbitrary resolution obstruction, homotopy equivalent to any simply connected, closed $n$-manifold. We further investigate the structure of generalized…

Geometric Topology · Mathematics 2009-09-25 John L. Bryant , Steven C. Ferry , Washington Mio , Shmuel Weinberger

We analyse how the standard reductions between constraint satisfaction problems affect their proof complexity. We show that, for the most studied propositional, algebraic, and semi-algebraic proof systems, the classical constructions of…

Computational Complexity · Computer Science 2018-09-26 Albert Atserias , Joanna Ochremiak

We study Morse theory on noncompact manifolds equipped with exhaustions by compact pieces, defining the Morse homology of a pair which consists of the manifold and related geometric/homotopy data. We construct a collection of Morse data…

Geometric Topology · Mathematics 2019-11-12 Taesu Kim

We determine the symmetrized topological complexity of the circle, using primarily just general topology.

Algebraic Topology · Mathematics 2017-03-17 Donald M Davis

We propose here selected actual features of measurement problems based on our concerns in our respective fields of research. Their technical similarity in apparently disconnected fields motivate this common communication. Problems of…

Mathematical Physics · Physics 2026-03-03 Ask Ellingsen , Douglas Lundholm , Jean-Pierre Magnot

Some problems of testology are discussed.

Applications · Statistics 2007-11-12 Victor Kromer

To any metric spaces there is an associated metric profile. The rectifiability of the metric profile gives a good notion of curvature of a sub-Riemannian space. We shall say that a curvature class is the rectifiability class of the metric…

Metric Geometry · Mathematics 2007-05-23 Marius Buliga

Pluridisciplinar convergence is a major problem that had emerged with Human-Artefact Systems and so-called " Augmented Humanity " as academical fields and even more as technical fields. Problems come mainly from the juxtaposition of two…

Human-Computer Interaction · Computer Science 2016-02-12 Rémi Nazin , Didier Fass

We discuss our recent results on the existence and classification problem of complex and Kaehler structures on compact solvmanifolds. In particular, we determine in this paper all the complex surfaces which are diffeomorphic to compact…

Complex Variables · Mathematics 2008-04-30 Keizo Hasegawa

While looking for abductive explanations of a given set of manifestations, an ordering between possible solutions is often assumed. The complexity of finding/verifying optimal solutions is already known. In this paper we consider the…

Logic in Computer Science · Computer Science 2021-04-09 Paolo Liberatore , Marco Schaerf

A fundamental fact for the algebraic theory of constraint satisfaction problems (CSPs) over a fixed template is that pp-interpretations between at most countable \omega-categorical relational structures have two algebraic counterparts for…

Logic · Mathematics 2017-01-25 Libor Barto , Jakub Opršal , Michael Pinsker

Plank problems concern the covering of convex bodies by planks in Euclidean space and are related to famous open problems in convex geometry. In this survey, we introduce plank problems and present surprising applications of plank theorems…

Metric Geometry · Mathematics 2025-10-23 William Verreault

Random projections offer an appealing and flexible approach to a wide range of large-scale statistical problems. They are particularly useful in high-dimensional settings, where we have many covariates recorded for each observation. In…

Methodology · Statistics 2019-11-26 Timothy I. Cannings

The study of homotopy theoretic phenomena in the language of type theory is sometimes loosely called `synthetic homotopy theory'. Homotopy theory in type theory is only one of the many aspects of homotopy type theory, which also includes…

Logic · Mathematics 2019-06-25 Egbert Rijke

We study continuous homomorphisms between algebras of iterated Laurent series over a commutative ring. We give a full description of such homomorphisms in terms of a discrete data determined by the images of parameters. In similar terms, we…

Rings and Algebras · Mathematics 2016-12-26 Sergey Gorchinskiy , Denis Osipov

This work builds on a rich discourse surrounding the social brain hypothesis as well as the definition and quantification of social complexity. We believe this manuscript provides a new perspective on the topic by pairing a conceptual…

Physics and Society · Physics 2025-03-25 Etienne Lein , Cécile Aprili , Jayaditya Deep , Isaac Kazuo Uyehara