Related papers: A cell decomposition for marked cycle curves

We study the set of all decompositions (clusterings) of a graph through its characterization as a set of lifted multicuts. This leads us to practically relevant insights related to the definition of a class of decompositions by must-join…

The o-minimal structure generated by the restricted Pfaffian functions, known as restricted sub-Pfaffian sets, admits a natural measure of complexity in terms of a format $\mathcal{F}$, recording information like the number of variables and…

We give a simple expression for the integral of the canonical holomorphic volume form in degenerating families of varieties constructed from wall structures and with central fiber a union of toric varieties. The cycles to integrate over are…

We provide sharp cylindrical parametrizations of cylindrical cell decompositions by maps with bounded $C^{r}$ norm in the sharply o-minimal setting, thus generalizing and strengthening the Yomdin-Gromov Algebraic Lemma. We introduce forts,…

Chromatic polynomials have been studied extensively, giving us results such as the Fundamental Reduction Theorem and closed formulas for the chromatic polynomials of common classes of graphs. Though, none of those extend to the context of…

We use cell decomposition techniques to study additive reducts of p- adic fields. We consider a very general class of fields, including fields with infinite residue fields, which we study using a multi-sorted language. The results are used…

We present statistics on the decompositions (with respect to a distinguished symmetric 2t-cycle) of vertices of the hypercube graph, whose negative parts are regarded as disjoint unions of two subsets of the ground set {1,...,t} of the…

Piecewise smooth hybrid systems, involving continuous and discrete variables, are suitable models for describing the multiscale regulatory machinery of the biological cells. In hybrid models, the discrete variables can switch on and off…

A somewhat pretentious presentation of number systems (N, Z, Q, R, C, Q_p, >...). The problem of a p-adic characterisation of good-reduction p-adic curves is posed.

We study genus $g$ hyperelliptic curves with reduced automorphism group $A_5$ and give equations $y^2=f(x)$ for such curves in both cases where $f(x)$ is a decomposable polynomial in $x^2$ or $x^5$. For any fixed genus the locus of such…

Cylindrical Algebraic Decomposition (CAD) has long been one of the most important algorithms within Symbolic Computation, as a tool to perform quantifier elimination in first order logic over the reals. More recently it is finding…

The functional decomposition of polynomials has been a topic of great interest and importance in pure and computer algebra and their applications. The structure of compositions of (suitably normalized) polynomials f=g(h) over finite fields…

We construct a family of plane curves as pull-backs of a conic for abelian coverings of P^2. If the conic is tangent to the ramification lines one obtains a family of curves of degree 2n with 3n singularities of type A_{n-1}. We calculate…

In this paper, we establish that the space $ \mathbb{P}_p $ of all periodic function of fundamental period $ p $ can be expressed as a direct sum of the space $ \mathbb{P}_{p/2} $ of all periodic functions with fundamental period $ p/2 $…

We study the computational complexity of $c$-Colored $P_\ell$ Deletion and $c$-Colored $C_\ell$ Deletion. In these problems, one is given a $c$-edge-colored graph and wants to destroy all induced $c$-colored paths or cycles, respectively,…

Cycle polytopes of matroids have been introduced in combinatorial optimization as a generalization of important classes of polyhedral objects like cut polytopes and Eulerian subgraph polytopes associated to graphs. Here we start an…

Probabilistic Cell Decomposition (PCD) is a probabilistic path planning method combining the concepts of approximate cell decomposition with probabilistic sampling. It has been shown that the use of lazy evaluation techniques and supervised…

Let p be a saddle fixed point for an orientation-preserving surface diffeomorphism f admitting a homoclinic point q. Let V be an open 2-cell bounded by a simple loop formed by two arcs joining p to q lying respectively in the stable and…

An (edge) decomposition of a graph $G$ is a set of subgraphs of $G$ whose edge sets partition the edge set of $G$. Here we show, for each odd $\ell \geq 5$, that any graph $G$ of sufficiently large order $n$ with minimum degree at least…

We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\em weakened} notion of a polynomial GCD modulo a regular chain, which…