Searcharxiv⌕ Search

arXiv subjects

Libby Taylor

Publications and source records attributed to Libby Taylor.

13 recordsLinked to original sources
arXiv2021

Higher Fano Manifolds

In this paper we address Fano manifolds with positive higher Chern characters. They are expected to enjoy stronger versions of several of the nice properties of Fano manifolds. For instance, they should be covered by higher dimensional rational varieties, and families of higher Fano manifolds over higher dimensional bases should admit meromorphic sections (modulo the Brauer obstruction). Aiming at finding new examples of higher Fano manifolds, we investigate positivity of higher Chern characters of rational homogeneous spaces. We determine which rational homogeneous spaces of Picard rank $1$ have positive second Chern character, and show that the only rational homogeneous spaces of Picard rank $1$ having positive second and third Chern characters are projective spaces and quadric hypersurfaces. We also classify Fano manifolds of large index having positive second and third Chern characters. We conclude by discussing conjectural characterizations of projective spaces and complete intersections in terms of these higher Fano conditions.

math.AG↗
arXiv2021

On the arithmetic of a family of superelliptic curves

Let $p$ be a prime, let $r$ and $q$ be powers of $p$, and let $a$ and $b$ be relatively prime integers not divisible by $p$. Let $C/\mathbb F_{r}(t)$ be the superelliptic curve with affine equation $y^b+x^a=t^q-t$. Let $J$ be the Jacobian of $C$. By work of Pries--Ulmer, $J$ satisfies the Birch and Swinnerton-Dyer conjecture (BSD). Generalizing work of Griffon--Ulmer, we compute the $L$-function of $J$ in terms of certain Gauss sums. In addition, we estimate several arithmetic invariants of $J$ appearing in BSD, including the rank of the Mordell--Weil group $J(\mathbb F_{r}(t))$, the Faltings height of $J$, and the Tamagawa numbers of $J$ in terms of the parameters $a,b,q$. For any $p$ and $r$, we show that for certain $a$ and $b$ depending only on $p$ and $r$, these Jacobians provide new examples of families of simple abelian varieties of fixed dimension and with unbounded analytic and algebraic rank as $q$ varies through powers of $p$. Under a different set of criteria on $a$ and $b$, we prove that the order of the Tate--Shafarevich group of $J$ grows quasilinearly in $q$ as $q \to \infty.$

math.NT↗
arXiv2020

Derived equivalences of gerbey curves

We study derived equivalences of certain stacks over genus $1$ curves, which arise as connected components of the Picard stack of a genus $1$ curve. To this end, we develop a theory of integral transforms for these algebraic stacks. We use this theory to answer the question of when two stacky genus $1$ curves are derived equivalent. We use integral transforms and intersection theory on stacks to answer the following questions: if $C'=Pic^d(C)$, is $C=Pic^f(C')$ for some integer $f$? If $C'=Pic^d(C)$ and $C''=Pic^f(C')$, then is $C''=Pic^g(C)$ for some integer $g$?

math.AG↗
arXiv2020

An arithmetic variant of Raynaud's theorem

It is well known that for a regular semistable curve $\mathfrak X$ over a DVR with algebraically closed residue field, the spanning trees of the dual graph of the special fiber of $\mathfrak X$ are in bijection with components of the special fiber of the N\'eron model of the Jacobian of $\mathfrak X$. We prove a generalization of this fact that does not require the residue field to be algebraically closed, using a combinatorially enriched version of the dual graph to encode arithmetic information about divisors on $\mathfrak X$.

math.AG↗
arXiv2019

$\mathbb{A}^{1}$-Local Degree via Stacks

We extend results of Kass--Wickelgren to define an Euler class for a non-orientable (or non-relatively orientable) vector bundle on a smooth scheme, valued in the Grothendieck--Witt group of the ground field. We use a root stack construction to produce this Euler class and discuss its relation to other versions of an Euler class in $\mathbb{A}^{1}$-homotopy theory. This allows one to apply Kass--Wickelgren's technique for arithmetic enrichments of enumerative geometry to a larger class of problems; as an example, we use our construction to give an arithmetic count of the number of lines meeting $6$ planes in $\mathbb{P}^4$.

math.AG↗
arXiv2018

Kasteleyn cokernels and perfect matchings on planar bipartite graphs

The determinant method of Kasteleyn gives a method of computing the number of perfect matchings of a planar bipartite graph. In addition, results of Bernardi exhibit a bijection between spanning trees of a planar bipartite graph and elements of its Jacobian. In this paper, we explore an analogue of Bernardi's results, providing a canonical simply transitive group action of the Kasteleyn cokernel of a planar bipartite graph on its set of perfect matchings, when the planar bipartite graph in question is of the form $G^+$, as defined by Kenyon, Propp and Wilson.

math.CO↗
arXiv2018

Using Block Designs in Crossing Number Bounds

The crossing number ${\mbox {cr}}(G)$ of a graph $G=(V,E)$ is the smallest number of edge crossings over all drawings of $G$ in the plane. For any $k\ge 1$, the $k$-planar crossing number of $G$, ${\mbox {cr}}_k(G)$, is defined as the minimum of ${\mbox {cr}}(G_1)+{\mbox {cr}}(G_2)+\ldots+{\mbox {cr}}(G_{k})$ over all graphs $G_1, G_2,\ldots, G_{k}$ with $\cup_{i=1}^{k}G_i=G$. Pach et al. [\emph{Computational Geometry: Theory and Applications} {\bf 68} 2--6, (2018)] showed that for every $k\ge 1$, we have ${\mbox {cr}}_k(G)\le \left(\frac{2}{k^2}-\frac1{k^3}\right){\mbox {cr}}(G)$ and that this bound does not remain true if we replace the constant $\frac{2}{k^2}-\frac1{k^3}$ by any number smaller than $\frac1{k^2}$. We improve the upper bound to $\frac{1}{k^2}(1+o(1))$ as $k\rightarrow \infty$. For the class of bipartite graphs, we show that the best constant is exactly $\frac{1}{k^2}$ for every $k$. The results extend to the rectilinear variant of the $k$-planar crossing number.

math.CO↗
arXiv2017

On the regularity of orientable matroids

We present two characterizations of regular matroids among orientable matroids and use them to give a measure of "how far" an orientable matroid is from being regular.

math.CO↗
arXiv2017

Comparing Dushnik-Miller Dimension, Boolean Dimension and Local Dimension

The original notion of dimension for posets is due to Dushnik and Miller and has been studied extensively in the literature. Quite recently, there has been considerable interest in two variations of dimension known as Boolean dimension and local dimension. For a poset $P$, the Boolean dimension of $P$ and the local dimension of $P$ are both bounded from above by the dimension of $P$ and can be considerably less. Our primary goal will be to study analogies and contrasts among these three parameters. As one example, it is known that the dimension of a poset is bounded as a function of its height and the tree-width of its cover graph. The Boolean dimension of a poset is bounded in terms of the tree-width of its cover graph, independent of its height. We show that the local dimension of a poset cannot be bounded in terms of the tree-width of its cover graph, independent of height. We also prove that the local dimension of a poset is bounded in terms of the path-width of its cover graph. In several of our results, Ramsey theoretic methods will be applied.

math.CO↗
arXiv2017

Distance ideals of graphs

We introduce the concept of distance ideals of graphs, which can be regarded as a generalization of the Smith normal form and the spectra of the distance matrix of a graph. We obtain a classification of the graphs with at most one trivial distance ideal.

math.CO↗
arXiv2017

The k-planar crossing number of random graphs and random regular graphs

We give an explicit extension of Spencer's result on the biplanar crossing number of the Erdos-Renyi random graph $G(n,p)$. In particular, we show that the k-planar crossing number of $G(n,p)$ is almost surely $\Omega((n^2p)^2)$. Along the same lines, we prove that for any fixed $k$, the $k$-planar crossing number of various models of random $d$-regular graphs is $\Omega ((dn)^2)$ for $d > c_0$ for some constant $c_0=c_0(k)$.

math.CO↗
arXiv2017

The Graph of Critical Pairs of a Crown

There is a natural way to associate with a poset $P$ a hypergraph $H$, called the hypergraph of critical pairs, so that the dimension of $P$ is exactly equal to the chromatic number of $H$. The edges of $H$ have variable sizes, but it is of interest to consider the graph $G$ formed by the edges of $H$ that have size~2. The chromatic number of $G$ is less than or equal to the dimension of $P$ and the difference between the two values can be arbitrarily large. Nevertheless, there are important instances where the two parameters are the same, and we study one of these in this paper. Our focus is on a family $\{S_n^k:n\ge 3, k\ge 0\}$ of height two posets called crowns. We show that the chromatic number of the graph $G_n^k$ of critical pairs of the crown $S_n^k$ is the same as the dimension of $S_n^k$, which is known to be $\lceil 2(n+k)/(k+2)\rceil$. In fact, this theorem follows as an immediate corollary to the stronger result: The independence number of $G_n^k$ is $(k+1)(k+2)/2$. We obtain this theorem as part of a comprehensive analysis of independent sets in $G_n^k$ including the determination of the second largest size among the maximal independent sets, both the reversible and non-reversible types.

math.CO↗