Related papers: Deciding reducibility of mapping classes is in $\t…
Given a static vertex-selection problem (e.g. independent set, dominating set) on a graph, we can define a corresponding temporally satisfying reconfiguration problem on a temporal graph which asks for a sequence of solutions to the…
Homogenization is a powerful way of taming a class of finite structures with several interesting applications in different areas, from Ramsey theory in combinatorics to constraint satisfaction problems (CSPs) in computer science, through…
We give a finite presentation of the mapping class group of an oriented (possibly bounded) surface of genus greater or equal than 1, considering Dehn twists on a very simple set of curves.
Optimization with nonnegative orthogonality constraints has wide applications in machine learning and data sciences. It is NP-hard due to some combinatorial properties of the constraints. We first propose an equivalent optimization…
Neural networks achieve outstanding accuracy in classification and regression tasks. However, understanding their behavior still remains an open challenge that requires questions to be addressed on the robustness, explainability and…
Constraint Satisfaction Problem on finite sets is known to be NP-complete in general but certain restrictions on the constraint language can ensure tractability. It was proved that if a constraint language has a weak near unanimity…
In the recent years, branch-and-cut algorithms have been the target of data-driven approaches designed to enhance the decision making in different phases of the algorithm such as branching, or the choice of cutting planes (cuts). In…
Motivated by graphical models, we consider the "Sparse Plus Low-rank" decomposition of a positive definite concentration matrix -- the inverse of the covariance matrix. This is a classical problem for which a rich theory and numerical…
A suitable measure for the similarity of shapes represented by parameterized curves or surfaces is the Fr\'echet distance. Whereas efficient algorithms are known for computing the Fr\'echet distance of polygonal curves, the same problem for…
We give an alternate proof of the left-orderability of the mapping class group of a connected oriented infinite-type surface with a non-empty boundary. Our main strategy involves the inductive construction of a countable stable Alexander…
It is currently an unsolved problem to determine whether a $\triangle$-free planar graph $G$ contains an independent set $A$ such that $G[V_G\setminus A]$ is $2$-choosable. However, in this paper, we take a slightly different approach by…
Let $P$ be a set of $N$ points in the Euclidean plane, where a positive proportion of points lies off a single straight line. This note points out two facts concerning the number of equivalence classes of triangles that $P$ determines,…
Testing isomorphism of infinite groups is a classical topic, but from the complexity theory viewpoint, few results are known. S{\'e}nizergues and the fifth author (ICALP2018) proved that the isomorphism problem for virtually free groups is…
We show that every subgroup of the mapping class group MCG(S) of a compact surface S is either virtually abelian or it has infinite dimensional second bounded cohomology. As an application, we give another proof of the…
Deep networks have recently been shown to be vulnerable to universal perturbations: there exist very small image-agnostic perturbations that cause most natural images to be misclassified by such classifiers. In this paper, we propose the…
For every graph $H$, there exists a polynomial-time algorithm deciding if a planar input graph $G$ can be contracted to~$H$. However, the degree of the polynomial depends on the size of $H$. In this paper, we identify a class of graphs…
The task of reconstructing a matrix given a sample of observedentries is known as the matrix completion problem. It arises ina wide range of problems, including recommender systems, collaborativefiltering, dimensionality reduction, image…
For a time-limited version of the H$_2$ norm defined over a fixed time interval, we obtain a closed form expression of the gradients. After that, we use the gradients to propose a time-limited model order reduction method. The method…
Consider the scheme parametrizing non-constant morphisms from a fixed projective curve to a projective surface. There is a rational map between this scheme and the Chow variety of $1$-cycles on the surface. We prove that, if the curve is…
A MapReduce algorithm can be described by a mapping schema, which assigns inputs to a set of reducers, such that for each required output there exists a reducer that receives all the inputs that participate in the computation of this…