Zobrazeno 1 - 10
of 247
pro vyhledávání: '"de Mesmay, A."'
While the problem of computing the genus of a knot is now fairly well understood, no algorithm is known for its four-dimensional variants, both in the smooth and in the topological locally flat category. In this article, we investigate a class of kno
Externí odkaz:
http://arxiv.org/abs/2312.09094
Autor:
Cohen-Addad, Vincent, Fan, Chenglin, Ghoshal, Suprovat, Lee, Euiwoong, de Mesmay, Arnaud, Newman, Alantha, Wang, Tony Chang
We consider the Low Rank Approximation problem, where the input consists of a matrix $A \in \mathbb{R}^{n_R \times n_C}$ and an integer $k$, and the goal is to find a matrix $B$ of rank at most $k$ that minimizes $\| A - B \|_0$, which is the number
Externí odkaz:
http://arxiv.org/abs/2311.00892
The degenerate crossing number of a graph is the minimum number of transverse crossings among all its drawings, where edges are represented as simple arcs and multiple edges passing through the same point are counted as a single crossing. Interpretin
Externí odkaz:
http://arxiv.org/abs/2308.10666
Autor:
Lunel, Corentin, de Mesmay, Arnaud
Knots are commonly represented and manipulated via diagrams, which are decorated planar graphs. When such a knot diagram has low treewidth, parameterized graph algorithms can be leveraged to ensure the fast computation of many invariants and properti
Externí odkaz:
http://arxiv.org/abs/2303.07982
The main goal of this paper is to investigate the minimal size of families of curves on surfaces with the following property: a family of simple closed curves $\Gamma$ on a surface realizes all types of pants decompositions if for any pants decomposi
Externí odkaz:
http://arxiv.org/abs/2302.06336
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 26:2, Discrete Algorithms (August 20, 2024) dmtcs:10810
A matroid $M$ is an ordered pair $(E,I)$, where $E$ is a finite set called the ground set and a collection $I\subset 2^{E}$ called the independent sets which satisfy the conditions: (i) $\emptyset \in I$, (ii) $I'\subset I \in I$ implies $I'\in I$, a
Externí odkaz:
http://arxiv.org/abs/2301.03221
Given $x \in (\mathbb{R}_{\geq 0})^{\binom{[n]}{2}}$ recording pairwise distances, the METRIC VIOLATION DISTANCE (MVD) problem asks to compute the $\ell_0$ distance between $x$ and the metric cone; i.e., modify the minimum number of entries of $x$ to
Externí odkaz:
http://arxiv.org/abs/2208.13920
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 26:2, Iss Discrete Algorithms (2024)
A matroid $M$ is an ordered pair $(E,I)$, where $E$ is a finite set called the ground set and a collection $I\subset 2^{E}$ called the independent sets which satisfy the conditions: (i) $\emptyset \in I$, (ii) $I'\subset I \in I$ implies $I'\in I$, a
Externí odkaz:
https://doaj.org/article/b7d8f1972a714d3bb745d56c9b0ce6f6
Autor:
Loïc Miry, Marine De Mesmay, Marion Quirins, Charlotte Wemmert, Mohamed Khemili, Nicolas Engrand
Publikováno v:
Heliyon, Vol 10, Iss 14, Pp e34629- (2024)
Purpose: Varicella-zoster virus (VZV) can cause a wide range of neurological complications, including meningoencephalitis, upon reactivation. The objective of this report is to alert physicians of the possibility of VZV recurrence with meningoencepha
Externí odkaz:
https://doaj.org/article/8a77aa403d804e4e841703c778b36eed
In this article, we investigate short topological decompositions of non-orientable surfaces and provide algorithms to compute them. Our main result is a polynomial-time algorithm that for any graph embedded in a non-orientable surface computes a cano
Externí odkaz:
http://arxiv.org/abs/2203.06659