Related papers: A cell decomposition for marked cycle curves

We construct a natural semiorthogonal decomposition for the derived category of an arbitrary flat family of sextic del Pezzo surfaces with at worst du Val singularities. This decomposition has three components equivalent to twisted derived…

We consider a one-dimensional family of rational surfaces with automorphisms. In a degeneration of this family, the limiting map is the identity map on a special fiber. We check that the map on the total space of the family has…

The edges surrounding a face of a map $M$ form a cycle $C$, called the boundary cycle of the face, and $C$ is often not a simple cycle. If the map $M$ is arc-transitive, then there is a cyclic subgroup of automorphisms of $M$ which leaves…

A general procedure which defines a partial ordering of cyclic permutations induced by continuous maps is known for constructing immediate successors to a cycle. We expound on this procedure in terms of labelled digraphs and characteristic…

We consider the cell decomposition of the moduli space of real genus two curves with a marked point on the only real oval. The cells are enumerated by certain graphs with their weights describing the complex structure on a curve. We show…

This paper investigates the \textbf{graphical $r$-Stirling numbers of the first kind}, denoted by $\str{G}{k}$, which enumerate partitions of a vertex set $V(G)$ into $k$ disjoint cycles such that $r$ specified vertices occupy distinct…

We introduce tropical complexes, as an enrichment of the dual complex of a degeneration with additional data from non-transverse intersection numbers. We define cycles, divisors, and linear equivalence on tropical complexes, analogous both…

We introduce the cycle intersection graph of a graph, an adaptation of the cycle graph of a graph, and use the structure of these graphs to prove an upper bound for the decycling number of all even graphs. This bound is shown to be…

We construct some natural cycles with trivial regulator in the higher Chow groups of Jacobians. For hyperelliptic curves we use a criterion due to J. Lewis to prove that the cycles we construct are indecomposable, and then use a…

We study families of plane algebraic curves sharing the same set of foci. We reformulate confocality via a focal map on equiclassical families and analyze its fibers using deformation theory.

Polynomial-time algorithms are given to find a central decomposition of maximum size for a finite p-group of class 2 and for a nilpotent Lie ring of class 2. The algorithms use Las Vegas probabilistic routines to compute the structure of…

Periodic normal forms for the codim 2 bifurcations of limit cycles up to a 3-dimensional center manifold in generic autonomous ODEs and computational formulas for their coefficients are derived. The formulas are independent of the dimension…

In this paper we study the reduction of $p$-cyclic covers of the $p$-adic line ramified at exactly four points. For $p=2$ these covers are elliptic curves and Deuring has given a criterion for when such a curve has good reduction. Here we…

We prove a decomposition formula of logarithmic Gromov-Witten invariants in a degeneration setting. A one-parameter log smooth family X->B with singular fibre over b_0 \in B yields a family M(X/B,\beta) -> B of moduli stacks of stable…

The classical derangement numbers count fixed point-free permutations. In this paper we study the enumeration problem of generalized derangements, when some of the elements are restricted to be in distinct cycles in the cycle decomposition.…

The commutative semiring $\mathbf{D}$ of finite, discrete-time dynamical systems was introduced in order to study their (de)composition from an algebraic point of view. However, many decision problems related to solving polynomial equations…

A graph $G$ has a $C_k$-decomposition if its edge set can be partitioned into cycles of length $k$. We show that if $\delta(G)\geq 2|G|/3-1$, then $G$ has a $C_4$-decomposition, and if $\delta(G)\geq |G|/2$, then $G$ has a…

The main objective of this paper is to study the number of limit cycles in a family of polynomial systems. Using bifurcation methods, we obtain the maximal number of limit cycles in global bifurcation.

This paper addresses a system identification for linear periodically time-varying plants in the discrete-time setting. A system identification algorithm for linear, periodically time-varying plants is introduced based on a cyclic…

Let $\mathcal{X}$ be an irreducible algebraic curve defined over a finite field $\mathbb{F}_q$ of characteristic $p>2$. Assume that the $\mathbb{F}_q$-automorphism group of $\mathcal{X}$ admits as an automorphism group the direct product of…