English
Related papers

Related papers: GMSNP and Finite Structures

200 papers

Constraint satisfaction problems (CSPs) are a natural class of decision problems where one must decide whether there is an assignment to variables that satisfies a given formula. Schaefer's dichotomy theorem, and its extension to all…

Quantum Physics · Physics 2025-02-27 Eric Culf , Kieran Mastel

An instance of the Valued Constraint Satisfaction Problem (VCSP) is given by a finite set of variables, a finite domain of labels, and a sum of functions, each function depending on a subset of the variables. Each function can take finite…

Computational Complexity · Computer Science 2017-02-14 Vladimir Kolmogorov , Andrei Krokhin , Michal Rolinek

Let $G$ be a group and $A\subseteq G$ a non-empty subset. A right $s$-factor associated with $A$ is a maximal subset $U\subseteq G$ such that the product $AU$ is direct. The lower and upper $s$-indices $|G:A|^-$ and $|G:A|^+$ are defined as…

Group Theory · Mathematics 2026-02-27 Mikhail Kabenyuk

We study parameterized Constraint Satisfaction Problem for infinite constraint languages. The parameters that we study are weight of the satisfying assignment, number of constraints, maximum number of occurrences of a variable in the…

Computational Complexity · Computer Science 2017-08-10 Ruhollah Majdoddin

We algorithmically compute integral Eilenberg-MacLane homology of all semigroups of order at most $8$ and present some particular semigroups with notable classifying spaces, refuting conjectures of Nico. Along the way, we give an…

Algebraic Topology · Mathematics 2025-02-11 Dennis Sweeney

In the maximum constraint satisfaction problem (MAX CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to assign values from a given finite domain to the variables so…

Computational Complexity · Computer Science 2007-05-23 Vladimir Deineko , Peter Jonsson , Mikael Klasson , Andrei Krokhin

We present a brief structural equivalence between the symmetric TSP and a constrained Group Steiner Tree Problem (cGSTP) defined on a simplicial incidence graph. Given the complete weighted graph on the city set V, we form the bipartite…

Data Structures and Algorithms · Computer Science 2026-02-06 Yılmaz Arslanoğlu

In this paper we show that a countable structure admitting a finite monomorphic decomposition has finite big Ramsey degrees if and only if so does every monomorphic part in its minimal monomorphic decomposition. The necessary prerequisite…

Logic · Mathematics 2026-05-21 Dragan Mašulović , Veljko Toljić

The \emph{Sandwich Problem} (SP) for a graph class $\calC$ is the following computational problem. The input is a pair of graphs $(V,E_1)$ and $(V,E_2)$ where $E_1\subseteq E_2$, and the task is to decide whether there is an edge set $E$…

Discrete Mathematics · Computer Science 2025-10-13 Manuel Bodirsky , Santiago Guzmán-Pro

Given a finite group $G$, the generating graph $\Gamma(G)$ of $G$ has as vertices the non-identity elements of $G$ and two vertices are adjacent if and only if they are distinct and generate $G$ as group elements. Let $G$ be a 2-generated…

Group Theory · Mathematics 2019-08-06 Andrea Lucchini

Robertson and Seymour proved that for every finite tree $H$, there exists $k$ such that every finite graph $G$ with no $H$ minor has path-width at most $k$; and conversely, for every integer $k$, there is a finite tree $H$ such that every…

Combinatorics · Mathematics 2025-09-16 Tung Nguyen , Alex Scott , Paul Seymour

We prove that for every nonnegative integer $g$, there exists a bound on the number of ends of a complete, embedded minimal surface $M$ in $\mathbb{R}^3$ of genus $g$ and finite topology. This bound on the finite number of ends when $M$ has…

Differential Geometry · Mathematics 2019-09-19 William H. Meeks , Joaquin Perez , Antonio Ros

Given a Counting Monadic Second Order (CMSO) sentence $\psi$, the CMSO$[\psi]$ problem is defined as follows. The input to CMSO$[\psi]$ is a graph $G$, and the objective is to determine whether $G\models \psi$. Our main theorem states that…

Data Structures and Algorithms · Computer Science 2018-02-06 Daniel Lokshtanov , M. S. Ramanujan , Saket Saurabh , Meirav Zehavi

For a subgroup $S$ of a group $G$, let $I_G(S)$ denote the set of commutators $[g,s]=g^{-1}g^s$, where $g\in G$ and $s\in S$, so that $[G,S]$ is the subgroup generated by $I_G(S)$. We prove that if $G$ is a $p$-soluble finite group with a…

Group Theory · Mathematics 2026-05-19 Cristina Acciarri , Robert M. Guralnick , Evgeny Khukhro , Pavel Shumyatsky

Let $G$ be a right-angled Artin group with defining graph $\Gamma$ and let $H$ be a finitely generated group quasi-isometric to $G(\Gamma)$. We show if $G$ satisfies (1) its outer automorphism group is finite; (2) $\Gamma$ does not have…

Geometric Topology · Mathematics 2016-06-07 Jingyin Huang

In the paper we consider the following conjecture: if a finite group $G$ possesses a solvable $\pi$-Hall subgroup $H$, then there exist elements $x,y,z,t\in G$ such that the identity $H\cap H^x\cap H^y\cap H^z\cap H^t=O_\pi(G)$ holds. The…

Group Theory · Mathematics 2010-08-17 E. P. Vdovin , V. I. Zenkov

Suppose $G$ is a finitely presented group that is hyperbolic relative to ${\bf P}$ a finite collection of 1-ended finitely generated proper subgroups of $G$. If $G$ and the ${\bf P}$ are 1-ended and the boundary $\partial (G,{\bf P})$ has…

Group Theory · Mathematics 2021-05-03 Matthew Haulmark , Michael Mihalik

In a simple C*-algebra with suitable regularity properties, any unitary or invertible element with de la Harpe--Skandalis determinant zero is a finite product of commutators.

Operator Algebras · Mathematics 2014-08-20 Ping Wong Ng , Leonel Robert

The purpose of this note is to describe some algebraic conditions on a Banach algebra which force it to be finite dimensional. One of the main results in Theorem~2 which states that for a locally compact group $G$, $G$ is compact if there…

Functional Analysis · Mathematics 2007-05-23 Ali Ghaffari , Ali Reza Medghalchi

The $G$-graph $\Gamma(G,S)$ is a graph from the group $G$ generated by $S\subseteq G$, where the vertices are the right cosets of the cyclic subgroups $\langle s \rangle, s\in S$ with $k$-edges between two distinct cosets if there is an…

Combinatorics · Mathematics 2016-09-05 Lord Clifford Kavi