Related papers: Entangled Suslin lines and OGA
For fragments L of first-order logic (FO) with counting quantifiers, we consider the definability problem, which asks whether a given L-formula can be equivalently expressed by a formula in some fragment of L without counting, and the more…
Let $H$ be a complete $r$-uniform hypergraph such that two vertices are marked in each edge as its `boundary' vertices. A linear ordering of the vertex set of $H$ is called an {\em agreeing linear order}, provided all vertices of each edge…
Visibility graph reconstruction, which asks us to construct a polygon that has a given visibility graph, is a fundamental problem with unknown complexity (although visibility graph recognition is known to be in PSPACE). We show that two…
We study the existence of ample uniruled divisors on irreducible holomorphic symplectic manifolds that are deformation of the ten dimensional example introduced by O'Grady. In particular, we show that for any polarized OG10 manifold lying…
An edge-ordered graph is a graph with a total ordering of its edges. A path $P=v_1v_2\ldots v_k$ in an edge-ordered graph is called increasing if $(v_iv_{i+1}) > (v_{i+1}v_{i+2})$ for all $i = 1,\ldots,k-2$; it is called decreasing if…
An ordered biclique partition of the complete graph $K_n$ on $n$ vertices is a collection of bicliques (i.e., complete bipartite graphs) such that (i) every edge of $K_n$ is covered by at least one and at most two bicliques in the…
We give an algorithm to calculate the minimal and maximal genus of the orientable closed surface where a graph $G$ can be embedded. For this, we construct some special branched coverings of the 2-sphere. We apply this algorithm to calculate…
Consider the real vector space of formal sums of non-empty, finite unoriented graphs without multiple edges and loops. Let the vertices of graphs be unlabelled but let every graph $\gamma$ be endowed with an ordered set of edges…
Unbreakable decomposition, introduced by Cygan et al. (SICOMP'19) and Cygan et al. (TALG'20), has proven to be one of the most powerful tools for parameterized graph cut problems in recent years. Unfortunately, all known constructions…
This paper studies graphs that have two tree decompositions with the property that every bag from the first decomposition has a bounded-size intersection with every bag from the second decomposition. We show that every graph in each of the…
In the Segment Intersection Graph Representation Problem, we want to represent the vertices of a graph as straight line segments in the plane such that two segments cross if and only if there is an edge between the corresponding vertices.…
We show that every unstable NIP theory admits a V-definable linear quasi-order, over a finite set of parameters. In particular, if the theory is omega-categorical, then it interprets an infinite linear order. This partially answers a…
Word-representable graphs, characterized by the existence of a semi-transitive orientation, form a well-studied class of graphs. Comparability graphs form another well-studied class and constitute a subclass of word-representable graphs.…
In this paper, we initiate a systematic study of entanglements of division fields from a group theoretic perspective. For a positive integer $n$ and a subgroup $G\subseteq \text{GL}_2(\mathbb{Z}/{n}\mathbb{Z})$ with surjective determinant,…
We study a non-trivial extreme case of the orchard problem for $12$ pseudolines and we provide a complete classification of pseudoline arrangements having $19$ triple points and $9$ double points. We have also classified those that can be…
Let $D$ be a knot diagram, and let ${\mathcal D}$ denote the set of diagrams that can be obtained from $D$ by crossing exchanges. If $D$ has $n$ crossings, then ${\mathcal D}$ consists of $2^n$ diagrams. A folklore argument shows that at…
Consider a graph $G$ with a path $P$ of order $n$. What conditions force $G$ to also have a long induced path? As complete bipartite graphs have long paths but no long induced paths, a natural restriction is to forbid some fixed complete…
Understanding the spreading of the operator space entanglement entropy ($OSEE$) is key in order to explore out-of-equilibrium quantum many-body systems. Here we argue that for integrable models the dynamics of the $OSEE$ is related to the…
In this paper, we study the \textsf{Planar Disjoint Paths} problem: Given an undirected planar graph $G$ with $n$ vertices and a set $T$ of $k$ pairs $(s_i,t_i)_{i=1}^k$ of vertices, the goal is to find a set $\mathcal P$ of $k$ pairwise…
We produce an edge-coloring of the complete 3-uniform hypergraph on n vertices with $e^{O(\sqrt {log log n})}$ colors such that the edges spanned by every set of five vertices receive at least three distinct colors. This answers the first…