Related papers: GMSNP and Finite Structures

Let $\mathfrak{P}_r$ be a representation system of the non-isomorphic finite posets, and let ${\cal H}(P,Q)$ be the set of order homomorphisms from $P$ to $Q$. For finite posets $R$ and $S$, we write $R \sqsubseteq_G S$ iff, for every $P…

We study minimum cost constraint satisfaction problems (MinCostCSP) through the algebraic lens. We show that for any constraint language $\Gamma$ which has the dual discriminator operation as a polymorphism, there exists a…

Let $E = (E^0, E^1, r, s)$ be a topological graph with no sinks such that $E^0$ and $E^1$ are compact. We show that when $C^*(E)$ is finite, there is a natural isomorphism $C^*(E) \cong C(E^\infty) \rtimes \mathbb{Z}$, where $E^\infty$ is…

A subgroup $H$ of a finite group $G$ is said to be an NC-subgroup of $G$, if $ H^G N_G (H) =G$, where $H^G$ denotes the normal closure of $H$ in $G$. A finite group $G$ is called a PNC-group, if any subgroup of $G$ is an NC-subgroup of $G$,…

We adapt tools from the algebraic approach to constraint satisfaction problems to answer descriptive set theoretic questions about Borel CSPs. We show that if a structure $\mathcal D$ does not have a Taylor polymorphism, then the…

A cover of a finite group $G$ is a family of proper subgroups of $G$ whose union is $G$, and a cover is called minimal if it is a cover of minimal cardinality. A partition of $G$ is a cover such that the intersection of any two of its…

Let $\mathcal G$ denote the space of finitely generated marked groups. For any finitely generated group $G$, we construct a continuous, injective map $f$ from the space of subgroups $Sub(G)$ to $\mathcal G$ that sends conjugate subgroups to…

We prove that the outer automorphism group $Out(G)$ is residually finite when the group $G$ is virtually compact special (in the sense of Haglund and Wise) or when $G$ is isomorphic to the fundamental group of some compact $3$-manifold. To…

Given a compact 3-manifold N without boundary, we prove that for a bumpy metric of positive scalar curvature the space of minimal surfaces having a uniform upper bound on the Morse index is always finite unless the manifold itself contains…

In recent years, much attention has been placed on the complexity of graph homomorphism problems when the input is restricted to ${\mathbb P}_k$-free and ${\mathbb P}_k$-subgraph-free graphs. We consider the directed version of this…

In this paper, we study the structures of finite groups using some arithmetic conditions on the sizes of real conjugacy classes. We prove that a finite group is solvable if the prime graph on the real class sizes of the group is…

It is well known that the constraint satisfaction problem over a general relational structure A is polynomial time equivalent to the constraint problem over some associated digraph. We present a variant of this construction and show that…

Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on the form of the constraints can ensure tractability. The…

A Hausdorff topological semiring is called simple if every non-zero continuous homomorphism into another Hausdorff topological semiring is injective. Classical work by Anzai and Kaplansky implies that any simple compact ring is finite. We…

In this paper, we establish some modified defect relations for the Gauss map $g$ of a complete minimal surface $S\subset\mathbb R^m$ into $\mathbb P^n(\mathbb C)\ (n=m-1)$ with only a single Fermat hypersurface $Q$ of $\mathbb P^n(\mathbb…

The factor graph of an instance of a symmetric constraint satisfaction problem on n Boolean variables and m constraints (CSPs such as k-SAT, k-AND, k-LIN) is a bipartite graph describing which variables appear in which constraints. The…

A value of a CSP instance is typically defined as a fraction of constraints that can be simultaneously met. We propose an alternative definition of a value of an instance and show that, for purely combinatorial reasons, a value of an…

In this paper we extend certain central results of zero dimensional systems to higher dimensions. The first main result shows that if (Y,f) is a finitely presented system, then there exists a Smale space (X,F) and a u-resolving factor map…

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…

We study the computational complexity of exact minimisation of rational-valued discrete functions. Let $\Gamma$ be a set of rational-valued functions on a fixed finite domain; such a set is called a finite-valued constraint language. The…