SearcharxivSearch

arXiv subjects

Marcella Manivel

Publications and source records attributed to Marcella Manivel.

3 recordsLinked to original sources

Integral aspects of Fourier duality for abelian varieties

We prove several results about integral versions of Fourier duality for abelian schemes, making use of Pappas's work on integral Grothendieck-Riemann-Roch. If $S$ is smooth quasi-projective of dimension $d$ over a field and $\pi \colon X\to S$ is a $g$-dimensional abelian scheme, we prove, under very mild assumptions on $X/S$, that all classical results about Fourier duality, including the existence of a Beauville decomposition, are valid for the Chow ring $\mathrm{CH}(X;\Lambda)$ with coefficients in the ring $\Lambda = \mathbb{Z}[1/(2g+d+1)!]$. If $X$ admits a polarization $\theta$ of degree $\nu(\theta)^2$ we further construct an $\mathfrak{sl}_2$-action on $\mathrm{CH}(X;\Lambda_\theta)$ with $\Lambda_\theta = \Lambda[1/\nu(\theta)]$, and we show that $\mathrm{CH}(X;\Lambda_\theta)$ is a sum of copies of the symmetric powers $\mathrm{Sym}^n(\mathrm{St})$ of the $2$-dimensional standard representation, for $n=0,\ldots,g$. For an abelian variety over an algebraically closed field, we use our results to produce torsion classes in $\mathrm{CH}^i(X;\Lambda_\theta)$ for every $i\in \{1,\ldots,g\}$.

math.AG

Down-left graphs and a connection to toric ideals of graphs

We introduce a family of graphs, which we call down-left graphs, and study their combinatorial and algebraic properties. We show that members of this family are well-covered, $C_5$-free, and vertex decomposable. By applying a result of H\`a-Woodroofe and Moradi--Khosh-Ahang, the (Castelnuovo-Mumford) regularity of the associated edge ideals is the induced matching number of the graph. As an application, we give a combinatorial interpretation for the regularity of the toric ideals of chordal bipartite graphs that are $(K_{3,3} \setminus e)$-free.

math.AC

Iterative Respacing of Polygonal Curves

A $\textit{polygonal curve}$ is a collection of $m$ connected line segments specified as the linear interpolation of a list of points $\{p_0, p_1, \ldots, p_m\}$. These curves may be obtained by sampling points from an oriented curve in $\mathbb{R}^n$. In applications it can be useful for this sample of points to be close to \textit{equilateral}, with equal distance between consecutive points. We present a computationally efficient method for respacing the points of a polygonal curve and show that iteration of this method converges to an equilateral polygonal curve.

math.NA